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 conferences this year:
European Symposium on Algorithms (ESA), 2025: Weighted Matching in a Poly-streaming model,
and Semi-streaming algorithms for hypergraph matching.
The Symposium on Experimental Algorithms (SEA) 2025: A parallel algorithm for maximizing submodular functions.
ACM KDD, 2024: AGS-GNN: Attribute-guided sampling for Graph Neural Networks.
IEEE Quantum Computing and Engineering (QCE) 2024: Divide and Conquer-based quantum algorithms for maximum independent set on large separable graphs.
Two journal papers too: one on compuational chemistry and machine learning in Digital Discovery, and another on an organ-on-a-chip model in PLOS One.
Congratulations, Siddartha Das, SM Ferdous, Shivaram Gopal, Henrik Reinstadtler, Ahammed Ullah, Caitlin Whitter, Hanjing Xu, Manoja Aravindakshan, and coauthors!

Three PhD students, Siddartha Shankar Das, Abida Sanjana Shemonti, and Hanjing Xu defended their theses in the Spring and Summer of 2025. It has been a privilege to work with you! Best wishes in your future careers!

I am thankful to my students and colleagues whose work with me led to my recognition as a Fellow of the AAAS (2024). Here is the Purdue story.

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 an Intel Parallel Computing Center. More news at the column on the right.