Scholar
Nate Veldt
Google Scholar ID: 6is0_9wAAAAJ
Texas A&M University
Algorithms
Combinatorial Optimization
Network Science
Graph Algorithms
Data Science
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
1,077
H-index
15
i10-index
21
Publications
20
Co-authors
33
list available
Contact
CV
Open ↗
Twitter
Open ↗
GitHub
Open ↗
Publications
7 items
An Improved Combinatorial Algorithm for Edge-Colored Clustering in Hypergraphs
2026
Cited
0
Better Learning-Augmented Spanning Tree Algorithms via Metric Forest Completion
2026
Cited
0
A Simple and Fast $(3+varepsilon)$-approximation for Constrained Correlation Clustering
2025
Cited
0
The Densest SWAMP problem: subhypergraphs with arbitrary monotonic partial edge rewards
2025
Cited
0
Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees
2025
Cited
0
Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges
2025
Cited
0
Improved Hardness and Approximations for Cardinality-Based Minimum $s$-$t$ Cuts Problems in Hypergraphs
2024
Cited
1
Co-authors
12 total
David Gleich
Purdue University
Jon Kleinberg
Professor of Computer Science, Cornell University
Anthony Wirth
Professor, School of Computer Science, The University of Sydney
Ilya Amburg
Rochester Institute of Technology; Pacific Northwest National Laboratory
Phil Chodrow
Assistant Professor of Computer Science, Middlebury College
James Saunderson
Monash University
Pan Li
Georgia Institute of Technology, Purdue University
Michael Mahoney
Professor of Statistics, UC Berkeley
