CALDAM 2017 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.
The range of topics within the scope of CALDAM 2017 includes (but is not limited to) the following
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
Algebraic Combinatorics | Design Theory | Enumeration | Extremal Combinatorics | Graph Theory | Topological and Analytical Techniques in Combinatorics | Probabilistic Combinatorics | Combinatorial Number Theory | Discrete Geometry | Ramsey Theory
The proceedings of accepted papers will be published in Lecture Notes in Computer Science by Springer: LNCS . Also, selected papers of CALDAM 2017 are likely to be published as a special issue of Discrete Applied Mathematics (DAM).
Paper Submission : September 28, 2016, AOE October 2, 2016, AoE
Paper Submission (Final Version): October 4, 2016, 23:59:59 (AoE).
Notification of Acceptance: November 11, 2016
Camera-ready Version: November 28, 2016
Pre-Conference School: February 13-14, 2017
Conference: February 16-18, 2017
Submissions may be made using the server at Easy Chair 2017
