On the parameterized complexity of Eulerian strong component arc deletion
From MaRDI portal
Cites work
- A c^k n 5-approximation algorithm for treewidth
- A single-exponential time 2-approximation algorithm for treewidth
- An application of simultaneous diophantine approximation in combinatorial optimization
- An improved parameterized algorithm for treewidth
- Bin packing with fixed number of bins revisited
- Can you beat treewidth?
- Computing the Deficiency of Housing Markets with Duplicate Houses
- Exploring the gap between treedepth and vertex cover through vertex integrity
- Finding even subgraphs even faster
- Fundamentals of parameterized complexity
- Graph minors. XIII: The disjoint paths problem
- scientific article; zbMATH DE number 4053662 (Why is no real title available?)
- Integer Programming with a Fixed Number of Variables
- Maximal Flow Through a Network
- Minkowski's Convex Body Theorem and Integer Programming
- On the computational complexity of vertex integrity and component order connectivity
- Parameterized algorithms
- Parameterized algorithms for generalizations of directed feedback vertex set
- Parameterized complexity of Eulerian deletion problems
- Parameterized Eulerian strong component arc deletion problem on tournaments
- Reducibility among combinatorial problems
This page was built for publication: On the parameterized complexity of Eulerian strong component arc deletion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6926524)
