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. The first CALDAM will be organized by the Department of Computer Science at Indian Institute of Technology, Kanpur (IIT Kanpur). CALDAM has originated from the ongoing efforts for promoting research in Algorithms and Discrete Mathematics. For details, please see here. In the future, CALDAM will be organized at venues within India every year. The proceedings of accepted papers will be published in the Lecture Notes in Computer Science by Springer.

The conference focuses on topics related to

efficient algorithms and data structures, their analysis (both theoretical and experimental) and 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):

Topics Related to Algorithms
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

Topics Related to Discrete Applied Mathematics

Algebraic Combinatorics
Design Theory
Extremal Combinatorics
Graph Theory
Topological and Analytical Techniques in Combinatorics
Probabilistic Combinatorics
Combinatorial Number Theory
Discrete Geometry
Ramsey Theory


Contact Us

Venue: Outreach Auditorium,
IIT Kanpur, Kanpur

+91 (512) 259-7638