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
2007Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovsz extension and non-smooth convex optimization.Fabin A. Chudak, Kiyohito Nagano
2007A lower bound for scheduling mechanisms.George Christodoulou, Elias Koutsoupias, Angelina Vidali
2007Quantum algorithm for a generalized hidden shift problem.Andrew M. Childs, Wim van Dam
2007Convergence to approximate Nash equilibria in congestion games.Steve Chien, Alistair Sinclair
2007The approximation complexity of win-lose games.Xi Chen, Shang-Hua Teng, Paul Valiant
2007Improved algorithms for path, matching, and packing problems.Jianer Chen, Songjian Lu, Sing-Hoi Sze, Fenghui Zhang
2007Cheap labor can be expensive.Ning Chen, Anna R. Karlin
2007Approximate shortest paths in anisotropic regions.Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Yajun Wang
2007Delaunay refinement for piecewise smooth complexes.Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos
2007Approximation algorithms for node-weighted buy-at-bulk network design.Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
2007A rigorous analysis of population stratification with limited data.Kamalika Chaudhuri, Eran Halperin, Satish Rao, Shuheng Zhou
2007A divide and conquer algorithm forMoses Charikar, Konstantin Makarychev, Yury Makarychev
2007Near-optimal algorithms for maximum constraint satisfaction problems.Moses Charikar, Konstantin Makarychev, Yury Makarychev
2007Energy efficient online deadline scheduling.Ho-Leung Chan, Wun-Tat Chan, Tak Wah Lam, Lap-Kei Lee, Kin-Sum Mak, Prudence W. H. Wong
2007Planar graphs are in 1-STRING.Jrmie Chalopin, Daniel Gonalves, Pascal Ochem
2007A near-optimal algorithm for computing the entropy of a stream.Amit Chakrabarti, Graham Cormode, Andrew McGregor
2007Compacting cuts: a new linear formulation for minimum cut.Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh
2007The random graph threshold forJulie Anne Cain, Peter Sanders, Nicholas C. Wormald
2007Layered multicast scheduling for the LQingbo Cai, Vincenzo Liberatore
2007Obnoxious centers in graphs.Sergio Cabello, Gnter Rote
2007Multiple source shortest paths in a genus g graph.Sergio Cabello, Erin W. Chambers
2007Optimization problems in multiple-interval graphs.Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz
2007Restricted strip covering and the sensor cover problem.Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh Venkatasubramanian, Ke Yi
2007Single source multiroute flows and cuts on uniform capacity networks.Henning Bruhn, Jakub Cern, Alexander Hall, Petr Kolman
2007On extremal subgraphs of random graphs.Graham R. Brightwell, Konstantinos Panagiotou, Angelika Steger
3,2513,275 of 4,977← PreviousNext →

Comparable venues

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