 |
A refined search tree technique for Dominating Set on planar graphs |
Alber, Jochen; Fan, Hongbing; Fellows, Michael R.; Fernau, Henning; Niedermeier, Rolf... More
|
2005 |
—
|
|
 |
A parameterized route to exact puzzles: breaking the 2n-barrier for irredundance |
Binkele-Raible, Daniel; Brankovic, Ljiljana; Fernau, Henning; Kneis, Joachim; Kratsch, Dieter... More
|
2010 |
—
|
|
 |
Breaking the 2ⁿ-barrier for irredundance: two lines of attack |
Binkele-Raible, Daniel; Brankovic, Ljiljana; Wojtaszczyk, Jakub Onufry; Cygan, Marek; Fernau, Henning... More
|
2011 |
—
|
|
 |
Approximability of a {0,1} - matrix problem |
Brankovic, Ljiljana; Fernau, Henning |
2005 |
|
|
 |
Combining two worlds: parameterised approximation for vertex cover |
Brankovic, Ljiljana; Fernau, Henning |
2010 |
—
|
|
 |
Parametric duality and kernelization: Lower bounds and upper bounds on kernel size |
Chen, J. N.; Fernau, Henning; Kanj, I. A.; Xia, G. |
2005 |
—
|
|
 |
Facility location problems: a parameterized view |
Fellows, Michael; Fernau, Henning |
2008 |
—
|
|
 |
Parameterized algorithmics for d-HITTING SET |
Fernau, Henning |
2010 |
—
|
|
 |
Two-layer planarization: Improving on parameterized algorithmics |
Fernau, Henning |
2005 |
—
|
|
List View
