Pages that link to "Item:Q3651564"
From MaRDI portal
The following pages link to Simpler Parameterized Algorithm for OCT (Q3651564):
Displaying 11 items.
- A note on the parameterized complexity of unordered maximum tree orientation (Q427909) (← links)
- Edge bipartization faster than \(2^k\) (Q666655) (← links)
- Optimizing adiabatic quantum program compilation using a graph-theoretic framework (Q1654155) (← links)
- List-coloring -- parameterizing from triviality (Q2173305) (← links)
- Another disjoint compression algorithm for odd cycle transversal (Q2445321) (← links)
- A faster FPT algorithm for bipartite contraction (Q2445333) (← links)
- Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760) (← links)
- Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs (Q2689443) (← links)
- An Updated Experimental Evaluation of Graph Bipartization Methods (Q5102059) (← links)
- Hitting Selected (Odd) Cycles (Q5348214) (← links)
- (Q5743380) (← links)
