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
2011	Multicut in Trees Viewed through the Eyes of Vertex Cover.	Jianer Chen, Jia-Hao Fan, Iyad A. Kanj, Yang Liu, Fenghui Zhang
2011	Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions.	Timothy M. Chan, Vinayak Pathak
2011	Connecting a Set of Circles with Minimum Sum of Radii.	Erin W. Chambers, Sndor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Srinivasan Venkatesh, Ulrike Stege, Sue Whitesides
2011	Register Loading via Linear Programming.	Gruia Calinescu, Minming Li
2011	Adjacency-Preserving Spatial Treemaps.	Kevin Buchin, David Eppstein, Maarten Lffler, Martin Nllenburg, Rodrigo I. Silveira
2011	Frequency Capping in Online Advertising.	Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor
2011	Path Minima Queries in Dynamic Weighted Trees.	Gerth Stlting Brodal, Pooya Davoodi, S. Srinivasa Rao
2011	Switching to Directional Antennas with Constant Increase in Radius and Hop Distance.	Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Y. Flatland, Matthew J. Katz, Anil Maheshwari
2011	Feedback Vertex Set in Mixed Graphs.	Paul S. Bonsma, Daniel Lokshtanov
2011	Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals.	Markus Blser, Bodo Manthey, B. V. Raghavendra Rao
2011	Orthogonal Cartograms with Few Corners Per Face.	Therese Biedl, Lesvia Elena Ruiz Velzquez
2011	Faster Optimal Algorithms for Segment Minimization with Small Maximal Value.	Therese Biedl, Stephane Durocher, Cline Engelbeen, Samuel Fiorini, Maxwell Young
2011	On Rectilinear Partitions with Minimum Stabbing Number.	Mark de Berg, Amirali Khosravi, Sander Verdonschot, Vincent van der Weele
2011	Witness Rectangle Graphs.	Boris Aronov, Muriel Dulieu, Ferran Hurtado
2011	How to Cover a Point Set with a V-Shape of Minimum Width.	Boris Aronov, Muriel Dulieu
2011	Convex Transversals.	Esther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf, Shang Yang
2011	Multi-target Ray Searching Problems.	Spyros Angelopoulos, Alejandro Lpez-Ortiz, Konstantinos Panagiotou
2011	On the Area Requirements of Euclidean Minimum Spanning Trees.	Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella
2011	A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs.	Abhijin Adiga, Jasine Babu, L. Sunil Chandran
2011	Piecewise-Linear Approximations of Uncertain Functions.	Mohammad Ali Abam, Mark de Berg, Amirali Khosravi
2009	Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs.	Chenyu Yan, Yang Xiang, Feodor F. Dragan
2009	Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees.	Hiroaki Yamamoto, Daichi Takenouchi
2009	On Making Directed Graphs Transitive.	Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
2009	Resolving Loads with Positive Interior Stresses.	Gnter Rote, Andr Schulz
2009	Integer Programming: Optimization and Evaluation Are Equivalent.	James B. Orlin, Abraham P. Punnen, Andreas S. Schulz

376–400 of 896← Previous Next →

Comparable venues

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