Nate Veldt - RankMe

73 papers A* 19A 6B 2Journal 41Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	—	`conf`	A Simple and Fast (3 + ε)-approximation for Constrained Correlation Clustering. SOSA Nate Veldt
2026	A*	`conf`	An Improved Combinatorial Algorithm for Edge-Colored Clustering in Hypergraphs. WWW Seongjune Han, Nate Veldt
2026	J	`jnl`	An Improved Combinatorial Algorithm for Edge-Colored Clustering in Hypergraphs. CoRR Seongjune Han, Nate Veldt
2026	J	`jnl`	Better Learning-Augmented Spanning Tree Algorithms via Metric Forest Completion. CoRR Nate Veldt, Thomas Stanley, Benjamin W. Priest, Trevor Steil, Keita Iwabuchi, T. S. Jayram, Grace J. Li, Geoffrey Sanders
2026	A	`ed.`	Proceedings of the 28th Symposium on Algorithm Engineering and Experiments, ALENEX 2026, Vancouver, BC, Canada, January 11-12, 2026 ALENEX Rezaul Chowdhury, Simon J. Puglisi, Bin Ren, Nate Veldt
2025	J	`jnl`	A Simple and Fast (3+ϵ)-approximation for Constrained Correlation Clustering. CoRR Nate Veldt
2025	A*	`conf`	Approximate Forest Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees. ICML Nate Veldt, Thomas Stanley, Benjamin W. Priest, Trevor Steil, Keita Iwabuchi, T. S. Jayram, Geoffrey Sanders
2025	J	`jnl`	Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees. CoRR Nate Veldt, Thomas Stanley, Benjamin W. Priest, Trevor Steil, Keita Iwabuchi, T. S. Jayram, Geoffrey Sanders
2025	A*	`conf`	Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges. ICML Alex Crane, Thomas Stanley, Blair D. Sullivan, Nate Veldt
2025	J	`jnl`	Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges. CoRR Alex Crane, Thomas Stanley, Blair D. Sullivan, Nate Veldt
2025	—	`conf`	The Densest SWAMP Problem: Subhypergraphs with Arbitrary Monotonic Partial Edge Rewards. ECML/PKDD (3) Vedangi Bengali, Nikolaj Tatti, Iiro Kumpulainen, Florian Adriaens, Nate Veldt
2025	J	`jnl`	The Densest SWAMP problem: subhypergraphs with arbitrary monotonic partial edge rewards. CoRR Vedangi Bengali, Nikolaj Tatti, Iiro Kumpulainen, Florian Adriaens, Nate Veldt
2024	A*	`conf`	Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better. ICML Vicente Balmaseda, Ying Xu, Yixin Cao, Nate Veldt
2024	J	`jnl`	Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better. CoRR Vicente Balmaseda, Ying Xu, Yixin Cao, Nate Veldt
2024	A*	`conf`	Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods. WWW Yufan Huang, David F. Gleich, Nate Veldt
2024	—	`conf`	Growing a Random Maximal Independent Set Produces a 2-approximate Vertex Cover. SOSA Nate Veldt
2024	J	`jnl`	On the tractability and approximability of non-submodular cardinality-based CoRR Vedangi Bengali, Nate Veldt
2024	A	`conf`	Overlapping and Robust Edge-Colored Clustering in Hypergraphs. WSDM Alex Crane, Brian Lavallee, Blair D. Sullivan, Nate Veldt
2023	J	`jnl`	Augmented Sparsifiers for Generalized Hypergraph Cuts. J. Mach. Learn. Res. Nate Veldt, Austin R. Benson, Jon M. Kleinberg
2023	—	`conf`	Coordinated Botnet Detection in Social Networks via Clustering Analysis. ICPP Workshops Preston Piercey, Roger Pearce, Nate Veldt
2023	A*	`conf`	Cut-matching Games for Generalized Hypergraph Ratio Cuts. WWW Nate Veldt
2023	J	`jnl`	Cut-matching Games for Generalized Hypergraph Ratio Cuts. CoRR Nate Veldt
2023	J	`jnl`	Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods. CoRR Yufan Huang, David F. Gleich, Nate Veldt
2023	A	`conf`	Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling. CIKM Vedangi Bengali, Nate Veldt
2023	J	`jnl`	Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling. CoRR Vedangi Bengali, Nate Veldt
2023	J	`jnl`	On the Optimal Recovery of Graph Signals. CoRR Simon Foucart, Chunyang Liao, Nate Veldt
2023	A*	`conf`	Optimal LP Rounding and Linear-Time Approximation Algorithms for Clustering Edge-Colored Hypergraphs. ICML Nate Veldt
2023	J	`jnl`	Overlapping and Robust Edge-Colored Clustering in Hypergraphs. CoRR Alex Crane, Brian Lavallee, Blair D. Sullivan, Nate Veldt
2023	J	`jnl`	Seven open problems in applied combinatorics. CoRR 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, Ignacio Segovia-Dominguez, Nate Veldt, Stephen J. Young
2022	A*	`conf`	Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds. ICML Nate Veldt
2022	A	`conf`	Diverse and Experienced Group Discovery via Hypergraph Clustering. SDM Ilya Amburg, Nate Veldt, Austin R. Benson
2022	A	`conf`	Fauci-Email: A JSON Digest of Anthony Fauci's Released Emails. ICWSM Austin R. Benson, Nate Veldt, David F. Gleich
2022	J	`jnl`	Growing a Random Maximal Independent Set Produces a 2-approximate Vertex Cover. CoRR Nate Veldt
2022	J	`jnl`	Hypergraph Cuts with General Splitting Functions. SIAM Rev. Nate Veldt, Austin R. Benson, Jon M. Kleinberg
2022	J	`jnl`	Optimal LP Rounding and Fast Combinatorial Algorithms for Clustering Edge-Colored Hypergraphs. CoRR Nate Veldt
2021	A*	`conf`	Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components. NeurIPS Nate Veldt, Austin R. Benson, Jon M. Kleinberg
2021	J	`jnl`	Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components. CoRR Nate Veldt, Austin R. Benson, Jon M. Kleinberg
2021	J	`jnl`	Faster Deterministic Approximation Algorithms for Correlation Clustering and Cluster Deletion. CoRR Nate Veldt
2021	J	`jnl`	Generative hypergraph clustering: from blockmodels to modularity. CoRR Philip S. Chodrow, Nate Veldt, Austin R. Benson
2021	J	`jnl`	Higher-order Homophily is Combinatorially Impossible. CoRR Nate Veldt, Austin R. Benson, Jon M. Kleinberg
2021	A*	`conf`	Strongly Local Hypergraph Diffusions for Clustering and Semi-supervised Learning. WWW Meng Liu, Nate Veldt, Haoyu Song, Pan Li, David F. Gleich
2021	A*	`conf`	The Generalized Mean Densest Subgraph Problem. KDD Nate Veldt, Austin R. Benson, Jon M. Kleinberg
2021	J	`jnl`	The Generalized Mean Densest Subgraph Problem. CoRR Nate Veldt, Austin R. Benson, Jon M. Kleinberg
2021	J	`jnl`	fauci-email: a json digest of Anthony Fauci's released emails. CoRR Austin R. Benson, Nate Veldt, David F. Gleich
2020	—	`conf`	A Parallel Projection Method for Metric Constrained Optimization. CSC Cameron Ruggles, Nate Veldt, David F. Gleich
2020	J	`jnl`	Augmented Sparsifiers for Generalized Hypergraph Cuts. CoRR Austin R. Benson, Jon M. Kleinberg, Nate Veldt
2020	A*	`conf`	Clustering in graphs and hypergraphs with categorical edge labels. WWW Ilya Amburg, Nate Veldt, Austin R. Benson
2020	J	`jnl`	Fair Clustering for Diverse and Experienced Groups. CoRR Ilya Amburg, Nate Veldt, Austin R. Benson
2020	B	`conf`	Graph Clustering in All Parameter Regimes. MFCS Junhao Gan, David F. Gleich, Nate Veldt, Anthony Wirth, Xin Zhang
2020	J	`jnl`	Hypergraph Cuts with General Splitting Functions. CoRR Nate Veldt, Austin R. Benson, Jon M. Kleinberg
2020	J	`jnl`	Localized Flow-Based Clustering in Hypergraphs. CoRR Nate Veldt, Austin R. Benson, Jon M. Kleinberg
2020	A*	`conf`	Minimizing Localized Ratio Cut Objectives in Hypergraphs. KDD Nate Veldt, Austin R. Benson, Jon M. Kleinberg
2020	A*	`conf`	Parameterized Correlation Clustering in Hypergraphs and Bipartite Graphs. KDD Nate Veldt, Anthony Wirth, David F. Gleich
2020	J	`jnl`	Parameterized Objectives and Algorithms for Clustering Bipartite Graphs and Hypergraphs. CoRR Nate Veldt, Anthony Wirth, David F. Gleich
2020	J	`jnl`	Strongly Local Hypergraph Diffusions for Clustering and Semi-supervised Learning. CoRR Meng Liu, Nate Veldt, Haoyu Song, Pan Li, David F. Gleich
2019	J	`jnl`	A Parallel Projection Method for Metric Constrained Optimization. CoRR Cameron Ruggles, Nate Veldt, David F. Gleich
2019	A	`conf`	Flow-Based Local Graph Clustering with Better Seed Set Inclusion. SDM Nate Veldt, Christine Klymko, David F. Gleich
2019	J	`jnl`	Graph Clustering in All Parameter Regimes. CoRR Junhao Gan, David F. Gleich, Nate Veldt, Anthony Wirth, Xin Zhang
2019	J	`jnl`	Hypergraph clustering with categorical edge labels. CoRR Ilya Amburg, Nate Veldt, Austin R. Benson
2019	A*	`conf`	Learning Resolution Parameters for Graph Clustering. WWW Nate Veldt, David F. Gleich, Anthony Wirth
2019	J	`jnl`	Learning Resolution Parameters for Graph Clustering. CoRR Nate Veldt, David F. Gleich, Anthony Wirth
2019	J	`jnl`	Metric-Constrained Optimization for Graph Clustering Algorithms. SIAM J. Math. Data Sci. Nate Veldt, David F. Gleich, Anthony Wirth, James Saunderson
2018	A*	`conf`	A Correlation Clustering Framework for Community Detection. WWW Nate Veldt, David F. Gleich, Anthony Wirth
2018	J	`jnl`	A Projection Method for Metric-Constrained Optimization. CoRR Nate Veldt, David F. Gleich, Anthony Wirth, James Saunderson
2018	B	`conf`	Correlation Clustering Generalized. ISAAC David F. Gleich, Nate Veldt, Anthony Wirth
2018	J	`jnl`	Correlation Clustering Generalized. CoRR David F. Gleich, Nate Veldt, Anthony Wirth
2018	J	`jnl`	Flow-Based Local Graph Clustering with Better Seed Set Inclusion. CoRR Nate Veldt, Christine Klymko, David F. Gleich
2018	A*	`conf`	Low Rank Spectral Network Alignment. WWW Huda Nassar, Nate Veldt, Shahin Mohammadi, Ananth Grama, David F. Gleich
2017	A*	`conf`	Correlation Clustering with Low-Rank Matrices. WWW Nate Veldt, Anthony Ian Wirth, David F. Gleich
2017	J	`jnl`	Unifying Sparsest Cut, Cluster Deletion, and Modularity Clustering Objectives with Correlation Clustering. CoRR Nate Veldt, David F. Gleich, Anthony Wirth
2016	A*	`conf`	A Simple and Strongly-Local Flow-Based Method for Cut Improvement. ICML Nate Veldt, David F. Gleich, Michael W. Mahoney
2016	J	`jnl`	A Simple and Strongly-Local Flow-Based Method for Cut Improvement. CoRR Nate Veldt, David F. Gleich, Michael W. Mahoney
2016	J	`jnl`	Correlation Clustering with Low-Rank Matrices. CoRR Nate Veldt, Anthony Wirth, David F. Gleich