I am a Professor of Computer Science at Purdue. My research interests are in combinatorial scientific computing (CSC), graph algorithms, parallel computing, and bioinformatics algorithms. I am a Fellow of the Society for Industrial and Applied Mathematics (SIAM, 2018), the Association for Computing Machinery (ACM, 2022), the American Mathematical Society (AMS, 2024), and the American Association for the Advancement of Science (AAAS, 2024). I also received the George Polya prize in Applied Combinatorics for 2021 from SIAM. I have served as the founding Chair of the SIAM Activity Group on Applied and Computational Discrete Algorithms.

Highlights from our research group:
Several papers were accepted at journals and conferences recently:
ACM Conference on Knowledge Discovery and Data Mining (KDD) 2026: SGS-GNN: A supervised graph sparsifier for Graph Neural Networks.
PLOS Computational Biology, 2026: CARGO: A cytometry analysis framework via regularized graph optimal-transport.
Journal of Chemical Information and Modeling, 2026: MolSelector: A machine learning framework for interpretable subset selection from molecular science datasets.
SIAM Journal on Scientific Computing, 2026: New approximation algorithms for vertex-weighted b-matching.
European Symposium on Algorithms (ESA), 2025: Weighted Matching in a Poly-streaming model, (best paper in the compuational track)
and Semi-streaming algorithms for hypergraph matching.
The Symposium on Experimental Algorithms (SEA) 2025: A parallel algorithm for maximizing submodular functions.
IEEE Quantum Computing and Engineering (QCE) 2024: Divide and Conquer-based quantum algorithms for maximum independent set on large separable graphs.
Congratulations, Siddartha Das, Abida Sanjana Shemonti, SM Ferdous, Caitlin Whitter, Ahmed Al-Herz, Shivaram Gopal, Henrik Reinstadtler, Ahammed Ullah, Hanjing Xu, and coauthors!

Five PhD students, Siddartha Shankar Das, Abida Sanjana Shemonti, Hanjing Xu, Ahammed Ullah, and Caitlin Whitter defended their theses in 2025 and 2026. It has been a privilege to work with you! Best wishes in your future careers!

I served as the CoChair of the Program Committee for the SIAM ACDA25 conference, and the Proceedings are now available. I also gave the call-to-action talk at the SIAM Convening on Quantum Intersections in Oct. 2024; and edited a collection of articles in SIAM News (April, May 2024) introducing quantum computing to applied mathematicians. Links are in the News column on the right of this page.

Our work in the ExaGraph project on scalable graph algorithms has been featured in a podcast from the Exascale Project:
Applying graph algorithms to solve key science problems.
The story is also available from HPC Wire.

Our research is supported by grants from the Department of Energy; an NSF Industry-University Cooperative Research Center, the Center for Quantum Technology; the NSF Molecular Sciences Sofware Institute; and All State Insurance Company. More news at the column on the right.