Alex Pothen

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), and received the George Polya prize in Applied Combinatorics for 2021. I served as the founding Chair of the SIAM Activity Group on Applied and Computational Discrete Algorithms. I have also served as the Director of the CSCAPES Institute, a pioneering research center in CSC (2006-2012), Director of Purdue's Computing Research Institute (2008-2010), and Associate Head of computer science (2015-2018).

Highlights from our research group:
The award ceremony for the George Polya prize in Applied Combinatorics for 2021 is on Wednesday July 21 at the SIAM Annual Meeting. On Youtube, SIAM has created a video on the prizes awarded at the meeting.
The transcript of an interview with my coauthors Assefaw Gebremehin, Fredrik Manne and me, discussing our work on "efficient graph coloring algorithms and codes with applications to Jacobian and Hessian matrix computations" is available as a SIAM News Spotlight.
Here is a story from Purdue News.

We have a paper in SIAM ACDA21, July 2021:
A parallel approximation algorithm for maximizing submodular b-matching.

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 paper Approximation Algorithms in Combinatorial Scientific Computing was published in Acta Numerica 2019, the journal with the highest impact factor in computational mathematics.

Here is a video of our work on surgery simulations from ACM TOG and SIGGRAPH 2016 (MP4 format).

Our research is supported by grants from NSF, Department of Energy, The Exascale Computing Project, and an Intel Parallel Computing Center. More news at the column on the right.