scientific article; zbMATH DE number 5485529
From MaRDI portal
Publication:3549698
Cited in
(47)- A Linear Kernel for Planar Feedback Vertex Set
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes
- Designing FPT algorithms for cut problems using randomized contractions
- FPT algorithms for path-transversal and cycle-transversal problems
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems
- Towards a polynomial kernel for directed feedback vertex set
- Invertibility of Digraphs and Tournaments
- On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts
- Parameterized complexity and approximability of the longest compatible sequence problem
- scientific article; zbMATH DE number 7559446 (Why is no real title available?)
- Improved algorithms for feedback vertex set problems
- Parameterized complexity of finding regular induced subgraphs
- Almost 2-SAT is fixed-parameter tractable
- Aligning and Labeling Genomes under the Duplication-Loss Model
- Bounding the feedback vertex number of digraphs in terms of vertex degrees
- Parameterized complexity of Eulerian deletion problems
- Slightly superexponential parameterized problems
- Feedback vertex sets on restricted bipartite graphs
- Constant congestion routing of symmetric demands in planar directed graphs
- Euler digraphs
- Linear time parameterized algorithms for subset feedback vertex set
- Acyclic digraphs
- Fixed-parameter algorithms for Kemeny rankings
- A survey of parameterized algorithms and the complexity of edge modification
- Obtaining a planar graph by vertex deletion
- Constant ratio fixed-parameter approximation of the edge multicut problem
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments
- A cubic kernel for feedback vertex set and loop cutset
- On Weighted Graph Separation Problems and Flow Augmentation
- Digraph width measures in parameterized algorithmics
- Kernels for deletion to classes of acyclic digraphs
- The parameterized complexity of editing graphs for bounded degeneracy
- Hardness of subgraph and supergraph problems in c-tournaments
- Odd cycle transversal in mixed graphs
- Parameterized Complexity and Approximability of the SLCS Problem
- Multicut Is FPT
- Possible winner problems on partial tournaments: a parameterized study
- On the parameterized complexity of deletion to \(\mathcal{H}\)-free strong components
- Degreewidth: A New Parameter for Solving Problems on Tournaments
- Iterative Compression and Exact Algorithms
- Faster deterministic \textsc{Feedback Vertex Set}
- Analyzing and reconstructing reticulation networks under timing constraints
- Fixed-Parameter Algorithms for Kemeny Scores
- Iterative compression and exact algorithms
- Hitting selected (odd) cycles
- Faster graph bipartization
- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549698)
