Skip to main content
SpringerLink
Log in
Book cover

Combinatorial Algorithms

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

  • Conference proceedings
  • © 2013

Overview

Editors:
  1. Thierry Lecroq

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Laurent Mouchard

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Up-to-date results
  • State-of-the-art research
  • Fast-track conference proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 8288)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: IWOCA 2013.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (45 papers)

  1. Front Matter

    Download chapter 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
Back to top

Other volumes

  1. Combinatorial Algorithms

Keywords

About this book

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.

Editors and Affiliations

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

    Thierry Lecroq, Laurent Mouchard

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation