default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19th WADS 2025: Toronto, ON, Canada
- Pat Morin
, Eunjin Oh:
19th International Symposium on Algorithms and Data Structures, WADS 2025, August 11-15, 2025, York University, Toronto, Canada. LIPIcs 349, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2025, ISBN 978-3-95977-398-0 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xviii
- Prosenjit Bose:
Constructing and Routing on Geometric Spanners (Invited Talk). 1:1-1:1 - Hsien-Chih Chang:
Unintuitive Facts About Distances on Planar Graphs (Invited Talk). 2:1-2:1 - Aditya Acharya, Auguste H. Gezalyan, Julian Vanecek, David M. Mount, Sunil Arya:
Support Vector Machines in the Hilbert Geometry. 3:1-3:20 - Aditya Acharya, David M. Mount:
Evolving Distributions Under Local Motion. 4:1-4:20 - Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli, Giacomo Ortali:
On Planar Straight-Line Dominance Drawings. 5:1-5:18 - Vikrant Ashvinkumar, Rezaul Chowdhury, Jie Gao, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk:
Vantage Point Selection Algorithms for Bottleneck Capacity Estimation. 6:1-6:19 - Sayan Bandyapadhyay, Elijah Mitchell:
Approximation and Parameterized Algorithms for Covering with Disks of Two Types of Radii. 7:1-7:14 - Ahmad Biniaz, Prosenjit Bose, Chaeyoon Chung, Jean-Lou De Carufel, John Iacono, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth:
Tight Bounds on the Number of Closest Pairs in Vertical Slabs. 8:1-8:14 - Prosenjit Bose, Jean-Lou De Carufel, John Stuart:
Online Routing in Directed Yao₄^∞ Graphs. 9:1-9:22 - Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo I. Silveira, Tyler Tuttle:
On Geodesic Disks Enclosing Many Points. 10:1-10:20 - Anna Brötzner, Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada:
Crossing and Independent Families Among Polygons. 11:1-11:15 - Sergio Cabello:
Testing Whether a Subgraph Is Convex or Isometric. 12:1-12:16 - Sergio Cabello, Delia Garijo, Antonia Kalb, Fabian Klute, Irene Parada, Rodrigo I. Silveira:
Algorithms for Distance Problems in Continuous Graphs. 13:1-13:14 - Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista, Michael T. Goodrich, Martin Nöllenburg:
Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms. 14:1-14:22 - Emanuel Elias Silva Castelo, Oscar Defrain, Guilherme C. M. Gomes:
Enumerating Minimal Dominating Sets and Variants in Chordal Bipartite Graphs. 15:1-15:15 - Parinya Chalermsook, Axel Kugelmann, Ly Orgo, Sumedha Uniyal, Minoo Zarsav:
An Improved Guillotine Cut for Squares. 16:1-16:19 - Timothy M. Chan, Yuancheng Yu:
Dynamic Streaming Algorithms for Geometric Independent Set. 17:1-17:12 - Ho-Lin Chen, Peng-Ting Lin, Meng-Tsung Tsai:
Parameterized Streaming Algorithms for Topological Sorting. 18:1-18:20 - Nadia Creignou, Oscar Defrain, Frédéric Olive, Simon Vilmin:
On the Enumeration of Signatures of XOR-CNF's. 19:1-19:14 - Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko, M. S. Ramanujan:
Routing Few Robots in a Crowded Network. 20:1-20:15 - Lindsey Deryckere, Joachim Gudmundsson, André van Renssen, Yuan Sha, Sampson Wong:
A WSPD, Separator and Small Tree Cover for c-Packed Graphs. 21:1-21:15 - Alexander Dobler, Martin Nöllenburg:
On Minimizing Wiggle in Stacked Area Charts. 22:1-22:14 - Riccardo Dondi, Manuel Lafond:
Novel Complexity Results for Temporal Separators with Deadlines. 23:1-23:14 - David Eppstein, Michael T. Goodrich, Vinesh Sridhar:
Computational Geometry with Probabilistically Noisy Primitive Operations. 24:1-24:20 - Leah Epstein, Asaf Levin:
An Efficient Polynomial Time Approximation Scheme for Minimizing the Total Weighted Completion Time on Uniformly Related Machines. 25:1-25:21 - Leah Epstein, Asaf Levin:
Lower Bounds for Several Standard Bin Packing Algorithms in the Random Order Model. 26:1-26:15 - Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, Hao Sun:
A QPTAS for Facility Location on Unit Disk Graphs. 27:1-27:18 - Zachary Friggstad, Mohammad R. Salavatipour, Hao Sun:
Approximation Algorithms for the Generalized Point-To-Point Problem. 28:1-28:16 - Emilio Di Giacomo, Walter Didimo, Henry Förster, Torsten Ueckerdt, Johannes Zink:
Linear Layouts of Graphs with Priority Queues. 29:1-29:17 - Kilian Grage, Klaus Jansen, Björn Schumacher:
Convolution and Knapsack in Higher Dimensions. 30:1-30:16 - Niels Grüttemeier, Klaus Heeger:
Repairing Schedules by Removing Waiting Times: A Parameterized Complexity Analysis. 31:1-31:14 - Niels Grüttemeier, Nils Morawietz, Frank Sommer:
Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problems. 32:1-32:20 - Joachim Gudmundsson, Zijin Huang, André van Renssen, Sampson Wong:
Spanner for the 0/1/∞ Weighted Region Problem. 33:1-33:15 - Mart Hagedoorn, Valentin Polishchuk:
Link Diameter, Radius and 2-Point Link Distance Queries in Polygonal Domains. 34:1-34:15 - Meng He, Kaiyu Wu:
Succinct Data Structures for Chordal Graph with Bounded Leafage or Vertex Leafage. 35:1-35:23 - Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono:
On the Complexity of Minimising the Moving Distance for Dispersing Objects. 36:1-36:14 - Thijs van der Horst, Marc J. van Kreveld, Tim Ophelders, Bettina Speckmann:
A Near-Linear Time Exact Algorithm for the L₁-Geodesic Fréchet Distance Between Two Curves on the Boundary of a Simple Polygon. 37:1-37:13 - Md. Billal Hossain, Benjamin Raichel:
Clustering Point Sets Revisited. 38:1-38:16 - Kien C. Huynh, Joseph S. B. Mitchell, Valentin Polishchuk:
Sweeping a Domain with Line-Of-Sight Between Covisible Agents. 39:1-39:22 - Vincent Jugé:
Grandchildren-Weight-Balanced Binary Search Trees. 40:1-40:19 - Yasushi Kawase, Kazuhisa Makino, Vinh Long Phan, Hanna Sumita:
Scheduling on Identical Machines with Setup Time and Unknown Execution Time. 41:1-41:16 - Manuel Lafond, Bertrand Marchand:
The Parameterized Landscape of Labeled Graph Contractions. 42:1-42:23 - Pin-Hsian Lee, Meng-Tsung Tsai, Hung-Lung Wang:
On the Complexity of Finding 1-Center Spanning Trees. 43:1-43:19 - Rogers Mathew, Fahad Panolan, Seshikanth:
Streaming Algorithms for Conflict-Free Coloring. 44:1-44:18 - Tuyen Pham, Hubert Wagner:
Fast Kd-Trees for the Kullback-Leibler Divergence and Other Decomposable Bregman Divergences. 45:1-45:19 - Vincent Pilaud, Aaron Williams:
Skipping Ropes: An Efficient Gray Code Algorithm for Generating Wiggly Permutations. 46:1-46:20 - Roodabeh Safavi, Martin P. Seybold:
B-Treaps Revised: Write Efficient Randomized Block Search Trees with High Load. 47:1-47:23 - Minju Song, Mook Kwon Jung, Hee-Kap Ahn:
Farthest-Point Voronoi Diagrams in the Hilbert Metric. 48:1-48:15 - Lorenzo De Stefani, Vedant Gupta:
On the I/O Complexity of the Cocke-Younger-Kasami Algorithm and of a Family of Related Dynamic Programming Algorithms. 49:1-49:24 - Tatsuya Terao:
Deterministic (2/3 - ε)-Approximation of Matroid Intersection Using Nearly-Linear Independence-Oracle Queries. 50:1-50:18
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-09-27 19:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
