Eelko Penninkx

Arnold Overwijk, Eelko Penninkx, Hans L. Bodlaender: A Local Search Algorithm for Branchwidth. SOFSEM 2011: 444-454

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

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

Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos: (Meta) Kernelization. FOCS 2009: 629-638

Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penninkx: Planar Capacitated Dominating Set Is W[1]-Hard. IWPEC 2009: 50-60

Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos: (Meta) Kernelization. CoRR abs/0904.0727 (2009)

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

Hans L. Bodlaender, Eelko Penninkx: A Linear Kernel for Planar Feedback Vertex Set. IWPEC 2008: 160-171

Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle: On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems. WAOA 2006: 69-82

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