Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. - Frederic Dorn; Eelko Penninkx; Hans L. Bodlaender; Fedor V. Fomin (ESA, 2005)

A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs. - Hans L. Bodlaender; Eelko Penninkx; Richard B. Tan (ISAAC, 2008)

A Linear Kernel for Planar Feedback Vertex Set. - Hans L. Bodlaender; Eelko Penninkx (IWPEC, 2008)

Planar Capacitated Dominating Set Is W[1]-Hard. - Hans L. Bodlaender; Daniel Lokshtanov; Eelko Penninkx (IWPEC, 2009)

On the minimum corridor connection problem and other generalized geometric problems. - Hans L. Bodlaender; Corinne Feremans; Alexander Grigoriev; Eelko Penninkx; René Sitters; Thomas Wolle (Comput. Geom., 2009)

Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions. - Frederic Dorn; Eelko Penninkx; Hans L. Bodlaender; Fedor V. Fomin (Algorithmica, 2010)

A Local Search Algorithm for Branchwidth. - Arnold Overwijk; Eelko Penninkx; Hans L. Bodlaender (SOFSEM, 2011)

(Meta) Kernelization. - Hans L. Bodlaender; Fedor V. Fomin; Daniel Lokshtanov; Eelko Penninkx; Saket Saurabh 001; Dimitrios M. Thilikos (J. ACM, 2016)