Call for paper 〔OPEN〕

My submissions

Registration 〔OPEN〕

My tickets


This symposium focuses on research topics related to efficient algorithms and data structures for discrete problems. In addition to the design of such methods and structures, the scope also includes their use, performance analysis, and the mathematical problems related to their development or limitations. Performance analyses may be analytical or experimental and may address worst-case or expected-case performance. Studies can be theoretical or based on data sets that have arisen in practice and may address methodological issues involved in performance analysis.

Call for paper

Submission Topics

Themes and application areas include, but are not limited to, the following topics:

  1. Aspects of Combinatorics and Discrete Mathematics, such as:
  2. Algebra
  3. Combinatorial Structures
  4. Discrete Optimization
  5. Discrete Probability
  6. Finite Metric Spaces
  7. Graph Theory
  8. Mathematical Programming
  9. Number Theory
  10. Random Structures
  11. Topological Problems
  12. Aspects of Computer Science, such as:
  13. Algorithm Analysis and Complexity
  14. Algorithmic Game Theory
  15. Algorithmic Mechanism Design
  16. Combinatorial Scientific Computing
  17. Communication Networks and the Internet
  18. Computational Geometry & Topology
  19. Computer Graphics and Computer Vision
  20. Computer Systems
  21. Cryptography and Computer Security
  22. Data Compression
  23. Data Structures
  24. Databases and Information Retrieval
  25. Distributed and Parallel Computing
  26. Experimental Algorithmics
  27. Machine Learning
  28. Quantum Computing
  29. Robotics
  30. Symbolic Computation
  31. Applications in the Sciences and Business such as:
  32. Bioinformatics
  33. Economics
  34. Finance
  35. Manufacturing
  36. Physics
  37. Sociology
Submit Comment
Verify Code Change Another
All Comments
Important Date
  • Conference Date

    Jan 10



    Jan 12


Sponsored By
Contact Information
Previous Conferences