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
2025Improved Spectral Density Estimation via Explicit and Implicit Deflation.Rajarshi Bhattacharjee, Rajesh Jayaram, Cameron Musco, Christopher Musco, Archan Ray
2025Relating Interleaving and Frchet Distances via Ordered Merge Trees.Thijs Beurskens, Tim Ophelders, Bettina Speckmann, Kevin Verbeek
2025Matching Composition and Efficient Weight Reduction in Dynamic Matching.Aaron Bernstein, Jiale Chen, Aditi Dudeja, Zachary Langley, Aaron Sidford, Ta-Wei Tu
2025Quasilinear-time eccentricities computation, and more, on median graphs.Pierre Berg, Guillaume Ducoffe, Michel Habib
2025Packing Short Cycles.Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov
2025Fully Dynamic (Δ + 1)-Coloring Against Adaptive Adversaries.Soheil Behnezhad, Rajmohan Rajaraman, Omer Wasim
2025Strict Self-Assembly of Discrete Self-Similar Fractals in the abstract Tile Assembly Model.Florent Becker, Daniel Hader, Matthew J. Patitz
2025Nearly Tight Bounds on Testing of Metric Properties.Yiqiao Bao, Sampath Kannan, Erik Waingarten
2025Majorized Bayesian Persuasion and Fair Selection.Siddhartha Banerjee, Kamesh Munagala, Yiheng Shen, Kangning Wang
2025PTASes for Euclidean TSP with Unit Disk and Unit Square Neighborhoods.Sayan Bandyapadhyay, Katie Clinch, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2025The Submodular Santa Claus Problem.tienne Bamas, Sarah Morell, Lars Rohwedder
2025Lift-and-Project Integrality Gaps for Santa Claus.tienne Bamas
2025Unweighted Layered Graph Traversal: Passing a Crown via Entropy Maximization.Xingjian Bai, Christian Coester, Romain Cosson
2025Forall-exist statements in pseudopolynomial time.Eleonore Bach, Friedrich Eisenbrand, Thomas Rothvoss, Robert Weismantel
2025Massively Parallel Minimum Spanning Tree in General Metric Spaces.Amir Azarmehr, Soheil Behnezhad, Rajesh Jayaram, Jakub Lacki, Vahab Mirrokni, Peilin Zhong
2025Fully-Distributed Byzantine Agreement in Sparse Networks.John Augustine, Fabien Dufoulon, Gopal Pandurangan
2025Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemerdi Graphs.Sepehr Assadi, Sanjeev Khanna, Peter Kiss
2025Streaming and Communication Complexity of Load-Balancing via Matching Contractors.Sepehr Assadi, Aaron Bernstein, Zachary Langley, Lap Chi Lau, Robert Wang
2025Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams.Sepehr Assadi, Soheil Behnezhad, Christian Konrad, Kheeran K. Naidu, Janani Sundaresan
2025Faster Vizing and Near-Vizing Edge Coloring Algorithms.Sepehr Assadi
2025Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs.Vikrant Ashvinkumar, Aaron Bernstein, Adam Karczmarz
2025An Elementary Predictor Obtaining Distance to Calibration.Eshwar Ram Arunachaleswaran, Natalie Collina, Aaron Roth, Mirah Shi
2025Integer programs with nearly totally unimodular matrices: the cographic case.Manuel Aprile, Samuel Fiorini, Gwenal Joret, Stefan Kober, Miehal T. Seweryn, Stefan Weltge, Yelena Yuditsky
2025Low Degree Local Correction Over the Boolean Cube.Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan
2025Improving the Leading Constant of Matrix Multiplication.Josh Alman, Hantao Yu
376400 of 4,977← PreviousNext →

Comparable venues

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