CALDAM 2019 invites papers describing original research in the areas of design, analysis and experimental evaluation of algorithms and in discrete applied mathematics. Papers must be typeset using LaTeX/LaTeX2e and may not exceed 12 pages in LNCS style, including bibliographic references. Further details may be included in a clearly marked appendix that will be read at the discretion of the program committee. Only electronic submission is allowed. Submitted papers must describe previously unpublished work and may not be submitted concurrently to another conference with refereed proceedings or to a refereed journal. There will be Best Paper Awards of Springer for outstanding research papers.

SCOPE

The range of topics within the scope of CALDAM 2019 includes (but is not limited to) the following

CALDAM TOPICS

Approximation Algorithms | Combinatorial Algorithms | Combinatorial Optimization | Computational Biology | Computational Complexity | Computational Geometry | Data Structures | Experimental Algorithm Methodologies | Graph Algorithms | Graph Drawing | Parallel and Distributed Algorithms | Parameterized Complexity | Network Optimization | Online Algorithms | Randomized Algorithms | Combinatorics | Graph Theory | Discrete Geometry

PROCEEDINGS

The proceedings of accepted papers is planned to be be published in Lecture Notes in Computer Science (LNCS) by Springer. Also, selected papers of CALDAM 2019 are planned to be published in a special issue of Discrete Applied Mathematics (DAM) journal of Elsevier.