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 |
|---|---|---|
| 2019 | Subgraph Isomorphism on Graph Classes that Exclude a Substructure. | Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden |
| 2019 | Project Games. | Vittorio Bil, Laurent Gourvs, Jrme Monnot |
| 2019 | Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints. | Ren van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche |
| 2019 | Parameterized Complexity of Diameter. | Matthias Bentert, Andr Nichterlein |
| 2019 | Parameterized Complexity of Safe Set. | Rmy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi |
| 2019 | Minimum Convex Partition of Point Sets. | Allan S. Barboza, Cid C. de Souza, Pedro J. de Rezende |
| 2019 | The Temporal Explorer Who Returns to the Base. | Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis |
| 2019 | Quadratic Vertex Kernel for Split Vertex Deletion. | Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika |
| 2017 | Linear-Time Generation of Random Chordal Graphs. | Oylum Seker, Pinar Heggernes, Tnaz Ekim, Z. Caner Taskin |
| 2017 | Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values. | Themistoklis Melissourgos, Paul G. Spirakis |
| 2017 | Rooted Uniform Monotone Minimum Spanning Trees. | Konstantinos Mastakas, Antonios Symvonis |
| 2017 | Population Protocols with Faulty Interactions: The Impact of a Leader. | Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta |
| 2017 | Perpetually Dominating Large Grids. | Ioannis Lamprou, Russell Martin, Sven Schewe |
| 2017 | Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion Games. | Pieter Kleer, Guido Schfer |
| 2017 | On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs. | Sndor Kisfaludi-Bak, Tom C. van der Zanden |
| 2017 | Structural Parameters for Scheduling with Assignment Restrictions. | Klaus Jansen, Marten Maack, Roberto Solis-Oba |
| 2017 | New Algorithmic Results for Bin Packing and Scheduling. | Klaus Jansen |
| 2017 | Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems. | Lars Jaffke, Bart M. P. Jansen |
| 2017 | Minimum Point-Overlap Labeling. | Yuya Higashikawa, Keiko Imai, Yusuke Matsumoto, Noriyoshi Sukegawa, Yusuke Yokosuka |
| 2017 | Space-Efficient Euler Partition and Bipartite Edge Coloring. | Torben Hagerup, Frank Kammer, Moritz Laudahn |
| 2017 | Approximate Maximin Share Allocations in Matroids. | Laurent Gourvs, Jrme Monnot |
| 2017 | Enumeration of Maximal Irredundant Sets for Claw-Free Graphs. | Petr A. Golovach, Dieter Kratsch, Mohamed Yosri Sayadi |
| 2017 | TFNP: An Update. | Paul W. Goldberg, Christos H. Papadimitriou |
| 2017 | Cache Oblivious Minimum Cut. | Barbara Geissmann, Lukas Gianinazzi |
| 2017 | Cost-Sharing in Generalised Selfish Routing. | Martin Gairing, Konstantinos Kollias, Grammateia Kotsialou |
126–150 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