会议信息

COCOON 2026: International Computing and Combinatorics Conference

请登录查看会议网址
免费注册：查看官网链接、跟踪截稿日期，并接收邮件提醒。
注册 登录
截稿日期:
2026-03-04 已截稿
通知日期:
2026-05-06
会议日期:
2026-07-23
会议地点:
Singapore
届数:
CCF: B   QUALIS: B1   浏览: 45125   关注: 25   参加: 6
这一页信息有误？告诉我们
嵌入截止倒计时徽章
COCOON
用 API 获取这条数据
搜索与榜单列表完全无需凭证；本页的完整详情需要一把免费 API 密钥。详见开发者接入页。

会伴指数 (CP-I)

77.0 / 100
全站第 239 名 / 共 5,763 个会议 · 前 5%
学术认可 (35%)
82
投稿选择性 (20%)
60
会议传承 (20%)
94
社区关注 (10%)
47
资料公开度 (15%)
85

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

公开资料里还缺: 最佳论文记录 (+2.3)
主办方认领本会议后，可直接在这一页补上；分数每晚重算。如何提升这个分数

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

征稿

COCOON 2026 (International Computing and Combinatorics Conference) is a CCF B / QUALIS B1 conference held in Singapore on 2026-07-23. The paper submission deadline is 2026-03-04 (extended). Acceptance notifications are sent on 2026-05-06.

The 32nd International Computing and Combinatorics Conference (COCOON 2026) will be held in Singapore from 23 to 25 July 2026. More information can be found at the conference website: https://event.ntu.edu.sg/cocoon2026. Original research papers in the areas of algorithms, theory of computation, computational complexity, and combinatorics related to computing are solicited. Submissions presenting experimental or applied work are also welcome, provided that they make a clear algorithmic contribution and offer insights of interest to the theory and algorithms community. Special consideration will be given to research that is motivated by real-world problems. Such submissions are expected to include rigorous justification, careful evaluation, or convincing evidence of the effectiveness of the proposed algorithms. Topics of interest The topics of interest include (but are not limited to) the following: Algorithms and Data Structures Algorithmic Game Theory and Mechanism Design Approximation Algorithms and Online Algorithms Automata, Languages, Logic, and Computability Combinatorics Related to Algorithms and Complexity Complexity Theory Computational Learning Theory and Knowledge Discovery Cryptography, Reliability and Security Database Theory Computational Biology and Bioinformatics Computational Algebra, Geometry, and Number Theory Exact and Parameterized Algorithms Graph Drawing and Information Visualization Graph Theory and Communication Networks Optimization Parallel and Distributed Computing Quantum Computing
由 Admin Agent 最后更新于

录用率

平均录用率: 41.6% 18 年间 (2003–2021).

年份提交数录用数录用率(%)
20211315642.7%
20201265442.9%
20191245544.4%
20181206251.7%
20171114843.2%
20161135044.2%
20141105146.4%
20131205646.7%
20121215041.3%
20111365439.7%
20101335440.6%
20091255140.8%
20081726638.4%
20071545133.1%
20061375238%
20053539627.2%
20041094642.2%
20031145245.6%

相关会议

相关期刊

CCF全称影响因子出版商ISSN
Graphs and Combinatorics0.7Springer0911-0119
Combinatorics, Probability and Computing0.900Cambridge University Press0963-5483
BSoftware & Systems Modeling3.2Springer1619-1366
BPattern Recognition7.6Elsevier0031-3203
BIEEE Transactions on Neural Networks and Learning Systems8.9IEEE1045-9227
BInformation Sciences6.0Elsevier0020-0255
BComputer Networks4.7Elsevier1389-1286
BComputers & Security5.4Elsevier0167-4048
BIEEE Transactions on Intelligent Transportation Systems8.4IEEE1524-9050
BJournal of Systems and Software3.8Elsevier0164-1212

评论 0

暂无评论。

请登录后发表评论