Table of Contents

• Small-Space Algorithms for the Online Language Distance Problem for Palindromes and SquaresGabriel Bathie, Tomasz Kociumaka, Tatiana Starikovskaya. [doi]
• Faithful Graph Drawing (Invited Talk)Seok-Hee Hong 0001. [doi]
• A Compact DAG for Storing and Searching Maximal Common SubsequencesAlessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno. [doi]
• Recognizing Unit Multiple Intervals Is HardVirginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette. [doi]
• Matching Cuts in Graphs of High Girth and H-Free GraphsCarl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries. [doi]
• Clustering What Matters in Constrained Settings: Improved Outlier to Outlier-Free ReductionsRagesh Jaiswal, Amit Kumar 0001. [doi]
• The st-Planar Edge Completion Problem Is Fixed-Parameter TractableLiana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov. [doi]
• A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution SystemsKei Kimura, Kazuhisa Makino. [doi]
• An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-Free Two-Edge-CoverYusuke Kobayashi 0001, Takashi Noguchi. [doi]
• Testing Properties of Distributions in the Streaming ModelSampriti Roy, Yadu Vasudev. [doi]
• A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible DegreesShuai Shao 0001, Stanislav Zivný. [doi]
• On the Fine-Grained Query Complexity of Symmetric FunctionsSupartha Podder, Penghui Yao, Zekun Ye. [doi]
• FPT Approximation Using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating SetHuairui Chu, Bingkai Lin. [doi]
• Shortest Beer Path Queries in Digraphs with Bounded TreewidthJoachim Gudmundsson, Yuan Sha. [doi]
• Is the Algorithmic Kadison-Singer Problem Hard?Ben Jourdan, Peter Macgregor, He Sun 0001. [doi]
• Fast Convolutions for Near-Convex SequencesCornelius Brand, Alexandra Lassota. [doi]
• Rapid Mixing for the Hardcore Glauber Dynamics and Other Markov Chains in Bounded-Treewidth GraphsDavid Eppstein, Daniel Frishberg. [doi]
• Rectilinear-Upward Planarity Testing of DigraphsWalter Didimo, Michael Kaufmann 0001, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani. [doi]
• Regularization of Low Error PCPs and an Application to MCSPShuichi Hirahara, Dana Moshkovitz. [doi]
• On the Line-Separable Unit-Disk Coverage and Related ProblemsGang Liu, Haitao Wang 0001. [doi]
• Non-Clairvoyant Makespan Minimization Scheduling with PredictionsEvripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual. [doi]
• Computing a Subtrajectory Cluster from c-Packed TrajectoriesJoachim Gudmundsson, Zijin Huang, André van Renssen, Sampson Wong. [doi]
• Unified Almost Linear Kernels for Generalized Covering and Packing Problems on Nowhere Dense ClassesJungho Ahn, Jinha Kim, O-joung Kwon. [doi]
• Finding Diverse Minimum s-t CutsMark de Berg, Andrés López-Martínez, Frits C. R. Spieksma. [doi]
• An FPT Algorithm for Splitting a Necklace Among Two ThievesMichaela Borzechowski, Patrick Schnider, Simon Weber 0001. [doi]
• Realizability of Free Spaces of CurvesHugo A. Akitaya, Maike Buchin, Majid Mirzanezhad, Leonie Ryvkin, Carola Wenk. [doi]
• Substring Complexity in Sublinear SpaceGiulia Bernardini 0001, Gabriele Fici, Pawel Gawrychowski, Solon P. Pissis. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related MachinesSebastian Berndt 0001, Hauke Brinkop, Klaus Jansen, Matthias Mnich, Tobias Stamm. [doi]
• Distance Queries over Dynamic Interval GraphsJingbang Chen, Meng He 0001, J. Ian Munro, Richard Peng, Kaiyu Wu, Daniel J. Zhang. [doi]
• Group Fairness: From Multiwinner Voting to Participatory Budgeting (Invited Talk)Edith Elkind. [doi]
• Pattern-Avoiding Binary Trees - Generation, Counting, and BijectionsPetr Gregor, Torsten Mütze, Namrata. [doi]
• Computing Paths of Large Rank in Planar Frameworks DeterministicallyFedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis. [doi]
• Sparse Graphs of Twin-Width 2 Have Bounded Tree-WidthBenjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski 0001. [doi]
• Connected Vertex Cover on AT-Free GraphsJoydeep Mukherjee, Tamojit Saha. [doi]
• Prefix Sorting DFAs: A Recursive AlgorithmNicola Cotumaccio. [doi]
• Depth-Three Circuits for Inner Product and Majority FunctionsKazuyuki Amano. [doi]
• Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal SetsAnubhav Dhar, Soumita Hait, Sudeshna Kolay. [doi]
• Structural Parameterizations of b-ColoringLars Jaffke, Paloma T. Lima, Roohani Sharma. [doi]
• Exact Matching: Correct Parity and FPT Parameterized by Independence NumberNicolas El Maalouly, Raphael Steiner, Lasse Wulf. [doi]
• Geometric TSP on SetsHenk Alkema, Mark de Berg. [doi]
• Shortest Beer Path Queries Based on Graph DecompositionTesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama. [doi]
• Improved Guarantees for the a Priori TSPJannis Blauth, Meike Neuwohner, Luise Puhlmann, Jens Vygen. [doi]
• Clustering in Polygonal DomainsMark de Berg, Leyla Biabani, Morteza Monemizadeh, Leonidas Theocharous. [doi]
• Matrix Completion: Approximating the Minimum DiameterDiptarka Chakraborty, Sanjana Dey. [doi]
• k-Universality of Regular LanguagesDuncan Adamson, Pamela Fleischmann, Annika Huch, Tore Koß, Florin Manea, Dirk Nowotka. [doi]
• A Unified Worst Case for Classical Simplex and Policy Iteration Pivot RulesYann Disser, Nils Mosis. [doi]
• Succinct Planar Encoding with Minor OperationsFrank Kammer, Johannes Meintrup. [doi]
• Single-Exponential FPT Algorithms for Enumerating Secluded ℱ-Free Subgraphs and Deleting to Scattered Graph ClassesBart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk 0001. [doi]
• Improved Approximation for Two-Dimensional Vector Multiple KnapsackTomer Cohen, Ariel Kulik, Hadas Shachnai. [doi]
• On the Complexity of the Eigenvalue Deletion ProblemNeeldhara Misra, Harshil Mittal, Saket Saurabh 0001, Dhara Thakkar. [doi]
• Reconfiguration of the Union of ArborescencesYusuke Kobayashi 0001, Ryoga Mahara, Tamás Schwarcz. [doi]
• Improved Approximation Algorithm for Capacitated Facility Location with Uniform Facility CostMong-Jen Kao. [doi]
• Approximation Guarantees for Shortest Superstrings: Simpler and BetterMatthias Englert, Nicolaos Matsakis, Pavel Veselý 0001. [doi]
• Coloring and Recognizing Mixed Interval GraphsGrzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen, Pawel Rzazewski, Alexander Wolff 0001, Johannes Zink. [doi]
• Temporal Separators with DeadlinesHovhannes A. Harutyunyan, Kamran Koupayi, Denis Pankratov. [doi]
• On Min-Max Graph Balancing with Strict Negative Correlation ConstraintsTing-Yu Kuo, Yu-Han Chen, Andrea Frosini, Sun-Yuan Hsieh, Shi-Chun Tsai, Mong-Jen Kao. [doi]
• Improved Smoothed Analysis of 2-Opt for the Euclidean TSPBodo Manthey, Jesse van Rhijn. [doi]