| 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 |
| Graph Classes with Few Minimal Separators. II. A Dichotomy
|
2023 |
Gartland, Peter |
| Almost Consistent Systems of Linear Equations
|
2023 |
Dabrowski, Konrad K. |
| Deterministic Counting Lovász Local Lemma beyond Linear Programming
|
2023 |
He, Kun |
| Improved Bounds for Sampling Solutions of Random CNF Formulas
|
2023 |
He, Kun |
| Instability of Backoff Protocols with Arbitrary Arrival Rates
|
2023 |
Goldberg, Leslie Ann |
| Non-Stochastic CDF Estimation Using Threshold Queries
|
2023 |
Okoroafor, Princewill |
| Higher Degree Sum-of-Squares Relaxations Robust against Oblivious Outliers
|
2023 |
d'Orsi, Tommaso |
| Fixed-Parameter Tractability of Maximum Colored Path and Beyond
|
2023 |
Fomin, Fedor V. |
| 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 |
Tag hinzufügen