:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Blais, Eric, Seth, Cameron
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2403.18777
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Testing Graph Properties with the Container Method
by: Blais, Eric, et al.
Published: (2023)

A Tolerant Independent Set Tester
by: Seth, Cameron
Published: (2025)

Sketching Cuts in Graphs and Hypergraphs
by: Kogan, Dmitry, et al.
Published: (2014)

Transitivity Preserving Projection in Directed Hypergraphs
by: Parsonage, Eric, et al.
Published: (2025)

Dynamic Construction of the Lovász Local Lemma
by: Haeupler, Bernhard, et al.
Published: (2026)

Johnson-Lindenstrauss Lemma Beyond Euclidean Geometry
by: Deng, Chengyuan, et al.
Published: (2025)

Learning Low Degree Hypergraphs
by: Balkanski, Eric, et al.
Published: (2022)

Nearly Space-Optimal Graph and Hypergraph Sparsification in Insertion-Only Data Streams
by: Cohen-Addad, Vincent, et al.
Published: (2025)

Approximating Traveling Salesman Problems Using a Bridge Lemma
by: Böhm, Martin, et al.
Published: (2024)

Notes on the Linear Algebraic View of Regularity Lemmas
by: Bodwin, Greg, et al.
Published: (2025)

Hyper-distance Oracles in Hypergraphs
by: Preti, Giulia, et al.
Published: (2023)

BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers
by: Wheatman, Brian, et al.
Published: (2024)

A simple algorithm for Combinatorial n-fold ILPs using the Steinitz Lemma
by: Gupta, Sushmita, et al.
Published: (2025)

A Refined Graph Container Lemma and Applications to the Hard‐Core Model on Bipartite Expanders
by: Matthew Jenssen, et al.
Published: (2026)

Property Testing of Computational Networks
by: Czumaj, Artur, et al.
Published: (2025)

New Algorithms for Incremental Minimum Spanning Trees and Temporal Graph Applications
by: Ding, Xiangyun, et al.
Published: (2025)

Hypergraph Unreliability in Quasi-Polynomial Time
by: Cen, Ruoxu, et al.
Published: (2024)

Engineering Hypergraph $b$-Matching Algorithms
by: Großmann, Ernestine, et al.
Published: (2024)

Mimicking Networks for Constrained Multicuts in Hypergraphs
by: Cho, Kyungjin, et al.
Published: (2024)

Compressing Hypergraphs using Suffix Sorting
by: Adler, Enno, et al.
Published: (2025)

Semi-Streaming Algorithms for Hypergraph Matching
by: Reinstädtler, Henrik, et al.
Published: (2025)

Efficient Parallel Algorithms for Hypergraph Matching
by: Reinstädtler, Henrik, et al.
Published: (2026)

Fully Dynamic Spectral Sparsification of Hypergraphs
by: Goranci, Gramoz, et al.
Published: (2025)

Most Juntas Saturate the Hardcore Lemma
by: Kumar, Vinayak M.
Published: (2025)

A new notion of commutativity for the algorithmic Lovász Local Lemma
by: Harris, David G., et al.
Published: (2020)

A Sampling Lovász Local Lemma for Large Domain Sizes
by: Wang, Chunyang, et al.
Published: (2023)

Almost Tight Bounds for Online Hypergraph Matching
by: Tröbst, Thorben, et al.
Published: (2024)

Overlapping and Robust Edge-Colored Clustering in Hypergraphs
by: Crane, Alex, et al.
Published: (2023)

Sublinear Edge Fault Tolerant Spanners for Hypergraphs
by: He, Jialin, et al.
Published: (2025)

Fully Dynamic Spectral Sparsification for Directed Hypergraphs
by: Forster, Sebastian, et al.
Published: (2025)

Improved Certificates for Independence Number in Semirandom Hypergraphs
by: Kothari, Pravesh, et al.
Published: (2026)

Near-Optimal Minimum Cuts in Hypergraphs at Scale
by: Chhabra, Adil, et al.
Published: (2025)

Cut Sparsification and Succinct Representation of Submodular Hypergraphs
by: Kenneth, Yotam, et al.
Published: (2023)

Online versus Offline Adversaries in Property Testing
by: Kelman, Esty, et al.
Published: (2024)

Polynomial Property Testing
by: Gishboliner, Lior, et al.
Published: (2025)

Solving Hypergraph Laplacian Systems in Almost-Linear Time
by: Yoshida, Yuichi
Published: (2026)

Near-optimal Size Linear Sketches for Hypergraph Cut Sparsifiers
by: Khanna, Sanjeev, et al.
Published: (2024)

Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs
by: Khanna, Sanjeev, et al.
Published: (2024)

FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs
by: Lanzinger, Matthias, et al.
Published: (2023)

Data Reductions for the Strong Maximum Independent Set Problem in Hypergraphs
by: Großmann, Ernestine, et al.
Published: (2026)