default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNate Veldt
Person information
- affiliation: Texas A&M University, College Station, TX, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c26]Vicente Balmaseda, Ying Xu, Yixin Cao, Nate Veldt:
Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better. ICML 2024- [c25]Nate Veldt:
Growing a Random Maximal Independent Set Produces a 2-approximate Vertex Cover. SOSA 2024: 355-362 - [c24]Alex Crane
, Brian Lavallee, Blair D. Sullivan, Nate Veldt:
Overlapping and Robust Edge-Colored Clustering in Hypergraphs. WSDM 2024: 143-151 - [c23]Yufan Huang, David F. Gleich, Nate Veldt:
Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods. WWW 2024: 881-892 - [i32]Vicente Balmaseda, Ying Xu, Yixin Cao, Nate Veldt:
Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better. CoRR abs/2404.16131 (2024) - [i31]Vedangi Bengali, Nate Veldt:
On the tractability and approximability of non-submodular cardinality-based s-t cut problems in hypergraphs. CoRR abs/2409.16195 (2024) - 2023
- [j3]Nate Veldt, Austin R. Benson, Jon M. Kleinberg:
Augmented Sparsifiers for Generalized Hypergraph Cuts. J. Mach. Learn. Res. 24: 207:1-207:50 (2023) - [c22]Vedangi Bengali, Nate Veldt:
Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling. CIKM 2023: 78-87 - [c21]Nate Veldt:
Optimal LP Rounding and Linear-Time Approximation Algorithms for Clustering Edge-Colored Hypergraphs. ICML 2023: 34924-34951 - [c20]Preston Piercey, Roger Pearce, Nate Veldt:
Coordinated Botnet Detection in Social Networks via Clustering Analysis. ICPP Workshops 2023: 192-196 - [c19]Nate Veldt:
Cut-matching Games for Generalized Hypergraph Ratio Cuts. WWW 2023: 694-704 - [i30]Nate Veldt:
Cut-matching Games for Generalized Hypergraph Ratio Cuts. CoRR abs/2301.12274 (2023) - [i29]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:
Seven open problems in applied combinatorics. CoRR abs/2303.11464 (2023) - [i28]Simon Foucart, Chunyang Liao, Nate Veldt:
On the Optimal Recovery of Graph Signals. CoRR abs/2304.00474 (2023) - [i27]Alex Crane, Brian Lavallee, Blair D. Sullivan, Nate Veldt:
Overlapping and Robust Edge-Colored Clustering in Hypergraphs. CoRR abs/2305.17598 (2023) - [i26]Vedangi Bengali, Nate Veldt:
Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling. CoRR abs/2306.04884 (2023) - [i25]Yufan Huang, David F. Gleich, Nate Veldt:
Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods. CoRR abs/2310.13792 (2023) - 2022
- [j2]Nate Veldt, Austin R. Benson, Jon M. Kleinberg:
Hypergraph Cuts with General Splitting Functions. SIAM Rev. 64(3): 650-685 (2022) - [c18]Nate Veldt:
Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds. ICML 2022: 22060-22083 - [c17]Austin R. Benson, Nate Veldt, David F. Gleich:
Fauci-Email: A JSON Digest of Anthony Fauci's Released Emails. ICWSM 2022: 1208-1217 - [c16]Ilya Amburg, Nate Veldt, Austin R. Benson:
Diverse and Experienced Group Discovery via Hypergraph Clustering. SDM 2022: 145-153 - [d1]Nate Veldt, Austin R. Benson, Jon M. Kleinberg:
Combinatorial Measures of Higher-order Homophily for Group Interaction Datasets. Zenodo, 2022
- [i24]Nate Veldt:
Optimal LP Rounding and Fast Combinatorial Algorithms for Clustering Edge-Colored Hypergraphs. CoRR abs/2208.06506 (2022) - [i23]Nate Veldt:
Growing a Random Maximal Independent Set Produces a 2-approximate Vertex Cover. CoRR abs/2209.04673 (2022) - 2021
- [c15]Nate Veldt, Austin R. Benson, Jon M. Kleinberg:
The Generalized Mean Densest Subgraph Problem. KDD 2021: 1604-1614 - [c14]Nate Veldt, Austin R. Benson, Jon M. Kleinberg:
Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components. NeurIPS 2021: 3744-3756 - [c13]Meng Liu, Nate Veldt, Haoyu Song, Pan Li, David F. Gleich:
Strongly Local Hypergraph Diffusions for Clustering and Semi-supervised Learning. WWW 2021: 2092-2103 - [i22]Philip S. Chodrow, Nate Veldt, Austin R. Benson:
Generative hypergraph clustering: from blockmodels to modularity. CoRR abs/2101.09611 (2021) - [i21]Nate Veldt, Austin R. Benson, Jon M. Kleinberg:
Higher-order Homophily is Combinatorially Impossible. CoRR abs/2103.11818 (2021) - [i20]Nate Veldt, Austin R. Benson, Jon M. Kleinberg:
The Generalized Mean Densest Subgraph Problem. CoRR abs/2106.00909 (2021) - [i19]Austin R. Benson, Nate Veldt, David F. Gleich:
fauci-email: a json digest of Anthony Fauci's released emails. CoRR abs/2108.01239 (2021) - [i18]Nate Veldt, Austin R. Benson, Jon M. Kleinberg:
Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components. CoRR abs/2110.14859 (2021) - [i17]Nate Veldt:
Faster Deterministic Approximation Algorithms for Correlation Clustering and Cluster Deletion. CoRR abs/2111.10699 (2021) - 2020
- [c12]Nate Veldt, Austin R. Benson, Jon M. Kleinberg:
Minimizing Localized Ratio Cut Objectives in Hypergraphs. KDD 2020: 1708-1718 - [c11]Nate Veldt, Anthony Wirth, David F. Gleich:
Parameterized Correlation Clustering in Hypergraphs and Bipartite Graphs. KDD 2020: 1868-1876 - [c10]Junhao Gan, David F. Gleich, Nate Veldt, Anthony Wirth, Xin Zhang:
Graph Clustering in All Parameter Regimes. MFCS 2020: 39:1-39:15 - [c9]Cameron Ruggles, Nate Veldt, David F. Gleich:
A Parallel Projection Method for Metric Constrained Optimization. CSC 2020: 43-53 - [c8]Ilya Amburg, Nate Veldt, Austin R. Benson:
Clustering in graphs and hypergraphs with categorical edge labels. WWW 2020: 706-717 - [i16]Nate Veldt, Austin R. Benson, Jon M. Kleinberg:
Hypergraph Cuts with General Splitting Functions. CoRR abs/2001.02817 (2020) - [i15]Nate Veldt, Austin R. Benson, Jon M. Kleinberg:
Localized Flow-Based Clustering in Hypergraphs. CoRR abs/2002.09441 (2020) - [i14]Nate Veldt, Anthony Wirth, David F. Gleich:
Parameterized Objectives and Algorithms for Clustering Bipartite Graphs and Hypergraphs. CoRR abs/2002.09460 (2020) - [i13]Ilya Amburg, Nate Veldt, Austin R. Benson:
Fair Clustering for Diverse and Experienced Groups. CoRR abs/2006.05645 (2020) - [i12]Austin R. Benson, Jon M. Kleinberg, Nate Veldt:
Augmented Sparsifiers for Generalized Hypergraph Cuts. CoRR abs/2007.08075 (2020) - [i11]Meng Liu, Nate Veldt, Haoyu Song, Pan Li, David F. Gleich:
Strongly Local Hypergraph Diffusions for Clustering and Semi-supervised Learning. CoRR abs/2011.07752 (2020)
2010 – 2019
- 2019
- [j1]Nate Veldt, David F. Gleich, Anthony Wirth, James Saunderson:
Metric-Constrained Optimization for Graph Clustering Algorithms. SIAM J. Math. Data Sci. 1(2): 333-355 (2019) - [c7]Nate Veldt, Christine Klymko, David F. Gleich:
Flow-Based Local Graph Clustering with Better Seed Set Inclusion. SDM 2019: 378-386 - [c6]Nate Veldt, David F. Gleich, Anthony Wirth:
Learning Resolution Parameters for Graph Clustering. WWW 2019: 1909-1919 - [i10]Cameron Ruggles, Nate Veldt, David F. Gleich:
A Parallel Projection Method for Metric Constrained Optimization. CoRR abs/1901.10084 (2019) - [i9]Nate Veldt, David F. Gleich, Anthony Wirth:
Learning Resolution Parameters for Graph Clustering. CoRR abs/1903.05246 (2019) - [i8]Junhao Gan, David F. Gleich, Nate Veldt, Anthony Wirth, Xin Zhang:
Graph Clustering in All Parameter Regimes. CoRR abs/1910.06435 (2019) - [i7]Ilya Amburg, Nate Veldt, Austin R. Benson:
Hypergraph clustering with categorical edge labels. CoRR abs/1910.09943 (2019) - 2018
- [c5]David F. Gleich, Nate Veldt, Anthony Wirth:
Correlation Clustering Generalized. ISAAC 2018: 44:1-44:13 - [c4]Nate Veldt, David F. Gleich, Anthony Wirth:
A Correlation Clustering Framework for Community Detection. WWW 2018: 439-448 - [c3]Huda Nassar, Nate Veldt, Shahin Mohammadi, Ananth Grama, David F. Gleich:
Low Rank Spectral Network Alignment. WWW 2018: 619-628 - [i6]Nate Veldt, David F. Gleich, Anthony Wirth, James Saunderson:
A Projection Method for Metric-Constrained Optimization. CoRR abs/1806.01678 (2018) - [i5]David F. Gleich, Nate Veldt, Anthony Wirth:
Correlation Clustering Generalized. CoRR abs/1809.09493 (2018) - [i4]Nate Veldt, Christine Klymko, David F. Gleich:
Flow-Based Local Graph Clustering with Better Seed Set Inclusion. CoRR abs/1811.12280 (2018) - 2017
- [c2]Nate Veldt, Anthony Ian Wirth, David F. Gleich:
Correlation Clustering with Low-Rank Matrices. WWW 2017: 1025-1034 - [i3]Nate Veldt, David F. Gleich, Anthony Wirth:
Unifying Sparsest Cut, Cluster Deletion, and Modularity Clustering Objectives with Correlation Clustering. CoRR abs/1712.05825 (2017) - 2016
- [c1]Nate Veldt, David F. Gleich, Michael W. Mahoney:
A Simple and Strongly-Local Flow-Based Method for Cut Improvement. ICML 2016: 1938-1947 - [i2]Nate Veldt, David F. Gleich, Michael W. Mahoney:
A Simple and Strongly-Local Flow-Based Method for Cut Improvement. CoRR abs/1605.08490 (2016) - [i1]Nate Veldt, Anthony Wirth, David F. Gleich:
Correlation Clustering with Low-Rank Matrices. CoRR abs/1611.07305 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-17 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
