ACM/SIAM Symposium on Discrete Algorithms

SODA

CORE rank

CORE rank (raw)

Acceptance rate

32.0% (2024)

Fields of research

Theory of Computation

Papers indexed

4,977

1990–2026

Best Theory of Computation conferences

Papers per year

1990243 peak2026

Most published authors

SODA papers

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

Year	Title	Authors
2022	Unsplittable Flow on a Path: The Game!.	Fabrizio Grandoni, Tobias Mmke, Andreas Wiese
2022	Counting Homomorphic Cycles in Degenerate Graphs.	Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster
2022	Directed Tangle Tree-Decompositions and Applications.	Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon
2022	A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision.	Sumanta Ghosh, Rohit Gurjar, Roshan Raj
2022	Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets.	Jugal Garg, Yixin Tao, Lszl A. Vgh
2022	How Compression and Approximation Affect Efficiency in String Distance Measures.	Arun Ganesh, Tomasz Kociumaka, Andrea Lincoln, Barna Saha
2022	Pattern Matching on Grammar-Compressed Strings in Linear Time.	Moses Ganardi, Pawel Gawrychowski
2022	A 3-Approximation Algorithm for Maximum Independent Set of Rectangles.	Waldo Glvez, Arindam Khan, Mathieu Mari, Tobias Mmke, Madhusudhan Reddy Pittu, Andreas Wiese
2022	An Improved Algorithm for The k-Dyck Edit Distance Problem.	Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya
2022	Algorithmic Extensions of Dirac's Theorem.	Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2022	Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds.	Jacob Focke, Dniel Marx, Pawel Rzazewski
2022	Computing Lewis Weights to High Precision.	Maryam Fazel, Yin Tat Lee, Swati Padmanabhan, Aaron Sidford
2022	Almost Tight Approximation Algorithms for Explainable Clustering.	Hossein Esfandiari, Vahab S. Mirrokni, Shyam Narayanan
2022	Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches.	Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong
2022	Massively Parallel and Dynamic Algorithms for Minimum Size Clustering.	Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong
2022	Approximating the Arboricity in Sublinear Time.	Talya Eden, Saleet Mossel, Dana Ron
2022	Private Interdependent Valuations.	Alon Eden, Kira Goldner, Shuran Zheng
2022	Streaming Regular Expression Membership and Pattern Matching.	Bartlomiej Dudek, Pawel Gawrychowski, Garance Gourdel, Tatiana Starikovskaya
2022	Enumerating k-SAT functions.	Dingding Dong, Nitya Mani, Yufei Zhao
2022	Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time.	Sally Dong, Yu Gao, Gramoz Goranci, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Guanghao Ye
2022	Spectral recovery of binary censored block models.	Souvik Dhara, Julia Gaudio, Elchanan Mossel, Colin Sandon
2022	Approximating Sumset Size.	Anindya De, Shivam Nadimpalli, Rocco A. Servedio
2022	On the Hardness of Scheduling With Non-Uniform Communication Delays.	Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Sai Sandeep, Jakub Tarnawski, Yihao Zhang
2022	A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs.	Debarati Das, Maximilian Probst Gutenberg, Christian Wulff-Nilsen
2022	On finding exact solutions of linear programs in the oracle model.	Daniel Dadush, Lszl A. Vgh, Giacomo Zambelli

876–900 of 4,977← Previous Next →

Comparable venues

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