Scope

We solicit high-quality papers in the broad area of combinatorial algorithms. The topics include (but are not restricted to)

  • Algorithms and Data Structures (including sequential, parallel, distributed, approximation, probabilistic, randomised, and on-line algorithms)
  • Algorithms on Strings and Graphs
  • Applications (Bioinformatics, Music Analysis, Networking, and others)
  • Combinatorics on Words
  • Combinatorial Enumeration
  • Combinatorial Optimization
  • Complexity Theory
  • Computational Biology
  • Compression and Information Retrieval
  • Cryptography and Information Security
  • Decompositions and Combinatorial Designs
  • Discrete and Computational Geometry
  • Graph Drawing and Labelling
  • Graph Theory