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
Most published authors
ICALP papers
4,916 records sourced from DBLP. Search titles, filter by year, sort by recency.
| Year | Title | Authors |
|---|---|---|
| 2018 | A Faster FPTAS for #Knapsack. | Pawel Gawrychowski, Liran Markin, Oren Weimann |
| 2018 | A Faster Construction of Greedy Consensus Trees. | Pawel Gawrychowski, Gad M. Landau, Wing-Kin Sung, Oren Weimann |
| 2018 | Improved Bounds for Shortest Paths in Dense Distance Graphs. | Pawel Gawrychowski, Adam Karczmarz |
| 2018 | ARRIVAL: Next Stop in CLS. | Bernd Grtner, Thomas Dueholm Hansen, Pavel Hubcek, Karel Krl, Hagar Mosaad, Veronika Slvov |
| 2018 | Quasi-PTAS for Scheduling with Precedences using LP Hierarchies. | Shashwat Garg |
| 2018 | High Probability Frequency Moment Sketches. | Sumit Ganguly, David P. Woodruff |
| 2018 | Randomized Sliding Window Algorithms for Regular Languages. | Moses Ganardi, Danny Hucke, Markus Lohrey |
| 2018 | Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering. | Buddhima Gamlath, Sangxia Huang, Ola Svensson |
| 2018 | First-Order Interpretations of Bounded Expansion Classes. | Jakub Gajarsk, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk |
| 2018 | A PTAS for a Class of Stochastic Dynamic Programs. | Hao Fu, Jian Li, Pan Xu |
| 2018 | Noise-Tolerant Testing of High Entanglement of Formation. | Rotem Arnon Friedman, Henry Yuen |
| 2018 | Costs and Rewards in Priced Timed Automata. | Martin Frnzle, Mahsa Shirmohammadi, Mani Swaminathan, James Worrell |
| 2018 | Finding Cliques in Social Networks: A New Distribution-Free Model. | Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein |
| 2018 | Towards Blackbox Identity Testing of Log-Variate Circuits. | Michael A. Forbes, Sumanta Ghosh, Nitin Saxena |
| 2018 | Parameterized Low-Rank Binary Matrix Approximation. | Fedor V. Fomin, Petr A. Golovach, Fahad Panolan |
| 2018 | A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error. | Hendrik Fichtenberger, Reut Levi, Yadu Vasudev, Maximilian Wtzel |
| 2018 | Fully-Dynamic Bin Packing with Little Repacking. | Bjrn Feldkord, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar, Sren Riechers, David Wajc |
| 2018 | On the Probe Complexity of Local Computation Algorithms. | Uriel Feige, Boaz Patt-Shamir, Shai Vardi |
| 2018 | Reachability Switching Games. | John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani |
| 2018 | Faster Algorithms for Integer Programs with Block Structure. | Friedrich Eisenbrand, Christoph Hunkenschrder, Kim-Manuel Klein |
| 2018 | How to Navigate Through Obstacles?. | Eduard Eiben, Iyad A. Kanj |
| 2018 | Additive Non-Approximability of Chromatic Number in Proper Minor-Closed Classes. | Zdenek Dvork, Ken-ichi Kawarabayashi |
| 2018 | A Note on Two-Colorability of Nonuniform Hypergraphs. | Lech Duraj, Grzegorz Gutowski, Jakub Kozik |
| 2018 | Edit Distance between Unrooted Trees in Cubic Time. | Bartlomiej Dudek, Pawel Gawrychowski |
| 2018 | Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time. | Ran Duan, Hanlin Ren |
1,301–1,325 of 4,916← PreviousNext →
Comparable venues
Other A*/A conferences filed under the same field of research.
- A*SODAACM/SIAM Symposium on Discrete Algorithms
- A*STOCACM Symposium on Theory of Computing
- A*FOCSIEEE Symposium on Foundations of Computer Science
- AESAEuropean Symposium on Algorithms
- ASTACSInternational Symposium on Theoretical Aspects of Computer Science
- A*LICSIEEE Symposium on Logic in Computer Science
- AGDGraph Drawing
- AALENEXWorkshop on Algorithm Engineering and Experiments