Eelko Penninkx

According to our database, Eelko Penninkx authored at least 8 papers between 2005 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

(Meta) Kernelization.

Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos

J. ACM, 2016

2011

A Local Search Algorithm for Branchwidth.

Arnold Overwijk, Eelko Penninkx, Hans L. Bodlaender

Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

2010

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

Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin

Algorithmica, 2010

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

Planar Capacitated Dominating Set Is <i>W</i>[1]-Hard.

Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penninkx

Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

2008

A Linear Kernel for Planar Feedback Vertex Set.

Hans L. Bodlaender, Eelko Penninkx

Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008

A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs.

Hans L. Bodlaender, Eelko Penninkx, Richard B. Tan

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2005

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

Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin

Proceedings of the Algorithms, 2005