Skip to main content
Springer Nature Link
Log in

Algorithms and Complexity

10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings

  • Conference proceedings
  • © 2017

Overview

Editors:
  1. Dimitris Fotakis

    1. National Technical University of Athens, Zografou, Athens, Greece

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Aris Pagourtzis

    1. National Technical University of Athens, Zografou, Athens, Greece

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Vangelis Th. Paschos

    1. Université Paris-Dauphine, Paris, France

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

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

Included in the following conference series:

Conference proceedings info: CIAC 2017.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
€32.70 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook EUR 42.79
Price includes VAT (France)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book EUR 52.74
Price includes VAT (France)
  • 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

About this book

This book constitutes the refereed conference proceedings of the 10th International Conference on Algorithms and Complexity, CIAC 2017, held in Athens, Greece, in May 2017.
The 36 revised full papers were carefully reviewed and selected from 90 submissions and are presented together with 3 abstracts of invited talks and a paper to the 70th birthday of Stathis Zachos. The papers present original research in the theory and applications of algorithms and computational complexity.

Similar content being viewed by others

Keywords

Table of contents (39 papers)

  1. Front Matter

    Pages I-XX
    Download chapter PDF

  2. Extended Abstracts

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. TFNP: An Update

      • Paul W. Goldberg, Christos H. Papadimitriou
      Pages 3-9

    3. New Algorithmic Results for Bin Packing and Scheduling

      • Klaus Jansen
      Pages 10-15

  3. Regular Papers

    1. Front Matter

      Pages 17-17
      Download chapter PDF

    2. Scheduling Maintenance Jobs in Networks

      • Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner et al.
      Pages 19-30

    3. Paths to Trees and Cacti

      • Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale
      Pages 31-42

    4. Temporal Flows in Temporal Networks

      • Eleni C. Akrida, Jurek Czyzowicz, Leszek Gąsieniec, Łukasz Kuszner, Paul G. Spirakis
      Pages 43-54

    5. Completeness Results for Counting Problems with Easy Decision

      • Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos
      Pages 55-66

    6. Tracking Paths

      • Aritra Banik, Matthew J. Katz, Eli Packer, Marina Simakov
      Pages 67-79

    7. On the Complexity of Finding a Potential Community

      • Cristina Bazgan, Thomas Pontoizeau, Zsolt Tuza
      Pages 80-91

    8. Improved Lower Bounds for Graph Embedding Problems

      • Hans L. Bodlaender, Tom C. van der Zanden
      Pages 92-103

    9. Collaboration Without Communication: Evacuating Two Robots from a Disk

      • Sebastian Brandt, Felix Laufenberg, Yuezhou Lv, David Stolz, Roger Wattenhofer
      Pages 104-115

    10. Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems

      • Sascha Brauer
      Pages 116-127

    11. Assessing the Computational Complexity of Multi-layer Subgraph Detection

      • Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
      Pages 128-139

    12. Almost Optimal Cover-Free Families

      • Nader H. Bshouty, Ariel Gabizon
      Pages 140-151

    13. On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality

      • Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, Chia-Wei Lee, Bang Ye Wu
      Pages 152-163

    14. Parameterized Resiliency Problems via Integer Linear Programming

      • Jason Crampton, Gregory Gutin, Martin Koutecký, Rémi Watrigant
      Pages 164-176

    15. Push-Pull Block Puzzles are Hard

      • Erik D. Demaine, Isaac Grosof, Jayson Lynch
      Pages 177-195

    16. Weak Coverage of a Rectangular Barrier

      • Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Jan Maňuch, Lata Narayanan et al.
      Pages 196-208
Back to top

Other volumes

  1. Algorithms and Complexity

Editors and Affiliations

  • National Technical University of Athens, Zografou, Athens, Greece

    Dimitris Fotakis, Aris Pagourtzis

  • Université Paris-Dauphine, Paris, France

    Vangelis Th. Paschos

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation