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 16 to 18, 2017. The fourth CALDAM was organized by the Department of Computer Science Engineering, Indian Institute of Technology, Guwahati (IIT Guwahati) from February 15 to 17, 2018.
The proceedings of accepted papers (CALDAM 2015, CALDAM 2016, CALDAM 2017, CALDAM 2018) 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 fifth CALDAM (CALDAM 2019) will be organized by the Department of Computer Science & Engineering, IIT Kharagpur from 14th to 16th of February 2019. As in earlier CALDAMs, it is planned to publish the proceedings of accepted papers of CALDAM 2019 in the Lecture Notes in Computer Science by Springer. Also, it is planned to publish the selected papers of CALDAM 2019 as a special issue of Discrete Applied Mathematics (DAM), as in previous CALDAMs.
The conference focuses on topics related to efficient algorithms and data structures, their analysis (both theoretical and experimental), the mathematical problems arising thereof, new applications of discrete mathematics, advances in existing applications, and the 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 Algorithms
- Graph Theory
- Discrete Geometry