International Conference on Algorithms and Complexity (was Italian Conference )
CIAC
C
CORE rank
CORE rank (raw)
C
Fields of research
Theory of Computation
Papers indexed
404
1994–2025
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 |
|---|---|---|
| 2015 | Orthogonal Graph Drawing with Inflexible Edges. | Thomas Blsius, Sebastian Lehmann, Ignaz Rutter |
| 2015 | A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths. | Cristina Bazgan, Andr Nichterlein, Rolf Niedermeier |
| 2015 | "Green" Barrier Coverage with Mobile Sensors. | Amotz Bar-Noy, Dror Rawitz, Peter Terlecky |
| 2013 | LP-Rounding Algorithms for the Fault-Tolerant Facility Placement Problem. | Li Yan, Marek Chrobak |
| 2013 | Sparse Linear Complementarity Problems. | Hanna Sumita, Naonori Kakimura, Kazuhisa Makino |
| 2013 | Advice Complexity of the Online Coloring Problem. | Sebastian Seibert, Andreas Sprock, Walter Unger |
| 2013 | A Faster CREW PRAM Algorithm for Computing Cartesian Trees. | Chung Keung Poon, Hao Yuan |
| 2013 | Capacitated Rank-Maximal Matchings. | Katarzyna E. Paluch |
| 2013 | A New Dynamic Graph Structure for Large-Scale Transportation Networks. | Georgia Mali, Panagiotis Michail, Andreas Paraskevopoulos, Christos D. Zaroliagis |
| 2013 | Query Complexity of Matroids. | Raghav Kulkarni, Miklos Santha |
| 2013 | Decentralized Throughput Scheduling. | Jasper de Jong, Marc Uetz, Andreas Wombacher |
| 2013 | List Coloring in the Absence of Two Subgraphs. | Petr A. Golovach, Danil Paulusma |
| 2013 | Cliques and Clubs. | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey |
| 2013 | Shortest Paths with Bundles and Non-additive Weights Is Hard. | Paul W. Goldberg, Antony McCabe |
| 2013 | Finding All Convex Cuts of a Plane Graph in Cubic Time. | Roland Glantz, Henning Meyerhenke |
| 2013 | Optimal Network Decontamination with Threshold Immunity. | Paola Flocchini, Fabrizio Luccio, Linda Pagli, Nicola Santoro |
| 2013 | Competitive Online Clique Clustering. | Aleksander Fabijan, Bengt J. Nilsson, Mia Persson |
| 2013 | Truthful Many-to-Many Assignment with Private Weights. | Bruno Escoffier, Jrme Monnot, Fanny Pascual, Olivier Spanjaard |
| 2013 | Money-Based Coordination of Network Packets. | Pavlos S. Efraimidis, Remous-Aris Koutsiamanis |
| 2013 | Succinct Permanent Is | Shlomi Dolev, Nova Fandina, Dan Gutfreund |
| 2013 | Complexity of Barrier Coverage with Relocatable Sensors in the Plane. | Stefan Dobrev, Stephane Durocher, Mohsen Eftekhari Hesari, Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende, Jorge Urrutia |
| 2013 | Improving the | Yann Disser, Andreas Emil Feldmann, Max Klimm, Mats Mihalk |
| 2013 | New Results on Stabbing Segments with a Polygon. | Jos Miguel Daz-Bez, Matias Korman, Pablo Prez-Lantero, Alexander Pilz, Carlos Seara, Rodrigo I. Silveira |
| 2013 | Linear Time Distributed Swap Edge Algorithms. | Ajoy Kumar Datta, Lawrence L. Larmore, Linda Pagli, Giuseppe Prencipe |
| 2013 | Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas. | Evgeny Dantsin, Alexander Wolpert |
201–225 of 404← PreviousNext →
Comparable venues
Other A*/A conferences filed under the same field of research.
- A*SODAACM/SIAM Symposium on Discrete Algorithms
- A*ICALPInternational Colloquium on Automata Languages and Programming
- 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