Subexponential Mixing for Partition Chains on Grid-Like Graphs

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:ACM-SIAM Symposium on Discrete Algorithms (34. : 2023 : Florenz; Online) Thirty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023) ; Volume 5 of 7
1. Verfasser: Frieze, Alan (VerfasserIn)
Weitere Verfasser: Pegden, Wesley (VerfasserIn)
Pages:2023
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2023
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
Constant Approximating Parameterized k-SetCover is W[2]-Hard 2023 Lin, Bingkai
Subexponential Mixing for Partition Chains on Grid-Like Graphs 2023 Frieze, Alan
Moser-Tardos Algorithm: Beyond Shearer's Bound 2023 He, Kun
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs 2023 Focke, Jacob
Zigzagging through Acyclic Orientations of Chordal Graphs and Hypergraphs 2023 Cardinal, Jean
A Half-Integral Erdős-Pósa Theorem for Directed Odd Cycles 2023 Kawarabayashi, Ken-ichi
Graph Classes With Few Minimal Separators. I. Finite Forbidden Subgraphs 2023 Gartland, Peter
Fixed-Parameter Tractability of Directed Multicut with Three Terminal Pairs Parameterized by the Size of the Cutset: Twin-Width Meets Flow-Augmentation 2023 Hatzel, Meike
A Logic-Based Algorithmic Meta-Theorem for Mim-Width 2023 Bergougnoux, Benjamin
Robust Voting Rules from Algorithmic Robust Statistics 2023 Liu, Allen
Positivity of the Symmetric Group Characters Is as Hard as the Polynomial Time Hierarchy 2023 Ikenmeyer, Christian
Concentration of Polynomial Random Matrices via Efron-Stein Inequalities 2023 Rajendran, Goutham
Kernelization for Graph Packing Problems via Rainbow Matching 2023 Bessy, Stéphane
Sparse Graphs with Bounded Induced Cycle Packing Number Have Logarithmic Treewidth 2023 Bonamy, Marthe
Polynomial Formulations as a Barrier for Reduction-Based Hardness Proofs 2023 Belova, Tatiana
Flow-Augmentation III: Complexity Dichotomy for Boolean CSPs Parameterized by the Number of Unsatisfied Constraints 2023 Kim, Eun Jung
From Algorithms to Connectivity and Back: Finding a Giant Component in Random k-SAT 2023 Chen, Zongchen
Interactive Coding with Small Memory 2023 Efremenko, Klim
Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage 2023 Jain, Pallavi
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes 2023 Golovach, Petr A.
Alle Artikel auflisten