Table of Contents

• Gourds: A Sliding-Block Puzzle with TurningJoep Hamersma, Marc J. van Kreveld, Yushi Uno, Tom C. van der Zanden. [doi]
• On Girth and the Parameterized Complexity of Token Sliding and Token JumpingValentin Bartier, Nicolas Bousquet, Clément Dallard, Kyle Lomer, Amer E. Mouawad. [doi]
• Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with CostsTrung Thanh Nguyen 0004, Jörg Rothe. [doi]
• Random Access in Persistent StringsPhilip Bille, Inge Li Gørtz. [doi]
• Discriminating Codes in Geometric SetupsSanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen. [doi]
• Geometric Pattern Matching Reduces to k-SUMBoris Aronov, Jean Cardinal. [doi]
• Diverse Pairs of MatchingsFedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov. [doi]
• Shortest-Path Queries in Geometric NetworksEunjin Oh 0001. [doi]
• Sparse Hop Spanners for Unit Disk GraphsAdrian Dumitrescu, Anirban Ghosh, Csaba D. Tóth. [doi]
• Enumerating Range ModesKentaro Sumigawa, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti. [doi]
• Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related ProblemsLoukas Georgiadis, Evangelos Kosinas. [doi]
• Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal GraphsTill Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche. [doi]
• Linear Transformations Between Dominating Sets in the TAR-ModelNicolas Bousquet, Alice Joffard, Paul Ouvrard. [doi]
• Algorithms and Complexity for Geodetic Sets on Planar and Chordal GraphsDibyayan Chakraborty, Sandip Das 0001, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy. [doi]
• Constant-Factor Approximation Algorithms for the Parity-Constrained Facility Location ProblemKangsan Kim, Yongho Shin, Hyung-Chan An. [doi]
• Indexing Isodirectional Pointer SequencesSung-Hwan Kim, Hwan-Gue Cho. [doi]
• Improved FPT Algorithms for Deletion to Forest-Like StructuresKishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh 0001. [doi]
• How to Decompose a Graph into a Tree-Like Structure (Invited Talk)Sang-il Oum. [doi]
• Contracting to a Longest Path in H-Free GraphsWalter Kern, Daniël Paulusma. [doi]
• Complexity of Scheduling Few Types of Jobs on Related and Unrelated MachinesMartin Koutecký, Johannes Zink. [doi]
• The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored GraphsThomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge. [doi]
• Online Primal-Dual Algorithms with Configuration Linear ProgramsNguyen Kim Thang. [doi]
• Compact Routing in Unit Disk GraphsWolfgang Mulzer, Max Willert. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Finding Temporal Paths Under Waiting Time ConstraintsArnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche. [doi]
• Approximating the Packedness of Polygonal CurvesJoachim Gudmundsson, Yuan Sha, Sampson Wong. [doi]
• The k-Server Problem with Delays on the Uniform Metric SpacePredrag Krnetic, Darya Melnyk, Yuyi Wang 0001, Roger Wattenhofer. [doi]
• Wear Leveling RevisitedTaku Onodera, Tetsuo Shibuya. [doi]
• Quantum-Inspired Algorithms for Solving Low-Rank Linear Equation Systems with Logarithmic Dependence on the DimensionNai-Hui Chia, András Gilyén, Han-Hsuan Lin, Seth Lloyd, Ewin Tang, Chunhao Wang. [doi]
• Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of CutsTakao Asano, Hiroyuki Umeda. [doi]
• The Online Broadcast Range-Assignment ProblemMark de Berg, Aleksandar Markovic 0001, Seeun William Umboh. [doi]
• Between Shapes, Using the Hausdorff DistanceMarc J. van Kreveld, Tillmann Miltzow, Tim Ophelders, Willem Sonke, Jordi L. Vermeulen. [doi]
• Complexity of StabilityFabian Frei, Edith Hemaspaandra, Jörg Rothe. [doi]
• Efficient Labeling for Reachability in Directed Acyclic GraphsMaciej Duleba, Pawel Gawrychowski, Wojciech Janczewski. [doi]
• A Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence LengthYoshifumi Sakai, Shunsuke Inenaga. [doi]
• Efficiently Computing All Delaunay Triangles Occurring over All Contiguous SubsequencesStefan Funke, Felix Weitbrecht. [doi]
• Multicommodity Flows in Planar Graphs with Demands on FacesNikhil Kumar 0001. [doi]
• Arithmetic Expression ConstructionLeo Alcock, Sualeh Asif, Jeffrey Bosboom, Josh Brunner, Charlotte Chen, Erik D. Demaine, Rogers Epstein, Adam Hesterberg, Lior Hirschfeld, William Hu, Jayson Lynch, Sarah Scheffler, Lillian Zhang. [doi]
• Minimization and Parameterized Variants of Vertex Partition Problems on GraphsYuma Tamura, Takehiro Ito, Xiao Zhou 0001. [doi]
• Towards Constant-Factor Approximation for Chordal / Distance-Hereditary Vertex DeletionJungho Ahn, Eun Jung Kim 0002, Euiwoong Lee. [doi]
• Partial Function Extension with Applications to Learning and Property TestingUmang Bhaskar, Gunjan Kumar. [doi]
• Recency Queries with Succinct RepresentationWilliam L. Holland, Anthony Wirth, Justin Zobel. [doi]
• Weakly Submodular Function Maximization Using Local Submodularity RatioRichard Santiago, Yuichi Yoshida. [doi]
• Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is HardJosh Brunner, Erik D. Demaine, Dylan H. Hendrickson, Julian Wellman. [doi]
• Computing Dense and Sparse Subgraphs of Weakly Closed GraphsTomohiro Koana, Christian Komusiewicz, Frank Sommer. [doi]
• Approximations for Throughput MaximizationDylan Hyatt-Denesik, Mirmahdi Rahgoshay, Mohammad R. Salavatipour. [doi]
• Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct TreesMeng He 0001, J. Ian Munro, Yakov Nekrich, Sebastian Wild, Kaiyu Wu. [doi]
• Shared vs Private Randomness in Distributed Interactive ProofsPedro Montealegre, Diego Ramírez-Romero, Ivan Rapaport. [doi]
• A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence ProblemAnadi Agrawal, Pawel Gawrychowski. [doi]
• Sorting by Prefix Block-InterchangesAnthony Labarre. [doi]
• Approximation Algorithms for Generalized Path SchedulingHaozhou Pang, Mohammad R. Salavatipour. [doi]
• Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in GraphsBartlomiej Dudek 0001, Pawel Gawrychowski. [doi]
• Worst-Case Optimal Join Algorithms (Invited Talk)Ke Yi 0001. [doi]
• An SPQR-Tree-Like Embedding Representation for Level PlanarityGuido Brückner, Ignaz Rutter. [doi]
• Signal Passing Self-Assembly Simulates Tile AutomataAngel A. Cantu, Austin Luchsinger, Robert T. Schweller, Tim Wylie. [doi]
• Space Hardness of Solving Structured Linear SystemsXuangui Huang. [doi]
• Flexible List Colorings in Graphs with Special Degeneracy ConditionsPeter Bradshaw, Tomás Masarík, Ladislav Stacho. [doi]
• Size, Depth and Energy of Threshold Circuits Computing Parity FunctionKei Uchizawa. [doi]
• Market Pricing for Matroid Rank ValuationsKristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi 0001. [doi]
• Recursed Is Not Recursive: A Jarring ResultErik D. Demaine, Justin Kopinsky, Jayson Lynch. [doi]
• A Unified Framework of FPT Approximation Algorithms for Clustering ProblemsQilong Feng, Zhen Zhang 0024, Ziyun Huang, Jinhui Xu 0001, Jianxin Wang 0001. [doi]
• Length-Bounded Cuts: Proper Interval Graphs and Structural ParametersMatthias Bentert, Klaus Heeger, Dusan Knop. [doi]
• Multiparty SelectionKe Chen 0011, Adrian Dumitrescu. [doi]
• (In)approximability of Maximum Minimal FVSLouis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos. [doi]
• Sparsification Lower Bounds for List H-ColoringHubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski. [doi]
• Update Query Time Trade-Off for Dynamic Suffix ArraysAmihood Amir, Itai Boneh. [doi]