What is the submission deadline for SODA 2027?

The paper submission deadline for SODA 2027 (ACM-SIAM Symposium on Discrete Algorithms) is 2026-07-09.

Where is SODA 2027 held?

SODA 2027 is held in Philadelphia, Pennsylvania, USA.

When does SODA 2027 take place?

SODA 2027 takes place on 2027-01-24.

What is the ranking of SODA?

SODA is ranked CCF A, ICORE A*, QUALIS A1. These are categorical rankings maintained by the respective bodies (China Computer Federation, ICORE Inc., and Brazilian CAPES).

会议信息

SODA 2027: ACM-SIAM Symposium on Discrete Algorithms

请登录查看会议网址

免费注册：查看官网链接、跟踪截稿日期，并接收邮件提醒。

注册登录

嵌入截止倒计时徽章

用 API 获取这条数据

搜索与榜单列表完全无需凭证；本页的完整详情需要一把免费 API 密钥。详见开发者接入页。

截稿日期:

2026-07-09

通知日期:

会议日期:

2027-01-24

会议地点:

Philadelphia, Pennsylvania, USA

届数:

查看历届（1）

CCF: A ICORE: A* QUALIS: A1 浏览: 537333 关注: 38 参加: 3

会伴指数 (CP-I)

87.6 / 100

全站第 96 名 / 共 5,650 个会议 · 前 2%

理论与算法第 5 / 138

学术认可 (35%)		100
投稿选择性 (20%)		77
会议传承 (20%)		84
社区关注 (10%)		54
资料公开度 (15%)		100

用到的输入: 收录等级：CCF A, QUALIS A1 · 录用率：31.3%（有记录的 5 届的均值） · 有据可查的届次：22 · 在会伴关注它的研究者：38 人 · 过去 24 个月打开过本页的研究者：11 人

置信度 100% —— 分数中有多大比例来自实际观测到的数据，而不是中性基准。这个分数是怎么算出来的 · 查看完整榜单 · 算法版本 1.1 · 算于 2026-09-05

下一届开放征稿时通知我

本届已结束。注册免费账号，下一届征稿一发布我们就发邮件通知你。
按上一届推算，下届截稿预计在 2027-07 前后。

有新征稿时通知我已有账号？登录

账号免费。每天最多一封邮件，每封信都带一键退订链接。

征稿

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

由 Admin Agent 最后更新于 2026-07-04

录用率

平均录用率: 30.1% 17 年间 (2005–2021).

年份	提交数	录用数	录用率(%)
2021	641	180	28.1%
2020	594	182	30.6%
2019	591	183	31%
2018	547	180	32.9%
2017	533	181	34%
2016	527	149	28.3%
2015	495	137	27.7%
2014	485	136	28%
2013	454	135	29.7%
2012	517	138	26.7%
2011	452	136	30.1%
2010	445	135	30.3%
2009	458	135	29.5%
2008	455	135	29.7%
2007	382	139	36.4%
2006	440	135	30.7%
2005	488	135	27.7%

最佳论文

年份	最佳论文
2023	Dynamic Algorithms for Maximum Matching Size
2023	Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time
2022	New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the √n Barrie
2021	Solving Sparse Linear Systems Faster than Matrix Multiplication
2020	Chasing Convex Bodies with Linear Competitive Ratio
2020	Chasing Convex Bodies Optimally
2019	Sublinear Algorithms for (∆ + 1) Vertex Coloring
2018	Approaching 3/2 for the s-t-path TSP
2018	Online Bipartite Matching with Amortized O(log2 N)Replacements
2017	Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs
2017	A (2 + Є) Approximation for Maximum Weight Matching in the Semi-Streaming Model
2016	Near-Optimal Light Spanners
2016	An Improved Distributed Algorithm for Maximal Independent Set
2015	The Parameterized Complexity of k-Biclique
2014	An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
2014	Polynomiality for Bin Packing with a Constant Number of Item Types
2013	Dynamic graph connectivity in polylogarithmic worst case time
2013	A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory
2012	Computing all maps into a sphere
2011	An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform
2010	An O(log n/log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
2009	Natural Algorithms

CCF	ICORE	CP-I	简称	全称	截稿日期	会议日期
		42.1	ACDA	SIAM Conference on Applied and Computational Discrete Algorithms	2021-03-01	2021-07-19
	C	46.1	DM	SIAM Conference on Discrete Mathematics	2025-12-22	2026-06-22
A	A*	92.4	SIGIR	International Conference on Research and Development in Information Retrieval	2026-01-15	2026-07-20
A	A*	97.7	AAAI	AAAI Conference on Artificial Intelligence	2026-07-21	2027-02-16
A	A*	90.7	CVPR	IEEE Conference on Computer Vision and Pattern Recognition	2025-11-06	2026-06-03
A	A*	89.2	STOC	ACM Symposium on Theory of Computing	2025-11-04	2026-06-22
A	A*	95.0	OSDI	USENIX Symposium on Operating Systems Design and Implementation	2026-12-01	2027-07-07
A	A*	91.9	ICML	International Conference on Machine Learning	2026-01-23	2026-07-06
A	A*	97.2	INFOCOM	International Conference on Computer Communications	2026-07-24	2027-05-24
A	A*	89.2	ICCV	International Conference on Computer Vision	2025-03-07	2025-10-19

CCF	全称	影响因子	出版商	ISSN
	Journal of Discrete Algorithms		Elsevier	1570-8667
C	SIAM Journal on Discrete Mathematics		SIAM	0895-4801
	Discrete Mathematics	0.9	Elsevier	0012-365X
	Discrete Optimization	1.6	Elsevier	1572-5286
A	SIAM Journal on Computing		SIAM	0097-5397
B	SIAM Journal on Imaging Sciences		SIAM	1936-4954
A	IEEE Transactions on Multimedia	9.7	IEEE	1520-9210
A	IEEE Transactions on Computers	3.8	IEEE	0018-9340
A	IEEE Transactions on Dependable and Secure Computing	7.5	IEEE	1545-5971
A	IEEE Transactions on Parallel and Distributed Systems	6.0	IEEE	1045-9219

会议信息

SODA 2027: ACM-SIAM Symposium on Discrete Algorithms

会伴指数 (CP-I)

征稿

录用率

最佳论文

相关会议

相关期刊

评论 0