International Conference on Algorithms and Complexity (was Italian Conference )

CIAC

CORE rank

CORE rank (raw)

Fields of research

Theory of Computation

Papers indexed

404

1994–2025

Best Theory of Computation conferences

Papers per year

199444 peak2025

Most published authors

CIAC papers

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

Year	Title	Authors
2021	Recent Advances in Competitive Analysis of Online Algorithms.	Joseph (Seffi) Naor
2021	Colouring Graphs of Bounded Diameter in the Absence of Small Cycles.	Barnaby Martin, Danil Paulusma, Siani Smith
2021	Can Local Optimality Be Used for Efficient Data Reduction?	Christian Komusiewicz, Nils Morawietz
2021	Globally Rigid Augmentation of Minimally Rigid Graphs in R	Csaba Kirly, Andrs Mihlyk
2021	Online and Approximate Network Construction from Bounded Connectivity Constraints.	Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
2021	Phylogenetic Networks, A Way to Cope with Complex Evolutionary Processes.	Katharina T. Huber
2021	Covering a Set of Line Segments with a Few Squares.	Joachim Gudmundsson, Mees van de Kerkhof, Andr van Renssen, Frank Staals, Lionov Wiratma, Sampson Wong
2021	FPT and Kernelization Algorithms for the Induced Tree Problem.	Guilherme de Castro Mendes Gomes, Vincius Fernandes dos Santos, Murilo V. G. da Silva, Jayme Luiz Szwarcfiter
2021	Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity.	Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi
2021	The Parameterized Suffix Tray.	Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021	The Weisfeiler-Leman Algorithm and Recognition of Graph Properties.	Frank Fuhlbrck, Johannes Kbler, Ilia Ponomarenko, Oleg Verbitsky
2021	A Multistage View on 2-Satisfiability.	Till Fluschnik
2021	On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering.	Aleksander Figiel, Anne-Sophie Himmel, Andr Nichterlein, Rolf Niedermeier
2021	Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-exponential Approximation.	Louis Dublois, Michael Lampis, Vangelis Th. Paschos
2021	A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs.	Rajesh Chitnis
2021	Extending Partial Representations of Rectangular Duals with Given Contact Orientations.	Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff
2021	The Multi-budget Maximum Weighted Coverage Problem.	Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj
2021	Abundant Extensions.	Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jrme Monnot, Florian Sikora
2021	Fragile Complexity of Adaptive Algorithms.	Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman
2021	Upper Tail Analysis of Bucket Sort and Random Tries.	Ioana O. Bercea, Guy Even
2021	On the Role of 3's for the 1-2-3 Conjecture.	Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney
2021	On Vertex-Weighted Graph Realizations.	Amotz Bar-Noy, Toni Bhnlein, David Peleg, Dror Rawitz
2021	Distributed Distance-r Covering Problems on Sparse High-Girth Graphs.	Saeed Akhoondian Amiri, Ben Wiederhake
2021	Algorithms for Energy Conservation in Heterogeneous Data Centers.	Susanne Albers, Jens Quedenfeld
2021	Reconfiguration of Connected Graph Partitions via Recombination.	Hugo A. Akitaya, Matias Korman, Oliver Korten, Diane L. Souvaine, Csaba D. Tth

76–100 of 404← Previous Next →

Comparable venues

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