Where is ICALP 2027 held?

ICALP 2027 is held in Krakow, Poland.

When does ICALP 2027 take place?

ICALP 2027 takes place on 2027-07-05.

What is the ranking of ICALP?

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

Conference Information

ICALP 2027: International Colloquium on Automata, Languages and Programming

Q: What is the submission deadline for ICALP 2027?

The paper submission deadline for ICALP 2027 (International Colloquium on Automata, Languages and Programming) is 2026-09-15.

Please Login to view website of conference

Free account: view official websites, track deadlines, and get email reminders.

Register Login

Embed deadline badge

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-09-15

Notification Date:

2026-12-08

Conference Date:

2027-07-05

Location:

Krakow, Poland

Years:

54 View past editions (2)

CCF: B ICORE: A* QUALIS: A1 Viewed: 203200 Tracked: 44 Attend: 5

Conference Partner Index (CP-I)

91.7 / 100

Ranked #53 of 5,687 conferences · Top 1%

#2 of 142 in Theory & Algorithms

Academic recognition (35%)		100
Submission selectivity (20%)		79
Editions held (20%)		100
Community attention (10%)		58
Public record completeness (15%)		100

Inputs used: Listed as CCF B, QUALIS A1 · Acceptance rate: 29% (mean of 5 editions on file) · Editions on record: 54 · Researchers following it here: 44 · Researchers who opened this page in the past 24 months: 16

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

Get notified when the next edition opens

This edition is over. Create a free account and we will email you as soon as the next call for papers is published.
Based on the previous edition, the next deadline is estimated around 2027-09.

Notify me about new calls for papers Already have an account? Login

Free account. At most one email a day, and every email has a one-click unsubscribe link.

Call For Papers

ICALP 2027 (International Colloquium on Automata, Languages and Programming) is a CCF B / ICORE A* / QUALIS A1 conference held in Krakow, Poland on 2027-07-05. The paper submission deadline is 2026-09-15. Acceptance notifications are sent on 2026-12-08.

Topics Papers presenting original research on all aspects of theoretical computer science are sought. Typical, but not exclusive, topics of interest for Track B (Automata, Logic, Semantics, and Theory of Programming) include: Algebraic and Categorical Models of Computation Automata, Logic, and Games Database Theory, Constraint Satisfaction Problems, and Finite Model Theory Formal and Logical Aspects of Learning Formal and Logical Aspects of Security and Privacy Logic in Computer Science and Theorem Proving Models of Computation: Complexity and Computability Models of Concurrent, Distributed, and Mobile Systems Models of Reactive, Hybrid, and Stochastic Systems Principles and Semantics of Programming Languages Program Analysis, Verification, and Synthesis Type Systems and Typed Calculi

Last updated by Admin Agent on 2026-09-08

Acceptance Ratio

Average acceptance rate: 28.2% over 14 years (2007–2020).

Year	Submitted	Accepted	Accepted(%)
2020	347	102	29.4%
2019	316	94	29.7%
2018	346	98	28.3%
2017	296	88	29.7%
2016	319	89	27.9%
2015	507	143	28.2%
2014	484	136	28.1%
2013	422	124	29.4%
2012	248	71	28.6%
2011	222	60	27%
2010	222	60	27%
2009	223	62	27.8%
2008	269	70	26%
2007	149	41	27.5%

Best Papers

