scientific article; zbMATH DE number 7278081
From MaRDI portal
Publication:5136298
DOI10.4230/LIPIcs.FSTTCS.2017.9zbMath1491.68091MaRDI QIDQ5136298
M. S. Ramanujan, Amer E. Mouawad, R. Krithika, Daniel Lokshtanov, Akanksha Agrawal
Publication date: 25 November 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
feedback vertex setparameterized complexityedge-colored graphsodd cycle transversalsimultaneous deletion
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Unnamed Item
- Chordal editing is fixed-parameter tractable
- Finding odd cycle transversals.
- Improved upper bounds for vertex cover
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- Improved algorithms for feedback vertex set problems
- Faster deterministic \textsc{Feedback Vertex Set}
- Parameterized Tractability of Multiway Cut with Parity Constraints
- Dual Connectedness of Edge-Bicolored Graphs and Beyond
- Finding small separators in linear time via treewidth reduction
- Subset Feedback Vertex Set Is Fixed-Parameter Tractable
- Linear Time Parameterized Algorithms for Subset Feedback Vertex Set
- Simultaneous Feedback Vertex Set: A Parameterized Perspective
- Faster Parameterized Algorithms Using Linear Programming
- Interval Deletion Is Fixed-Parameter Tractable
- Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
- Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting
- Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts
- Linear-Time FPT Algorithms via Network Flow
- A Near-Optimal Planarization Algorithm
- Parameterized Algorithms
This page was built for publication:
