Skip to content

International Colloquium on Automata Languages and Programming

ICALP

A*

CORE rank

CORE rank (raw)

A*

Fields of research

Theory of Computation

Papers indexed

4,916

1972–2026

Papers per year

1972193 peak2026

ICALP papers

4,916 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2025Density of Rational Languages Under Shift Invariant Measures.Valrie Berth, Herman Goulet-Ouellet, Dominique Perrin
2025Pushing the Frontiers of Subexponential FPT Time for Feedback Vertex Set.Gatan Berthe, Marin Bougeret, Daniel Gonalves, Jean-Florent Raymond
2025Mim-Width Is paraNP-Complete.Benjamin Bergougnoux, douard Bonnet, Julien Duron
2025Counting Permutation Patterns with Multidimensional Trees.Gal Beniamini, Nir Lavee
2025On the Instance Optimality of Detecting Collisions and Subgraphs.Omri Ben-Eliezer, Tomer Grossman, Moni Naor
2025New Bounds for the Ideal Proof System in Positive Characteristic.Amik Raj Behera, Nutan Limaye, Varun Ramanathan, Srikanth Srinivasan
2025Multiparty Communication Complexity of Collision-Finding and Cutting Planes Proofs of Concise Pigeonhole Principles.Paul Beame, Michael Whitmeyer
2025The Trichotomy of Regular Property Testing.Gabriel Bathie, Nathanal Fijalkow, Corto Mascle
2025Containment for Guarded Monotone Strict NP.Alexey Barsukov, Michael Pinsker, Jakub Rydval
2025Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity.Ishan Bansal, Joe Cheriyan, Sanjeev Khanna, Miles Simmons
2025Dynamic Algorithms for Submodular Matching.Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
2025q-Partitioning Valuations: Exploring the Space Between Subadditive and Fractionally Subadditive Valuations.Kiril Bangachev, S. Matthew Weinberg
2025Robust Contraction Decomposition for Minor-Free Graphs and Its Applications.Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dniel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue
2025Shared Randomness Helps with Local Distributed Problems.Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn, Augusto Modanese, Dennis Olivetti, Mikal Rabie, Jukka Suomela, Jara Uitto
2025Testing C_k-Freeness in Bounded Admissibility Graphs.Christine Awofeso, Patrick Greaves, Oded Lachish, Amit Levi, Felix Reidl
2025Algorithms for the Diverse-k-SAT Problem: The Geometry of Satisfying Assignments.Per Austrin, Ioana O. Bercea, Mayank Goswami, Nutan Limaye, Adarsh Srinivasan
2025On the Complexity of Hazard-Free Formulas.Leah London Arazi, Amir Shpilka
2025Quantum Speedup for Sampling Random Spanning Trees.Simon Apers, Minbo Gao, Zhengfeng Ji, Chenghua Liu
2025Minimality and Computability of Languages of G-Shifts.Djamel Eddine Amir, Benjamin Hellouin de Menibus
2025A Near-Optimal Polynomial Distance Lemma over Boolean Slices.Prashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan, Madhu Sudan
2025On the Complexity of Telephone Broadcasting from Cacti to Bounded Pathwidth Graphs.Aida Aminian, Shahin Kamali, Seyed-Mohammad Seyed-Javadi, Sumedha
2025On the Quantum Time Complexity of Divide and Conquer.Jonathan Allcock, Jinge Bao, Aleksandrs Belovs, Troy Lee, Miklos Santha
2025Identifying Approximate Minimizers Under Stochastic Uncertainity.Hessa Al-Thani, Viswanath Nagarajan
2025Taming Infinity One Chunk at a Time: Concisely Represented Strategies in One-Counter MDPs.Michal Ajdarw, James C. A. Main, Petr Novotn, Mickael Randour
2025Parameterised Holant Problems.Panagiotis Aivasiliotis, Andreas Gbel, Marc Roth, Johannes Schmitt
326350 of 4,916← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.