Advertisement

Algorithms and Complexity

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

  • Pinar Heggernes
Conference proceedings CIAC 2019

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

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 11485)

Table of contents

  1. Front Matter
    Pages i-xiii
  2. Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika
    Pages 1-12
  3. Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis
    Pages 13-24
  4. Allan S. Barboza, Cid C. de Souza, Pedro J. de Rezende
    Pages 25-37
  5. Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
    Pages 38-49
  6. Matthias Bentert, André Nichterlein
    Pages 50-61
  7. René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche
    Pages 62-74
  8. Vittorio Bilò, Laurent Gourvès, Jérôme Monnot
    Pages 75-86
  9. Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
    Pages 87-98
  10. Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
    Pages 99-111
  11. Xing Shi Cai, Luc Devroye, Cecilia Holmgren, Fiona Skerman
    Pages 112-123
  12. Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikoalei, Jérôme Monnot, Florian Sikora
    Pages 124-136
  13. Bugra Caskurlu, Fatih Erdem Kizilkaya
    Pages 137-148
  14. Janka Chlebíková, Clément Dallard, Niklas Paulsen
    Pages 149-160
  15. Pratibha Choudhary, Pallavi Jain, R. Krithika, Vibha Sahlot
    Pages 161-173
  16. Serafino Cicerone, Gabriele Di Stefano, Leszek Gasieniec, Tomasz Jurdzinski, Alfredo Navarra, Tomasz Radzik et al.
    Pages 174-186
  17. Dariusz Dereniowski, Łukasz Kuszner, Robert Ostrowski
    Pages 199-211
  18. Adrian Dumitrescu
    Pages 212-223
  19. Sándor P. Fekete, Dominik Krupke
    Pages 224-236
  20. Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    Pages 237-248
  21. Alexander Göke, Dániel Marx, Matthias Mnich
    Pages 249-261
  22. Duc A. Hoang, Amanj Khorramian, Ryuhei Uehara
    Pages 262-273
  23. Matthew P. Johnson
    Pages 274-285
  24. Frank Kammer, Andrej Sajenko
    Pages 286-298
  25. Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes
    Pages 311-322
  26. Emanuele Natale, Iliad Ramezani
    Pages 323-338
  27. Ho Lam Pang, Leizhen Cai
    Pages 339-351
  28. Paolo Penna, Laurent Viennot
    Pages 352-364
  29. Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale
    Pages 365-376
  30. Back Matter
    Pages 377-378

About these proceedings

Introduction

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.

Keywords

approximation algorithms artificial intelligence computer networks game theory graph g graph theory polynomial approximation polynomial-time algorithms problem solving scheduling algorithms scheduling problem telecommunication networks vertex set

Editors and affiliations

  • Pinar Heggernes
    • 1
  1. 1.University of BergenBergenNorway

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-030-17402-6
  • Copyright Information Springer Nature Switzerland AG 2019
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-030-17401-9
  • Online ISBN 978-3-030-17402-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Electronics
IT & Software
Telecommunications
Law
Engineering