Editors:
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)
Conference series link(s): CIAC: International Conference on Algorithms and Complexity
Conference proceedings info: CIAC 2015.
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (31 papers)
-
Front Matter
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.Keywords
- Algorithmic game theory
- Approximation algorithms
- Combinatorial optimization
- Combinatorics
- Computational complexity
- Data structures design and analysis
- Design and analysis of algorithms
- Discrete mathematics
- Geometry and discrete structures
- Graph theory
- Mechanism design
- Online algorithms
- Parameterized complexity and exact algorithms
- Probabilistic algorithms
- Probabilistic computation
- Randomness
- Streaming models
- Sublinear and near linear time algorithms
- algorithm analysis and problem complexity
- data structures
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
Book Title: Algorithms and Complexity
Book Subtitle: 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings
Editors: Vangelis Th. Paschos, Peter Widmayer
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-319-18173-8
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing Switzerland 2015
Softcover ISBN: 978-3-319-18172-1Published: 22 April 2015
eBook ISBN: 978-3-319-18173-8Published: 15 May 2015
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XV, 430
Number of Illustrations: 81 b/w illustrations
Topics: Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Data Structures