Sci. et al. News
Important dates:
-Deadline for submissions: November 15, 2024 (AoE)
-Author notification: January 31, 2025
-Camera-ready due: February 14, 2025
Submission site: https://easychair.org/conferences/?conf=ciac2025
Event: 10 – 12 June, 2025 – LUISS University, Rome, Italy
The International Conference on Algorithms and Complexity is intended to provide a forum for researchers working in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures.
Topics:
Authors are invited to submit papers presenting original and unpublished research on algorithms and complexity. Typical areas include:
- algorithm design and analysis
- sequential, parallel, and distributed algorithms
- data structures
- computational and structural complexity
- lower bounds and limitations of algorithms
- randomized and approximation algorithms
- parameterized algorithms and parameterized complexity classes
- smoothed analysis of algorithms
- alternatives to the worst-case analysis of algorithms (e.g., algorithms with predictions)
- on-line computation and competitive analysis
- streaming algorithms
- quantum algorithms and complexity
- algorithms in algebra, geometry, number theory and combinatorics
- computational geometry
- algorithmic game theory and mechanism design
- algorithmic economics (including auctions and contests)
- computational learning theory
- computational biology and bioinformatics
- algorithmic issues in communication networks
- algorithms for discrete optimization (including convex optimization)
- algorithm engineering
All questions about submissions should be emailed to Loukas Georgiadis at [email protected]
