Algorithms and Data Structures Symposium (was Workshop on Algorithms and Data Structures)

WADS

CORE rank

CORE rank (raw)

Fields of research

Theory of Computation

Papers indexed

896

1989–2025

Best Theory of Computation conferences

Papers per year

198961 peak2025

Most published authors

WADS papers

896 records sourced from DBLP. Search titles, filter by year, sort by recency.

Year	Title	Authors
2021	Computing the Frchet Distance Between Uncertain Curves in One Dimension.	Kevin Buchin, Maarten Lffler, Tim Ophelders, Aleksandr Popov, Jrme Urhausen, Kevin Verbeek
2021	Computing Weighted Subset Transversals in H-Free Graphs.	Nick Brettell, Matthew Johnson, Danil Paulusma
2021	Routing on Heavy-Path WSPD-Spanners.	Prosenjit Bose, Tyler Tuttle
2021	Improved Bounds on the Spanning Ratio of the Theta-5-Graph.	Prosenjit Bose, Darryl Hill, Aurlien Ooms
2021	Solving Problems on Generalized Convex Graphs via Mim-Width.	Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Danil Paulusma
2021	Euclidean Maximum Matchings in the Plane - Local to Global.	Ahmad Biniaz, Anil Maheshwari, Michiel Smid
2021	Incomplete Directed Perfect Phylogeny in Linear Time.	Giulia Bernardini, Paola Bonizzoni, Pawel Gawrychowski
2021	The Neighborhood Polynomial of Chordal Graphs.	Helena Bergold, Winfried Hochstttler, Uwe Mayer
2021	Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations.	Ioana O. Bercea, Guy Even
2021	A 4-Approximation of the $\frac{2\pi }{3}$-MST.	Stav Ashur, Matthew J. Katz
2021	Generalized Disk Graphs.	var Marrow Arnrsson, Steven Chaplick, Jkull Snr Gylfason, Magns M. Halldrsson, Jkull Mni Reynisson, Tigran Tonoyan
2021	An APTAS for Bin Packing with Clique-Graph Conflicts.	Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
2021	HalftimeHash: Modern Hashing Without 64-Bit Multipliers or Finite Fields.	Jim Apple
2021	On Minimum Generalized Manhattan Connections.	Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nlke, Nidia Obscura Acosta, Joachim Spoerhase
2021	Reachability Problems for Transmission Graphs.	Shinwoo An, Eunjin Oh
2021	Pattern Matching in Doubling Spaces.	Corentin Allair, Antoine Vigneron
2021	Online Makespan Minimization with Budgeted Uncertainty.	Susanne Albers, Maximilian Janke
2021	Scheduling with Testing on Multiple Identical Parallel Machines.	Susanne Albers, Alexander Eckl
2021	The Minimum Moving Spanning Tree Problem.	Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Lus Fernando Schultz Xavier da Silveira, Michiel Smid
2021	On the Spanning and Routing Ratios of the Directed $\varTheta _6$-Graph.	Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose
2019	Zip Trees.	Robert E. Tarjan, Caleb C. Levy, Stephen Timmel
2019	Approximating Robust Bin Packing with Budgeted Uncertainty.	Aniket Basu Roy, Marin Bougeret, Noam Goldberg, Michael Poss
2019	Optimal Offline Dynamic 2, 3-Edge/Vertex Connectivity.	Richard Peng, Bryce Sandlund, Daniel Dominic Sleator
2019	Discrete Morse Theory for Computing Zigzag Persistence.	Clment Maria, Hannah Schreiber
2019	Extending Upward Planar Graph Drawings.	Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati

126–150 of 896← Previous Next →

Comparable venues

Other A*/A conferences filed under the same field of research.