Original research papers in the areas of algorithms, theory of computation, computational complexity, and combinatorics related to computing are solicited. In addition to theoretical results, we are particularly interested in submissions that report on experimental and applied research of general algorithmic interest.
Special consideration will be given to research that is motivated by real-world problems. Experimental and applied papers are expected to show convincingly the usefulness and efficiency of the algorithms discussed in a practical setting.
The program topics include but not limited to:
- Algorithms and Data Structures
- Algorithmic Game Theory
- Approximation Algorithms and Online Algorithms
- Automata, Languages, Logic, and Computability
- Complexity Theory
- Computational Learning Theory and Knowledge Discovery
- Cryptography, Reliability and Security, and Database Theory
- Computational Biology and Bioinformatics
- Computational Algebra, Geometry, and Number Theory
- Graph Drawing and Information Visualization
- Graph Theory, Communication Networks, and Optimization
- Parallel and Distributed Computing