Image de couverture de livre

Twice-Ramanujan Sparsifiers

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Batson, Joshua, Spielman, Daniel A., Srivastava, Nikhil
Format:	Preprint
Publié:	2008
Sujets:	Data Structures and Algorithms Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Tight Bounds for Sparsifying Random CSPs
par: Brakensiek, Joshua, et autres
Publié: (2025)

Linear-Sized Spectral Sparsifiers and the Kadison-Singer Problem
par: Paschalidis, Phevos, et autres
Publié: (2023)

An Approximate Generalization of the Okamura-Seymour Theorem
par: Kumar, Nikhil
Publié: (2022)

Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification
par: Jeronimo, Fernando Granha, et autres
Publié: (2022)

Ranking with Multiple Objectives
par: Devanur, Nikhil R., et autres
Publié: (2024)

Online Graph Balancing and the Power of Two Choices
par: Bansal, Nikhil, et autres
Publié: (2026)

An Improved Bound for the Beck-Fiala Conjecture
par: Bansal, Nikhil, et autres
Publié: (2025)

Optimal Padded Decomposition For Bounded Treewidth Graphs
par: Filtser, Arnold, et autres
Publié: (2024)

Isomorphism for Tournaments of Small Twin Width
par: Grohe, Martin, et autres
Publié: (2023)

A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs
par: Paul-Pena, Daniel, et autres
Publié: (2022)

Near-linear time subhypergraph counting in bounded degeneracy hypergraphs
par: Paul-Pena, Daniel, et autres
Publié: (2025)

Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs
par: Paul-Pena, Daniel, et autres
Publié: (2024)

Continuous Petri Nets for Fast Yield Computation: Polynomial-Time and MILP Approaches
par: Jordon, Addie, et autres
Publié: (2025)

Solving the List Coloring Problem through a Branch-and-Price algorithm
par: Lucci, Mauro, et autres
Publié: (2023)

Pattern-Sparse Tree Decompositions in $H$-Minor-Free Graphs
par: Marx, Dániel, et autres
Publié: (2026)

Grouping Strategies on Two-Phase Methods for Bi-objective Combinatorial Optimization
par: Mota, Felipe O., et autres
Publié: (2025)

Robust Graph Isomorphism, Quadratic Assignment and VC Dimension
par: Dahan, Anatole, et autres
Publié: (2026)

Decoupling via Affine Spectral-Independence: Beck-Fiala and Komlós Bounds Beyond Banaszczyk
par: Bansal, Nikhil, et autres
Publié: (2025)

Approximating Submodular Matroid-Constrained Partitioning
par: Bérczi, Kristóf, et autres
Publié: (2025)

Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees
par: Efthymiou, Charilaos, et autres
Publié: (2023)

Feedback Vertex Set for pseudo-disk graphs in subexponential FPT time
par: Berthe, Gaétan, et autres
Publié: (2024)

The Complexity of Diameter on H-free graphs
par: Oostveen, Jelle J., et autres
Publié: (2024)

Parameterized Saga of First-Fit and Last-Fit Coloring
par: Agrawal, Akanksha, et autres
Publié: (2024)

Path Contraction Faster than $2^n$
par: Agrawal, Akanksha, et autres
Publié: (2025)

Graph Visualization for Blockchain Data
par: Dietl, Marcell, et autres
Publié: (2024)

Greedy Algorithms for Shortcut Sets and Hopsets
par: Bals, Ben, et autres
Publié: (2025)

Sorting with constraints
par: Manas, A.
Publié: (2025)

Source-Oblivious Broadcast
par: Fraigniaud, Pierre, et autres
Publié: (2025)

Functional design of efficient and parallelizable combinatorial generators using convolution
par: He, Xi, et autres
Publié: (2025)

Polynomial Kernels for Spanning Tree with Diversity Requirements
par: Golovach, Petr A., et autres
Publié: (2026)

Distance Recoloring
par: Banerjee, Niranka, et autres
Publié: (2024)

When does FTP become FPT?
par: Bentert, Matthias, et autres
Publié: (2025)

Stability in Graphs with Matroid Constraints
par: Fomin, Fedor V., et autres
Publié: (2024)

Edge Clique Partition and Cover Beyond Independence
par: Fomin, Fedor V., et autres
Publié: (2025)

Fault-Tolerant Matroid Bases
par: Bentert, Matthias, et autres
Publié: (2025)

H-Planarity and Parametric Extensions: when Modulators Act Globally
par: Fomin, Fedor V., et autres
Publié: (2025)

Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective
par: Fomin, Fedor V., et autres
Publié: (2024)

Isomorphism Testing for Graphs Excluding Small Topological Subgraphs
par: Neuen, Daniel
Publié: (2020)

Isomorphism Testing Parameterized by Genus and Beyond
par: Neuen, Daniel
Publié: (2021)

String Matching with a Dynamic Pattern
par: Monteiro, Bruno, et autres
Publié: (2025)