Eelko Penninkx

Publication Activity (10 Years)

Years Active: 2005-2016
Publications (10 Years): 1

Top Topics

Search Results Clustering

Top Venues

Publications

Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos
(Meta) Kernelization. J. ACM 63 (5) (2016)
Arnold Overwijk, Eelko Penninkx, Hans L. Bodlaender
A Local Search Algorithm for Branchwidth. SOFSEM (2011)
Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions. Algorithmica 58 (3) (2010)
Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos
(Meta) Kernelization. FOCS (2009)
Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos
(Meta) Kernelization CoRR (2009)
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) (2009)
Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penninkx
[1]-Hard. IWPEC (2009)
Hans L. Bodlaender, Eelko Penninkx
A Linear Kernel for Planar Feedback Vertex Set. IWPEC (2008)
Hans L. Bodlaender, Eelko Penninkx, Richard B. Tan
A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs. ISAAC (2008)
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)
Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. ESA (2005)