Kalpesh Kapoor

Professor, Teaching, Research
IIT Guwahati

Kalpesh Kapoor joined the Department of Mathematics, Indian Institute of Technology Guwahati in June 2007. He did his M.Sc. (Applied Statistics and Informatics) and M.Tech. (Computer Science and Engineering) from Indian Institute of Technoloy Bombay in 1997 and 2000, respectively. He did his PhD from London South Bank University on formal aspects of software testing. He has worked in the area of software testing, graph algorithms. His current research interest is in word combinatorics. 

Principal Investigator

Further information

Research interest in relevance of the project
Field of Expertise
Selected publications
Contact details

Research interest in relevance of the project

  • String Algorithms
  • High Performance Computing 

Field of Expertise

  • Word Combinatorics 

Selected publications

  • S. Das, K. Kapoor. Weighted Approximate Parameterized String Matching. AKCE International Journal of Graphs and Combinatorics. Elsevier. 14(1):1-12. April 2017. 
  • A. Srivastava, A. C. Nayak, K. Kapoor. On Del-Robust Primitive Words. Discrete Applied Mathematics. Elsevier. 206:115-121.  2016.
  • A. C. Nayak, A. Srivastava, K. Kapoor. On Exchange-Robust and Subst-Robust Partial Primitive Words. 17th Italian Conference on Theoretical Computer Science. September.  2016. 

Contact details


Department of Mathematics

IIT Guwahati,
Assam 781039

Phone: +91 361 258 2619

Ashok Dasmahapatra
Chivukula V. Sastri