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 |
|---|---|---|
| 2019 | Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi |
| 2019 | Splaying Preorders and Postorders. | Caleb C. Levy, Robert E. Tarjan |
| 2019 | Most Vital Segment Barriers. | Irina Kostitsyna, Maarten Lffler, Valentin Polishchuk, Frank Staals |
| 2019 | A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space. | Christopher Johnson, Haitao Wang |
| 2019 | Inventory Routing Problem with Facility Location. | Yang Jiao, R. Ravi |
| 2019 | Improved Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint. | Chien-Chung Huang, Naonori Kakimura |
| 2019 | Balanced Stable Marriage: How Close Is Close Enough? | Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi |
| 2019 | Dynamic Dictionary Matching in the Online Model. | Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat |
| 2019 | Guess Free Maximization of Submodular and Linear Sums. | Moran Feldman |
| 2019 | Online Circle Packing. | Sndor P. Fekete, Sven von Hveling, Christian Scheffer |
| 2019 | Efficient Second-Order Shape-Constrained Function Fitting. | David Durfee, Yu Gao, Anup B. Rao, Sebastian Wild |
| 2019 | Reconfiguring Undirected Paths. | Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno |
| 2019 | Maximizing Dominance in the Plane and Its Applications. | Jong Min Choi, Sergio Cabello, Hee-Kap Ahn |
| 2019 | Weighted Throughput Maximization with Calibrations. | Vincent Chau, Shengzhong Feng, Minming Li, Yinling Wang, Guochuan Zhang, Yong Zhang |
| 2019 | Kernelization of Graph Hamiltonicity: Proper H-Graphs. | Steven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman |
| 2019 | Range Closest-Pair Search in Higher Dimensions. | Timothy M. Chan, Saladi Rahul, Jie Xue |
| 2019 | Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. | Timothy M. Chan, Yakov Nekrich, Michiel H. M. Smid |
| 2019 | FRESH: Frchet Similarity with Hashing. | Matteo Ceccarello, Anne Driemel, Francesco Silvestri |
| 2019 | Online Bin Covering with Advice. | Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen |
| 2019 | Hamiltonicity for Convex Shape Delaunay and Gabriel Graphs. | Prosenjit Bose, Pilar Cano, Maria Saumell, Rodrigo I. Silveira |
| 2019 | Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. | Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid |
| 2019 | Graph Isomorphism for (H | Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson, Danil Paulusma |
| 2019 | Stackelberg Packing Games. | Toni Bhnlein, Oliver Schaudt, Joachim Schauer |
| 2019 | Parameterized Complexity of Conflict-Free Graph Coloring. | Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse |
| 2019 | On the Minimum Consistent Subset Problem. | Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel H. M. Smid |
151–175 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