The International Conference on Algorithms and Complexity

Країна: Італія

Місто: Rome

Тези до: 31.10.2017

Дати: 27.05.19 — 29.05.19

Область наук: Фізико-математичні;

Е-мейл Оргкомітету: info@easyconferences.eu

Організатори: EASY CONFERENCES

 

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. The 11th International Conference on Algorithms and Complexity (CIAC 2019) will take place in Rome, Italy, on May 27-29, 2019.

Topics

Papers presenting original research in the areas of algorithms and complexity are sought, including (but not limited to):

  • sequential, parallel and distributed algorithms and data structures
  • approximation and randomized algorithms
  • graph algorithms and graph drawing
  • on-line and streaming algorithms
  • analysis of algorithms and computational complexity
  • algorithm engineering
  • web algorithms
  • exact and parameterized computation
  • algorithmic game theory
  • computational biology
  • foundations of communication networks
  • computational geometry
  • discrete optimization

Веб-сторінка конференції: http://easyconferences.eu/ciac2019/