Abstract is missing.
- Communication, Dynamics, and RenormalizationBernard Chazelle. 1-32 [doi]
- "Green" Barrier Coverage with Mobile SensorsAmotz Bar-Noy, Dror Rawitz, Peter Terlecky. 33-46 [doi]
- A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest PathsCristina Bazgan, André Nichterlein, Rolf Niedermeier. 47-60 [doi]
- Orthogonal Graph Drawing with Inflexible EdgesThomas Bläsius, Sebastian Lehmann, Ignaz Rutter. 61-73 [doi]
- Linear Time Constructions of Some d -Restriction ProblemsNader H. Bshouty. 74-88 [doi]
- Efficiently Testing T -Interval Connectivity in Dynamic GraphsArnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters. 89-100 [doi]
- Competitive Strategies for Online Clique ClusteringMarek Chrobak, Christoph Dürr, Bengt J. Nilsson. 101-113 [doi]
- Scheduling with Gaps: New Models and AlgorithmsMarek Chrobak, Mordecai J. Golin, Tak Wah Lam, Dorian Nogneng. 114-126 [doi]
- MinMax-Distance Gathering on Given Meeting PointsSerafino Cicerone, Gabriele Di Stefano, Alfredo Navarra. 127-139 [doi]
- Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Lata Narayanan, Jaroslav Opatrny, Birgit Vogtenhuber. 140-152 [doi]
- Planarity of Streamed GraphsGiordano Da Lozzo, Ignaz Rutter. 153-166 [doi]
- Clique-Width of Graph Classes Defined by Two Forbidden Induced SubgraphsKonrad Dabrowski, Daniël Paulusma. 167-181 [doi]
- Randomized Adaptive Test CoverPeter Damaschke. 182-193 [doi]
- Contraction Blockers for Graphs with Forbidden Induced PathsÖznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries. 194-207 [doi]
- On the Complexity of Wafer-to-Wafer IntegrationGuillerme Duvillié, Marin Bougeret, Vincent Boudet, Trivikram Dokka, Rodolphe Giroudeau. 208-220 [doi]
- Label Placement in Road MapsAndreas Gemsa, Benjamin Niedermann, Martin Nöllenburg. 221-234 [doi]
- Discrete Stochastic Submodular Maximization: Adaptive vs. Non-adaptive vs. OfflineLisa Hellerstein, Devorah Kletenik, Patrick Lin. 235-248 [doi]
- Parameterized Algorithms and Kernels for 3-Hitting Set with Parity ConstraintsVikram Kamat, Neeldhara Misra. 249-260 [doi]
- Simple Strategies Versus Optimal Schedules in Multi-agent PatrollingAkitoshi Kawamura, Makoto Soejima. 261-273 [doi]
- Sharing Non-anonymous Costs of Multiple Resources OptimallyMax Klimm, Daniel Schmand. 274-287 [doi]
- Algorithms Solving the Matching Cut ProblemDieter Kratsch, Van Bang Le. 288-299 [doi]
- End-Vertices of Graph Search AlgorithmsDieter Kratsch, Mathieu Liedloff, Daniel Meister. 300-312 [doi]
- Deciding the On-line Chromatic Number of a Graph with Pre-coloring Is PSPACE-CompleteChristian Kudahl. 313-324 [doi]
- A Lex-BFS-Based Recognition Algorithm for Robinsonian MatricesMonique Laurent, Matteo Seminaroti. 325-338 [doi]
- Mixed Map LabelingMaarten Löffler, Martin Nöllenburg, Frank Staals. 339-351 [doi]
- Optimal Online Edge Coloring of Planar Graphs with AdviceJesper W. Mikkelsen. 352-364 [doi]
- Approximability of Two Variants of Multiple Knapsack ProblemsShuichi Miyazaki, Naoyuki Morimoto, Yasuo Okabe. 365-376 [doi]
- Block Sorting Is APX-HardN. S. Narayanaswamy, Swapnoneel Roy. 377-389 [doi]
- An Opportunistic Text Indexing Structure Based on Run Length EncodingYuya Tamakoshi, Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 390-402 [doi]
- PSPACE-Completeness of Bloxorz and of Games with 2-ButtonsTom C. van der Zanden, Hans L. Bodlaender. 403-415 [doi]
- Advice Complexity of Fine-Grained Job Shop SchedulingDavid Wehner. 416-428 [doi]