Table of Contents

• Incompressibility of H-Free Edge Modification Problems: Towards a DichotomyDániel Marx, R. B. Sandeep. [doi]
• Parallel Batch-Dynamic Trees via Change PropagationUmut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Sam Westrick. [doi]
• Space-Efficient, Fast and Exact Routing in Time-Dependent Road NetworksBen Strasser, Dorothea Wagner, Tim Zeitz. [doi]
• More on Change-Making and Related ProblemsTimothy M. Chan, Qizheng He. [doi]
• Improved Distance Sensitivity Oracles with Subcubic Preprocessing TimeHanlin Ren. [doi]
• On the Complexity of Recovering Incidence MatricesFedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan. [doi]
• Approximating k-Connected m-Dominating SetsZeev Nutov. [doi]
• Optimal Polynomial-Time Compression for Boolean Max CSPBart M. P. Jansen, Michal Wlodarczyk 0001. [doi]
• Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension GraphsAndreas Emil Feldmann, David Saulpic. [doi]
• New Binary Search Tree Bounds via Geometric InversionsParinya Chalermsook, Wanchote Po Jiamjitrak. [doi]
• Compact Oblivious Routing in Weighted GraphsPhilipp Czerner, Harald Räcke. [doi]
• The Minimization of Random HypergraphsThomas Bläsius, Tobias Friedrich 0001, Martin Schirneck. [doi]
• The Maximum Binary Tree ProblemKarthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu. [doi]
• Augmenting the Algebraic Connectivity of GraphsBogdan-Adrian Manghiuc, Pan Peng 0001, He Sun. [doi]
• Reconfiguration of Spanning Trees with Many or Few LeavesNicolas Bousquet, Takehiro Ito, Yusuke Kobayashi 0001, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa. [doi]
• Many Visits TSP RevisitedLukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström. [doi]
• Capacitated Sum-Of-Radii Clustering: An FPT ApproximationTanmay Inamdar 0002, Kasturi R. Varadarajan. [doi]
• Fine-Grained Complexity of Regular Expression Pattern Matching and MembershipPhilipp Schepper. [doi]
• A Linear Fixed Parameter Tractable Algorithm for Connected PathwidthMamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos. [doi]
• Improved Algorithms for Alternating Matrix Space Isometry: From Theory to PracticePeter A. Brooksbank, Yinan Li, Youming Qiao, James B. Wilson. [doi]
• Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital RaysMan-Kwun Chiu, Matias Korman, Martin Suderland, Takeshi Tokuyama. [doi]
• Engineering Fast Almost Optimal Algorithms for Bipartite Graph MatchingIoannis Panagiotas, Bora Uçar. [doi]
• Dynamic Matching Algorithms in PracticeMonika Henzinger, Shahbaz Khan 0004, Richard Paul, Christian Schulz 0003. [doi]
• Linear Time LexDFS on Chordal GraphsJesse Beisegel, Ekkehard Köhler, Robert Scheffler, Martin Strehler. [doi]
• Cutting Polygons into Small Pieces with Chords: Laser-Based LocalizationEsther M. Arkin, Rathish Das, Jie Gao 0001, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk, Csaba D. Tóth. [doi]
• Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free GraphsJan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Subexponential Parameterized Algorithms and Kernelization on Almost Chordal GraphsFedor V. Fomin, Petr A. Golovach. [doi]
• Sometimes Reliable Spanners of Almost Linear SizeKevin Buchin, Sariel Har-Peled, Dániel Oláh. [doi]
• A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial TimeZachary Friggstad, Chaitanya Swamy. [doi]
• Grundy Distinguishes Treewidth from PathwidthRémy Belmonte, Eun Jung Kim 0002, Michael Lampis, Valia Mitsou, Yota Otachi. [doi]
• Simulating Population Protocols in Sub-Constant Time per InteractionPetra Berenbrink, David Hammer, Dominik Kaaser, Ulrich Meyer 0001, Manuel Penschuck, Hung Tran. [doi]
• Minimum Neighboring Degree Realization in Graphs and TreesAmotz Bar-Noy, Keerti Choudhary, Avi Cohen, David Peleg, Dror Rawitz. [doi]
• Optimally Handling Commitment Issues in Online Throughput MaximizationFranziska Eberle, Nicole Megow, Kevin Schewior. [doi]
• On the Computational Complexity of Linear DiscrepancyLily Li, Aleksandar Nikolov. [doi]
• Improved Prophet Inequalities for Combinatorial Welfare Maximization with (Approximately) Subadditive AgentsHanrui Zhang. [doi]
• Linear Expected Complexity for Directional and Multiplicative Voronoi DiagramsChenglin Fan, Benjamin Raichel. [doi]
• -1-ε)-Approximation for the Monotone Submodular Multiple Knapsack ProblemYaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai. [doi]
• The Number of Repetitions in 2D-StringsPanagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba. [doi]
• Set Cover with Delay - Clairvoyance Is Not RequiredYossi Azar, Ashish Chiplunkar, Shay Kutten, Noam Touitou. [doi]
• When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance Under TranslationKarl Bringmann, Marvin Künnemann, André Nusser. [doi]
• Reconstructing Biological and Digital Phylogenetic Trees in ParallelRamtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda. [doi]
• Fully-Dynamic CoresetsMonika Henzinger, Sagar Kale. [doi]
• Approximation Algorithms for Clustering with Dynamic PointsShichuan Deng, Jian Li 0015, Yuval Rabani. [doi]
• Improved Approximation Algorithm for Set Multicover with Non-Piercing RegionsRajiv Raman 0001, Saurabh Ray. [doi]
• Practical Performance of Space Efficient Data Structures for Longest Common ExtensionsPatrick Dinklage, Johannes Fischer 0001, Alexander Herlez, Tomasz Kociumaka, Florian Kurpicz. [doi]
• Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar GraphsPanagiotis Charalampopoulos, Adam Karczmarz. [doi]
• An Algorithmic Weakening of the Erdős-Hajnal ConjectureÉdouard Bonnet, Stéphan Thomassé, Xuan Thang Tran, Rémi Watrigant. [doi]
• Coresets for the Nearest-Neighbor RuleAlejandro Flores-Velazco, David M. Mount. [doi]
• On the Approximation Ratio of the k-Opt and Lin-Kernighan Algorithm for Metric and Graph TSPXianghui Zhong. [doi]
• Light Euclidean Spanners with Steiner PointsHung Le, Shay Solomon. [doi]
• Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text IndexingYounan Gao, Meng He 0001, Yakov Nekrich. [doi]
• An Optimal Decentralized (Δ + 1)-Coloring AlgorithmDaniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl. [doi]
• Kruskal-Based Approximation Algorithm for the Multi-Level Steiner Tree ProblemAbu Reyan Ahmed, Faryad Darabi Sahneh, Keaton Hamm, Stephen G. Kobourov, Richard Spence. [doi]
• A Polynomial Kernel for Line Graph DeletionEduard Eiben, William Lochet. [doi]
• Planar Bichromatic Bottleneck Spanning TreesA. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell. [doi]
• Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network AnalysisEugenio Angriman, Maria Predari, Alexander van der Grinten, Henning Meyerhenke. [doi]
• Analysis of the Period Recovery Error BoundAmihood Amir, Itai Boneh, Michael Itzhaki, Eitan Kondratovsky. [doi]
• Dual Half-Integrality for Uncrossable Cut Cover and Its Application to Maximum Half-Integral FlowNaveen Garg, Nikhil Kumar. [doi]
• First-Order Model-Checking in Random Graphs and Complex NetworksJan Dreier, Philipp Kuinke, Peter Rossmanith. [doi]
• Tight Approximation Algorithms for p-Mean Welfare Under Subadditive ValuationsSiddharth Barman, Umang Bhaskar, Anand Krishna, Ranjani G. Sundaram. [doi]
• Efficient Computation of 2-Covers of a StringJakub Radoszewski, Juliusz Straszynski. [doi]
• Improved Bounds for Metric Capacitated Covering ProblemsSayan Bandyapadhyay. [doi]
• Noisy, Greedy and Not so Greedy k-Means++Anup Bhattacharya, Jan Eube, Heiko Röglin, Melanie Schmidt 0001. [doi]
• The Fine-Grained Complexity of Median and Center String Problems Under Edit DistanceGary Hoppenworth, Jason W. Bentley, Daniel Gibney, Sharma V. Thankachan. [doi]
• 0.802 nFriedrich Eisenbrand, Moritz Venzin. [doi]
• An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOLFedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos. [doi]
• Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth GraphsKarolina Okrasa, Marta Piecyk, Pawel Rzazewski. [doi]
• Finding Large H-Colorable Subgraphs in Hereditary Graph ClassesMaria Chudnovsky, Jason King, Michal Pilipczuk, Pawel Rzazewski, Sophie Spirkl. [doi]
• An Efficient, Practical Algorithm and Implementation for Computing Multiplicatively Weighted Voronoi DiagramsMartin Held, Stefan de Lorenzo. [doi]
• New Bounds on Augmenting Steps of Block-Structured Integer ProgramsLin Chen 0009, Martin Koutecký, Lei Xu 0012, Weidong Shi. [doi]
• An Algorithmic Study of Fully Dynamic Independent Sets for Map LabelingSujoy Bhore, Guangping Li 0001, Martin Nöllenburg. [doi]
• Approximate Turing Kernelization for Problems Parameterized by TreewidthEva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse. [doi]
• Settling the Relationship Between Wilber's Bounds for Dynamic OptimalityVictor Lecomte, Omri Weinstein. [doi]
• Finding All Global Minimum Cuts in PracticeMonika Henzinger, Alexander Noe, Christian Schulz 0003, Darren Strash. [doi]
• Chordless Cycle Packing Is Fixed-Parameter TractableDániel Marx. [doi]
• On Compact RAC DrawingsHenry Förster, Michael Kaufmann 0001. [doi]
• Mincut Sensitivity Data Structures for the Insertion of an EdgeSurender Baswana, Shiv Kumar Gupta, Till Knollmann. [doi]
• Kernelization of Whitney SwitchesFedor V. Fomin, Petr A. Golovach. [doi]
• Exploiting c-Closure in Kernelization Algorithms for Graph ProblemsTomohiro Koana, Christian Komusiewicz, Frank Sommer. [doi]
• On the Complexity of BWT-Runs Minimization via Alphabet ReorderingJason W. Bentley, Daniel Gibney, Sharma V. Thankachan. [doi]
• Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction HierarchiesJohannes Blum 0001, Sabine Storandt. [doi]
• Generalizing CGAL Periodic Delaunay TriangulationsGeorg Osang, Mael Rouxel-Labbé, Monique Teillaud. [doi]
• A Sub-Linear Time Framework for Geometric Optimization with Outliers in High DimensionsHu Ding. [doi]