Nate Veldt

CoRR, 2024

Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods.

[BibT_eX]

[DOI]

Yufan Huang

Proceedings of the ACM on Web Conference 2024, 2024

Overlapping and Robust Edge-Colored Clustering in Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the 17th ACM International Conference on Web Search and Data Mining, 2024

Growing a Random Maximal Independent Set Produces a 2-approximate Vertex Cover.

[BibT_eX]

[DOI]

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023

Augmented Sparsifiers for Generalized Hypergraph Cuts.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2023

On the Optimal Recovery of Graph Signals.

[BibT_eX]

[DOI]

Simon Foucart

Chunyang Liao

Ignacio Segovia-Dominguez

CoRR, 2023

Seven open problems in applied combinatorics.

[BibT_eX]

[DOI]

Stephen J. Young

CoRR, 2023

Cut-matching Games for Generalized Hypergraph Ratio Cuts.

[BibT_eX]

[DOI]

Proceedings of the ACM Web Conference 2023, 2023

Coordinated Botnet Detection in Social Networks via Clustering Analysis.

[BibT_eX]

[DOI]

Preston Piercey

Roger Pearce

Proceedings of the 52nd International Conference on Parallel Processing Workshops, 2023

Optimal LP Rounding and Linear-Time Approximation Algorithms for Clustering Edge-Colored Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling.

[BibT_eX]

[DOI]

Vedangi Bengali

Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, 2023

2022

Combinatorial Measures of Higher-order Homophily for Group Interaction Datasets.

[BibT_eX]

[DOI]

Dataset, September, 2022

Hypergraph Cuts with General Splitting Functions.

[BibT_eX]

[DOI]

SIAM Rev., 2022

Optimal LP Rounding and Fast Combinatorial Algorithms for Clustering Edge-Colored Hypergraphs.

[BibT_eX]

[DOI]

CoRR, 2022

Diverse and Experienced Group Discovery via Hypergraph Clustering.

[BibT_eX]

[DOI]

Proceedings of the 2022 SIAM International Conference on Data Mining, 2022

Fauci-Email: A JSON Digest of Anthony Fauci's Released Emails.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth International AAAI Conference on Web and Social Media, 2022

Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

2021

Faster Deterministic Approximation Algorithms for Correlation Clustering and Cluster Deletion.

[BibT_eX]

[DOI]

CoRR, 2021

Higher-order Homophily is Combinatorially Impossible.

[BibT_eX]

[DOI]

CoRR, 2021

Generative hypergraph clustering: from blockmodels to modularity.

[BibT_eX]

[DOI]

Philip S. Chodrow

CoRR, 2021

Strongly Local Hypergraph Diffusions for Clustering and Semi-supervised Learning.

[BibT_eX]

[DOI]

Proceedings of the WWW '21: The Web Conference 2021, 2021

Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

The Generalized Mean Densest Subgraph Problem.

[BibT_eX]

[DOI]

Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

2020

Fair Clustering for Diverse and Experienced Groups.

[BibT_eX]

[DOI]

CoRR, 2020

Parameterized Objectives and Algorithms for Clustering Bipartite Graphs and Hypergraphs.

[BibT_eX]

[DOI]

CoRR, 2020

Localized Flow-Based Clustering in Hypergraphs.

[BibT_eX]

[DOI]

CoRR, 2020

Clustering in graphs and hypergraphs with categorical edge labels.

[BibT_eX]

[DOI]

Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

A Parallel Projection Method for Metric Constrained Optimization.

[BibT_eX]

[DOI]

Cameron Ruggles

Proceedings of the SIAM Workshop on Combinatorial Scientific Computing, 2020

Graph Clustering in All Parameter Regimes.

[BibT_eX]

[DOI]

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Parameterized Correlation Clustering in Hypergraphs and Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

Minimizing Localized Ratio Cut Objectives in Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

2019

Metric-Constrained Optimization for Graph Clustering Algorithms.

[BibT_eX]

[DOI]

SIAM J. Math. Data Sci., 2019

Hypergraph clustering with categorical edge labels.

[BibT_eX]

[DOI]

CoRR, 2019

Learning Resolution Parameters for Graph Clustering.

[BibT_eX]

[DOI]

Proceedings of the World Wide Web Conference, 2019

Flow-Based Local Graph Clustering with Better Seed Set Inclusion.

[BibT_eX]

[DOI]

Christine Klymko

Proceedings of the 2019 SIAM International Conference on Data Mining, 2019

2018

A Projection Method for Metric-Constrained Optimization.

[BibT_eX]

[DOI]

CoRR, 2018

A Correlation Clustering Framework for Community Detection.

[BibT_eX]

[DOI]

Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Low Rank Spectral Network Alignment.

[BibT_eX]

[DOI]

Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Correlation Clustering Generalized.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017

Unifying Sparsest Cut, Cluster Deletion, and Modularity Clustering Objectives with Correlation Clustering.

[BibT_eX]

[DOI]

CoRR, 2017

Correlation Clustering with Low-Rank Matrices.

[BibT_eX]

[DOI]

Anthony Ian Wirth

Proceedings of the 26th International Conference on World Wide Web, 2017

2016

A Simple and Strongly-Local Flow-Based Method for Cut Improvement.

[BibT_eX]

[DOI]