Table of Contents

• Fully Dynamic k-Means Coreset in Near-Optimal Update TimeMax Dupré la Tour, Monika Henzinger, David Saulpic. [doi]
• Simple (Invited Talk)Eva Rotenberg. [doi]
• Scheduling with Obligatory TestsKonstantinos Dogeas, Thomas Erlebach, Ya-Chun Liang. [doi]
• Cuts in Graphs with Matroid ConstraintsAritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar 0002, Satyabrata Jana, Saket Saurabh 0001. [doi]
• Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower BoundsCornelius Brand, Martin Koutecký, Alexandra Lassota, Sebastian Ordyniak. [doi]
• Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge WeightsVikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, Hsin-Hao Su. [doi]
• From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar GraphsChandra Chekuri, Rhea Jain, Shubhang Kulkarni, Da-Wei Zheng, Weihao Zhu. [doi]
• Finding Perfect Matchings in Bridgeless Cubic Multigraphs Without Dynamic (2-)connectivityPawel Gawrychowski, Mateusz Wasylkiewicz. [doi]
• Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent SetPaloma T. Lima, Martin Milanic, Peter Mursic, Karolina Okrasa, Pawel Rzazewski, Kenny Storgel. [doi]
• The Algorithmic Power of the Greene-Kleitman TheoremShimon Kogan, Merav Parter. [doi]
• Parameterized Dynamic Data Structure for Split CompletionKonrad Majewski, Michal Pilipczuk, Anna Zych-Pawlewicz. [doi]
• Time-Efficient Quantum Entropy Estimator via SamplizerQisheng Wang, Zhicheng Zhang. [doi]
• Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth GraphsSally Dong, Guanghao Ye. [doi]
• Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUMTim Randolph 0001, Karol Wegrzycki. [doi]
• Steiner Tree Parameterized by Multiway Cut and Even LessBart M. P. Jansen, Céline M. F. Swennenhuis. [doi]
• Minimizing the Weighted Number of Tardy Jobs Is W[1]-HardKlaus Heeger, Danny Hermelin. [doi]
• Near Optimal Dual Fault Tolerant Distance OracleDipan Dey, Manoj Gupta 0002. [doi]
• A Faster Algorithm for the Fréchet Distance in 1D for the Imbalanced CaseLotte Blank, Anne Driemel. [doi]
• Graph Spanners for Group Steiner DistancesDavide Bilò, Luciano Gualà, Stefano Leucci 0001, Alessandro Straziota. [doi]
• Segment Proximity Graphs and Nearest Neighbor Queries Amid Disjoint SegmentsPankaj K. Agarwal, Haim Kaplan, Matthew J. Katz, Micha Sharir. [doi]
• Worst-Case to Expander-Case Reductions: Derandomized and GeneralizedAmir Abboud, Nathan Wallheimer. [doi]
• Euclidean Capacitated Vehicle Routing in the Random Setting: A 1.55-Approximation AlgorithmZipei Nie, Hang Zhou 0001. [doi]
• New Algorithms and Lower Bounds for Streaming TournamentsPrantar Ghosh, Sahil Kuchlous. [doi]
• Making Multicurves Cross Minimally on SurfacesLoïc Dubois. [doi]
• A Faster Algorithm for the 4-Coloring ProblemPu Wu, Huanyu Gu, Huiqin Jiang, Zehui Shao, Jin Xu 0002. [doi]
• Recent Progress on Correlation Clustering: From Local Algorithms to Better Approximation Algorithms and Back (Invited Talk)Vincent Cohen-Addad. [doi]
• Art Galleries and Mobile Guards: Revisiting O'Rourke's ProofAhmad Biniaz. [doi]
• PHOBIC: Perfect Hashing With Optimized Bucket Sizes and Interleaved CodingStefan Hermann, Hans-Peter Lehmann, Giulio Ermanno Pibiri, Peter Sanders 0001, Stefan Walzer. [doi]
• A Row Generation Algorithm for Finding Optimal Burning Sequences of Large GraphsFelipe de Carvalho Pereira, Pedro Jussieu de Rezende, Tallys H. Yunes, Luiz Fernando Batista Morato. [doi]
• List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth GraphsBaris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski. [doi]
• Scalable Distributed String SortingFlorian Kurpicz, Pascal Mehnert, Peter Sanders 0001, Matthias Schimek. [doi]
• Towards Communication-Efficient Peer-To-Peer NetworksKhalid Hourani, William K. Moses Jr., Gopal Pandurangan. [doi]
• How to Reduce Temporal Cliques to Find Sparse SpannersSebastian Angrick, Ben Bals, Tobias Friedrich 0001, Hans Gawendowicz, Niko Hastrich, Nicolas Klodt, Pascal Lenzner, Jonas Schmidt 0002, George Skretas, Armin Wells. [doi]
• Longest Common Extensions with Wildcards: Trade-Off and ApplicationsGabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya. [doi]
• Local Optimization Algorithms for Maximum Planar SubgraphGruia Calinescu, Sumedha Uniyal. [doi]
• Deterministic Minimum Steiner Cut in Maximum Flow TimeMatthew Ding 0001, Jason Li 0006. [doi]
• String 2-Covers with No Length RestrictionsItai Boneh, Shay Golan 0001, Arseny M. Shur. [doi]
• Pattern Matching with Mismatches and WildcardsGabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya. [doi]
• Online Flexible Busy Time Scheduling on Heterogeneous MachinesGruia Calinescu, Sami Davies, Samir Khuller, Shirley Zhang. [doi]
• A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded GraphsTherese Biedl, Prosenjit Bose, Karthik Murali 0001. [doi]
• On Connections Between k-Coloring and Euclidean k-MeansEnver Aman, Karthik C. S., Sharath Punna. [doi]
• Improved Algorithms for Maximum Coverage in Dynamic and Random Order StreamsAmit Chakrabarti, Andrew McGregor 0001, Anthony Wirth. [doi]
• Parameterized Complexity of MinCSP over the Point AlgebraGeorge Osipov, Marcin Pilipczuk, Magnus Wahlström. [doi]
• Solving Directed Multiway Cut Faster Than 2ⁿMingyu Xiao 0001. [doi]
• Optimizing Throughput and Makespan of Queuing Systems by Information DesignSvenja M. Griesbach, Max Klimm, Philipp Warode, Theresa Ziemke. [doi]
• Removing the log Factor from (min, +)-Products on Bounded Range Integer MatricesDvir Fried, Tsvi Kopelowitz, Ely Porat. [doi]
• Density-Sensitive Algorithms for (Δ + 1)-Edge ColoringSayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon. [doi]
• Better Diameter Algorithms for Bounded VC-Dimension Graphs and Geometric Intersection GraphsLech Duraj, Filip Konieczny, Krzysztof Potepa. [doi]
• A Textbook Solution for Dynamic StringsZsuzsanna Lipták, Francesco Masillo, Gonzalo Navarro 0001. [doi]
• Approximating Maximum-Size Properly Colored ForestsYuhang Bai, Kristóf Bérczi, Gergely Csáji, Tamás Schwarcz. [doi]
• Finding a Maximum Restricted t-Matching via Boolean Edge-CSPYuni Iwamasa, Yusuke Kobayashi 0001, Kenjiro Takazawa. [doi]
• Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree ProblemYann Disser, Svenja M. Griesbach, Max Klimm, Annette Lutz. [doi]
• Approximation Algorithms for Steiner Connectivity AugmentationDaniel Hathcock, Michael Zlatin. [doi]
• Improved Space-Efficient Approximate Nearest Neighbor Search Using Function InversionSamuel McCauley. [doi]
• Improved Space Bounds for Subset SumTatiana Belova, Nikolai Chukhin, Alexander S. Kulikov, Ivan Mihajlin. [doi]
• Practical Expander DecompositionLars Gottesbüren, Nikos Parotsidis, Maximilian Probst Gutenberg. [doi]
• Many-To-Many Polygon Matching à La JaccardAlexander Naumann, Annika Bonerath, Jan-Henrik Haunert. [doi]
• Edge-Coloring Sparse Graphs with Δ Colors in Quasilinear TimeLukasz Kowalik. [doi]
• Laminar Matroid Secretary: Greedy Strikes BackZhiyi Huang 0002, Zahra Parsaeian, Zixuan Zhu. [doi]
• Fractional Linear Matroid Matching Is in Quasi-NCRohit Gurjar, Taihei Oki, Roshan Raj. [doi]
• Outlier Robust Multivariate Polynomial RegressionVipul Arora 0002, Arnab Bhattacharyya 0001, Mathews Boban, Venkatesan Guruswami, Esty Kelman. [doi]
• Parameterized Algorithms for Node Connectivity Augmentation ProblemsZeev Nutov. [doi]
• A Euclidean Embedding for Computing Persistent Homology with Gaussian KernelsJean-Daniel Boissonnat, Kunal Dutta. [doi]
• A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity OraclesKaito Harada, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa. [doi]
• Invertible Bloom Lookup Tables with Less Memory and RandomnessNils Fleischhacker, Kasper Green Larsen, Maciej Obremski, Mark Simkin 0001. [doi]
• Approximation Algorithms for Hop Constrained and Buy-At-Bulk Network Design via Hop Constrained Oblivious RoutingChandra Chekuri, Rhea Jain. [doi]
• Engineering Edge Orientation AlgorithmsHenrik Reinstädtler, Christian Schulz 0003, Bora Uçar. [doi]
• Parameterized Approximation for Maximum Weight Independent Set of Rectangles and SegmentsJana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki. [doi]
• Toward Self-Adjusting k-Ary Search Tree NetworksEvgeniy Feder, Anton Paramonov, Pavel Mavrin, Iosif Salem, Vitaly Aksenov, Stefan Schmid 0001. [doi]
• A Lower Bound for Local Search Proportional Approval VotingSonja Kraiczy, Edith Elkind. [doi]
• Exact Minimum Weight Spanners via Column GenerationFritz Bökler, Markus Chimani, Henning Jasper, Mirko H. Wagner. [doi]
• Hitting Meets Packing: How Hard Can It Be?Jacob Focke, Fabian Frei, Shaohua Li 0005, Dániel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki. [doi]
• Competitive Capacitated Online RecoloringRajmohan Rajaraman, Omer Wasim. [doi]
• Shortest Path Separators in Unit Disk GraphsElfarouk Harb, Zhengcheng Huang, Da-Wei Zheng. [doi]
• A (5/3+ε)-Approximation for Tricolored Non-Crossing Euclidean TSPJúlia Baligács, Yann Disser, Andreas Emil Feldmann, Anna Zych-Pawlewicz. [doi]
• A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQsKou Hamada, Sankardeep Chakraborty, Seungbum Jo, Takuto Koriyama, Kunihiko Sadakane, Srinivasa Rao Satti. [doi]
• Locally Computing Edge OrientationsSlobodan Mitrovic, Ronitt Rubinfeld, Mihir Singhal. [doi]
• Lower Envelopes of Surface Patches in 3-SpacePankaj K. Agarwal, Esther Ezra, Micha Sharir. [doi]
• SubModST: A Fast Generic Solver for Submodular Maximization with Size ConstraintsHenning Martin Woydt, Christian Komusiewicz, Frank Sommer. [doi]
• Parameterized Quantum Query Algorithms for Graph ProblemsTatsuya Terao, Ryuhei Mori. [doi]
• Hypergraph Connectivity Augmentation in Strongly Polynomial TimeKristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni. [doi]
• A Simple Deterministic Near-Linear Time Approximation Scheme for Transshipment with Arbitrary Positive Edge CostsEmily Fox. [doi]
• Longest Common Substring with Gaps and Related ProblemsAranya Banerjee, Daniel Gibney, Sharma V. Thankachan. [doi]
• Bicriteria Approximation for Minimum Dilation Graph AugmentationKevin Buchin, Maike Buchin, Joachim Gudmundsson, Sampson Wong. [doi]
• Achieving Envy-Freeness Through Items SaleVittorio Bilò, Evangelos Markakis, Cosimo Vinci. [doi]
• The Last Success Problem with SamplesToru Yoshinaga, Yasushi Kawase. [doi]
• On Finding Longest Palindromic Subsequences Using Longest Common SubsequencesGerth Stølting Brodal, Rolf Fagerberg, Casper Moldrup Rysgaard. [doi]
• Interval Selection in Sliding WindowsCezar-Mihail Alexandru, Christian Konrad 0001. [doi]
• Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and BalancingKarl Bringmann, Anita Dürr, Adam Polak 0001. [doi]
• Insights into (k, ρ)-Shortcutting AlgorithmsAlexander Leonhardt, Ulrich Meyer 0001, Manuel Penschuck. [doi]
• Online Sorting and Online TSP: Randomized, Stochastic, and High-DimensionalMikkel Abrahamsen, Ioana O. Bercea, Lorenzo Beretta 0001, Jonas Klausen, László Kozma 0002. [doi]
• Semi-Streaming Algorithms for Weighted k-Disjoint MatchingsS. M. Ferdous, Bhargav Samineni, Alex Pothen, Mahantesh Halappanavar, Bala Krishnamoorthy. [doi]
• Near-Linear Algorithms for Visibility Graphs over a 1.5-Dimensional TerrainMatthew J. Katz, Rachel Saban, Micha Sharir. [doi]
• Re²Pair: Increasing the Scalability of RePair by Decreasing Memory UsageJustin Kim, Rahul Varki, Marco Oliva, Christina Boucher 0001. [doi]
• From Donkeys to Kings in TournamentsAmir Abboud, Tomer Grossman, Moni Naor, Tomer Solomon. [doi]
• Dynamic Embeddings of Dynamic Single-Source Upward Planar GraphsIvor van der Hoog, Irene Parada, Eva Rotenberg. [doi]
• Improved Approximations for Flexible Network DesignDylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanità. [doi]
• Height-Bounded Lempel-Ziv EncodingsHideo Bannai, Mitsuru Funakoshi, Diptarama Hendrian, Myuji Matsuda, Simon J. Puglisi. [doi]
• Local Max-Cut on Sparse GraphsGregory Schwartzman. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Giving Some Slack: Shortcuts and Transitive Closure CompressionsShimon Kogan, Merav Parter. [doi]
• Connectivity Oracles for Predictable Vertex FailuresBingbing Hu, Evangelos Kosinas, Adam Polak 0001. [doi]
• An Optimal Randomized Algorithm for Finding the SaddlepointJustin Dallant, Frederik Haagensen, Riko Jacob, László Kozma 0002, Sebastian Wild. [doi]
• Sparse Outerstring Graphs Have Logarithmic TreewidthShinwoo An, Eunjin Oh 0001, Jie Xue 0003. [doi]
• Exploring the Approximability Landscape of 3SUMKarl Bringmann, Ahmed Ghazy, Marvin Künnemann. [doi]
• Random-Order Online Independent Set of Intervals and HyperrectanglesMohit Garg 0003, Debajyoti Kar, Arindam Khan 0001. [doi]