WADS 2025

WADS 2025 - Accepted Papers

• Aditya Acharya and David Mount. Evolving Distributions Under Local Motion

• Aditya Acharya, Auguste Gezalyan, Julian Vanecek and David Mount. Support Vector Machines in the Hilbert Geometry

• Ahmad Biniaz, Prosenjit Bose, Chaeyoon Chung, Jean-Lou De Carufel, John Iacono, Anil Maheshwari, Saeed Odak, Michiel Smid and Csaba Toth. Tight Bounds on the Number of Closest Pairs in Vertical Slabs

• Alexander Dobler and Martin Nöllenburg. On Minimizing Wiggle in Stacked Area Charts

• Anna Brötzner, Robert Ganian, Thekla Hamm, Fabian Klute and Irene Parada. Crossing and Independent Families among Polygons

• Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko and Ramanujan M. Sridharan. Routing Few Robots in a Crowded Network

• Emanuel Castelo, Oscar Defrain and Guilherme Gomes. Enumerating minimal dominating sets and variants in chordal bipartite graphs

• Emilio Di Giacomo, Walter Didimo, Henry Förster, Torsten Ueckerdt and Johannes Zink. Linear Layouts of Graphs with Priority Queues

• Ho-Lin Chen, Peng-Ting Lin and Meng-Tsung Tsai. Parameterized Streaming Algorithms for Topological Sorting

• Joachim Gudmundsson, Zijin Huang, André van Renssen and Sampson Wong. Spanner for the $0/1/\infty$ weighted region problem

• John Stuart, Prosenjit Bose and Jean-Lou De Carufel. Online Routing in Directed $\vec{\text{Yao}_4^\infty}$ Graphs

• Kien Huynh, Joseph Mitchell and Valentin Polishchuk. Sweeping a Domain with Line-of-Sight Between Covisible Agents

• Kilian Grage, Klaus Jansen and Björn Schumacher. Convolution and Knapsack in Higher Dimensions

• Leah Epstein and Asaf Levin. An efficient polynomial time approximation scheme for minimizing the total weighted completion time on uniformly related machines

• Leah Epstein and Asaf Levin. Lower bounds for several standard bin packing algorithms in the random order model

• Lindsey Deryckere, Joachim Gudmundsson, Yuan Sha, Sampson Wong and André van Renssen. A WSPD, Separator and Small Tree Cover for c-packed Graphs

• Lorenzo De Stefani and Vedant Gupta. On the I/O Complexity of the Cocke-Younger-Kasami Algorithm and of a Family of Related Dynamic Programming Algorithms

• Manuel Lafond and Bertrand Marchand. The Parameterized Landscape of Labeled Graph Contractions

• Mart Hagedoorn and Valentin Polishchuk. Link diameter, radius and 2-point link distance queries in polygonal domains

• Md. Billal Hossain and Benjamin Raichel. Clustering Point Sets Revisited

• Meng He and Kaiyu Wu. Succinct Data Structures for Chordal Graph with Bounded Leafage or Vertex Leafage

• Minju Song, Mook Kwon Jung and Hee-Kap Ahn. Farthest-point Voronoi Diagrams in the Hilbert Metric

• Nadia Creignou, Oscar Defrain, Frédéric Olive and Simon Vilmin. On the enumeration of signatures of XOR-CNF’s

• Nicolás Honorato-Droguett, Kazuhiro Kurita, Tesshu Hanaka and Hirotaka Ono. On the Complexity of Minimising the Moving Distance for Dispersing Objects

• Niels Grüttemeier and Klaus Heeger. Repairing Schedules by Removing Waiting Times: A Parameterized Complexity Analysis

• Niels Grüttemeier, Nils Morawietz and Frank Sommer. Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problems

• Parinya Chalermsook, Axel Kugelmann, Ly Orgo, Sumedha Uniyal and Minoo Zarsav. An Improved Guillotine Cut for Squares 

• Patrizio Angelini, Michael Bekos, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli and Giacomo Ortali. On Planar Straight-Line Dominance Drawings

• Pin-Hsian Lee, Meng-Tsung Tsai and Hung-Lung Wang. On the Complexity of Finding 1-Center Spanning Trees

• Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo Silveira and Tyler Tuttle. On geodesic disks enclosing many points

• Riccardo Dondi and Manuel Lafond. Novel Complexity Results for Temporal Separators with Deadlines

• Rogers Mathew, Fahad Panolan and Seshikanth Varma. Streaming Algorithms for Conflict-free Coloring

• Roodabeh Safavi and Martin P. Seybold. B-Treaps Revised: Write Efficient Randomized Block Search Trees with High Load

• Sayan Bandyapadhyay and Eli Mitchell. Approximation and Parameterized Algorithms for Covering with Disks of Two Types of Radii

• Sergio Cabello, Delia Garijo, Antonia Kalb, Fabian Klute, Irene Parada and Rodrigo Silveira. Algorithms for Distance Problems in Continuous Graphs

• Sergio Cabello. Testing whether a subgraph is convex or isometric

• Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista, Michael Goodrich and Martin Nöllenburg. Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms

• Tatsuya Terao. Deterministic $(2/3 - \varepsilon)$-Approximation of Matroid Intersection Using Nearly-Linear Independence-Oracle Queries

• Thijs van der Horst, Marc van Kreveld, Tim Ophelders and Bettina Speckmann. A near-linear time exact algorithm for the $L_1$-geodesic Fréchet distance between two curves on the boundary of a simple polygon

• Timothy M. Chan and Yuancheng Yu. Dynamic Streaming Algorithms for Geometric Independent Set

• Tuyen Pham and Hubert Wagner. Fast Kd-trees for the Kullback--Leibler Divergence and other Decomposable Bregman Divergences

• Vikrant Ashvinkumar, Rezaul Chowdury, Jie Gao, Mayank Goswami, Joseph Mitchell and Valentin Polishchuk. Vantage Point Selection Algorithms for Bottleneck Capacity Estimation

• Vincent Jugé. Grand-children weight-balanced binary search trees

• Vincent Pilaud and Aaron Williams. Skipping Ropes: An Efficient Gray Code Algorithm for Generating Wiggly Permutations

• Vinesh Sridhar, Michael T. Goodrich and David Eppstein. Computational Geometry with Probabilistically Noisy Primitive Operations

• Yasushi Kawase, Vinh Long Phan, Kazuhisa Makino and Hanna Sumita. Scheduling on Identical Machines with Setup Time and Unknown Execution Time

• Zachary Friggstad, Mohammad Salavatipour and Hao Sun. Approximation Algorithms for the Generalized Point-to-Point Problem

• Zachary Friggstad, Mohsen Rezapour, Mohammad Salavatipour and Hao Sun. A QPTAS for Facility Location on Unit Disk Graphs