Skip to main content
SpringerLink
Log in

Combinatorial Algorithms

20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28--July 2, 2009, Revised Selected Papers

  • Conference proceedings
  • © 2009

Overview

Editors:
  1. Jiří Fiala

    1. Institute for Theoretical Computer Science and Department of Applied Mathematics, Charles University, Prague, Czech Republic

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Jan Kratochvíl

    1. Institute for Theoretical Computer Science and Department of Applied Mathematics, Charles University, Prague, Czech Republic

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Mirka Miller

    1. School of Electrical Engineering and Computer Science, The University of Newcastle, Callaghan, Australia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Included in the following conference series:

Conference proceedings info: IWOCA 2009.

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 (46 papers)

  1. Front Matter

    Download chapter PDF

  3. Contributed Talks

    1. Evaluation of Recoverable-Robust Timetables on Tree Networks

      • Gianlorenzo D’Angelo, Gabriele Di Stefano, Alfredo Navarra
      Pages 24-35

    2. Weighted LCS

      • Amihood Amir, Zvi Gotthilf, B. Riva Shalom
      Pages 36-47

    3. Integrality Properties of Certain Special Balanceable Families

      • Nicola Apollonio, Massimiliano Caramia
      Pages 48-59

    4. Forbidden Subgraph Colorings and the Oriented Chromatic Number

      • N. R. Aravind, C. R. Subramanian
      Pages 60-71

    5. Polynomial Kernels for 3-Leaf Power Graph Modification Problems

      • Stéphane Bessy, Christophe Paul, Anthony Perez
      Pages 72-82

    6. Approximating the Max Edge-Coloring Problem

      • Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos
      Pages 83-94

    7. Three Complexity Results on Coloring P k -Free Graphs

      • Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma
      Pages 95-104

    8. Fully Decomposable Split Graphs

      • Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger
      Pages 105-112

    9. Feedback Vertex Set on Graphs of Low Cliquewidth

      • Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
      Pages 113-124

    10. Note on Decomposition of K n,n into (0,j)-prisms

      • Sylwia Cichacz, Dalibor Fronček, Petr Kovář
      Pages 125-133

    11. Edge-Simple Circuits through 10 Ordered Vertices in Square Grids

      • David Coudert, Frédéric Giroire, Ignasi Sau
      Pages 134-145

    12. Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search

      • Christophe Crespelle, Philippe Gambette
      Pages 146-157

    13. LPF Computation Revisited

      • Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Waleń
      Pages 158-169

    14. Limiting Distribution for Distances in k-Trees

      • Alexis Darrasse, Michèle Soria
      Pages 170-182
Back to top

Other volumes

  1. Combinatorial Algorithms

Keywords

About this book

This book constitutes the revised selected papers of the 20th International Workshop on Combinatorial Algorithms, held in June/July 2009 in the castle of Hradec nad Moravicí, Czech Republic. The 41 papers included in this volume together with 5 invited papers were carefully reviewed and selected from over 100 submissions. The topics dealt with are algorithms and data structures, applications, combinatorial enumeration, combinatorial optimization, complexity theory, computational biology, databases, decompositions and combinatorial designs, discrete and computational geometry, including graph drawing, and graph theory and combinatorics.

Editors and Affiliations

  • Institute for Theoretical Computer Science and Department of Applied Mathematics, Charles University, Prague, Czech Republic

    Jiří Fiala, Jan Kratochvíl

  • School of Electrical Engineering and Computer Science, The University of Newcastle, Callaghan, Australia

    Mirka Miller

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation