The following pages link to (Q5417631):
Displaying 19 items.
- Edge bipartization faster than \(2^k\) (Q666655) (← links)
- A linear-time algorithm for computing the intersection of all odd cycles in a graph (Q674917) (← links)
- Finding odd cycle transversals. (Q703225) (← links)
- Faster graph bipartization (Q2301359) (← links)
- Fixed-parameter tractability for subset feedback set problems with parity constraints (Q2344735) (← links)
- Modifying a graph using vertex elimination (Q2345941) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- Another disjoint compression algorithm for odd cycle transversal (Q2445321) (← links)
- A faster FPT algorithm for bipartite contraction (Q2445333) (← links)
- Odd cycle transversal in mixed graphs (Q2672431) (← links)
- Odd cycle packing (Q2875196) (← links)
- On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal (Q2891343) (← links)
- Subexponential parameterized odd cycle transversal on planar graphs (Q2957518) (← links)
- Linear Time Parameterized Algorithms for Subset Feedback Vertex Set (Q3448850) (← links)
- The Parameterized Complexity of Finding Point Sets with Hereditary Properties (Q5009473) (← links)
- A Linear-Time Parameterized Algorithm for Node Unique Label Cover (Q5111746) (← links)
- Hitting Selected (Odd) Cycles (Q5348214) (← links)
- (Q5743380) (← links)
- (Q5743513) (← links)