Accepted Papers

  • Aditya Acharya, Auguste Gezalyan and David Mount. Classifiers in High Dimensional Hilbert Metrics
  • Alma Arevalo Loyola, Ahmad Biniaz and Prosenjit Bose. Polychromatic 2-colorings with Bounded Discrepancy for Triangulations
  • Divya Bajaj, Bin Fu, Ryan Knobel, Austin Luchsinger, Aiden Massie, Pablo Santos, Ramiro Santos, Robert Schweller, Evan Tomai and Tim Wylie. Reachability with Restricted Reactions in Inhibitory Chemical Reaction Networks
  • J\'falia Balig\'e1cs, Yann Disser and Linda Thelen. Improved Bounds for Online TSP on the Half-Line
  • Robert Barish and Tetsuo Shibuya. Arranging pairwise disjoint shapes to partition point sets
  • Michael A. Bekos, Eleni Katsanou, Philipp Kindermann and Maria Eleni Pavlidi. How Many Slopes Does Polynomial Area Cost?
  • Kimon Boehmer. Submodular Max-Min Allocation under Identical Valuations
  • Édouard Bonnet, Jadwiga Czyżewska, Tomáš Masařík, Marcin Pilipczuk and Paweł Rzążewski. QPTAS for MWIS and finding large sparse induced subgraphs in graphs with few independent long holes
  • Nicolas Bousquet, Frank Connor, Remy El Sabeh, Louis-Roy Langevin, Amer E. Mouawad, Naomi Nishimura and Agnes Totschnig. Robotic arm rotation: Standing up is harder than you think
  • Anna Brötzner, Bengt J. Nilsson and Christiane Schmidt. Improved Approximation of Two Watchmen’s Routes in Simple Polygons
  • Tiziana Calamoneri, Pierre Gaillard, Giacomo Paesani and Giuseppe Perelli. Strategy Repair in Reachability Games via a Graph Quotientation
  • Panagiotis Charalampopoulos, Manal Mohamed, Solon Pissis, Hilde Verbeek and Wiktor Zuba. Faster Algorithms for Unique or Absent Substrings
  • Jaehoon Chung. Orthogonal Strip Partitioning of Polygons: Lattice-Theoretic Algorithms and Lower Bounds
  • Avinandan Das. One Color Makes All the Difference in the Tractability of Partial Coloring in Semi-Streaming
  • Minati De, Satyam Singh and Csaba Tóth. Online Hitting Set for Axis-Aligned Squares
  • Mark de Berg, Prosenjit Bose and Leonidas Theocharous. On the Doubling Dimension and the Perimeter of Geodesically Convex Sets in Fat Polygons
  • Ronald Deng, Samuel McCauley, Aidin Niaparast, Helia Niaparast, Bennett Ptak, Shirel Quintanilla, Shikha Singh and Nathan Vosburg. Incremental Strongly Connected Components with Predictions
  • Nicole Funk, Annika Hennes, Johanna Hillebrand and Sarah Sturm. Constant-Factor Approximations for Doubly Constrained Fair k-Center, k-Median and k-Means
  • Jie Gao, Pawel Gawrychowski, Panos Giannopoulos, Wolfgang Mulzer, Satyam Singh, Frank Staals and Meirav Zehavi. Near-Linear and Parameterized Approximations for Maximum Cliques in Disk Graphs
  • Manoj Gupta, Shahbaz Khan and Madhu Surendra. Dynamic MIS Revisited: Incremental, Fault Tolerant and Fully Dynamic
  • Bart M. P. Jansen and Ruben F.A. Verhaegh. Search-space Reduction for Boolean MinCSPs via Essential Constraints
  • Seungbum Jo and Dominik Köppl. Indexing Range Maximum-Sum Segment Queries with Offsets
  • Konstanty Junosza-Szaniawski, Antonio Lauerbach, Marie Diana Sieper and Alexander Wolff. The Parameterized Complexity of Coloring Mixed Graphs
  • Chirag Kaudan and Amir Nayyeri. Cutwidth versus BFS-Width with Applications to Graph Reconstruction from Distance Queries
  • Dušan Knop, Nikolaos Melissinos and Manolis Vasilakis. Parameterized Critical Node Cut Revisited
  • Pankaj Kumar, Haiku Muller, Sebastian Ordyniak and Melanie Schmidt. On the Parameterized Complexity of Min-Sum-Radii
  • Suruchi Kushwaha and Yakov Nekrich. New Results on Three-Sided Skyline Range Counting and Reporting
  • Jaegun Lee, Chaeyoon Chung and Hee-Kap Ahn. Bichromatic Classifications of Points using Strips
  • Michael Levet. Parallel Algorithms for Group Isomorphism via Code Equivalence
  • Young-San Lin and Alexander Turoczy. Improved and Parameterized Algorithms for Online Multi-level Aggregation: A Memory-based Approach
  • Anand Louis and Kirtan Vora. Semirandom Planted Bipartite Subgraphs
  • Michal Moiseev, Omrit Filtser and Tzalik Maimon. On Fréchet Traveling Salesmen Problems
  • Kengo Nakamura and Masaaki Nishino. Linear-Time Exact Computation of Influence Spread on Bounded-Pathwidth Graphs
  • Ofer Neiman and Alon Spector. Path-Reporting Distance Oracles for Vertex-Labeled Graphs
  • Seongbin Park and Eunjin Oh. Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
  • Ovidiu Rață. Faster Linear-Space Data Structures for Path Frequency Queries
  • Indu Ramesh, Boris Aronov, Mayank Goswami and John Iacono. On the Fragile Complexity of Geometric Algorithms
  • Liam Roditty and Plia Trabelsi. New algorithms for girth and cycle detection
  • Tatsuya Terao. Faster Approximate Linear Matroid Intersection
  • Anastasiia Tkachenko and Haitao Wang. Maximum Independent Sets in Disk Graphs with Disks in Convex Position