Skip to content

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

WADS papers

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

YearTitleAuthors
2017Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron.Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anna Lubiw
2017Dynamic Graph Coloring.Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, Andr van Renssen, Marcel Roeloffzen, Sander Verdonschot
2017\delta -Greedy t-spanner.Gali Bar-On, Paz Carmi
2017Obedient Plane Drawings for Disk Intersection Graphs.Bahareh Banyassady, Michael Hoffmann, Boris Klemz, Maarten Lffler, Tillmann Miltzow
2017Parameterized Complexity of Geometric Covering Problems Having Conflicts.Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh
2017Effectiveness of Local Search for Art Gallery Problems.Sayan Bandyapadhyay, Aniket Basu Roy
2017The Complexity of Tree Partitioning.Zhao An, Qilong Feng, Iyad A. Kanj, Ge Xia
2017Fast Exact Algorithms for Survivable Network Design with Uniform Requirements.Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh
2017Replica Placement on Bounded Treewidth Graphs.Anshul Aggarwal, Venkatesan T. Chakaravarthy, Neelima Gupta, Yogish Sabharwal, Sachin Sharma, Sonika Thakral
2017Covering Segments with Unit Squares.Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy
2017An Improved Algorithm for Diameter-Optimally Augmenting Paths in a Metric Space.Haitao Wang
2015Positive Semidefinite Zero Forcing: Complexity and Lower Bounds.Boting Yang
2015Swapping Colored Tokens on Graphs.Katsuhisa Yamanaka, Takashi Horiyama, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
2015Computing the Center of Uncertain Points on Tree Networks.Haitao Wang, Jingru Zhang
2015Constant Time Enumeration by Amortization.Takeaki Uno
2015On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids.Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2015A Moderately Exponential Time Algorithm for k-IBDD Satisfiability.Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
2015Smoothed Analysis of Local Search Algorithms.Bodo Manthey
2015Non-preemptive Scheduling on Machines with Setup Times.Alexander Mcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sren Riechers
2015Reconfiguration on Sparse Graphs.Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2015A 2k-vertex Kernel for Maximum Internal Spanning Tree.Wenjun Li, Jianxin Wang, Jianer Chen, Yixin Cao
2015Time-Space Trade-offs for Triangulations and Voronoi Diagrams.Matias Korman, Wolfgang Mulzer, Andr van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein
2015Dynamic Set Intersection.Tsvi Kopelowitz, Seth Pettie, Ely Porat
2015Elastic Geometric Shape Matching for Point Sets under Translations.Christian Knauer, Fabian Stehn
2015Fast and Simple Connectivity in Graph Timelines.Adam Karczmarz, Jakub Lacki
226250 of 896← PreviousNext →

Comparable venues

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