Accepted Papers

Arnaud Casteigts, Ralf Klasing, Yessin Neggaz and Joseph Peters. Efficiently Testing T-Interval Connectivity in Dynamic Graphs
David Wehner. Advice-Complexity-of-Fine-Grained-Job-Shop-Scheduling
Akitoshi Kawamura and Makoto Soejima. Simple strategies versus optimal schedules in multi-agent patrolling
Lisa Hellerstein, Devorah Kletenik and Patrick Lin. Discrete Stochastic Submodular Maximization: Adaptive vs. Non-Adaptive vs. Offline
Guillerme Duvillié, Marin Bougeret, Vincent Boudet, Trivikram Dokka and Rodolphe Giroudeau. On the complexity of Wafer-to-Wafer Integration
Giordano Da Lozzo and Ignaz Rutter. Planarity of Streamed Graphs
Andreas Gemsa, Benjamin Niedermann and Martin Nöllenburg. Label Placement in Road Maps
Marek Chrobak, Mordecai Golin, Tak-Wah Lam and Dorian Nogneng. Scheduling with Gaps: New Models and Algorithms
Dieter Kratsch and Van Bang Le. Algorithms solving the Matching Cut problem
Tom C. van der Zanden and Hans L. Bodlaender. PSPACE-completeness of Bloxorz - and of Games with 2-Buttons
Nader Bshouty. Linear time Constructions of some d-Restriction Problems
Yuya Tamakoshi, Keisuke Goto, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda. An opportunistic text indexing structure based on run length encoding
Oznur Diner, Daniel Paulusma, Christophe Picouleau and Bernard Ries. Contraction Blockers for Graphs with Forbidden Induced Paths
Amotz Bar-Noy, Dror Rawitz and Peter Terlecky. Green Barrier Coverage with Mobile Sensors
Peter Damaschke. Randomized Adaptive Test Cover
Monique Laurent and Matteo Seminaroti. A Lex-BFS-based recognition algorithm for Robinsonian matrices
Cristina Bazgan, André Nichterlein and Rolf Niedermeier. A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths
Thomas Bläsius, Sebastian Lehmann and Ignaz Rutter. Orthogonal Graph Drawing with Inflexible Edges
Dieter Kratsch, Mathieu Liedloff and Daniel Meister. End-Vertices of Graph Search Algorithms
Shuichi Miyazaki, Naoyuki Morimoto and Yasuo Okabe. Approximability of Two Variants of Multiple Knapsack Problems
Maarten Löffler, Martin Nöllenburg and Frank Staals. Mixed Map Labeling
Christian Kudahl. Deciding the On-line Chromatic Number of a Graph with Pre-coloring is PSPACE-complete
Max Klimm and Daniel Schmand. Sharing Non-Anonymous Costs of Multiple Resources Optimally
Jesper W. Mikkelsen. Optimal Online Edge Coloring of Planar Graphs with Advice
Konrad Kazimierz Dabrowski and Daniel Paulusma. Clique-width of Graph Classes Defined by Two Forbidden Induced Subgraphs
Marek Chrobak, Christoph Dürr and Bengt J. Nilsson. Approximation Algorithms for Clique Clustering
Vikram Kamat and Neeldhara Misra. Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints
Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Lata Narayanan, Jarda Opatrny and Birgit Vogtenhuber. Evacuating Robots from a Disk Using Face-to-Face Communication
Serafino Cicerone, Gabriele Di Stefano and Alfredo Navarra. MinMax-Distance Gathering on given Meeting Points
N.S. Narayanaswamy and Swapnoneel Roy. Block Sorting is $\APX$-Hard