Algorithms and Data Structures Symposium (was Workshop on Algorithms and Data Structures)
WADS
B
CORE rank
CORE rank (raw)
B
Fields of research
Theory of Computation
Papers indexed
896
1989–2025
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 |
|---|---|---|
| 2013 | Finding the Minimum-Weight k-Path. | Avinatan Hassidim, Orgad Keller, Moshe Lewenstein, Liam Roditty |
| 2013 | Hierarchies of Predominantly Connected Communities. | Michael Hamann, Tanja Hartmann, Dorothea Wagner |
| 2013 | Planar Packing of Binary Trees. | Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tth |
| 2013 | Universal Point Sets for Planar Three-Trees. | Radoslav Fulek, Csaba D. Tth |
| 2013 | Approximation Algorithms for B 1-EPG Graphs. | Dror Epstein, Martin Charles Golumbic, Gila Morgenstern |
| 2013 | Combinatorial Pair Testing: Distinguishing Workers from Slackers. | David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg |
| 2013 | A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs. | Zdenek Dvork, Vojtech Tuma |
| 2013 | Plane 3-trees: Embeddability and Approximation - (Extended Abstract). | Stephane Durocher, Debajyoti Mondal |
| 2013 | Blame Trees. | Erik D. Demaine, Pavel Panchekha, David A. Wilson, Edward Z. Yang |
| 2013 | Optimal Time-Convex Hull under the L p Metrics. | Bang-Sin Dai, Mong-Jen Kao, D. T. Lee |
| 2013 | Lift-and-Project Methods for Set Cover and Knapsack. | Eden Chlamtc, Zachary Friggstad, Konstantinos Georgiou |
| 2013 | Visibility and Ray Shooting Queries in Polygonal Domains. | Danny Z. Chen, Haitao Wang |
| 2013 | Treewidth and Pathwidth Parameterized by the Vertex Cover Number. | Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger |
| 2013 | The Art of Shaving Logs. | Timothy M. Chan |
| 2013 | Trajectory Grouping Structure. | Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Bettina Speckmann, Frank Staals |
| 2013 | On Explaining Integer Vectors by Few Homogenous Segments. | Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Such |
| 2013 | Relative Interval Analysis of Paging Algorithms on Access Graphs. | Joan Boyar, Sushmita Gupta, Kim S. Larsen |
| 2013 | On the Spanning Ratio of Theta-Graphs. | Prosenjit Bose, Andr van Renssen, Sander Verdonschot |
| 2013 | Interval Selection with Machine-Dependent Intervals. | Katerina Bhmov, Yann Disser, Mats Mihalk, Peter Widmayer |
| 2013 | Beacon-Based Algorithms for Geometric Routing. | Michael Biro, Justin Iwerks, Irina Kostitsyna, Joseph S. B. Mitchell |
| 2013 | Fingerprints in Compressed Strings. | Philip Bille, Patrick Hagge Cording, Inge Li Grtz, Benjamin Sach, Hjalte Wedel Vildhj, Sren Vind |
| 2013 | Online Control Message Aggregation in Chain Networks. | Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Lukasz Jez, Jir Sgall, Grzegorz Stachowiak |
| 2013 | Better Space Bounds for Parameterized Range Majority and Minority. | Djamal Belazzougui, Travis Gagie, Gonzalo Navarro |
| 2013 | Neighborhood-Preserving Mapping between Trees. | Jan Baumbach, Jiong Guo, Rashid Ibragimov |
| 2013 | On the Stretch Factor of the Theta-4 Graph. | Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Andr van Renssen, Sander Verdonschot |
301–325 of 896← PreviousNext →
Comparable venues
Other A*/A conferences filed under the same field of research.
- A*SODAACM/SIAM Symposium on Discrete Algorithms
- A*ICALPInternational Colloquium on Automata Languages and Programming
- A*STOCACM Symposium on Theory of Computing
- A*FOCSIEEE Symposium on Foundations of Computer Science
- AESAEuropean Symposium on Algorithms
- ASTACSInternational Symposium on Theoretical Aspects of Computer Science
- A*LICSIEEE Symposium on Logic in Computer Science
- AGDGraph Drawing