Hemanshu Kaul

General Information

I am an associate professor in the Department of Applied Mathematics at Illinois Institute of Technology. Here is my departmental contact page.

I graduated from the Department of Mathematics, University of Illinois at Urbana-Champaign. I was a member of the Combinatorics and Graph Theory research group, and the Simulation and Optimization laboratory (a part of Operations Research at UIUC). My dissertation was co-directed by Professors Sheldon Jacobson and Douglas West.

I was an AMS Project NExT Fellow, 2007-08.

Earlier, I studied at Indian Institute of Technology, Bombay and at St. Stephen's College, Delhi.

My Curriculum Vitae.

Research Interests

I work in the fields of Discrete Mathematics and Operations Research.
My research interests lie in Graph Theory, Discrete Optimization, Discrete Geometry, Probabilistic Discrete Structures, and their interdisciplinary applications in Civil Engineering (Transportation Networks), ECE (Renewable Energy distribution), Computer Science (Network Security), Homeland Security, etc.

Discrete optimization models arise naturally in all branches of discrete mathematics and their applications. My motivation is to develop the understanding of hard optimization problems through a variety of approaches - using probabilistic and combinatorial tools to tackle problems, developing and analyzing the complexity of exact and approximation algorithms, developing both practical and theoretical aspects of heuristics, and understanding local search algorithms and multi-objective optimization. I work with collaborators in Computer Science and in Engineering to apply these methodologies to interdisciplinary applications.
My past research has included topics in Stochastic Combinatorial Optimization, Network Optimization, Exact Combinatorial Algorithms, Meta-Heuristics, Local Search Landscapes, Multi-objective Discrete Optimization.

Graph Theory is the language used to describe and study binary relations, which explains its numerous and varied applications in engineering, social sciences, and natural sciences. For nontrivial applications of graph theory, it is essential to understand the substructures (and corresponding properties) in graphs and the parameters that imply their existence. My aims in graph theory are two-fold - to deepen the theoretical understanding of graphs as discrete structures, and to apply graph-theoretic techniques to problems in other disciplines.
My past research has included topics in Graph Packing, Graph Coloring, MAX-CUT or Largest Bipartite Subgraph problem, Maximum Independent (Stable) Set problem, Maximum Planar subgraph problem, Graph Layout problems.

Here is the departmental research page at IIT.

Check out my list of Journals in discrete mathematics and related fields , which also give an indication of my research interests.

Research and Academic Activities

Conferences and Seminars Organized

Current Teaching

Curriculum Development

At IIT :

At UIUC :

Teaching Experience

At IIT :

At UIUC :

Miscellaneous

Favorite Links: Discrete Math, Operations Research and Applied Probability; General Mathematical Resources; Academic Homepages; Software Resources; General References; Newspapers, Magazines and Blogs; Weather; Books and Music; Culinary Resources; Movies and Entertainment; Puzzles and Humor; Sports; Travel; Search Engines; Urbana-Champaign.

Journals (etc.) in Discrete Mathematics and related fields -- a resource maintained by me.