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
1999Rectilinear Static and Dynamic Discrete 2-center Problems.Sergei Bespamyatnikh, Michael Segal
1999Optimal Facility Location under Various Distance Functions.Sergei Bespamyatnikh, Klara Kedem, Michael Segal
1999The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout.Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Alexander Zelikovsky
1999Representing Trees of Higer Degree.David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman
1999Performance Guarantees for the TSP with a Parameterized Triangle Inequality.Michael A. Bender, Chandra Chekuri
19992-Point Site Voronoi Diagrams.Gill Barequet, Matthew Dickerson, Robert L. (Scot) Drysdale III
1999Optimizing Constrained Offset and Scaled Polygonal Annuli.Gill Barequet, Prosenjit Bose, Matthew Dickerson
1999The Lazy Bureaucrat Scheduling Problem.Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena
1999Optimization over k-set Polytopes and Efficient k-set Enumeration.Artur Andrzejak, Komei Fukuda
1999Indexing and Dictionary Matching with One Error.Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh
1997A Linear-Time Algorithm for the 1-Mismatch Problem.Nikola Stojanovic, Piotr Berman, Deborah Gumucio, Ross C. Hardison, Webb Miller
1997On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement Problem.Farhad Shahrokhi, Ondrej Skora, Lszl A. Szkely, Imrich Vrto
1997Randomized Algorithms for that Ancient Scheduling Problem.Steven S. Seiden
1997Geometric Applications Of Posets.Michael Segal, Klara Kedem
1997An Approximation Algorithm for Stacking up Bins from a Conveyor onto Pallets.Jochen Rethmann, Egon Wanke
1997A Centroid Labeling Technique and its Application to Path Selection in Trees (Extended Abstract).Sarnath Ramnath, Hong Shen
1997Orthogonal Drawing of High Degree Graphs with Small Area and Few Bends.Achilleas Papakostas, Ioannis G. Tollis
1997New TSP Construction Heuristics and Their Relationships to the 2-Opt.Hiroyuki Okano, Shinji Misono, Kazuo Iwano
1997On Hamiltonian Triangulations in Simple Polygons (Extended Abstract).Giri Narasimhan
1997Parallel vs. Parametric Complexity (Abstract).Ketan Mulmuley
1997On Some Geometric Optimization Problems in Layered Manufacturing.Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta
1997Position-Independent Near Optimal Searching and On-line Recognition in Star Polygons.Alejandro Lpez-Ortiz, Sven Schuierer
1997Relaxed Balance through Standard Rotations.Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer
1997On a Simple Depth-First Search Strategy for Exploring Unknown Graphs.Stephen Kwek
1997Approximation Algorithms for a Genetic Diagnostics Problem.S. Rao Kosaraju, Alejandro A. Schffer, Leslie G. Biesecker
651675 of 896← PreviousNext →

Comparable venues

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