Year	Best Papers
2019	Christof Loding and Anton Pirogov: "Determinization of Buchi Automata: Unifying the Approaches of Safra and Muller-Schupp
2019	Distributed Reconfiguration of Maximal Independent Sets
2019	A Simple Gap-producing Reduction for the Parameterized Set Cover Problem
2018	A polynomial-time approximation algorithm for all-terminal network reliability
2018	An optimal bound on the solution sets of one-variable word equations and its consequences
2018	Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations
2017	Directed Hamiltonicity and Out-Branchings via Generalized Laplacians
2017	Characterizing Defin-ability in Decidable Fixpoint Logics
2017	Universal Framework for Wireless Scheduling Problems
2016	Amplifiers for the Moran Process
2016	An almost Cubic Lower Bound for Depth Three Arithmetic Circuits
2016	Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length
2015	Selling two goods optimally
2015	An Algebraic Geometric Approach to Nivat's Conjecture
2015	Fully Dynamic Matching in Bipartite Graphs
2014	Shortest Two Disjoint Paths in Polynomial Time
2014	Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
2014	Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods
2013	Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities
2013	Reachability in Two-Clock Timed Automata is PSPACE-complete
2013	Fast Collaborative Graph Exploration
2012	The Complexity of Computing the Sign of the Tutte Polynomial (and consequent #P-hardness of Approximation)
2012	Regular Languages are Church-Rosser Congruential
2012	Online Mechanism Design (Randomized Rounding on the Fly)
2011	Algebraic Independence and Blackbox Identity Testing
2011	Regular Languages of Words Over Countable Linear Orderings
2011	Local Matching Dynamics in Social Networks
2010	Approximating the Partition Function of the Ferromagnetic Potts Model
2010	Placing Regenerators in Optical Networks to Safity Multiple Sets of Requests
2010	On optimal proof systems and logics for PTIME
2009	A Better algorithm for random k-SAT
2009	LTL Path Checking is Efficiently Parallelizable
2009	Improved Algorithms for Latency Minimization in Wireless Network
2008	The complexity of Boolean formula minimization
2008	Duality and equational theory of regular languages
2008	Making Classical honest verifier zero-knowledge protocols secure against quantum attacks
2007	Holographic algorithms. The Power of Dimensionality Resolved
2007	A Generalization of Cobham's Theorem to Automata over Real Numbers
2007	Deterministic History Independent Strategies for Storing Information on Write Once Memories
2006	Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions
2006	The Wadge Hierarchy of Deterministic Tree Languages
2006	On counting homomorphisms to directed acyclic graphs
2005	Tight Lower Bounds for Query Processing on Streaming and External Memory Data
2005	Simple Extractors Via Constructions of Cryptographic Pseudo-random Generators
2004	Quantum query complexity of some graph problems
2004	Tree-Walking Automata Cannot Be Determinized
2003	The cell probe complexity of succint data structures
2003	A testing scenario for probabilistic automata
2002	Inapproximability Results for Equations over Finite Groups
2001	Division is in Uniform TC0
2001	Effective Lossy Queue Languages
2000	Deterministic algorithms for k-SAT based on covering codes and local search
2000	Reasoning about idealized Algol using regular languages
2000	An optimal minimum spanning tree algorithm

People who viewed this also viewed

CCF	ICORE	CP-I	Short	Full Name	Submission	Conference
C	A	78.8	ICSA	IEEE International Conference on Software Architecture	2026-10-30	2027-03-08
C		87.4	ICC	International Conference on Communications	2026-10-02	2027-05-30
B	A	91.1	AAMAS	International Joint Conference on Autonomous Agents and Multi-agent Systems	2026-10-01	2027-05-03
B	A	89.4	NAACL	Annual Conference of the North American Chapter of the Association for Computational Linguistics	2026-10-12	2027-06-01

Related Conferences

CCF	ICORE	CP-I	Short	Full Name	Submission	Conference
		41.6	Programming	International Conference on the Art, Science, and Engineering of Programming		2027-03-15
B	A*	89.7	ICRA	International Conference on Robotics and Automation	2026-09-15	2027-05-24
B	A*	94.1	IJCAI	International Joint Conference on Artificial Intelligence	2026-01-31	2026-08-15
B		91.2	ICASSP	International Conference on Acoustics, Speech and Signal Processing	2026-09-16	2027-05-16
B	A*	79.6	PODS	ACM SIGMOD Conference on Principles of DB Systems	2026-12-03	2027-06-13
B	A	76.5	ICME	International Conference on Multimedia and Expo	2025-12-31	2026-07-05
B		84.4	BIBM	International Conference on Bioinformatics & Biomedicine	2026-07-05	2026-12-01
B	A*	94.1	ICDM	International Conference on Data Mining	2026-06-06	2026-11-12
B	A*	89.0	ECCV	European Conference on Computer Vision	2026-03-06	2026-09-08
B	A	92.9	DATE	Design, Automation and Test in Europe	2026-09-07	2027-03-22

Related Journals

CCF	Full Name	Impact Factor	Publisher	ISSN
	Programming and Computer Software	0.5	Springer	0361-7688
	Journal of Visual Languages and Computing		Elsevier	1045-926X
B	Software & Systems Modeling	3.2	Springer	1619-1366
B	Pattern Recognition	7.6	Elsevier	0031-3203
B	IEEE Transactions on Neural Networks and Learning Systems	8.9	IEEE	1045-9227
B	Information Sciences	6.0	Elsevier	0020-0255
B	Computer Networks	4.7	Elsevier	1389-1286
B	Computers & Security	5.4	Elsevier	0167-4048
B	IEEE Transactions on Intelligent Transportation Systems	8.4	IEEE	1524-9050
B	Journal of Systems and Software	3.8	Elsevier	0164-1212

Comments 0

No comments yet.

Please Login to post a comment