Ajit A Diwan

Ajit A Diwan serves as a Professor in the Department of Computer Science and Engineering at the Indian Institute of Technology Bombay, where he has maintained continuous faculty membership since 1988. His work bridges theoretical computer science and discrete mathematics, with emphasis on structural graph properties and combinatorial optimization.

His academic foundation includes a B.Tech from IIT Bombay (1983) and a Ph.D. from the Tata Institute of Fundamental Research Bombay (1989). These qualifications underpin his decades-long research trajectory in discrete structures.

Diwan's research program focuses on graph theory, combinatorics, and algorithm design. He investigates decomposition theorems, factorization problems, and extremal properties of graphs, particularly examining planar graphs, cubic graphs, and cycle structures. His methodological approach combines combinatorial reasoning with algorithmic applications, contributing to fundamental understanding in discrete mathematics.

Analysis of his 23+ publications (2000-2024) reveals persistent investigation into graph decomposition patterns, with recent work exploring modular cycle constraints (2024), clique factors in graph powers (2022), and structural properties of planar cubic graphs (2022). These contributions consistently appear in premier venues like the Journal of Graph Theory and Discrete Mathematics.

Professor Diwan has mentored three Ph.D. students to completion on topics including upward planar drawings, locally connected planar graphs, and degree-constrained subgraphs. His M.Tech supervision spans five projects covering graph subdivisions, factorization in graph powers, and partitioning algorithms, demonstrating active engagement in graduate education.