Advertisement

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

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

Table of contents

  1. Front Matter
    PDF
  2. Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes
    Konrad Dabrowski, Vadim Lozin, Haiko Müller, Dieter Rautenbach
    Pages 1-9
  3. On the Maximal Sum of Exponents of Runsin a String
    Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń
    Pages 10-19
  4. Path-Based Supports for Hypergraphs
    Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry
    Pages 20-33
  5. On Improved Exact Algorithms for L(2,1)-Labeling of Graphs
    Konstanty Junosza-Szaniawski, Paweł Rzążewski
    Pages 34-37
  6. Thread Graphs, Linear Rank-Width and Their Algorithmic Applications
    Robert Ganian
    Pages 38-42
  7. Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three
    Francine Blanchet-Sadri, Bob Chen, Aleksandar Chakarov
    Pages 43-55
  8. Shortest Paths between Shortest Paths and Independent Sets
    Marcin Kamiński, Paul Medvedev, Martin Milanič
    Pages 56-67
  9. Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism
    Yusaku Kaneta, Hiroki Arimura
    Pages 68-81
  10. Dichotomy for Coloring of Dart Graphs
    Martin Kochol, Riste Škrekovski
    Pages 82-89
  11. Worst Case Efficient Single and Multiple String Matching in the RAM Model
    Djamal Belazzougui
    Pages 90-102
  12. The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2
    Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
    Pages 103-106
  13. Upper and Lower I/O Bounds for Pebbling r-Pyramids
    Desh Ranjan, John Savage, Mohammad Zubair
    Pages 107-120
  14. Single Parameter FPT-Algorithms for Non-trivial Games
    Vladimir Estivill-Castro, Mahdi Parsa
    Pages 121-124
  15. The Complexity Status of Problems Related to Sparsest Cuts
    Paul Bonsma, Hajo Broersma, Viresh Patel, Artem Pyatkin
    Pages 125-135
  16. On Approximation Complexity of Metric Dimension Problem
    Mathias Hauptmann, Richard Schmied, Claus Viehmann
    Pages 136-139
  17. Collision-Free Routing in Sink-Centric Sensor Networks with Coarse-Grain Coordinates
    Alfredo Navarra, Cristina M. Pinotti
    Pages 140-153
  18. Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures
    Cristina Bazgan, Sonia Toubaline, Zsolt Tuza
    Pages 154-166
  19. Computing Role Assignments of Proper Interval Graphs in Polynomial Time
    Pinar Heggernes, Pim van ’t Hof, Daniël Paulusma
    Pages 167-180
  20. Efficient Connectivity Testing of Hypercubic Networks with Faults
    Tomáš Dvořák, Jiří Fink, Petr Gregor, Václav Koubek, Tomasz Radzik
    Pages 181-191
  21. Reductions of Matrices Associated with Nowhere-Zero Flows
    Martin Kochol, Nad’a Krivoňáková, Silvia Smejová, Katarína Šranková
    Pages 192-200
  22. Blocks of Hypergraphs
    Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry
    Pages 201-211
  23. Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree
    Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter
    Pages 212-225
  24. Skip Lift: A Probabilistic Alternative to Red-Black Trees
    Prosenjit Bose, Karim Douïeb, Pat Morin
    Pages 226-237
  25. On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs
    Oudone Phanalasy, Mirka Miller, Leanne Rylands, Paulette Lieby
    Pages 238-241
  26. Parameterized Complexity of k-Anonymity: Hardness and Tractability
    Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola
    Pages 242-255
  27. On Fast Enumeration of Pseudo Bicliques
    Zareen Alamgir, Saira Karim, Syed Husnine
    Pages 256-259
  28. Efficient Chaining of Seeds in Ordered Trees
    Julien Allali, Cédric Chauve, Pascal Ferraro, Anne-Laure Gaillard
    Pages 260-273
  29. On the Computational Complexity of Degenerate Unit Distance Representations of Graphs
    Boris Horvat, Jan Kratochvíl, Tomaž Pisanski
    Pages 274-285
  30. Recognition of Probe Ptolemaic Graphs
    Maw-Shang Chang, Ling-Ju Hung
    Pages 286-290
  31. Graphs of Separability at Most Two: Structural Characterizations and Their Consequences
    Ferdinando Cicalese, Martin Milanič
    Pages 291-302
  32. On Antimagic Labeling for Generalized Web and Flower Graphs
    Joe Ryan, Oudone Phanalasy, Mirka Miller, Leanne Rylands
    Pages 303-313
  33. Chains-into-Bins Processes
    Tuğkan Batu, Petra Berenbrink, Colin Cooper
    Pages 314-325
  34. Complexity of Locally Injective Homomorphism to the Theta Graphs
    Bernard Lidický, Marek Tesař
    Pages 326-336
  35. Ranking and Drawing in Subexponential Time
    Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh
    Pages 337-348
  36. Efficient Reconstruction of RC-Equivalent Strings
    Ferdinando Cicalese, Péter L. Erdős, Zsuzsanna Lipták
    Pages 349-362
  37. Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures
    Danny Z. Chen, Haitao Wang
    Pages 363-376
  38. The Cover Time of Cartesian Product Graphs
    Mohammed Abdullah, Colin Cooper, Tomasz Radzik
    Pages 377-389
  39. Dictionary-Symbolwise Flexible Parsing
    Maxime Crochemore, Laura Giambruno, Alessio Langiu, Filippo Mignosi, Antonio Restivo
    Pages 390-403
  40. Regular Language Constrained Sequence Alignment Revisited
    Gregory Kucherov, Tamar Pinhas, Michal Ziv-Ukelson
    Pages 404-415
  41. Back Matter
    PDF

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

  • DOI https://doi.org/10.1007/978-3-642-19222-7
  • 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
  • Buy this book on publisher's site