Conference Information

ISAAC 2026: International Symposium on Algorithms and Computation

Please Login to view website of conference
Free account: view official websites, track deadlines, and get email reminders.
Embed deadline badge
ISAAC
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.
Submission Date:
2026-06-29
Notification Date:
2026-09-07
Conference Date:
2026-12-06
Location:
Hangzhou, China
Years:
CCF: C   ICORE: B   QUALIS: B1   Viewed: 54678   Tracked: 51   Attend: 12

Conference Partner Index (CP-I)

79.3 / 100
Ranked #205 of 5,650 conferences · Top 4%

#12 of 138 in Theory & Algorithms

Academic recognition (35%)
78
Submission selectivity (20%)
70
Editions held (20%)
98
Community attention (10%)
57
Public record completeness (15%)
85

Inputs used: Listed as CCF C, ICORE B, QUALIS B1 · Acceptance rate: 36.9% (mean of 5 editions on file) · Editions on record: 37 · Researchers following it here: 51 · Researchers who opened this page in the past 24 months: 11

Missing from the public record: Best-paper records (+2.3)
Organizers can add these from this page after claiming the conference; scores are recomputed nightly. How to raise this score

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.1 · Computed 2026-09-06

Call For Papers

ISAAC 2026 (International Symposium on Algorithms and Computation) is a CCF C / ICORE B / QUALIS B1 conference held in Hangzhou, China on 2026-12-06. The paper submission deadline is 2026-06-29. Acceptance notifications are sent on 2026-09-07.

Topics The symposium serves as a forum for researchers in algorithms and theory of computation. We invite submissions presenting original research in these areas. Submissions in relevant applied areas also are welcome. Topics of interest include, but are not limited to: Algorithmic game theory Algorithms and data structures Approximation algorithms Combinatorial optimization Computational biology Computational complexity Computational geometry Cryptography Experimental algorithms Graph algorithms Graph drawing Integer programming Internet algorithms Online algorithms Parallel and distributed algorithms Parameterized algorithms Quantum computing Randomized algorithms Scheduling and resource allocation problems Streaming algorithms
Last updated by Admin Agent on

Acceptance Ratio

Average acceptance rate: 37.1% over 15 years (2006–2020).

YearSubmittedAcceptedAccepted(%)
20202026331.2%
20191776436.2%
20181957136.4%
20171606540.6%
20161556240%
20151806536.1%
20141716035.1%
20131776737.9%
20121746839.1%
20111877640.6%
20101827742.3%
200927912043%
20082297834.1%
20072207735%
20062557328.6%

Related Journals

CCFFull NameImpact FactorPublisherISSN
ComputationMDPI2079-3197
AlgorithmsMDPI1999-4893
CKnowledge-Based Systems7.2Elsevier0950-7051
CFuture Generation Computer Systems5.9Elsevier0167-739X
CNeurocomputing6.5Elsevier0925-2312
CPattern Recognition Letters3.9Elsevier0167-8655
CIEEE Transactions on Industrial Informatics11.7IEEE1551-3203
CIEEE Internet of Things Journal8.9IEEE2327-4662
CEngineering Applications of Artificial Intelligence9.0Elsevier0952-1976
CExpert Systems with Applications7.5Elsevier0957-4174

Comments 0

No comments yet.

Please Login to post a comment