default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID9. CIAC 2015: Paris, France
- Vangelis Th. Paschos, Peter Widmayer:
Algorithms and Complexity - 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings. Lecture Notes in Computer Science 9079, Springer 2015, ISBN 978-3-319-18172-1 - Bernard Chazelle:
Communication, Dynamics, and Renormalization. 1-32 - Amotz Bar-Noy, Dror Rawitz, Peter Terlecky:
"Green" Barrier Coverage with Mobile Sensors. 33-46 - Cristina Bazgan, André Nichterlein, Rolf Niedermeier:
A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths. 47-60 - Thomas Bläsius, Sebastian Lehmann, Ignaz Rutter
:
Orthogonal Graph Drawing with Inflexible Edges. 61-73 - Nader H. Bshouty:
Linear Time Constructions of Some d -Restriction Problems. 74-88 - Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters:
Efficiently Testing T -Interval Connectivity in Dynamic Graphs. 89-100 - Marek Chrobak, Christoph Dürr, Bengt J. Nilsson:
Competitive Strategies for Online Clique Clustering. 101-113 - Marek Chrobak, Mordecai J. Golin, Tak Wah Lam, Dorian Nogneng:
Scheduling with Gaps: New Models and Algorithms. 114-126 - Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
MinMax-Distance Gathering on Given Meeting Points. 127-139 - Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Lata Narayanan, Jaroslav Opatrny, Birgit Vogtenhuber:
Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract). 140-152 - Giordano Da Lozzo, Ignaz Rutter:
Planarity of Streamed Graphs. 153-166 - Konrad K. Dabrowski, Daniël Paulusma:
Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs. 167-181 - Peter Damaschke:
Randomized Adaptive Test Cover. 182-193 - Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries:
Contraction Blockers for Graphs with Forbidden Induced Paths. 194-207 - Guillerme Duvillié, Marin Bougeret, Vincent Boudet, Trivikram Dokka, Rodolphe Giroudeau:
On the Complexity of Wafer-to-Wafer Integration. 208-220 - Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg:
Label Placement in Road Maps. 221-234 - Lisa Hellerstein, Devorah Kletenik, Patrick Lin:
Discrete Stochastic Submodular Maximization: Adaptive vs. Non-adaptive vs. Offline. 235-248 - Vikram Kamat, Neeldhara Misra:
Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints. 249-260 - Akitoshi Kawamura, Makoto Soejima:
Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling. 261-273 - Max Klimm, Daniel Schmand:
Sharing Non-anonymous Costs of Multiple Resources Optimally. 274-287 - Dieter Kratsch, Van Bang Le:
Algorithms Solving the Matching Cut Problem. 288-299 - Dieter Kratsch, Mathieu Liedloff, Daniel Meister:
End-Vertices of Graph Search Algorithms. 300-312 - Christian Kudahl:
Deciding the On-line Chromatic Number of a Graph with Pre-coloring Is PSPACE-Complete. 313-324 - Monique Laurent, Matteo Seminaroti:
A Lex-BFS-Based Recognition Algorithm for Robinsonian Matrices. 325-338 - Maarten Löffler, Martin Nöllenburg, Frank Staals:
Mixed Map Labeling. 339-351 - Jesper W. Mikkelsen:
Optimal Online Edge Coloring of Planar Graphs with Advice. 352-364 - Shuichi Miyazaki, Naoyuki Morimoto, Yasuo Okabe:
Approximability of Two Variants of Multiple Knapsack Problems. 365-376 - N. S. Narayanaswamy, Swapnoneel Roy:
Block Sorting Is APX-Hard. 377-389 - Yuya Tamakoshi, Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
An Opportunistic Text Indexing Structure Based on Run Length Encoding. 390-402 - Tom C. van der Zanden, Hans L. Bodlaender:
PSPACE-Completeness of Bloxorz and of Games with 2-Buttons. 403-415 - David Wehner:
Advice Complexity of Fine-Grained Job Shop Scheduling. 416-428
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-29 00:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
