Conference Information

STACS 2027: International Symposium on Theoretical Aspects of Computer Science

Please Login to view website of conference
Free account: view official websites, track deadlines, and get email reminders.
Embed deadline badge
STACS
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-10-11 Due in 39 days
Notification Date:
2026-12-22
Conference Date:
2027-03-08
Location:
Gottingen, Germany
Years:
CCF: C   ICORE: A   QUALIS: A2   Viewed: 47661   Tracked: 29   Attend: 8

Conference Partner Index (CP-I)

87.4 / 100
Ranked #98 of 5,647 conferences · Top 2%

#6 of 138 in Theory & Algorithms

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

Inputs used: Listed as CCF C, ICORE A, QUALIS A2 · Acceptance rate: 25% (mean of 5 editions on file) · Editions on record: 44 · Researchers following it here: 29 · Researchers who opened this page in the past 24 months: 21

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-02

Call For Papers

STACS 2027 (International Symposium on Theoretical Aspects of Computer Science) is a CCF C / ICORE A / QUALIS A2 conference held in Gottingen, Germany on 2027-03-08. The paper submission deadline is 2026-10-11. Acceptance notifications are sent on 2026-12-22.

List of Topics: Track A: Algorithm Design, Data Structures, and Complexity Approximation algorithms Online algorithms Distributed/parallel algorithms Parameterized algorithms Randomized algorithms Analysis of algorithms Combinatorics of data structures Computational geometry Cryptography Algorithms for machine learning Algorithmic game theory Quantum algorithms Computational and structural complexity theory Parameterized complexity Randomness in computation Track B: Automata, Logic, Semantics and Theory of Programming Automata theory Games and multi-agent systems Algebraic and categorical methods Models of computation Concurrency Timed systems Finite model theory Database theory Semantics Type systems Program analysis Specification and verification Rewriting and deduction Learning theory Logical aspects of computability and complexity
Last updated by Admin Agent on

Acceptance Ratio

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

YearSubmittedAcceptedAccepted(%)
20202425623.1%
20192605420.8%
20181865429%
20172125425.5%
20162055426.3%
20152355523.4%
20142105425.7%
20132545421.3%
20122735419.8%
20112715419.9%
20102385422.7%
20092805419.3%
20082005427%
20074005614%
20062835419.1%

People who viewed this also viewed

Related Journals

CCFFull NameImpact FactorPublisherISSN
CNeurocomputing6.5Elsevier0925-2312
CKnowledge-Based Systems7.2Elsevier0950-7051
Electronic Notes in Theoretical Computer ScienceElsevier1571-0661
CFuture Generation Computer Systems5.9Elsevier0167-739X
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
CIEEE Transactions on Big Data5.7IEEE2332-7790

Comments 0

No comments yet.

Please Login to post a comment