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
2006Randomized online algorithms for minimum metric bipartite matching.Adam Meyerson, Akash Nanavati, Laura J. Poplawski
2006Metric cotype.Manor Mendel, Assaf Naor
2006Morphing orthogonal planar graph drawings.Anna Lubiw, Mark Petrick, Michael J. Spriggs
2006A polynomial algorithm to find an independent set of maximum weight in a fork-free graph.Vadim V. Lozin, Martin Milanic
2006FPTAS for mixed-integer polynomial optimization with a fixed number of variables.Jess A. De Loera, Raymond Hemmecke, Matthias Kppe, Robert Weismantel
2006Efficient construction of unit circular-arc models.Min Chih Lin, Jayme Luiz Szwarcfiter
2006A general approach for incremental approximation and hierarchical clustering.Guolong Lin, Chandrashekhar Nagarajan, Rajmohan Rajaraman, David P. Williamson
2006Superiority and complexity of the spaced seeds.Ming Li, Bin Ma, Louxin Zhang
2006Maintaining significant stream statistics over sliding windows.Lap-Kei Lee, H. F. Ting
2006Trees and Markov convexity.James R. Lee, Assaf Naor, Yuval Peres
2006Critical chromatic number and the complexity of perfect packings in graphs.Daniela Khn, Deryk Osthus
2006The price of being near-sighted.Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
2006Deterministic boundary recognition and topology extraction for large sensor networks.Alexander Krller, Sndor P. Fekete, Dennis Pfisterer, Stefan Fischer
2006Solving random satisfiable 3CNF formulas in expected polynomial time.Michael Krivelevich, Dan Vilenchik
2006Improved lower bounds for embeddings intoRobert Krauthgamer, Yuval Rabani
2006Subgraph characterization of Red/Blue-Split Graph and Knig Egervry Graphs.Ephraim Korach, Thnh Nguyen, Britta Peis
2006A new approach to proving upper bounds for MAX-2-SAT.Arist Kojevnikov, Alexander S. Kulikov
2006A near-tight approximation lower bound and algorithm for the kidnapped robot problem.Sven Koenig, Apurva Mudgal, Craig A. Tovey
2006Anytime algorithms for multi-armed bandit problems.Robert D. Kleinberg
2006Scalable leader election.Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee
2006Generating all vertices of a polyhedron is hard.Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich
2006Balanced allocation on graphs.Krishnaram Kenthapadi, Rina Panigrahy
2006Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition.Michael Kaufmann, Jan Kratochvl, Katharina Anna Lehmann, Amarendran Ramaswami Subramanian
2006Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting.Haim Kaplan, Micha Sharir
2006Reducing tile complexity for self-assembly through temperature programming.Ming-Yang Kao, Robert T. Schweller
3,3263,350 of 4,977← PreviousNext →

Comparable venues

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