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
2010Algorithmic Lower Bounds for Problems Parameterized with Clique-Width.Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2010Coresets and Sketches for High Dimensional Subspace Approximation Problems.Dan Feldman, Morteza Monemizadeh, Christian Sohler, David P. Woodruff
2010Maximum Flows and Parametric Shortest Paths in Planar Graphs.Jeff Erickson
2010Paired Approximation Problems and Incompatible Inapproximabilities.David Eppstein
2010An Improved Construction of Progression-Free Sets.Michael Elkin
2010Algorithms for Ray Class Groups and Hilbert Class Fields.Kirsten Eisentrger, Sean Hallgren
2010EDF-schedulability of Synchronous Periodic Task Systems is coNP-hard.Friedrich Eisenbrand, Thomas Rothvo
2010Testing Additive Integrality Gaps.Friedrich Eisenbrand, Nicolai Hhnle, Dmtr Plvlgyi, Gennady Shmonin
2010Inapproximability for Planar Embedding Problems.Jeff Edmonds, Anastasios Sidiropoulos, Anastasios Zouzias
2010Bounding Variance and Expectation of Longest Path Lengths in DAGs.Jeff Edmonds, Supratik Chakraborty
2010Differential Privacy in New Settings.Cynthia Dwork
2010The Forest Hiding Problem.Adrian Dumitrescu, Minghui Jiang
2010Convergence, Stability, and Discrete Approximation of Laplace Spectra.Tamal K. Dey, Pawas Ranjan, Yusu Wang
2010Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs.Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi
2010A Quasi-polynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing.Aparna Das, Claire Mathieu
2010How Good is the Chord Algorithm?.Constantinos Daskalakis, Ilias Diakonikolas, Mihalis Yannakakis
2010How to Meet Asynchronously (Almost) Everywhere.Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc
2010A Polynomial Time Approximation Scheme for k-Consensus Clustering.Tom Coleman, Anthony Wirth
2010Self-improving Algorithms for Convex Hulls.Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
2010SRPT is 1.86-Competitive for Completion Time Scheduling.Christine Chung, Tim Nonner, Alexander Souza
2010A Deterministic Truthful PTAS for Scheduling Related Machines.George Christodoulou, Annamria Kovcs
2010Rumour Spreading and Graph Conductance.Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi
2010Finding the Jaccard Median.Flavio Chierichetti, Ravi Kumar, Sandeep Pandey, Sergei Vassilvitskii
2010Online Learning with Queries.Chao-Kai Chiang, Chi-Jen Lu
2010Road Network Reconstruction for Organizing Paths.Daniel Chen, Leonidas J. Guibas, John Hershberger, Jian Sun
2,8262,850 of 4,977← PreviousNext →

Comparable venues

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