Conference Information

SODA 2027: ACM-SIAM Symposium on Discrete Algorithms

Please Login to view website of conference
Free account: view official websites, track deadlines, and get email reminders.
Register Login
Submission Date:
2026-07-09 Closed
Notification Date:
Conference Date:
2027-01-24
Location:
Philadelphia, Pennsylvania, USA
Years:
CCF: A   ICORE: A*   QUALIS: A1   Viewed: 539497   Tracked: 38   Attend: 3
Something wrong with this page? Tell us
Embed deadline badge
SODA
Get this via API
Search and ranking lists need no credentials at all; full detail for this page needs a free API key. See the developer guide.

Conference Partner Index (CP-I)

87.7 / 100
Ranked #107 of 5,749 conferences · Top 2%

#6 of 142 in Theory & Algorithms

Academic recognition (35%)
100
Submission selectivity (20%)
77
Editions held (20%)
84
Community attention (10%)
55
Public record completeness (15%)
100

Inputs used: Listed as CCF A, QUALIS A1 · Acceptance rate: 31.3% (mean of 5 editions on file) · Editions on record: 22 · Researchers following it here: 38 · Researchers who opened this page in the past 24 months: 13

Confidence 100% - the share of the score backed by observed data rather than the neutral baseline. How this score is calculated · Browse the ranking · Algorithm version 1.2 · Computed 2026-10-21

Call For Papers

SODA 2027 (ACM-SIAM Symposium on Discrete Algorithms) is a CCF A / ICORE A* / QUALIS A1 conference held in Philadelphia, Pennsylvania, USA on 2027-01-24. The paper submission deadline is 2026-07-09.

Included Themes Aspects of combinatorics and discrete mathematics, such as: Combinatorial and geometric structures Discrete optimization Graph theory and graph algorithms Random structures and probabilistic methods Core topics in discrete algorithms, such as: Algorithm design and analysis Approximation and randomized algorithms Data structures Dynamic, streaming, and sub-linear algorithms Experimental algorithms Fixed-parameter tractability Lower bounds and fine-grained complexity Mathematical programming Online algorithms Algorithmic aspects of other areas of computer science, such as: Algorithmic aspects of fairness Algorithmic coding theory Combinatorial scientific computing Communication networks and the internet Computational geometry and topology Computer systems Cryptography, security, and privacy Databases and information retrieval Distributed and parallel computing Game theory and mechanism design Machine learning and AI Quantum computing Scheduling and resource allocation
Last updated by Admin Agent on

Acceptance Ratio

Average acceptance rate: 30.1% over 17 years (2005–2021).

YearSubmittedAcceptedAccepted(%)
202164118028.1%
202059418230.6%
201959118331%
201854718032.9%
201753318134%
201652714928.3%
201549513727.7%
201448513628%
201345413529.7%
201251713826.7%
201145213630.1%
201044513530.3%
200945813529.5%
200845513529.7%
200738213936.4%
200644013530.7%
200548813527.7%

Best Papers

YearBest Papers
2026Is Nasty Noise Actually Harder Than Malicious Noise?
2026Existence of Fair and Efficient Allocation of Indivisible Chores
2025Quasi-Monte Carlo Beyond Hardy-Krause
2025Improved List Size for Folded Reed-Solomon Codes
2024Deterministic Near-linear Time Minimum Cut in Weighted Graphs
2024Breaking the Metric Voting Distortion Barrier
2023Dynamic Algorithms for Maximum Matching Size
2023Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time
2022New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the √n Barrie
2021Solving Sparse Linear Systems Faster than Matrix Multiplication
2020Chasing Convex Bodies with Linear Competitive Ratio
2020Chasing Convex Bodies Optimally
2019Sublinear Algorithms for (∆ + 1) Vertex Coloring
2018Approaching 3/2 for the s-t-path TSP
2018Online Bipartite Matching with Amortized O(log2 N)Replacements
2017A (2 + Є) Approximation for Maximum Weight Matching in the Semi-Streaming Model
2017Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs
2016Near-Optimal Light Spanners
2016An Improved Distributed Algorithm for Maximal Independent Set
2015The Parameterized Complexity of k-Biclique
2014An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
2014Polynomiality for Bin Packing with a Constant Number of Item Types
2013Dynamic graph connectivity in polylogarithmic worst case time
2013A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory
2012Computing all maps into a sphere
2011An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform
2010An O(log n/log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
2009Natural Algorithms

People who viewed this also viewed

CCFICORECP-IShortFull NameSubmissionConference
AA*97.3INFOCOMInternational Conference on Computer Communications2026-07-242027-05-24
BA*97.5IJCAIInternational Joint Conference on Artificial Intelligence2027-01-042027-08-07
AA*97.8AAAIAAAI Conference on Artificial Intelligence2026-07-212027-02-16

Related Conferences

CCFICORECP-IShortFull NameSubmissionConference
40.7ACDASIAM Conference on Applied and Computational Discrete Algorithms2026-09-082027-02-22
C46.1DMSIAM Conference on Discrete Mathematics2025-12-222026-06-22
AA*95.8SIGIRInternational Conference on Research and Development in Information Retrieval2027-01-142027-07-18
AA*97.8AAAIAAAI Conference on Artificial Intelligence2026-07-212027-02-16
AA*94.7CVPRIEEE Conference on Computer Vision and Pattern Recognition2026-11-102027-06-20
AA*92.9STOCACM Symposium on Theory of Computing2026-11-022027-06-06
AA*95.4OSDIUSENIX Symposium on Operating Systems Design and Implementation2026-12-012027-07-07
AA*95.2ICMLInternational Conference on Machine Learning2026-01-232026-07-06
AA*97.3INFOCOMInternational Conference on Computer Communications2026-07-242027-05-24
AA*89.4ICCVInternational Conference on Computer Vision2025-03-072025-10-19

Related Journals

Comments 0

No comments yet.

Please Login to post a comment