Skip to main content
  • Conference proceedings
  • © 2010

Algorithms and Complexity

7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010, Proceedings

  • Fast track conference proceeding

  • Unique visibility

  • State of the art research

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

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

Conference series link(s): CIAC: International Conference on Algorithms and Complexity

Conference proceedings info: CIAC 2010.

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • ISBN: 978-3-642-13073-1
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 109.00
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (33 papers)

  1. Front Matter

  2. Invited Talks

    1. Towards a Distributed Search Engine

      • Ricardo Baeza-Yates
      Pages 1-5
    2. Mechanisms for the Marriage and the Assignment Game

      • Paul Dütting, Monika Henzinger
      Pages 6-12
    3. Resilient Algorithms and Data Structures

      • Giuseppe F. Italiano
      Pages 13-24
  3. Session 1. Graph Algorithms I

    1. An Exact Algorithm for Connected Red-Blue Dominating Set

      • Faisal N. Abu-Khzam, Amer E. Mouawad, Mathieu Liedloff
      Pages 25-36
    2. Maximizing PageRank with New Backlinks

      • Martin Olsen
      Pages 37-48
    3. Enumerating Rooted Graphs with Reflectional Block Structures

      • Bingbing Zhuang, Hiroshi Nagamochi
      Pages 49-60
    4. Improved Approximations for TSP with Simple Precedence Constraints

      • Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Monika Steinová
      Pages 61-72
  4. Session 2. Computational Complexity

    1. Parameterized Complexity of Even/Odd Subgraph Problems

      • Leizhen Cai, Boting Yang
      Pages 85-96
    2. Popular Matchings in the Marriage and Roommates Problems

      • Péter Biró, Robert W. Irving, David F. Manlove
      Pages 97-108
    3. Bounding the Number of Tolerable Faults in Majority-Based Systems

      • Ching-Lueh Chang, Yuh-Dauh Lyuu
      Pages 109-119
    4. A Parameterized Algorithm for Chordal Sandwich

      • Pinar Heggernes, Federico Mancini, Jesper Nederlof, Yngve Villanger
      Pages 120-130
  5. Session 3. Graph Coloring

    1. Graph Unique-Maximum and Conflict-Free Colorings

      • Panagiotis Cheilaris, Géza Tóth
      Pages 143-154
    2. Strategic Coloring of a Graph

      • Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
      Pages 155-166
  6. Session 4. Tree Algorithms and Tree Decompositions

    1. Multicut Algorithms via Tree Decompositions

      • Reinhard Pichler, Stefan Rümmele, Stefan Woltran
      Pages 167-179
    2. The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality

      • Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovič, Tobias Mömke, Andreas Sprock, Björn Steffen
      Pages 180-191
    3. A Planar Linear Arboricity Conjecture

      • Marek Cygan, Łukasz Kowalik, Borut Lužar
      Pages 204-216

Other Volumes

  1. Algorithms and Complexity

    7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010. Proceedings

Keywords

  • algorithms
  • approximation
  • combinatorial optimization
  • combinatorics
  • complexity
  • computational complexity
  • computational geometry
  • computational graph theory
  • game theory
  • geometric algorithms
  • graph algorithms
  • graph coloring
  • graph computations
  • networ
  • algorithm analysis and problem complexity
  • data structures

Editors and Affiliations

  • Department of Computer Science, Sapienza University of Rome, Rome, Italy

    Tiziana Calamoneri

  • Departament de Llenguatges i Sistemes Informatics, Universitat Politecnica de Catalunya, Barcelona, Spain

    Josep Diaz

Bibliographic Information

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • ISBN: 978-3-642-13073-1
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 109.00
Price excludes VAT (USA)