Combinatorial Algorithms

21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers

  • Costas S. Iliopoulos
  • William F. Smyth
Conference proceedings IWOCA 2010

DOI: 10.1007/978-3-642-19222-7

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

Table of contents (39 papers)

  1. Front Matter
  2. Konrad Dabrowski, Vadim Lozin, Haiko Müller, Dieter Rautenbach
    Pages 1-9
  3. Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń
    Pages 10-19
  4. Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry
    Pages 20-33
  5. Konstanty Junosza-Szaniawski, Paweł Rzążewski
    Pages 34-37
  6. Francine Blanchet-Sadri, Bob Chen, Aleksandar Chakarov
    Pages 43-55
  7. Marcin Kamiński, Paul Medvedev, Martin Milanič
    Pages 56-67
  8. Martin Kochol, Riste Škrekovski
    Pages 82-89
  9. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
    Pages 103-106
  10. Desh Ranjan, John Savage, Mohammad Zubair
    Pages 107-120
  11. Vladimir Estivill-Castro, Mahdi Parsa
    Pages 121-124
  12. Paul Bonsma, Hajo Broersma, Viresh Patel, Artem Pyatkin
    Pages 125-135
  13. Mathias Hauptmann, Richard Schmied, Claus Viehmann
    Pages 136-139
  14. Cristina Bazgan, Sonia Toubaline, Zsolt Tuza
    Pages 154-166
  15. Pinar Heggernes, Pim van ’t Hof, Daniël Paulusma
    Pages 167-180
  16. Tomáš Dvořák, Jiří Fink, Petr Gregor, Václav Koubek, Tomasz Radzik
    Pages 181-191

About these proceedings

Introduction

This book constitutes the thoroughly referred post-proceedings of the 21st International Workshop on Combinatorial Algorithms, IWOCA 2010, held in London, UK, in July 2010.
The 31 revised full papers presented together with extended abstracts of 8 poster presentations were carefully reviewed and selected from a total of 85 submissions. A broad variety of combinatorial graph algorithms for the computations of various graph features are presented; also algorithms for network compuation, approximation, computational geometry, games, and search are presented and complexity aspects of such algorithms are discussed.

Keywords

combinatorial enumeration computational complexity graph coloring graph labeling hypergraphs matrix computation network routing alorithms parameterized algorithms parameterized complexity problem complexity shortest path computation string matching tree matching

Editors and affiliations

  • Costas S. Iliopoulos
    • 1
  • William F. Smyth
    • 2
  1. 1.Department of Computer ScienceUniversity of London, King’s CollegeLondonUK
  2. 2.Department of Computing and SoftwareMcMaster UniversityHamiltonCanada

Bibliographic information

  • Copyright Information Springer Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-19221-0
  • Online ISBN 978-3-642-19222-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349