scientific article; zbMATH DE number 7238978
From MaRDI portal
Publication:5116487
DOI10.4230/LIPIcs.SWAT.2018.23zbMath1442.68169MaRDI QIDQ5116487
Petr A. Golovach, Pinar Heggernes, Charis Papadopoulos, Athanasios L. Konstantinidis, Paloma T. Lima
Publication date: 25 August 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (3)
Parameterized aspects of strong subgraph closure ⋮ On the relation of strong triadic closure and cluster deletion ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Sparsity. Graphs, structures, and algorithms
- Solving MAX-\(r\)-SAT above a tight lower bound
- On problems without polynomial kernels
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Two edge modification problems without polynomial kernels
- Parameterized complexity of finding subgraphs with hereditary properties.
- Incompressibility of \(H\)-free edge modification problems
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions
- Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
- Edge-Deletion Problems
- Kernelization Lower Bounds Through Colors and IDs
- Neighborhood complexity and kernelization for nowhere dense classes of graphs
- Parameterized Algorithms
- Strong triadic closure in cographs and graphs of low maximum degree
This page was built for publication:
