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
2017	On the Combinatorial Power of the Weisfeiler-Lehman Algorithm.	Martin Frer
2017	Approximating Bounded Degree Deletion via Matroid Matching.	Toshihiro Fujito
2017	Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic Bounds.	Klaus-Tycho Foerster, Linus Groner, Torsten Hoefler, Michael Knig, Sascha Schmid, Roger Wattenhofer
2017	Congestion Games with Complementarities.	Matthias Feldotto, Lennart Leder, Alexander Skopalik
2017	Minimum Cost Perfect Matching with Delays for Two Sources.	Yuval Emek, Yaacov Shapiro, Yuyi Wang
2017	Weak Coverage of a Rectangular Barrier.	Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Jn Manuch, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende, Ladislav Stacho
2017	Push-Pull Block Puzzles are Hard.	Erik D. Demaine, Isaac Grosof, Jayson Lynch
2017	Linear Search with Terrain-Dependent Speeds.	Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende
2017	Parameterized Resiliency Problems via Integer Linear Programming.	Jason Crampton, Gregory Z. Gutin, Martin Kouteck, Rmi Watrigant
2017	On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality.	Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, Chia-Wei Lee, Bang Ye Wu
2017	Almost Optimal Cover-Free Families.	Nader H. Bshouty, Ariel Gabizon
2017	Assessing the Computational Complexity of Multi-layer Subgraph Detection.	Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2017	Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.	Sascha Brauer
2017	Collaboration Without Communication: Evacuating Two Robots from a Disk.	Sebastian Brandt, Felix Laufenberg, Yuezhou Lv, David Stolz, Roger Wattenhofer
2017	Improved Lower Bounds for Graph Embedding Problems.	Hans L. Bodlaender, Tom C. van der Zanden
2017	On the Complexity of Finding a Potential Community.	Cristina Bazgan, Thomas Pontoizeau, Zsolt Tuza
2017	Tracking Paths.	Aritra Banik, Matthew J. Katz, Eli Packer, Marina Simakov
2017	Completeness Results for Counting Problems with Easy Decision.	Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos
2017	Stathis Zachos at 70!	Eleni Bakali, Panagiotis Cheilaris, Dimitris Fotakis, Martin Frer, Costas D. Koutras, Euripides Markou, Christos Nomikos, Aris Pagourtzis, Christos H. Papadimitriou, Nikolaos S. Papaspyrou, Katerina Potika
2017	Temporal Flows in Temporal Networks.	Eleni C. Akrida, Jurek Czyzowicz, Leszek Gasieniec, Lukasz Kuszner, Paul G. Spirakis
2017	Paths to Trees and Cacti.	Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale
2017	Scheduling Maintenance Jobs in Networks.	Fidaa Abed, Lin Chen, Yann Disser, Martin Gro, Nicole Megow, Julie Meiner, Alexander T. Richter, Roman Rischke
2015	PSPACE-Completeness of Bloxorz and of Games with 2-Buttons.	Tom C. van der Zanden, Hans L. Bodlaender
2015	Advice Complexity of Fine-Grained Job Shop Scheduling.	David Wehner
2015	An Opportunistic Text Indexing Structure Based on Run Length Encoding.	Yuya Tamakoshi, Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

151–175 of 404← Previous Next →

Comparable venues

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