The following pages link to Finding odd cycle transversals. (Q703225):
Displaying 36 items.
- Backdoor Sets for CSP. (Q4993598) (← links)
- Finding branch-decompositions of matroids, hypergraphs, and more (Q5002759) (← links)
- (Q5005155) (← links)
- Exploring the Kernelization Borders for Hitting Cycles (Q5009476) (← links)
- Parameterized Complexity of Independent Set in H-Free Graphs. (Q5009479) (← links)
- Finding Branch-Decompositions of Matroids, Hypergraphs, and More (Q5013567) (← links)
- On the Complexity of Singly Connected Vertex Deletion (Q5041193) (← links)
- (Q5089249) (← links)
- An Updated Experimental Evaluation of Graph Bipartization Methods (Q5102059) (← links)
- (Q5136298) (← links)
- Paths to Trees and Cacti (Q5283353) (← links)
- Hitting Selected (Odd) Cycles (Q5348214) (← links)
- The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number (Q5387763) (← links)
- Fixed-Parameter Algorithms for Cluster Vertex Deletion (Q5458573) (← links)
- (Q5743380) (← links)
- (Q5743513) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
- Chordless Cycle Packing Is Fixed-Parameter Tractable (Q5874543) (← links)
- (Q5875482) (← links)
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems (Q5895104) (← links)
- Your rugby mates don't need to know your colleagues: triadic closure with edge colors (Q5918315) (← links)
- Conflict free version of covering problems on graphs: classical and parameterized (Q5918906) (← links)
- Streaming deletion problems Parameterized by vertex cover (Q6057830) (← links)
- (Q6065472) (← links)
- On the Parameterized Complexity of Clique Elimination Distance (Q6068235) (← links)
- Graph Bipartization Problem with Applications to Via Minimization in VLSI Design (Q6132388) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams (Q6185609) (← links)
- On Weighted Graph Separation Problems and Flow Augmentation (Q6187079) (← links)
- On the parallel parameterized complexity of MaxSAT variants (Q6535422) (← links)
- Maximum bipartite subgraphs of geometric intersection graphs (Q6552516) (← links)
- Fast FPT-approximation of branchwidth (Q6593764) (← links)
- Search-space reduction via essential vertices (Q6606914) (← links)
- On the parameterized complexity of deletion to \(\mathcal{H}\)-free strong components (Q6654121) (← links)
- Exact and parameterized algorithms for the independent cutset problem (Q6655670) (← links)
- A constant-factor approximation for weighted bond cover (Q6671673) (← links)
