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
2001	Deciding Clique-Width for Graphs of Bounded Tree-Width.	Wolfgang Espelage, Frank Gurski, Egon Wanke
2001	Approximating Multi-objective Knapsack Problems.	Thomas Erlebach, Hans Kellerer, Ulrich Pferschy
2001	Small Maximal Independent Sets and Faster Exact Graph Coloring.	David Eppstein
2001	An Approach for Mixed Upward Planarization.	Markus Eiglsperger, Michael Kaufmann
2001	Partitioning Colored Point Sets into Monochromatic Parts.	Adrian Dumitrescu, Jnos Pach
2001	Practical Approximation Algorithms for Separable Packing Linear Programs.	Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky
2001	Upward Embeddings and Orientations of Undirected Planar Graphs.	Walter Didimo, Maurizio Pizzonia
2001	Competitive Analysis of the LRFU Paging Algorithm.	Edith Cohen, Haim Kaplan, Uri Zwick
2001	Computing Phylogenetic Roots with Bounded Degrees and Errors.	Zhi-Zhong Chen, Tao Jiang, Guo-Hui Lin
2001	On the Complexity of Scheduling Conditional Real-Time Code.	Samarjit Chakraborty, Thomas Erlebach, Lothar Thiele
2001	Visual Ranking of Link Structures.	Ulrik Brandes, Sabine Cornelsen
2001	The Grid Placement Problem.	Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison
2001	Admission Control to Minimize Rejections.	Avrim Blum, Adam Kalai, Jon M. Kleinberg
2001	Fast Boolean Matrix Multiplication for Highly Clustered Data.	Andreas Bjrklund, Andrzej Lingas
2001	Optimal Algorithms for Two-Guard Walkability of Simple Polygons.	Binay K. Bhattacharya, Asish Mukhopadhyay, Giri Narasimhan
2001	Optimization over Zonotopes and Training Support Vector Machines.	Marshall W. Bern, David Eppstein
2001	Optimal Mbius Transformations for Information Visualization and Meshing.	Marshall W. Bern, David Eppstein
2001	Seller-Focused Algorithms for Online Auctioning.	Amitabha Bagchi, Amitabh Chaudhary, Rahul Garg, Michael T. Goodrich, Vijay Kumar
2001	A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study.	David A. Bader, Bernard M. E. Moret, Mi Yan
2001	Secure Multi-party Computational Geometry.	Mikhail J. Atallah, Wenliang Du
2001	On the Reflexivity of Point Sets.	Esther M. Arkin, Sndor P. Fekete, Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy, Vera Sacristn, Saurabh Sethia
2001	When Can You Fold a Map?	Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena
2001	On External-Memory Planar Depth First Search.	Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh
2001	Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions.	Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold
2001	Time Responsive External Data Structures for Moving Points.	Pankaj K. Agarwal, Lars Arge, Jan Vahrenhold

601–625 of 896← Previous Next →

Comparable venues

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