Skip to content

ACM/SIAM Symposium on Discrete Algorithms

SODA

A*

CORE rank

CORE rank (raw)

A*

Acceptance rate

32.0% (2024)

Fields of research

Theory of Computation

Papers indexed

4,977

1990–2026

Papers per year

1990243 peak2026

SODA papers

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

YearTitleAuthors
1999Reconstructing Set Partitions.Vladimir Grebinski, Gregory Kucherov
1999Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control.Michael H. Goldwasser
1999Combinatorial Algorithms Test Sets [CATS]: The ACM/EATCS Platform for Experimental Research.Andrew V. Goldberg, Bernard M. E. Moret
1999Cut Tree Algorithms.Andrew V. Goldberg, Kostas Tsioutsiouliklis
1999The Complexity of Gene Placement.Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson, Pavel A. Pevzner, Sleyman Cenk Sahinalp, Elizabeth Sweedyk
1999Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler.Michel X. Goemans, David P. Williamson
1999Stability of Networks and Protocols in the Adversarial Queueing Model for Packet Routing.Ashish Goel
1999Synopsis Data Structures for Massive Data Sets.Phillip B. Gibbons, Yossi Matias
1999Algorithms for Compile-Time Memory Optimization.Jordan Gergov
1999Efficient Approximation Algorithms for the Hamming Center Problem.Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
1999How to Make a Square Grid Framework with Cables Rigid.Harold N. Gabow, Tibor Jordn
1999Randomized Splay Trees.Martin Frer
1999Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs.Alan M. Frieze, Lei Zhao
1999Checking Priority Queues.Ulrich Finkler, Kurt Mehlhorn
1999Optimal Node-Degree Bounds for the Complexity of Nonplanarity Parameters.Celina M. H. de Figueiredo, Lurbio Faria, Candido Ferreira Xavier de Mendona Neto
1999Simplicity and Hardness of the Maximum Traveling Salesman Problem Under Geometric Distances.Sndor P. Fekete
1999Separation-Sensitive Collision Detection for Convex Objects.Jeff Erickson, Leonidas J. Guibas, Jorge Stolfi, Li Zhang
1999Randomized Online Scheduling on Two Uniform Machines.Leah Epstein, John Noga, Steven S. Seiden, Jir Sgall, Gerhard J. Woeginger
1999Shortest Paths in an Arrangement withDavid Eppstein, David Hart
1999Incremental and Decremental Maintenance of Planar Width.David Eppstein
1999Balanced Aspect Ratio Trees: Combining the Advantages ofChristian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
1999Clustering in Large Graphs and Matrices.Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh S. Vempala, V. Vinay
1999The 2-Catalog Segmentation Problem.Yevgeniy Dodis, Venkatesan Guruswami, Sanjeev Khanna
1999A Simple Provable Algorithm for Curve Reconstruction.Tamal K. Dey, Piyush Kumar
1999Folding and One Straight Cut Suffice.Erik D. Demaine, Martin L. Demaine, Anna Lubiw
4,3014,325 of 4,977← PreviousNext →

Comparable venues

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