CALDAM 2015 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.

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. Special issues on CALDAM 2015 are likely to be published in reputed international journals.

Paper Submission: Authors should submit the first version by September 18 20, 2014, AOE.

Submission of the first version closes on September 21 23:59:59 (Indian Standard Time).

Final Version Submission: September 25, 2014, AOE.

Notification of Acceptance: November 4, 2014

Camera-ready Version: November 21, 2014,

Conference: February 8-10, 2015

Submissions may be made using the server at https://www.easychair.org/conferences/?conf=caldam2015