Nate Veldt

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 59

Top Topics

Correlation Clustering

Approximation Algorithms

Top Venues

Publications

Yufan Huang, David F. Gleich, Nate Veldt
Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods. WWW (2024)
Alex Crane, Brian Lavallee, Blair D. Sullivan, Nate Veldt
Overlapping and Robust Edge-Colored Clustering in Hypergraphs. WSDM (2024)
Vicente Balmaseda, Ying Xu, Yixin Cao, Nate Veldt
Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better. CoRR (2024)
Nate Veldt
Growing a Random Maximal Independent Set Produces a 2-approximate Vertex Cover. SOSA (2024)
Simon Foucart, Chunyang Liao, Nate Veldt
On the Optimal Recovery of Graph Signals. CoRR (2023)
Alex Crane, Brian Lavallee, Blair D. Sullivan, Nate Veldt
Overlapping and Robust Edge-Colored Clustering in Hypergraphs. CoRR (2023)
Nate Veldt
Cut-matching Games for Generalized Hypergraph Ratio Cuts. CoRR (2023)
Vedangi Bengali, Nate Veldt
Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling. CoRR (2023)
Yufan Huang, David F. Gleich, Nate Veldt
Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods. CoRR (2023)
Nate Veldt
Cut-matching Games for Generalized Hypergraph Ratio Cuts. WWW (2023)
Preston Piercey, Roger Pearce, Nate Veldt
Coordinated Botnet Detection in Social Networks via Clustering Analysis. ICPP Workshops (2023)
Nate Veldt, Austin R. Benson, Jon M. Kleinberg
Augmented Sparsifiers for Generalized Hypergraph Cuts. J. Mach. Learn. Res. 24 (2023)
Nate Veldt
Optimal LP Rounding and Linear-Time Approximation Algorithms for Clustering Edge-Colored Hypergraphs. ICML (2023)
Sinan G. Aksoy, Ryan Bennink, Yuzhou Chen, José Frías, Yulia R. Gel, Bill Kay, Uwe Naumann, Carlos Ortiz Marrero, Anthony V. Petyuk, Sandip Roy, Ignacio Segovia-Dominguez, Nate Veldt, Stephen J. Young
Seven open problems in applied combinatorics. CoRR (2023)
Vedangi Bengali, Nate Veldt
Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling. CIKM (2023)
Ilya Amburg, Nate Veldt, Austin R. Benson
Diverse and Experienced Group Discovery via Hypergraph Clustering. SDM (2022)
Nate Veldt
Optimal LP Rounding and Fast Combinatorial Algorithms for Clustering Edge-Colored Hypergraphs. CoRR (2022)
Nate Veldt
Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds. ICML (2022)
Nate Veldt, Austin R. Benson, Jon M. Kleinberg
Hypergraph Cuts with General Splitting Functions. SIAM Rev. 64 (3) (2022)
Austin R. Benson, Nate Veldt, David F. Gleich
Fauci-Email: A JSON Digest of Anthony Fauci's Released Emails. ICWSM (2022)
Nate Veldt
Growing a Random Maximal Independent Set Produces a 2-approximate Vertex Cover. CoRR (2022)
Nate Veldt, Austin R. Benson, Jon M. Kleinberg
The Generalized Mean Densest Subgraph Problem. CoRR (2021)
Nate Veldt, Austin R. Benson, Jon M. Kleinberg
Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components. CoRR (2021)
Nate Veldt, Austin R. Benson, Jon M. Kleinberg
The Generalized Mean Densest Subgraph Problem. KDD (2021)
Austin R. Benson, Nate Veldt, David F. Gleich
fauci-email: a json digest of Anthony Fauci's released emails. CoRR (2021)
Nate Veldt, Austin R. Benson, Jon M. Kleinberg
Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components. NeurIPS (2021)
Nate Veldt
Faster Deterministic Approximation Algorithms for Correlation Clustering and Cluster Deletion. CoRR (2021)
Philip S. Chodrow, Nate Veldt, Austin R. Benson
Generative hypergraph clustering: from blockmodels to modularity. CoRR (2021)
Nate Veldt, Austin R. Benson, Jon M. Kleinberg
Higher-order Homophily is Combinatorially Impossible. CoRR (2021)
Meng Liu, Nate Veldt, Haoyu Song, Pan Li, David F. Gleich
Strongly Local Hypergraph Diffusions for Clustering and Semi-supervised Learning. WWW (2021)
Ilya Amburg, Nate Veldt, Austin R. Benson
Clustering in graphs and hypergraphs with categorical edge labels. WWW (2020)
Nate Veldt, Austin R. Benson, Jon M. Kleinberg
Hypergraph Cuts with General Splitting Functions. CoRR (2020)
Nate Veldt, Anthony Wirth, David F. Gleich
Parameterized Correlation Clustering in Hypergraphs and Bipartite Graphs. KDD (2020)
Ilya Amburg, Nate Veldt, Austin R. Benson
Fair Clustering for Diverse and Experienced Groups. CoRR (2020)
Nate Veldt, Anthony Wirth, David F. Gleich
Parameterized Objectives and Algorithms for Clustering Bipartite Graphs and Hypergraphs. CoRR (2020)
Cameron Ruggles, Nate Veldt, David F. Gleich
A Parallel Projection Method for Metric Constrained Optimization. CSC (2020)
Junhao Gan, David F. Gleich, Nate Veldt, Anthony Wirth, Xin Zhang
Graph Clustering in All Parameter Regimes. MFCS (2020)
Meng Liu, Nate Veldt, Haoyu Song, Pan Li, David F. Gleich
Strongly Local Hypergraph Diffusions for Clustering and Semi-supervised Learning. CoRR (2020)
Austin R. Benson, Jon M. Kleinberg, Nate Veldt
Augmented Sparsifiers for Generalized Hypergraph Cuts. CoRR (2020)
Nate Veldt, Austin R. Benson, Jon M. Kleinberg
Localized Flow-Based Clustering in Hypergraphs. CoRR (2020)
Nate Veldt, Austin R. Benson, Jon M. Kleinberg
Minimizing Localized Ratio Cut Objectives in Hypergraphs. KDD (2020)
Nate Veldt, David F. Gleich, Anthony Wirth
Learning Resolution Parameters for Graph Clustering. CoRR (2019)
Nate Veldt, David F. Gleich, Anthony Wirth, James Saunderson
Metric-Constrained Optimization for Graph Clustering Algorithms. SIAM J. Math. Data Sci. 1 (2) (2019)
Junhao Gan, David F. Gleich, Nate Veldt, Anthony Wirth, Xin Zhang
Graph Clustering in All Parameter Regimes. CoRR (2019)
Cameron Ruggles, Nate Veldt, David F. Gleich
A Parallel Projection Method for Metric Constrained Optimization. CoRR (2019)
Nate Veldt, Christine Klymko, David F. Gleich
Flow-Based Local Graph Clustering with Better Seed Set Inclusion. SDM (2019)
Ilya Amburg, Nate Veldt, Austin R. Benson
Hypergraph clustering with categorical edge labels. CoRR (2019)
Nate Veldt, David F. Gleich, Anthony Wirth
Learning Resolution Parameters for Graph Clustering. WWW (2019)
Nate Veldt, David F. Gleich, Anthony Wirth, James Saunderson
A Projection Method for Metric-Constrained Optimization. CoRR (2018)
Huda Nassar, Nate Veldt, Shahin Mohammadi, Ananth Grama, David F. Gleich
Low Rank Spectral Network Alignment. WWW (2018)
David F. Gleich, Nate Veldt, Anthony Wirth
Correlation Clustering Generalized. ISAAC (2018)
David F. Gleich, Nate Veldt, Anthony Wirth
Correlation Clustering Generalized. CoRR (2018)
Nate Veldt, David F. Gleich, Anthony Wirth
A Correlation Clustering Framework for Community Detection. WWW (2018)
Nate Veldt, Christine Klymko, David F. Gleich
Flow-Based Local Graph Clustering with Better Seed Set Inclusion. CoRR (2018)
Nate Veldt, David F. Gleich, Anthony Wirth
Unifying Sparsest Cut, Cluster Deletion, and Modularity Clustering Objectives with Correlation Clustering. CoRR (2017)
Nate Veldt, Anthony Ian Wirth, David F. Gleich
Correlation Clustering with Low-Rank Matrices. WWW (2017)
Nate Veldt, David F. Gleich, Michael W. Mahoney
A Simple and Strongly-Local Flow-Based Method for Cut Improvement. ICML (2016)
Nate Veldt, Anthony Wirth, David F. Gleich
Correlation Clustering with Low-Rank Matrices. CoRR (2016)
Nate Veldt, David F. Gleich, Michael W. Mahoney
A Simple and Strongly-Local Flow-Based Method for Cut Improvement. CoRR (2016)