The following pages link to (Q3549698):
Displaying 47 items.
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
- Feedback vertex sets on restricted bipartite graphs (Q393042) (← links)
- Parameterized complexity and approximability of the longest compatible sequence problem (Q456697) (← links)
- FPT algorithms for path-transversal and cycle-transversal problems (Q456698) (← links)
- Bounding the feedback vertex number of digraphs in terms of vertex degrees (Q534359) (← links)
- Analyzing and reconstructing reticulation networks under timing constraints (Q604547) (← links)
- Hardness of subgraph and supergraph problems in \(c\)-tournaments (Q638528) (← links)
- Improved algorithms for feedback vertex set problems (Q955350) (← links)
- A cubic kernel for feedback vertex set and loop cutset (Q968273) (← links)
- The parameterized complexity of editing graphs for bounded degeneracy (Q986553) (← links)
- Constant ratio fixed-parameter approximation of the edge multicut problem (Q990949) (← links)
- Parameterized complexity of finding regular induced subgraphs (Q1026227) (← links)
- Almost 2-SAT is fixed-parameter tractable (Q1034100) (← links)
- Fixed-parameter algorithms for Kemeny rankings (Q1035688) (← links)
- Kernels for deletion to classes of acyclic digraphs (Q1678165) (← links)
- Faster deterministic \textsc{Feedback Vertex Set} (Q2015151) (← links)
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes (Q2140500) (← links)
- Iterative compression and exact algorithms (Q2268862) (← links)
- Faster graph bipartization (Q2301359) (← links)
- Possible winner problems on partial tournaments: a parameterized study (Q2359793) (← links)
- Obtaining a planar graph by vertex deletion (Q2429328) (← links)
- Parameterized complexity of Eulerian deletion problems (Q2441593) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- Odd cycle transversal in mixed graphs (Q2672431) (← links)
- On Multiway Cut Parameterized above Lower Bounds (Q2891333) (← links)
- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows (Q2908547) (← links)
- Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q3012825) (← links)
- Acyclic Digraphs (Q3120435) (← links)
- Euler Digraphs (Q3120436) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- Linear Time Parameterized Algorithms for Subset Feedback Vertex Set (Q3448850) (← links)
- Parameterized Complexity and Approximability of the SLCS Problem (Q3503583) (← links)
- A Linear Kernel for Planar Feedback Vertex Set (Q3503587) (← links)
- Fixed-Parameter Algorithms for Kemeny Scores (Q3511416) (← links)
- Iterative Compression and Exact Algorithms (Q3599139) (← links)
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems (Q3637312) (← links)
- Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs (Q4582017) (← links)
- Multicut Is FPT (Q4605273) (← links)
- (Q5089249) (← links)
- (Q5111250) (← links)
- Aligning and Labeling Genomes under the Duplication-Loss Model (Q5326363) (← links)
- Hitting Selected (Odd) Cycles (Q5348214) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
- Invertibility of Digraphs and Tournaments (Q6141864) (← links)
- On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts (Q6157971) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- On Weighted Graph Separation Problems and Flow Augmentation (Q6187079) (← links)
