scientific article; zbMATH DE number 7053389
From MaRDI portal
Publication:5743513
zbMath1425.05082MaRDI QIDQ5743513
Naonori Kakimura, Ken-ichi Kawarabayashi, Yusuke Kobayashi
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095253
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (15)
Linear Time Parameterized Algorithms for Subset Feedback Vertex Set ⋮ Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs ⋮ Towards a polynomial kernel for directed feedback vertex set ⋮ Kernels for deletion to classes of acyclic digraphs ⋮ Hitting Selected (Odd) Cycles ⋮ Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center ⋮ Packing cycles through prescribed vertices under modularity constraints ⋮ Unnamed Item ⋮ An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) ⋮ Half-integral packing of odd cycles through prescribed vertices ⋮ Computing subset transversals in \(H\)-free graphs ⋮ Unnamed Item ⋮ Parameterised algorithms for deletion to classes of DAGs ⋮ Backdoors to tractable answer set programming ⋮ Fixed-parameter tractability for subset feedback set problems with parity constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- The disjoint paths problem in quadratic time
- Graph minors. XXII. Irrelevant vertices in linkage problems
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem
- Packing cycles through prescribed vertices under modularity constraints
- Packing cycles with modularity constraints
- Finding odd cycle transversals.
- Disjoint cycles intersecting a set of vertices
- On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Mangoes and blueberries
- Disjoint paths in graphs
- 2-linked graphs
- A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Rooted minor problems in highly connected graphs
- Graph minors. XIII: The disjoint paths problem
- Packing cycles through prescribed vertices
- Fixed-parameter tractability for subset feedback set problems with parity constraints
- On the odd-minor variant of Hadwiger's conjecture
- Odd cycle packing
- Subset Feedback Vertex Set Is Fixed-Parameter Tractable
- Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$
- On the presence of disjoint subgraphs of a specified type
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
- Packing cycles in undirected graphs
- A polyhedral approach to the feedback vertex set problem
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- Approximation algorithms and hardness results for cycle packing problems
- Reducibility among Combinatorial Problems
- Algorithms and Data Structures
- The Graph Minor Algorithm with Parity Conditions
- A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits
- A Min-Max Theorem on Feedback Vertex Sets
This page was built for publication:
