The following pages link to (Q3570028):
Displaying 9 items.
- A generalization of Nemhauser and Trotter's local optimization theorem (Q657921) (← links)
- The parameterised complexity of computing the maximum modularity of a graph (Q786031) (← links)
- Data reductions and combinatorial bounds for improved approximation algorithms (Q899583) (← links)
- The minimum spanning strong subdigraph problem is fixed parameter tractable (Q1005234) (← links)
- Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs (Q3439454) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- (Q5009471) (← links)
- A Parameterized Perspective on Packing Paths of Length Two (Q5505643) (← links)
- Kernelization for finding lineal topologies (depth-first spanning trees) with many or few leaves (Q6546606) (← links)