会議情報

SODA 2027: ACM-SIAM Symposium on Discrete Algorithms

会議のウェブサイトを表示するにはログインしてください
無料登録で公式サイトの閲覧、締切のトラッキング、メールリマインダーが利用できます。
新規登録 ログイン
投稿締切日:
2026-07-09 締切済み
通知日:
開催日:
2027-01-24
開催地:
Philadelphia, Pennsylvania, USA
開催回数:
CCF: A   ICORE: A*   QUALIS: A1   閲覧: 539504   フォロー: 38   参加: 3
このページに誤りがありますか？お知らせください
締切カウントダウンバッジを埋め込む
SODA
このデータを API で取得
検索とランキング一覧は資格情報なしで利用できます。このページの詳細データには無料の API キーが必要です。詳しくは開発者向けガイドをご覧ください。

会伴インデックス (CP-I)

87.7 / 100
全 5,749 件中 第 107 位 · 上位 2%

理論・アルゴリズム 分野 142 件中 第 6 位

学術的評価 (35%)
100
投稿の選択性 (20%)
77
開催回数 (20%)
84
コミュニティの注目度 (10%)
55
公開情報の充実度 (15%)
100

使用した入力: 収録ランク：CCF A, QUALIS A1 · 採択率：31.3%（記録のある 5 回の平均） · 確認できる開催回数：22 · 会伴でフォローしている研究者：38 人 · 過去 24 か月にこのページを開いた研究者：13 人

信頼度 100% — スコアのうち、中立の基準値ではなく実際に観測されたデータに基づく割合。 このスコアの算出方法 · ランキングを見る · アルゴリズム版 1.2 · 算出日 2026-10-21

論文募集

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 （）

採択率

平均採択率: 30.1% 17 年間 (2005–2021).

年投稿数採択数採択率(%)
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%

ベストペーパー

年ベストペーパー
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

これを見た人はこちらも見ています

CCFICORECP-I略称正式名称投稿締切開催日
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

関連会議

CCFICORECP-I略称正式名称投稿締切開催日
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

関連ジャーナル

CCF正式名称インパクトファクター出版社ISSN
Journal of Discrete AlgorithmsElsevier1570-8667
CSIAM Journal on Discrete MathematicsSIAM0895-4801
Discrete Mathematics0.9Elsevier0012-365X
Discrete Optimization1.6Elsevier1572-5286
ASIAM Journal on ComputingSIAM0097-5397
BSIAM Journal on Imaging SciencesSIAM1936-4954
AIEEE Transactions on Multimedia9.7IEEE1520-9210
AIEEE Transactions on Computers3.8IEEE0018-9340
AIEEE Transactions on Dependable and Secure Computing7.5IEEE1545-5971
AIEEE Transactions on Parallel and Distributed Systems6.0IEEE1045-9219

コメント 0

まだコメントはありません。

コメントするにはログインしてください