The International Conference on Algorithms and Discrete Applied Mathematics (CALDAM) is intended to bring together researchers working in the areas of algorithms and applied discrete mathematics and provide a high-quality forum for the dissemination and discussion of research results in these broad areas. CALDAM has originated from the ongoing efforts for promoting research in Algorithms and Discrete Mathematics.
The first CALDAM was organized by the Department of Computer Science at Indian Institute of Technology, Kanpur (IIT Kanpur) from February 8 to 10, 2015. The second CALDAM was organized by the Department of Futures Studies, University of Kerala, Thiruvananthapuram from Feburay 18 to 20, 2016. The third CALDAM was organized by the Department of Mathematics, Birla Institute of Technology and Science, Pilani (BITS Pilani),K K Birla Goa Campus, Goa, India from February 13 to 18, 2017.
The proceedings of accepted papers (CALDAM 2015, CALDAM 2016, CALDAM 2017) were published in the Lecture Notes in Computer Science by Springer. Also, selected papers are being published as a special issue of Discrete Applied Mathematics (DAM).
The fourth CALDAM (CALDAM 2018) will be organized by the Department of Computer Science & Engineering, IIT Guwahati from 15th to 17th of February 2018. The proceedings of accepted papers of CALDAM 2018 will be published in the Lecture Notes in Computer Science by Springer as was in CALDAM 2017, CALDAM 2016, and CALDAM 2015. Also, selected papers of CALDAM 2018 are likely to be published as a special issue of Discrete Applied Mathematics (DAM).
The conference focuses on topics related to efficient algorithms and data structures, their analysis (both theoretical and experimental). The mathematical problems arising thereof, and new applications of discrete mathematics, advances in existing applications and development of new tools for discrete mathematics.
A set of topics within the scope of CALDAM includes (but is not limited to):
- 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 Algorithm
- Graph Theory
- Discrete Geometry