Nate Veldt

My research focuses on combinatorial algorithms and computational methods for data analysis, especially data that can be modeled by a graph or network. This combines interests in CS theory, computational science, discrete mathematics, and various data science applications. My research is funded by the Army Research Office, the Air Force Office of Scientific Research, the Department of Energy, and by subcontracts from Lawrence Livermore National Laboratory.

I am currently looking for a postdoc to join my group starting in Fall 2026. The position will focus broadly on algorithms for analyzing large networked systems (graphs, hypergraphs, simplicial complexes), with a particular focus on randomized algorithms and techniques that better incorporate domain knowledge. Interested applicants can send application materials (CV, transcripts, and a research statement directly to me).

New and Events

• January 11-14, 2026. I had the pleasure of traveling to SIAM SODA/SOSA/ALENEX in Vancouver, Canada, where I served as PC co-chair of ALENEX, and also presented a paper at SOSA.
• December 15, 2025. I’m excited to be part of the recently funded SciDAC institute funded by the Department of Energy, on LEarning Accelerated Domain Science (LEADS). The new institute is led by Pacific Northwest National Laboratory, see a synopsis here. I will be part of a team focused on making combinatorial machine learning techniques more accessible to domain scientists.
• December 10, 2025. Vedangi Bengali successfully passed her preliminary exam. Congrats, Vedangi!
• November 3, 2025. I’m honored to receive a Montague Center for Teaching Excellence Scholar award for undergraduate teaching.
• May 8, 2025. I’m honored to have been selected for an AFOSR Young Investigator Program Award. My proposal was titled “Measuring and Enhancing Resilience in Dynamic Hypergraphs.” Read more about the research here.
• May 5, 2025. I’m excited to have received a course development grant from the Texas A&M Institute of Data Science (TAMIDS) to develop a new course on “Computational Methods for Network Science.”
• May 1, 2025. Two papers, co-authored with my student Thomas Stanley, were accepted for publication at ICML 2025, covering learning-augmented algorithms for metric MSTs (joint work with a team at Lawrence Livermore National Laboratory), and advances in clustering edge-colored hypergraphs (joint with Blair Sullivan and Alex Crane at the University of Utah).
• February 20-22, 2025. I attended the ICERM workshop on Fusing Theory and Practice of Graph Algorithms.
• January 2025. I will be serving as one of the co-chairs for the SIAM Symposium on Algorithm Engineering and Experiments (ALENEX26), to be held in Vancouver, CA in January 2026. The paper submission deadline was July 18, 2025.
• January 11-15, 2025. Traveled to New Orleans, LA, to attend SODA/SOSA/ALENEX 2025.
• January 2025. I started serving as one of the officers (specifically, the Secretary) of the SIAM Activity Group on Applied and Computational Discrete Algorithms (ACDA).

See here for earlier news.