Table of Contents

• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Near-Optimal Distance Oracles for Vertex-Labeled Planar GraphsJacob Evald, Viktor Fredslund-Hansen, Christian Wulff-Nilsen. [doi]
• Clustering with NeighborhoodsHongyao Huang, Georgiy Klimenko, Benjamin Raichel. [doi]
• Unique-Neighbor-Like Expansion and Group-Independent Cosystolic ExpansionTali Kaufman, David Mass. [doi]
• Streaming Pattern Matching (Invited Talk)Tatiana Starikovskaya. [doi]
• Algorithms and Complexity on Indexing Elastic Founder GraphsMassimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen. [doi]
• Repetition- and Linearity-Aware Rank/Select DictionariesPaolo Ferragina, Giovanni Manzini, Giorgio Vinciguerra. [doi]
• Self-Improving Voronoi Construction for a Hidden Mixture of Product DistributionsSiu-Wing Cheng, Man Ting Wong. [doi]
• Partitioning H-Free Graphs of Bounded DiameterChristoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith. [doi]
• Skeletons and Minimum Energy SchedulingAntonios Antoniadis, Gunjan Kumar, Nikhil Kumar 0001. [doi]
• The Complexity of Sharing a PizzaPatrick Schnider. [doi]
• Essentially Tight Kernels For (Weakly) Closed GraphsTomohiro Koana, Christian Komusiewicz, Frank Sommer. [doi]
• Augmenting Graphs to Minimize the RadiusJoachim Gudmundsson, Yuan Sha, Fan Yao. [doi]
• Maximum-Weight Matching in Sliding Windows and BeyondLeyla Biabani, Mark de Berg, Morteza Monemizadeh. [doi]
• Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic TreesLuciano Gualà, Stefano Leucci 0001, Isabella Ziccardi. [doi]
• Clique-Based Separators for Geometric Intersection GraphsMark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous. [doi]
• Probabilistic Analysis of Euclidean Capacitated Vehicle RoutingClaire Mathieu, Hang Zhou 0001. [doi]
• Group Evacuation on a Line by Agents with Different Communication AbilitiesJurek Czyzowicz, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov, Sunil M. Shende. [doi]
• Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update TimeJianer Chen, Qin Huang, Iyad Kanj, Qian Li 0012, Ge Xia. [doi]
• Anonymity-Preserving Space PartitionsÚrsula Hébert-Johnson, Chinmay Sonar, Subhash Suri, Vaishali Surianarayanan. [doi]
• Piecewise-Linear Farthest-Site Voronoi DiagramsFranz Aurenhammer, Evanthia Papadopoulou, Martin Suderland. [doi]
• Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a ForestSam Barr, Therese C. Biedl. [doi]
• Shortest Beer Path Queries in Outerplanar GraphsJoyce Bacic, Saeed Mehrabi 0001, Michiel Smid. [doi]
• Identity Testing Under Label MismatchClément L. Canonne, Karl Wimmer. [doi]
• Multimodal Transportation with Ridesharing of Personal VehiclesQian-Ping Gu, Jiajian Leo Liang. [doi]
• Feedback Vertex Set on Geometric Intersection GraphsShinwoo An, Eunjin Oh 0001. [doi]
• A Faster Algorithm for Maximum Flow in Directed Planar Graphs with Vertex CapacitiesJulian Enoch, Kyle Fox, Dor Mesica, Shay Mozes. [doi]
• Interval Edge Coloring of Bipartite Graphs with Small Vertex DegreesAnna Malafiejska, Michal Malafiejski, Krzysztof M. Ocetkiewicz, Krzysztof Pastuszak. [doi]
• The Impact of Geometry on Monochrome Regions in the Flip Schelling ProcessThomas Bläsius, Tobias Friedrich 0001, Martin S. Krejca, Louise Molitor. [doi]
• On Geometric Priority Set Cover ProblemsAritra Banik, Rajiv Raman 0001, Saurabh Ray. [doi]
• Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree ModelBoris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir. [doi]
• Quantum Advantage with Shallow Circuits Under Arbitrary CorruptionAtsuya Hasegawa, François Le Gall. [doi]
• Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic ExpansionAndrzej Czygrinow, Michal Hanckowiak, Marcin Witkowski. [doi]
• Dynamic Boolean Formula EvaluationRathish Das, Andrea Lincoln, Jayson Lynch, J. Ian Munro. [doi]
• Simple Envy-Free and Truthful Mechanisms for Cake Cutting with a Small Number of CutsTakao Asano. [doi]
• Computing Shapley Values for Mean Width in 3-DShuhao Tan. [doi]
• Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar GraphsViktor Fredslund-Hansen, Shay Mozes, Christian Wulff-Nilsen. [doi]
• An Improved Approximation Algorithm for the Matching Augmentation ProblemJoseph Cheriyan, Robert Cummings, Jack Dippel, Jasper Zhu. [doi]
• An Approximation Algorithm for Maximum Stable Matching with Ties and ConstraintsYu Yokoi. [doi]
• On the Kernel and Related Problems in Interval DigraphsMathew C. Francis, Pavol Hell, Dalu Jacob. [doi]
• Dynamic Data Structures for k-Nearest Neighbor QueriesSarita de Berg, Frank Staals. [doi]
• MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set SystemsSotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis. [doi]
• Approximate Maximum Halfspace DiscrepancyMichael Matheny, Jeff M. Phillips. [doi]
• Spanning Properties of Variants of the Delaunay Graph (Invited Talk)Prosenjit Bose. [doi]
• Untangling Circular Drawings: Algorithms and ComplexitySujoy Bhore, Guangping Li 0001, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu. [doi]
• Inverse Suffix Array Queries for 2-Dimensional Pattern Matching in Near-Compact SpaceDhrumil Patel, Rahul Shah. [doi]
• The VC-Dimension of Limited Visibility TerrainsMatt Gibson-Lopez, Zhongxiu Yang. [doi]
• Effective Resistance and Capacitance in Simplicial Complexes and a Quantum AlgorithmMitchell Black, William Maxwell. [doi]
• Making Three out of Two: Three-Way Online Correlated SelectionYongho Shin, Hyung-Chan An. [doi]
• Γ-Graphic Delta-Matroids and Their ApplicationsDonggyu Kim, Duksang Lee, Sang-il Oum. [doi]
• Preference-Based Trajectory Clustering - An Application of Geometric Hitting SetsFlorian Barth, Stefan Funke, Claudius Proissl. [doi]
• Approximating Longest Spanning Tree with NeighborhoodsAhmad Biniaz. [doi]
• Machine Covering in the Random-Order ModelSusanne Albers, Waldo Gálvez, Maximilian Janke. [doi]
• Interval Query Problem on Cube-Free Median GraphsSoh Kumabe. [doi]
• Exact and Approximation Algorithms for Many-To-Many Point Matching in the PlaneSayan Bandyapadhyay, Anil Maheshwari, Michiel Smid. [doi]
• Nearly-Tight Lower Bounds for Set Cover and Network Design with Deadlines/DelayNoam Touitou. [doi]
• Linear-Time Approximation Scheme for k-Means Clustering of Axis-Parallel Affine SubspacesKyungjin Cho, Eunjin Oh 0001. [doi]
• Illuminating the x-Axis by α-FloodlightsBengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski. [doi]
• On the Extended TSP ProblemJulián Mestre, Sergey Pupyrev, Seeun William Umboh. [doi]
• Algorithms for Normalized Multiple Sequence AlignmentsEloi Araujo, Luiz C. S. Rozante, Diego P. Rubert, Fábio Viduani Martinez. [doi]
• Selected Neighbor Degree Forest RealizationAmotz Bar-Noy, David Peleg, Dror Rawitz, Elad Yehezkel. [doi]
• Impatient PPSZ - A Faster Algorithm for CSPShibo Li, Dominik Scheder. [doi]
• Space-Efficient Algorithms for Reachability in Directed Geometric GraphsSujoy Bhore, Rahul Jain 0015. [doi]
• Lower Bounds for Induced Cycle Detection in Distributed ComputingFrançois Le Gall, Masayuki Miyamoto. [doi]
• Tight Competitive Analyses of Online Car-Sharing ProblemsYa-Chun Liang, Kuan-Yun Lai, Ho-Lin Chen, Kazuo Iwama. [doi]
• Separated Red Blue Center ClusteringMarzieh Eskandari, Bhavika B. Khare, Nirman Kumar. [doi]
• A Characterization of Individualization-Refinement TreesMarkus Anders, Jendrik Brachter, Pascal Schweitzer. [doi]
• Grid Recognition: Classical and Parameterized Computational PerspectivesSiddharth Gupta 0002, Guy Sa'ar, Meirav Zehavi. [doi]
• Filling Crosswords Is Very HardLaurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos. [doi]
• Connected Coordinated Motion Planning with Bounded StretchSándor P. Fekete, Phillip Keldenich, Ramin Kosfeld, Christian Rieck, Christian Scheffer. [doi]
• Pattern Masking for Dictionary MatchingPanagiotis Charalampopoulos, Huiping Chen, Peter Christen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski. [doi]
• Fine-Grained Meta-Theorems for Vertex IntegrityMichael Lampis, Valia Mitsou. [doi]
• Enclosing Depth and Other Depth MeasuresPatrick Schnider. [doi]
• Cryptographic Hardness Under Projections for Time-Bounded Kolmogorov ComplexityEric Allender, John Gouwar, Shuichi Hirahara, Caleb Robelle. [doi]
• Adaptive Regularized Submodular MaximizationShaoJie Tang, Jing Yuan 0002. [doi]