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
2005Conformance testing in the presence of multiple faults.Viraj Kumar, Mahesh Viswanathan
2005Approximation algorithms for cycle packing problems.Michael Krivelevich, Zeev Nutov, Raphael Yuster
2005Complete partitions of graphs.Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian
2005A group-strategyproof mechanism for Steiner forests.Jochen Knemann, Stefano Leonardi, Guido Schfer
2005Pianos are not flat: rigid motion planning in three dimensions.Vladlen Koltun
2005Provably good moving least squares.Ravi Krishna Kolluri
2005Girth restrictions for the 5-flow conjecture.Martin Kochol
2005Isomorphism and embedding problems for infinite limits of scale-free graphs.Robert D. Kleinberg, Jon M. Kleinberg
2005A multiple-choice secretary algorithm with applications to online auctions.Robert D. Kleinberg
2005Multiple-source shortest paths in planar graphs.Philip N. Klein
2005The hidden subgroup problem and permutation group theory.Julia Kempe, Aner Shalev
2005Online topological ordering.Irit Katriel, Hans L. Bodlaender
2005Algorithms for combining rooted triplets into a galled phylogenetic network.Jesper Jansson, Nguyen Bao Nguyen, Wing-Kin Sung
2005Market equilibria for homothetic, quasi-concave utilities and economies of scale in production.Kamal Jain, Vijay V. Vazirani, Yinyu Ye
2005Limitations of cross-monotonic cost sharing schemes.Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni
2005Marriage, honesty, and stability.Nicole Immorlica, Mohammad Mahdian
2005Approximating vertex cover on dense graphs.Tomokazu Imamura, Kazuo Iwama
2005A categorization theorem on suffix arrays with applications to space efficient text indexes.Meng He, J. Ian Munro, S. Srinivasa Rao
2005Computing minimal triangulations in time O(nPinar Heggernes, Jan Arne Telle, Yngve Villanger
2005Network design for information networks.Ara Hayrapetyan, Chaitanya Swamy, va Tardos
2005Coupling with the stationary distribution and improved sampling for colorings and independent sets.Thomas P. Hayes, Eric Vigoda
2005Deterministic network coding by matrix completion.Nicholas J. A. Harvey, David R. Karger, Kazuo Murota
2005Unknotting is in AM cup co-AM.Masao Hara, Seiichi Tani, Makoto Yamamoto
2005How fast is the k-means method?Sariel Har-Peled, Bardia Sadri
2005Oblivious routing on node-capacitated and directed graphs.Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton, Harald Rcke
3,4763,500 of 4,977← PreviousNext →

Comparable venues

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