A Simple and Strongly-Local Flow-Based Method for Cut Improvement. - Nate Veldt; David F. Gleich; Michael W. Mahoney (ICML, 2016)

Correlation Clustering with Low-Rank Matrices. - Nate Veldt; Anthony Ian Wirth; David F. Gleich (WWW, 2017)

Unifying Sparsest Cut, Cluster Deletion, and Modularity Clustering Objectives with Correlation Clustering. - Nate Veldt; David F. Gleich; Anthony Wirth (CoRR, 2017)

Correlation Clustering Generalized. - David F. Gleich; Nate Veldt; Anthony Wirth (ISAAC, 2018)

Low Rank Spectral Network Alignment. - Huda Nassar; Nate Veldt; Shahin Mohammadi; Ananth Grama; David F. Gleich (WWW, 2018)

A Correlation Clustering Framework for Community Detection. - Nate Veldt; David F. Gleich; Anthony Wirth (WWW, 2018)

A Projection Method for Metric-Constrained Optimization. - Nate Veldt; David F. Gleich; Anthony Wirth; James Saunderson (CoRR, 2018)

Flow-Based Local Graph Clustering with Better Seed Set Inclusion. - Nate Veldt; Christine Klymko; David F. Gleich (SDM, 2019)

Learning Resolution Parameters for Graph Clustering. - Nate Veldt; David F. Gleich; Anthony Wirth (WWW, 2019)

Hypergraph clustering with categorical edge labels. - Ilya Amburg; Nate Veldt; Austin R. Benson (CoRR, 2019)

Metric-Constrained Optimization for Graph Clustering Algorithms. - Nate Veldt; David F. Gleich; Anthony Wirth; James Saunderson (SIAM J. Math. Data Sci., 2019)

Minimizing Localized Ratio Cut Objectives in Hypergraphs. - Nate Veldt; Austin R. Benson; Jon M. Kleinberg (KDD, 2020)

Parameterized Correlation Clustering in Hypergraphs and Bipartite Graphs. - Nate Veldt; Anthony Wirth; David F. Gleich (KDD, 2020)

Graph Clustering in All Parameter Regimes. - Junhao Gan; David F. Gleich; Nate Veldt; Anthony Wirth; Xin Zhang 094 (MFCS, 2020)

A Parallel Projection Method for Metric Constrained Optimization. - Cameron Ruggles; Nate Veldt; David F. Gleich (CSC, 2020)

Clustering in graphs and hypergraphs with categorical edge labels. - Ilya Amburg; Nate Veldt; Austin R. Benson (WWW, 2020)

Localized Flow-Based Clustering in Hypergraphs. - Nate Veldt; Austin R. Benson; Jon M. Kleinberg (CoRR, 2020)

Parameterized Objectives and Algorithms for Clustering Bipartite Graphs and Hypergraphs. - Nate Veldt; Anthony Wirth; David F. Gleich (CoRR, 2020)

Fair Clustering for Diverse and Experienced Groups. - Ilya Amburg; Nate Veldt; Austin R. Benson (CoRR, 2020)

The Generalized Mean Densest Subgraph Problem. - Nate Veldt; Austin R. Benson; Jon M. Kleinberg (KDD, 2021)

Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components. - Nate Veldt; Austin R. Benson; Jon M. Kleinberg (NeurIPS, 2021)

Strongly Local Hypergraph Diffusions for Clustering and Semi-supervised Learning. - Meng Liu; Nate Veldt; Haoyu Song 003; Pan Li 005; David F. Gleich (WWW, 2021)

Generative hypergraph clustering: from blockmodels to modularity. - Philip S. Chodrow; Nate Veldt; Austin R. Benson (CoRR, 2021)

Higher-order Homophily is Combinatorially Impossible. - Nate Veldt; Austin R. Benson; Jon M. Kleinberg (CoRR, 2021)

Faster Deterministic Approximation Algorithms for Correlation Clustering and Cluster Deletion. - Nate Veldt (CoRR, 2021)

Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds. - Nate Veldt (ICML, 2022)

Fauci-Email: A JSON Digest of Anthony Fauci's Released Emails. - Austin R. Benson; Nate Veldt; David F. Gleich (ICWSM, 2022)

Diverse and Experienced Group Discovery via Hypergraph Clustering. - Ilya Amburg; Nate Veldt; Austin R. Benson (SDM, 2022)

Optimal LP Rounding and Fast Combinatorial Algorithms for Clustering Edge-Colored Hypergraphs. - Nate Veldt (CoRR, 2022)

Hypergraph Cuts with General Splitting Functions. - Nate Veldt; Austin R. Benson; Jon M. Kleinberg (SIAM Rev., 2022)

Combinatorial Measures of Higher-order Homophily for Group Interaction Datasets. - Nate Veldt; Austin R. Benson; Jon M. Kleinberg (Zenodo, 2022)

Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling. - Vedangi Bengali; Nate Veldt (CIKM, 2023)

Optimal LP Rounding and Linear-Time Approximation Algorithms for Clustering Edge-Colored Hypergraphs. - Nate Veldt (ICML, 2023)

Coordinated Botnet Detection in Social Networks via Clustering Analysis. - Preston Piercey; Roger Pearce; Nate Veldt (ICPP Workshops, 2023)

Cut-matching Games for Generalized Hypergraph Ratio Cuts. - Nate Veldt (WWW, 2023)

Seven open problems in applied combinatorics. - Sinan G. Aksoy; Ryan S. Bennink; Yuzhou Chen; José Frías; Yulia R. Gel; Bill Kay; Uwe Naumann; Carlos Ortiz Marrero; Anthony V. Petyuk; Sandip Roy 002; Ignacio Segovia-Dominguez; Nate Veldt; et al. (CoRR, 2023)

On the Optimal Recovery of Graph Signals. - Simon Foucart; Chunyang Liao; Nate Veldt (CoRR, 2023)

Augmented Sparsifiers for Generalized Hypergraph Cuts. - Nate Veldt; Austin R. Benson; Jon M. Kleinberg (J. Mach. Learn. Res., 2023)

Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better. - Vicente Balmaseda; Ying Xu; Yixin Cao 001; Nate Veldt (ICML, 2024)

Growing a Random Maximal Independent Set Produces a 2-approximate Vertex Cover. - Nate Veldt (SOSA, 2024)

Overlapping and Robust Edge-Colored Clustering in Hypergraphs. - Alex Crane; Brian Lavallee; Blair D. Sullivan; Nate Veldt (WSDM, 2024)

Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods. - Yufan Huang; David F. Gleich; Nate Veldt (WWW, 2024)

On the tractability and approximability of non-submodular cardinality-based s-t cut problems in hypergraphs. - Vedangi Bengali; Nate Veldt (CoRR, 2024)

Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees. - Nate Veldt; Thomas Stanley; Benjamin W. Priest; Trevor Steil; Keita Iwabuchi; T. S. Jayram; Geoffrey Sanders (CoRR, 2025)

Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges. - Alex Crane; Thomas Stanley; Blair D. Sullivan; Nate Veldt (CoRR, 2025)

The Densest SWAMP problem: subhypergraphs with arbitrary monotonic partial edge rewards. - Vedangi Bengali; Nikolaj Tatti; Iiro Kumpulainen; Florian Adriaens; Nate Veldt (CoRR, 2025)