Algorithms and Complexity

1. Front Matter

   Pages I-XX

   PDF

2. Extended Abstracts

   1. Front Matter

      Pages 1-1

      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

      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

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.

• algorithm engineering
• computational complexity
• discrete optimization
• parallel and distributed algorithms
• theoretical computer science
• algorithmic aspects of communication networks
• algorithmic game theory
• algorithms
• approximation algorithms
• complexity theory
• computational geometry
• data structures
• evolutionarily stable strategies
• exact and parameterized computation
• game theory
• graph algorithms and graph drawing
• inapproximability
• online and streaming algorithms
• randomized algorithms
• search algorithm
• algorithm analysis and problem complexity

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

  Dimitris Fotakis, Aris Pagourtzis

• Université Paris-Dauphine, Paris, France

  Vangelis Th. Paschos

Policies and ethics