Editorial Board
Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph
Connected facility location via random facility sampling and core detouring
The parameterized complexity of some minimum label problems
Dual ceiling protocol for real-time synchronization under preemption threshold scheduling
Sequencing by hybridization in few rounds
Incentive compatible regression learning
On pebble automata for data languages with decidable emptiness problem
Space-efficient informational redundancy
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
Simple restriction in context-free rewriting
Constraint satisfaction with succinctly specified relations
Subword balance, position indices and power sums
Betweenness parameterized above tight lower bound
A deterministic approximation algorithm for computing the permanent of a 0,1 matrix
When consensus meets self-stabilization
Contents