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
2007	A Pseudopolynomial Time	Ajay Deshpande, Taejung Kim, Erik D. Demaine, Sanjay E. Sarma
2007	Approximate Shortest Paths Guided by a Small Index.	Jrg Derungs, Riko Jacob, Peter Widmayer
2007	An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem.	Jianer Chen, Yang Liu, Songjian Lu
2007	Improved Algorithms for the Feedback Vertex Set Problems.	Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, Yngve Villanger
2007	Approximating the Maximum Sharing Problem.	Amitabh Chaudhary, Danny Z. Chen, Rudolf Fleischer, Xiaobo Sharon Hu, Jian Li, Michael T. Niemier, Zhiyi Xie, Hong Zhu
2007	The Stackelberg Minimum Spanning Tree Game.	Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenal Joret, Stefan Langerman, Ilan Newman, Oren Weimann
2007	Simple and Space-Efficient Minimal Perfect Hash Functions.	Fabiano C. Botelho, Rasmus Pagh, Nivio Ziviani
2007	On Generalized Diamond Spanners.	Prosenjit Bose, Aaron Lee, Michiel H. M. Smid
2007	On a Family of Strong Geometric Spanners That Admit Local Routing Strategies.	Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu
2007	Steiner Tree in Planar Graphs: An	Glencora Borradaile, Philip N. Klein, Claire Mathieu
2007	The	Marcin Bienkowski, Jaroslaw Kutylowski
2007	Cauchy's Theorem and Edge Lengths of Convex Polyhedra.	Therese Biedl, Anna Lubiw, Michael J. Spriggs
2007	Optimal Algorithms for the Weighted	Binay K. Bhattacharya, Qiaosheng Shi
2007	Faster Approximation of Distances in Graphs.	Piotr Berman, Shiva Prasad Kasiviswanathan
2007	Computing the Visibility Map of Fat Objects.	Mark de Berg, Chris Gray
2007	I/O-Efficient Flow Modeling on Fat Terrains.	Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma
2007	How to Draw a Clustered Tree.	Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati
2007	Drawing Colored Graphs on Colored Points.	Melanie Badent, Emilio Di Giacomo, Giuseppe Liotta
2007	Alpha-Beta Witness Complexes.	Dominique Attali, Herbert Edelsbrunner, John Harer, Yuriy Mileyko
2007	Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric.	Mikhail J. Atallah, Marina Blanton, Michael T. Goodrich, Stanislas Polu
2007	Computing a Minimum-Depth Planar Graph Embedding in	Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani
2007	On Computing the Centroid of the Vertices of an Arrangement and Related Problems.	Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans Raj Tiwary
2007	Maximizing Maximal Angles for Plane Straight-Line Graphs.	Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Attila Pr, Francisco Santos, Bettina Speckmann, Birgit Vogtenhuber
2007	Computational and Structural Advantages of Circular Boundary Representation.	Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bert Jttler, Margot Oberneder, Zbynek Sr
2007	Kernelization Algorithms for d-Hitting Set Problems.	Faisal N. Abu-Khzam

476–500 of 896← Previous Next →

Comparable venues

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