Combinatorial Algorithms

1. Front Matter

   PDF

2. Invited Talks

   1. Weak Heaps and Friends: Recent Developments

      • Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen, Armin Weiß

      Pages 1-6

   2. Efficient Exploration of Anonymous Undirected Graphs

      • Ralf Klasing

      Pages 7-13

3. Regular Papers

   1. On Maximum Rank Aggregation Problems

      • Christian Bachmaier, Franz Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier

      Pages 14-27

   2. Deciding Representability of Sets of Words of Equal Length in Polynomial Time

      • Francine Blanchet-Sadri, Sinziana Munteanu

      Pages 28-40

   3. Prefix Table Construction and Conversion

      • Widmer Bland, Gregory Kucherov, W. F. Smyth

      Pages 41-53

   4. On the Approximability of Splitting-SAT in 2-CNF Horn Formulas

      • Hans-Joachim Böckenhauer, Lucia Keller

      Pages 54-66

   5. Boundary-to-Boundary Flows in Planar Graphs

      • Glencora Borradaile, Anna Harutyunyan

      Pages 67-80

   6. Exact Algorithms for Weak Roman Domination

      • Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Mathieu Liedloff, Anthony Perez

      Pages 81-93

   7. Verification Problem of Maximal Points under Uncertainty

      • George Charalambous, Michael Hoffmann

      Pages 94-105

   8. Incidence Coloring Game and Arboricity of Graphs

      • Clément Charpentier, Éric Sopena

      Pages 106-114

   9. Linear-Time Self-stabilizing Algorithms for Minimal Domination in Graphs

      • Well Y. Chiu, Chiuyuan Chen

      Pages 115-126

   10. Phase Transition of Random Non-uniform Hypergraphs

       • Élie de Panafieu

       Pages 127-139

   11. Domino Tatami Covering Is NP-Complete

       • Alejandro Erickson, Frank Ruskey

       Pages 140-149

   12. The Complexity of the Identifying Code Problem in Restricted Graph Classes

       • Florent Foucaud

       Pages 150-163

   13. Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes

       • Robert Ganian, Jan Obdržálek

       Pages 164-177

   14. Dynamising Interval Scheduling: The Monotonic Case

       • Alexander Gavruskin, Bakhadyr Khoussainov, Mikhail Kokho, Jiamou Liu

       Pages 178-191

   15. Graph Editing to a Fixed Target

       • Petr A. Golovach, Daniël Paulusma, Iain Stewart

       Pages 192-205

   16. Tight Bound on the Diameter of the Knödel Graph

       • Hayk Grigoryan, Hovhannes A. Harutyunyan

       Pages 206-215

   17. Structural Properties of Subdivided-Line Graphs

       • Toru Hasunuma

       Pages 216-229

This book constitutes the thoroughly refereed post-workshop proceedings of the 24th International Workshop on Combinatorial Algorithms, IWOCA 2013, held in Rouen, France, in July 2013. The 33 revised full papers presented together with 10 short papers and 5 invited talks were carefully reviewed and selected from a total of 91 submissions. The papers are organized in topical sections on algorithms on graphs; algorithms on strings; discrete geometry and satisfiability.

• approximation algorithm
• distributed computing
• integer programming
• planar graph
• self-stabilizing algorithm
• combinatorics
• algorithm analysis and problem complexity
• data structures

• UFR des Sciences et Techniques, LITIS, Université de Rouen, Mont Saint Aignan Cedex, France

  Thierry Lecroq, Laurent Mouchard

Policies and ethics