Eelko Penninkx

On the minimum corridor connection and other generalized geometric problems

Thomas Erlebach, Alexander Grigoriev, René Sitters, 2006 .

(Meta) Kernelization

Dimitrios M. Thilikos, Fedor V. Fomin, Saket Saurabh, 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions

Fedor V. Fomin, Hans L. Bodlaender, Eelko Penninkx, 2010, Algorithmica.

Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions

Fedor V. Fomin, Hans L. Bodlaender, Eelko Penninkx, 2005, ESA.

A Local Search Algorithm for Branchwidth

Hans L. Bodlaender, Arnold Overwijk, Eelko Penninkx, 2011, SOFSEM.

On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems

Alexander Grigoriev, René Sitters, Thomas Wolle, 2006, WAOA.

A Linear Kernel for Planar Feedback Vertex Set

Hans L. Bodlaender, Eelko Penninkx, H. Bodlaender, 2008, IWPEC.