Table of Contents

• Single Family Algebra Operation on BDDs and ZDDs Leads to Exponential Blow-UpKengo Nakamura 0001, Masaaki Nishino, Shuhei Denzumi. [doi]
• Basis Sequence Reconfiguration in the Union of MatroidsTesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi, Yuto Okada, Rin Saito. [doi]
• A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy GraphsDaniel Paul-Pena, C. Seshadhri 0001. [doi]
• Temporal Queries for Dynamic Temporal ForestsDavide Bilò, Luciano Gualà, Stefano Leucci 0001, Guido Proietti, Alessandro Straziota. [doi]
• Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-GraphsVadim V. Lozin, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Mark H. Siggers, Siani Smith, Erik Jan van Leeuwen. [doi]
• Complexity of Local Search for Euclidean Clustering ProblemsBodo Manthey, Nils Morawietz, Jesse van Rhijn, Frank Sommer. [doi]
• Easier Ways to Prove Counting Hard: A Dichotomy for Generalized #SAT, Applied to Constraint GraphsMIT Hardness Group, Josh Brunner, Erik D. Demaine, Jenny Diomidova, Timothy Gomez, Markus Hecher, Frederick Stock, Zixiang Zhou. [doi]
• Data Privacy: The Land Where Average Cases Don't Exist and Assumptions Quickly Perish (Invited Talk)Olga Ohrimenko. [doi]
• On the Spanning and Routing Ratios of the Yao-Four GraphProsenjit Bose, Darryl Hill, Michiel Smid, Tyler Tuttle. [doi]
• Robust Bichromatic Classification Using Two LinesErwin Glazenburg, Thijs van der Horst, Tom Peters, Bettina Speckmann, Frank Staals. [doi]
• Generating All Invertible Matrices by Row OperationsPetr Gregor, Hung P. Hoang 0001, Arturo Merino, Ondrej Micka. [doi]
• Does Subset Sum Admit Short Proofs?Michal Wlodarczyk 0001. [doi]
• Constant Approximating Disjoint Paths on Acyclic Digraphs Is W[1]-HardMichal Wlodarczyk 0001. [doi]
• Constrained Boundary LabelingThomas Depian, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger. [doi]
• Composition Orderings for Linear Functions and Matrix Multiplication OrderingsSusumu Kubo, Kazuhisa Makino, Souta Sakamoto. [doi]
• When Can Cluster Deletion with Bounded Weights Be Solved Efficiently?Jaroslav Garvardt, Christian Komusiewicz, Nils Morawietz. [doi]
• Uniform Polynomial Kernel for Deletion to K_{2, p} Minor-Free GraphsWilliam Lochet, Roohani Sharma. [doi]
• From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All EdgesFabian Frei, Ahmed Ghazy, Tim A. Hartmann, Florian Hörsch, Dániel Marx. [doi]
• Optimal Sensitivity Oracle for Steiner MincutKoustav Bhanja. [doi]
• Robust Classification of Dynamic Bichromatic Point Sets in R²Erwin Glazenburg, Marc J. van Kreveld, Frank Staals. [doi]
• The Existential Theory of the Reals with Summation OperatorsMarkus Bläser, Julian Dörfler, Maciej Liskiewicz, Benito van der Zander. [doi]
• Constrained Two-Line Center ProblemsTaehoon Ahn 0001, Sang Won Bae 0001. [doi]
• A Fast Algorithm for Computing a Planar Support for Non-Piercing RectanglesAmbar Pal, Rajiv Raman 0001, Saurabh Ray, Karamjeet Singh. [doi]
• Succinct Data Structures for Baxter Permutation and Related FamiliesSankardeep Chakraborty, Seungbum Jo, Geunho Kim 0001, Kunihiko Sadakane. [doi]
• Online Multi-Level Aggregation with Delays and Stochastic ArrivalsMathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski. [doi]
• Revisit the Scheduling Problem with CalibrationsLin Chen 0009, Yixiong Gao, Minming Li, Guohui Lin, Kai Wang 0018. [doi]
• Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded DomainSándor P. Fekete, Ramin Kosfeld, Peter Kramer 0001, Jonas Neutzner, Christian Rieck, Christian Scheffer. [doi]
• Role of Structured Matrices in Fine-Grained Algorithm Design (Invited Talk)Barna Saha. [doi]
• On the Connected Minimum Sum of Radii ProblemHyung-Chan An, Mong-Jen Kao. [doi]
• Approximation Algorithms for Cumulative Vehicle Routing with Stochastic DemandsJingyang Zhao 0001, Mingyu Xiao 0001. [doi]
• On HTLC-Based Protocols for Multi-Party Cross-Chain SwapsEmily Clark, Chloe Georgiou, Katelyn Poon, Marek Chrobak. [doi]
• Knapsack with Vertex Cover, Set Cover, and Hitting SetPalash Dey, Ashlesha Hota, Sudeshna Kolay, Sipra Singh. [doi]
• A Polynomial Kernel for Deletion to the Scattered Class of Cliques and TreesAshwin Jacob, Diptapriyo Majumdar, Meirav Zehavi. [doi]
• Exact Algorithms for Clustered Planarity with Linear SaturatorsGiordano Da Lozzo, Robert Ganian, Siddharth Gupta 0002, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi. [doi]
• Approximating the Fréchet Distance When Only One Curve Is c-PackedJoachim Gudmundsson, Tiancheng Mai, Sampson Wong. [doi]
• Fault-Tolerant Bounded Flow PreserversShivam Bansal, Keerti Choudhary, Harkirat Dhanoa, Harsh Wardhan. [doi]
• Reconfiguration of Labeled Matchings in Triangular Grid GraphsNaonori Kakimura, Yuta Mishima. [doi]
• Optimal Offline ORAM with Perfect Security via Simple Oblivious Priority QueuesThore Thießen, Jan Vahrenhold. [doi]
• Core Stability in Additively Separable Hedonic Games of Low TreewidthTesshu Hanaka, Noleen Köhler, Michael Lampis. [doi]
• A Simple Distributed Algorithm for Sparse Fractional Covering and Packing ProblemsQian Li, Minghui Ouyang, Yuyi Wang 0001. [doi]
• Subsequence Matching and Analysis Problems for Formal LanguagesSzilárd Zsolt Fazekas, Tore Koß, Florin Manea, Robert Mercas, Timo Specht. [doi]
• Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test CoverDipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale. [doi]
• Simple Realizability of Abstract Topological GraphsGiordano Da Lozzo, Walter Didimo, Fabrizio Montecchiani, Miriam Münch, Maurizio Patrignani, Ignaz Rutter. [doi]
• Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width)Petr Hlinený, Liana Khazaliya. [doi]
• Hardness Amplification for Dynamic Binary Search TreesShunhua Jiang, Victor Lecomte, Omri Weinstein, Sorrachai Yingchareonthawornchai. [doi]
• Data Structures for Approximate Fréchet Distance for Realistic CurvesIvor van der Hoog, Eva Rotenberg, Sampson Wong. [doi]
• On the Parameterized Complexity of Diverse SATNeeldhara Misra, Harshil Mittal, Ashutosh Rai 0001. [doi]
• Algorithmic Problems in Discrete Choice (Invited Talk)Ravi Kumar 0001. [doi]
• Minimum Plane Bichromatic Spanning TreesHugo A. Akitaya, Ahmad Biniaz, Erik D. Demaine, Linda Kleist, Frederick Stock, Csaba D. Tóth. [doi]
• Enhancing Generalized Compressed Suffix Trees, with ApplicationsSankardeep Chakraborty, Kunihiko Sadakane, Wiktor Zuba. [doi]
• Kernelization Complexity of Solution Discovery ProblemsMario Grobler, Stephanie Maaz, Amer E. Mouawad, Naomi Nishimura, Vijayaragunathan Ramamoorthi, Sebastian Siebertz. [doi]
• Lower Bounds for Adaptive Relaxation-Based Algorithms for Single-Source Shortest PathsSunny Atalig, Alexander Hickerson, Arrdya Srivastav, Tingting Zheng, Marek Chrobak. [doi]
• On the Complexity of Establishing Hereditary Graph Properties via Vertex SplittingAlexander Firbas, Manuel Sorge. [doi]
• Routing from Pentagon to Octagon Delaunay GraphsProsenjit Bose, Jean-Lou De Carufel, John Stuart. [doi]
• Dynamic Parameterized Problems on Unit Disk GraphsShinwoo An, Kyungjin Cho, Leo Jang, Byeonghyeon Jung, Yudam Lee, Eunjin Oh 0001, Donghun Shin, Hyeonjun Shin, Chanho Song. [doi]
• Partitioning Problems with Splittings and Interval TargetsSamuel Bismuth, Vladislav Makarov, Erel Segal-haLevi, Dana Shapira. [doi]
• Mimicking Networks for Constrained Multicuts in HypergraphsKyungjin Cho, Eunjin Oh 0001. [doi]
• The Complexity of Geodesic Spanners Using Steiner PointsSarita de Berg, Tim Ophelders, Irene Parada, Frank Staals, Jules Wulms. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• FPT Approximations for Fair k-Min-Sum-RadiiLena Carta, Lukas Drexler, Annika Hennes, Clemens Rösner, Melanie Schmidt 0001. [doi]