Nate Veldt
Scholar

Nate Veldt

Google Scholar ID: 6is0_9wAAAAJ
Texas A&M University
AlgorithmsCombinatorial OptimizationNetwork ScienceGraph AlgorithmsData Science
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
1,077
 
H-index
15
 
i10-index
21
 
Publications
20
 
Co-authors
33
list available
Contact
CVOpen ↗TwitterOpen ↗GitHubOpen ↗
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
Resume (English only)
Co-authors
33 total
Co-author 1
Co-author 1
David Gleich
David Gleich
Purdue University
Jon Kleinberg
Jon Kleinberg
Professor of Computer Science, Cornell University
Co-author 4
Co-author 4
Ilya Amburg
Ilya Amburg
Rochester Institute of Technology; Pacific Northwest National Laboratory
Phil Chodrow
Phil Chodrow
Assistant Professor of Computer Science, Middlebury College
Co-author 7
Co-author 7
Co-author 8
Co-author 8