Table of Contents

• Car-Sharing on a Star Network: On-Line Scheduling with k ServersKelin Luo, Thomas Erlebach, Yinfeng Xu. [doi]
• Solving Simple Stochastic Games with Few Random Nodes Faster Using Bland's RuleDavid Auger, Pierre Coucheney, Yann Strozecki. [doi]
• Algorithmic Data Science (Invited Talk)Petra Mutzel. [doi]
• Space Lower Bounds for the Signal Detection ProblemFaith Ellen, Rati Gelashvili, Philipp Woelfel, Leqi Zhu. [doi]
• Fast and Longest RollercoastersPawel Gawrychowski, Florin Manea, Radoslaw Serafin. [doi]
• Dispersing Obnoxious Facilities on a GraphAlexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger. [doi]
• From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial)Tobias Friedrich 0001. [doi]
• Pairwise Preferences in the Stable Marriage ProblemÁgnes Cseh, Attila Juhos. [doi]
• Bipartite Diameter and Other Measures Under TranslationBoris Aronov, Omrit Filtser, Matthew J. Katz, Khadijeh Sheikhan. [doi]
• A Tight Extremal Bound on the Lovász Cactus Number in Planar GraphsParinya Chalermsook, Andreas Schmid 0003, Sumedha Uniyal. [doi]
• Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional ShiftsJulien Destombes, Andrei E. Romashchenko. [doi]
• Building Strategies into QBF ProofsOlaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan. [doi]
• Tractable QBF by Knowledge CompilationFlorent Capelli, Stefan Mengel. [doi]
• Fine-Grained Complexity Theory (Tutorial)Karl Bringmann. [doi]
• Constant-Time Retrieval with O(log m) Extra BitsMartin Dietzfelbinger, Stefan Walzer. [doi]
• Lower Bounds for DeMorgan Circuits of Bounded Negation WidthStasys Jukna, Andrzej Lingas. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Finite Sequentiality of Unambiguous Max-Plus Tree AutomataErik Paul. [doi]
• Paging with Dynamic Memory CapacityEnoch Peserico. [doi]
• The Set Cover Conjecture and Subgraph Isomorphism with a Tree PatternRobert Krauthgamer, Ohad Trabelsi. [doi]
• Algorithmic Properties of Sparse DigraphsStephan Kreutzer, Irene Muzi, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz. [doi]
• Distributed Coloring of Graphs with an Optimal Number of ColorsÉtienne Bamas, Louis Esperet. [doi]
• Quantum Advantage for the LOCAL Model in Distributed ComputingFrançois Le Gall, Harumichi Nishimura, Ansis Rosmanis. [doi]
• Beyond Boolean Surjective VCSPsGregor Matl, Stanislav Zivny. [doi]
• Average-Case Completeness in Tag SystemsMatthew Cook 0001, Turlough Neary. [doi]
• Lean Tree-Cut Decompositions: Obstructions and AlgorithmsArchontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos. [doi]
• A Characterization of Subshifts with Computable LanguageEmmanuel Jeandel, Pascal Vanier. [doi]
• Constructive Discrepancy Minimization with Hereditary L2 GuaranteesKasper Green Larsen. [doi]
• Wealth Inequality and the Price of AnarchyKurtulus Gemici, Elias Koutsoupias, Barnabé Monnot, Christos H. Papadimitriou, Georgios Piliouras. [doi]
• The Semialgebraic Orbit ProblemShaull Almagor, Joël Ouaknine, James Worrell 0001. [doi]
• The Containment Problem for Unambiguous Register AutomataAntoine Mottet, Karin Quaas. [doi]
• Sparsification of Binary CSPsSilvia Butti, Stanislav Zivny. [doi]
• Visibly Pushdown Languages over Sliding WindowsMoses Ganardi. [doi]
• Closure Properties of Synchronized RelationsMaría Emilia Descotte, Diego Figueira, Santiago Figueira. [doi]
• Random Noise Increases Kolmogorov Complexity and Hausdorff DimensionGleb Posobin, Alexander Shen. [doi]
• Modification to Planarity is Fixed Parameter TractableFedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos. [doi]
• A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar GraphsBart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen. [doi]
• Reachability in O(log n) Genus Graphs is in Unambiguous LogspaceChetan Gupta, Vimal Raj Sharma, Raghunath Tewari. [doi]
• Depth First Search in the Semi-streaming ModelShahbaz Khan, Shashank K. Mehta. [doi]
• A Unified Approach to Tail Estimates for Randomized Incremental ConstructionSandeep Sen. [doi]
• On the Descriptive Complexity of Color CodingMax Bannach, Till Tantau. [doi]
• Computational Complexity and Partition Functions (Invited Talk)Leslie Ann Goldberg. [doi]
• Tree Automata with Global Constraints for Infinite TreesPatrick Landwehr, Christof Löding. [doi]
• Best-Of-Two-Worlds Analysis of Online SearchSpyros Angelopoulos 0001, Christoph Dürr, Shendan Jin. [doi]
• Compressed Decision Problems in Hyperbolic GroupsDerek F. Holt, Markus Lohrey, Saul Schleimer. [doi]
• Token Sliding on Split GraphsRémy Belmonte, Eun Jung Kim 0002, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora. [doi]
• The Many Facets of String Transducers (Invited Talk)Anca Muscholl, Gabriele Puppis. [doi]
• Bounding Quantum-Classical Separations for Classes of Nonlocal GamesTom Bannink, Jop Briët, Harry Buhrman, Farrokh Labib, Troy Lee. [doi]
• Lifting Theorems for EqualityBruno Loff, Sagnik Mukhopadhyay. [doi]
• How to Secure Matchings Against Edge FailuresFelix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt. [doi]
• Dominating Sets and Connected Dominating Sets in Dynamic GraphsNiklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, David Saulpic. [doi]
• Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the LineAlexander Birx, Yann Disser. [doi]
• Tight Complexity Lower Bounds for Integer Linear Programming with Few ConstraintsDusan Knop, Michal Pilipczuk, Marcin Wrochna. [doi]
• Complexity of the Steiner Network Problem with Respect to the Number of TerminalsEduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý. [doi]
• Stabilization Time in Weighted Minority ProcessesPál András Papp, Roger Wattenhofer. [doi]
• On Finite Monoids over Nonnegative Integer Matrices and Short Killing WordsStefan Kiefer, Corto Mascle. [doi]
• Enumerating Minimal Dominating Sets in Triangle-Free GraphsMarthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond. [doi]
• Progressive Algorithms for Domination and IndependenceGrzegorz Fabianski, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk. [doi]
• On Kernelization for Edge Dominating Set under Structural ParametersEva-Maria C. Hols, Stefan Kratsch. [doi]
• NP[1] Lifting TheoremThomas Watson 0001. [doi]