Nate Veldt
8 papers · 2016–2025 · 3 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+2 more ↓ Show less ↑
🏃 Academic Marathon (9) 🧭 Keyword Pioneer 🌍 Conference Polyglot (3) 🌉 Interdisciplinary Bridge 🐣 Hot Topic Early Bird
🐝
Cross-Pollinator
(11)
🔥
Unstoppable
(5)
Conferences
ICML (6)
JMLR (1)
NIPS (1)
Top co-authors
Keywords
combinatorial optimization
(4)
graph cut
(3)
approximation algorithm
(2)
linear programming
(2)
hypergraph clustering
(2)
graph sparsification
(1)
local algorithm
(1)
cluster editing
(1)
strong triadic closure
(1)
edge-colored hypergraph
(1)
integrality gap
(1)
submodular function minimization
(1)
piecewise linear approximation
(1)
hypergraph cut
(1)
cluster deletion
(1)
linear programming rounding
(1)
max-flow min-cut
(1)
graph theory
(1)
submodular minimization
(1)
combinatorial algorithm
(1)
Papers
Approximate Forest Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees
ICML 2025
Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges
ICML 2025
Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better
ICML 2024
Augmented Sparsifiers for Generalized Hypergraph Cuts
JMLR 2023
Optimal LP Rounding and Linear-Time Approximation Algorithms for Clustering Edge-Colored Hypergraphs
ICML 2023
Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds
ICML 2022
Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components
NIPS 2021
A Simple and Strongly-Local Flow-Based Method for Cut Improvement
ICML 2016