Nate Veldt

Nate Veldt is an Assistant Professor in the Department of Computer Science and Engineering at Texas A&M University. His research focuses on combinatorial algorithms and computational methods for data analysis, particularly in graph and network modeling. He holds a Ph.D. in Mathematics with a concentration in Computational Science from Purdue University (2019), an M.S. in Mathematics from Purdue (2017), and a B.S. in Mathematics from Wheaton College (2013).

Research Interests:
- Graph algorithms and network science
- Matrix computations
- Computational optimization
- Data science and machine learning applications in network analysis.
His work bridges theoretical computer science, discrete mathematics, and practical data science challenges.

Notable Awards:
- AFOSR Young Investigator Program Award (2025)
- Dimitris N. Chorafas Foundation Award (2019)
- NSF East Asia and Pacific Summer Institute Award (2016)

Recent Grants and Roles:
- Course development grant for a new 'Computational Methods for Network Science' course (TAMIDS, 2025)
- Co-chair of SIAM Symposium on Algorithm Engineering and Experiments (ALENEX26, 2026)
- Secretary of SIAM Activity Group on Applied and Computational Discrete Algorithms (since 2025)

Research Contributions:
Develops algorithms for hypergraph clustering, cut improvement, and network analysis. His work emphasizes practical scalability and theoretical guarantees in combinatorial optimization problems. Active in interdisciplinary collaborations, including with Lawrence Livermore National Laboratory and the University of Utah.