Combinatorial Algorithms

24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers

Editors:

ISBN: 978-3-642-45277-2 (Print) 978-3-642-45278-9 (Online)

Table of contents (45 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. Invited Talks

    1. No Access

      Book Chapter

      Pages 1-6

      Weak Heaps and Friends: Recent Developments

    2. No Access

      Book Chapter

      Pages 7-13

      Efficient Exploration of Anonymous Undirected Graphs

  3. Regular Papers

    1. No Access

      Book Chapter

      Pages 14-27

      On Maximum Rank Aggregation Problems

    2. No Access

      Book Chapter

      Pages 28-40

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

    3. No Access

      Book Chapter

      Pages 41-53

      Prefix Table Construction and Conversion

    4. No Access

      Book Chapter

      Pages 54-66

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

    5. No Access

      Book Chapter

      Pages 67-80

      Boundary-to-Boundary Flows in Planar Graphs

    6. No Access

      Book Chapter

      Pages 81-93

      Exact Algorithms for Weak Roman Domination

    7. No Access

      Book Chapter

      Pages 94-105

      Verification Problem of Maximal Points under Uncertainty

    8. No Access

      Book Chapter

      Pages 106-114

      Incidence Coloring Game and Arboricity of Graphs

    9. No Access

      Book Chapter

      Pages 115-126

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

    10. No Access

      Book Chapter

      Pages 127-139

      Phase Transition of Random Non-uniform Hypergraphs

    11. No Access

      Book Chapter

      Pages 140-149

      Domino Tatami Covering Is NP-Complete

    12. No Access

      Book Chapter

      Pages 150-163

      The Complexity of the Identifying Code Problem in Restricted Graph Classes

    13. No Access

      Book Chapter

      Pages 164-177

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

    14. No Access

      Book Chapter

      Pages 178-191

      Dynamising Interval Scheduling: The Monotonic Case

    15. No Access

      Book Chapter

      Pages 192-205

      Graph Editing to a Fixed Target

    16. No Access

      Book Chapter

      Pages 206-215

      Tight Bound on the Diameter of the Knödel Graph

    17. No Access

      Book Chapter

      Pages 216-229

      Structural Properties of Subdivided-Line Graphs

    18. No Access

      Book Chapter

      Pages 230-243

      Induced Subtrees in Interval Graphs

previous Page of 3