Skip to main content
SpringerLink
Log in

Algorithms and Complexity

11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings

  • Conference proceedings
  • © 2019

Overview

Editors:
  1. Pinar Heggernes

    1. University of Bergen, Bergen, Norway

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

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

Included in the following conference series:

Conference proceedings info: CIAC 2019.

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 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 74.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 (30 papers)

  1. Front Matter

    Pages i-xiii
    Download chapter PDF

  2. Quadratic Vertex Kernel for Split Vertex Deletion

    • Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika
    Pages 1-12

  3. The Temporal Explorer Who Returns to the Base

    • Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis
    Pages 13-24

  4. Minimum Convex Partition of Point Sets

    • Allan S. Barboza, Cid C. de Souza, Pedro J. de Rezende
    Pages 25-37

  5. Parameterized Complexity of Safe Set

    • Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
    Pages 38-49

  6. Parameterized Complexity of Diameter

    • Matthias Bentert, André Nichterlein
    Pages 50-61

  7. Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints

    • René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche
    Pages 62-74

  8. Project Games

    • Vittorio Bilò, Laurent Gourvès, Jérôme Monnot
    Pages 75-86

  9. Subgraph Isomorphism on Graph Classes that Exclude a Substructure

    • Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
    Pages 87-98

  10. Your Rugby Mates Don’t Need to Know Your Colleagues: Triadic Closure with Edge Colors

    • Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
    Pages 99-111

  11. \(k\)-cuts on a Path

    • Xing Shi Cai, Luc Devroye, Cecilia Holmgren, Fiona Skerman
    Pages 112-123

  12. Extension of Vertex Cover and Independent Set in Some Classes of Graphs

    • Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikoalei, Jérôme Monnot, Florian Sikora
    Pages 124-136

  13. On Hedonic Games with Common Ranking Property

    • Bugra Caskurlu, Fatih Erdem Kizilkaya
    Pages 137-148

  14. Complexity of Scheduling for DARP with Soft Ride Times

    • Janka Chlebíková, Clément Dallard, Niklas Paulsen
    Pages 149-160

  15. Vertex Deletion on Split Graphs: Beyond 4-Hitting Set

    • Pratibha Choudhary, Pallavi Jain, R. Krithika, Vibha Sahlot
    Pages 161-173

  16. Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements

    • Serafino Cicerone, Gabriele Di Stefano, Leszek Gasieniec, Tomasz Jurdzinski, Alfredo Navarra, Tomasz Radzik et al.
    Pages 174-186

  17. Towards a Theory of Mixing Graphs: A Characterization of Perfect Mixability (Extended Abstract)

    • Miguel Coviello Gonzalez, Marek Chrobak
    Pages 187-198

  18. Searching by Heterogeneous Agents

    • Dariusz Dereniowski, Łukasz Kuszner, Robert Ostrowski
    Pages 199-211

  19. Finding a Mediocre Player

    • Adrian Dumitrescu
    Pages 212-223

  20. Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation

    • Sándor P. Fekete, Dominik Krupke
    Pages 224-236
Back to top

Other volumes

  1. Algorithms and Complexity

Keywords

About this book

This book constitutes the refereed conference proceedings of the 11th International Conference on Algorithms and Complexity, CIAC 2019, held in Rome, Italy, in May 2019.

The 30 full papers were carefully reviewed and selected from 95 submissions. The International Conference on Algorithms and Complexity is intended to provide a forum for researchers working in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures. The papers present original research in the theory and applications of algorithms and computational complexity.

Editors and Affiliations

  • University of Bergen, Bergen, Norway

    Pinar Heggernes

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation