scientific article; zbMATH DE number 7561676
From MaRDI portal
Publication:5092393
DOI10.4230/LIPIcs.MFCS.2019.32MaRDI QIDQ5092393
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1906.09213
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (5)
Faster algorithm for pathwidth one vertex deletion ⋮ An \(O^\ast ( 2 . 61 9^k )\) algorithm for \textsc{4-path vertex cover} ⋮ Computing connected-\(k\)-subgraph cover with connectivity requirement ⋮ Faster parameterized algorithms for two vertex deletion problems ⋮ Colored cut games
Cites Work
- A fixed-parameter algorithm for the vertex cover \(P_3\) problem
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
- Exact exponential algorithms.
- Improved upper bounds for vertex cover
- A faster FPT algorithm for 3-path vertex cover
- An FPT algorithm for the vertex cover \(P_4\) problem
- The node-deletion problem for hereditary properties is NP-complete
- Succinct data structures for nearest colored node in a tree
- Exact algorithms for maximum independent set
- Iterative compression and exact algorithms
- Minimum \(k\)-path vertex cover
- Parameterized algorithm for 3-path vertex cover
- A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
- Exact Algorithms via Monotone Local Search
- Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
- Parameterized Algorithms
This page was built for publication:
