Abstract is missing.
- Invited TalksHenning Fernau, Katharina T. Huber, Joseph (Seffi) Naor. 3-19 [doi]
- Abundant ExtensionsKatrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora. 3-17 [doi]
- Phylogenetic Networks, A Way to Cope with Complex Evolutionary ProcessesKatharina T. Huber. 18 [doi]
- Recent Advances in Competitive Analysis of Online AlgorithmsJoseph (Seffi) Naor. 19 [doi]
- Three Problems on Well-Partitioned Chordal GraphsJungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima. 23-36 [doi]
- Distributed Distance-r Covering Problems on Sparse High-Girth GraphsSaeed Akhoondian Amiri, Ben Wiederhake. 37-60 [doi]
- Reconfiguration of Connected Graph Partitions via RecombinationHugo A. Akitaya, Matias Korman, Oliver Korten, Diane L. Souvaine, Csaba D. Tóth. 61-74 [doi]
- Algorithms for Energy Conservation in Heterogeneous Data CentersSusanne Albers, Jens Quedenfeld. 75-89 [doi]
- On Vertex-Weighted Graph RealizationsAmotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz. 90-102 [doi]
- On the Role of 3's for the 1-2-3 ConjectureJulien Bensmail, Foivos Fioravantes, Fionn Mc Inerney. 103-115 [doi]
- Upper Tail Analysis of Bucket Sort and Random TriesIoana O. Bercea, Guy Even. 116-129 [doi]
- Throughput Scheduling with Equal Additive LaxityMartin Böhm 0001, Nicole Megow, Jens Schlöter. 130-143 [doi]
- Fragile Complexity of Adaptive AlgorithmsProsenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman. 144-157 [doi]
- FPT and Kernelization Algorithms for the Induced Tree ProblemGuilherme de Castro Mendes Gomes, Vinicius Fernandes dos Santos, Murilo V. G. da Silva, Jayme Luiz Szwarcfiter. 158-172 [doi]
- The Multi-budget Maximum Weighted Coverage ProblemFrancesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj. 173-186 [doi]
- A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGsRajesh Chitnis. 187-201 [doi]
- Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-exponential ApproximationLouis Dublois, Michael Lampis, Vangelis Th. Paschos. 202-215 [doi]
- On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm EngineeringAleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier. 216-230 [doi]
- A Multistage View on 2-SatisfiabilityTill Fluschnik. 231-244 [doi]
- The Weisfeiler-Leman Algorithm and Recognition of Graph PropertiesFrank Fuhlbrück, Johannes Köbler, Ilia Ponomarenko, Oleg Verbitsky. 245-257 [doi]
- The Parameterized Suffix TrayNoriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 258-270 [doi]
- Exploring the Gap Between Treedepth and Vertex Cover Through Vertex IntegrityTatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi. 271-285 [doi]
- Covering a Set of Line Segments with a Few SquaresJoachim Gudmundsson, Mees van de Kerkhof, André van Renssen, Frank Staals, Lionov Wiratma, Sampson Wong. 286-299 [doi]
- Circumventing Connectivity for KernelizationPallavi Jain 0001, Lawqueen Kanesh, Shivesh Kumar Roy, Saket Saurabh 0001, Roohani Sharma. 300-313 [doi]
- Online and Approximate Network Construction from Bounded Connectivity ConstraintsJesper Jansson, Christos Levcopoulos, Andrzej Lingas. 314-325 [doi]
- 2Csaba Király 0001, András Mihálykó. 326-339 [doi]
- Extending Partial Representations of Rectangular Duals with Given Contact OrientationsSteven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff 0001. 340-353 [doi]
- Can Local Optimality Be Used for Efficient Data Reduction?Christian Komusiewicz, Nils Morawietz. 354-366 [doi]
- Colouring Graphs of Bounded Diameter in the Absence of Small CyclesBarnaby Martin, Daniël Paulusma, Siani Smith. 367-380 [doi]
- Online Two-Dimensional Vector Packing With AdviceBengt J. Nilsson, Gordana Vujovic. 381-393 [doi]
- Temporal Matching on Geometric Graph DataTimothe Picavet, Ngoc-Trung Nguyen, Binh-Minh Bui-Xuan. 394-408 [doi]