Skip to main content
SpringerLink
Log in

Algorithms and Complexity

9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings

  • Conference proceedings
  • © 2015

Overview

Editors:
  1. Vangelis Th. Paschos

    1. LAMSADE, Université Paris-Dauphine, Paris Cedex 16, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Peter Widmayer

    1. Inst. of Theoretical Computer Science, ETH Zürich, Zürich, Switzerland

    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 9079)

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

Included in the following conference series:

Conference proceedings info: CIAC 2015.

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

  1. Front Matter

    Pages I-XV
    Download chapter PDF

  2. Communication, Dynamics, and Renormalization

    • Bernard Chazelle
    Pages 1-32

  3. “Green” Barrier Coverage with Mobile Sensors

    • Amotz Bar-Noy, Dror Rawitz, Peter Terlecky
    Pages 33-46

  4. A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths

    • Cristina Bazgan, André Nichterlein, Rolf Niedermeier
    Pages 47-60

  5. Orthogonal Graph Drawing with Inflexible Edges

    • Thomas Bläsius, Sebastian Lehmann, Ignaz Rutter
    Pages 61-73

  6. Linear Time Constructions of Some \(d\)-Restriction Problems

    • Nader H. Bshouty
    Pages 74-88

  7. Efficiently Testing \(T\)-Interval Connectivity in Dynamic Graphs

    • Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters
    Pages 89-100

  8. Competitive Strategies for Online Clique Clustering

    • Marek Chrobak, Christoph Dürr, Bengt J. Nilsson
    Pages 101-113

  9. Scheduling with Gaps: New Models and Algorithms

    • Marek Chrobak, Mordecai Golin, Tak-Wah Lam, Dorian Nogneng
    Pages 114-126

  10. MinMax-Distance Gathering on Given Meeting Points

    • Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
    Pages 127-139

  11. Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)

    • J. Czyzowicz, K. Georgiou, E. Kranakis, L. Narayanan, J. Opatrny, B. Vogtenhuber
    Pages 140-152

  12. Planarity of Streamed Graphs

    • Giordano Da Lozzo, Ignaz Rutter
    Pages 153-166

  13. Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs

    • Konrad K. Dabrowski, Daniël Paulusma
    Pages 167-181

  14. Randomized Adaptive Test Cover

    • Peter Damaschke
    Pages 182-193

  15. Contraction Blockers for Graphs with Forbidden Induced Paths

    • Öznur Yaşar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries
    Pages 194-207

  16. On the Complexity of Wafer-to-Wafer Integration

    • Guillerme Duvillié, Marin Bougeret, Vincent Boudet, Trivikram Dokka, Rodolphe Giroudeau
    Pages 208-220

  17. Label Placement in Road Maps

    • Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg
    Pages 221-234

  18. Discrete Stochastic Submodular Maximization: Adaptive vs. Non-adaptive vs. Offline

    • Lisa Hellerstein, Devorah Kletenik, Patrick Lin
    Pages 235-248

  19. Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints

    • Vikram Kamat, Neeldhara Misra
    Pages 249-260

  20. Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling

    • Akitoshi Kawamura, Makoto Soejima
    Pages 261-273
Back to top

Other volumes

  1. Algorithms and Complexity

Keywords

About this book

This book constitutes the refereed conference proceedings of the 9th International Conference on Algorithms and Complexity, CIAC 2015, held in Paris, France, in May 2015.

The 30 revised full papers presented were carefully reviewed and selected from 93 submissions and are presented together with 2 invited papers. The papers present original research in the theory and applications of algorithms and computational complexity.

Editors and Affiliations

  • LAMSADE, Université Paris-Dauphine, Paris Cedex 16, France

    Vangelis Th. Paschos

  • Inst. of Theoretical Computer Science, ETH Zürich, Zürich, Switzerland

    Peter Widmayer

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation