Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Nate Veldt
Texas A&M University, College Station, TX, USA
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 58 matches
- 2024
- Nate Veldt:
Growing a Random Maximal Independent Set Produces a 2-approximate Vertex Cover. SOSA 2024: 355-362 - Alex Crane, Brian Lavallee, Blair D. Sullivan, Nate Veldt:
Overlapping and Robust Edge-Colored Clustering in Hypergraphs. WSDM 2024: 143-151 - 2023
- Nate Veldt, Austin R. Benson, Jon M. Kleinberg:
Augmented Sparsifiers for Generalized Hypergraph Cuts. J. Mach. Learn. Res. 24: 207:1-207:50 (2023) - Vedangi Bengali, Nate Veldt:
Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling. CIKM 2023: 78-87 - Nate Veldt:
Optimal LP Rounding and Linear-Time Approximation Algorithms for Clustering Edge-Colored Hypergraphs. ICML 2023: 34924-34951 - Preston Piercey, Roger Pearce, Nate Veldt:
Coordinated Botnet Detection in Social Networks via Clustering Analysis. ICPP Workshops 2023: 192-196 - Nate Veldt:
Cut-matching Games for Generalized Hypergraph Ratio Cuts. WWW 2023: 694-704 - Nate Veldt:
Cut-matching Games for Generalized Hypergraph Ratio Cuts. CoRR abs/2301.12274 (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 abs/2303.11464 (2023) - Simon Foucart, Chunyang Liao, Nate Veldt:
On the Optimal Recovery of Graph Signals. CoRR abs/2304.00474 (2023) - Alex Crane, Brian Lavallee, Blair D. Sullivan, Nate Veldt:
Overlapping and Robust Edge-Colored Clustering in Hypergraphs. CoRR abs/2305.17598 (2023) - Vedangi Bengali, Nate Veldt:
Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling. CoRR abs/2306.04884 (2023) - Yufan Huang, David F. Gleich, Nate Veldt:
Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods. CoRR abs/2310.13792 (2023) - 2022
- Nate Veldt, Austin R. Benson, Jon M. Kleinberg:
Hypergraph Cuts with General Splitting Functions. SIAM Rev. 64(3): 650-685 (2022) - Nate Veldt:
Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds. ICML 2022: 22060-22083 - Austin R. Benson, Nate Veldt, David F. Gleich:
Fauci-Email: A JSON Digest of Anthony Fauci's Released Emails. ICWSM 2022: 1208-1217 - Ilya Amburg, Nate Veldt, Austin R. Benson:
Diverse and Experienced Group Discovery via Hypergraph Clustering. SDM 2022: 145-153 - Nate Veldt, Austin R. Benson, Jon M. Kleinberg:
Combinatorial Measures of Higher-order Homophily for Group Interaction Datasets. Zenodo, 2022 - Nate Veldt:
Optimal LP Rounding and Fast Combinatorial Algorithms for Clustering Edge-Colored Hypergraphs. CoRR abs/2208.06506 (2022) - Nate Veldt:
Growing a Random Maximal Independent Set Produces a 2-approximate Vertex Cover. CoRR abs/2209.04673 (2022) - 2021
- Nate Veldt, Austin R. Benson, Jon M. Kleinberg:
The Generalized Mean Densest Subgraph Problem. KDD 2021: 1604-1614 - Nate Veldt, Austin R. Benson, Jon M. Kleinberg:
Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components. NeurIPS 2021: 3744-3756 - 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 - Philip S. Chodrow, Nate Veldt, Austin R. Benson:
Generative hypergraph clustering: from blockmodels to modularity. CoRR abs/2101.09611 (2021) - Nate Veldt, Austin R. Benson, Jon M. Kleinberg:
Higher-order Homophily is Combinatorially Impossible. CoRR abs/2103.11818 (2021) - Nate Veldt, Austin R. Benson, Jon M. Kleinberg:
The Generalized Mean Densest Subgraph Problem. CoRR abs/2106.00909 (2021) - Austin R. Benson, Nate Veldt, David F. Gleich:
fauci-email: a json digest of Anthony Fauci's released emails. CoRR abs/2108.01239 (2021) - Nate Veldt, Austin R. Benson, Jon M. Kleinberg:
Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components. CoRR abs/2110.14859 (2021) - Nate Veldt:
Faster Deterministic Approximation Algorithms for Correlation Clustering and Cluster Deletion. CoRR abs/2111.10699 (2021) - 2020
- Nate Veldt, Austin R. Benson, Jon M. Kleinberg:
Minimizing Localized Ratio Cut Objectives in Hypergraphs. KDD 2020: 1708-1718
skipping 28 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-05-07 07:33 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint