scientific article; zbMATH DE number 7561552
From MaRDI portal
Publication:5091216
DOI10.4230/LIPIcs.ICALP.2019.59MaRDI QIDQ5091216
Saket Saurabh, Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Meirav Zehavi
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1902.06957
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- An FPT algorithm for edge subset feedback edge set
- Parameterized graph separation problems
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- Computing girth and cogirth in perturbed graphic matroids
- The highly connected matroids in minor-closed classes
- Solving Rota's Conjecture
- Robust principal component analysis?
- Rank-Sparsity Incoherence for Matrix Decomposition
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions
- Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy
- The Complexity of Multiterminal Cuts
- Color-coding
- The intractability of computing the minimum distance of a code
- Covering Vectors by Spaces: Regular Matroids
- LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs
- Fixed-parameter Approximability of Boolean MinCSPs
- The Parametrized Complexity of Some Fundamental Problems in Coding Theory
- Parameterized Algorithms
- The steiner problem in graphs
