Eelko Penninkx

11 papers A* 1A 1B 3Journal 4Unranked 2
YearRankTypeTitle / Venue / Authors
2016 J jnl
(Meta) Kernelization.
J. ACM
Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos
2011 B conf
A Local Search Algorithm for Branchwidth.
SOFSEM
Arnold Overwijk, Eelko Penninkx, Hans L. Bodlaender
2010 J jnl
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions.
Algorithmica
Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin
2009 J jnl
(Meta) Kernelization
CoRR
Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos
2009 A* conf
(Meta) Kernelization.
FOCS
Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos
2009 J jnl
On the minimum corridor connection problem and other generalized geometric problems.
Comput. Geom.
Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle
2009 — conf
Planar Capacitated Dominating Set Is
IWPEC
Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penninkx
2008 — conf
A Linear Kernel for Planar Feedback Vertex Set.
IWPEC
Hans L. Bodlaender, Eelko Penninkx
2008 B conf
A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs.
ISAAC
Hans L. Bodlaender, Eelko Penninkx, Richard B. Tan
2006 B conf
On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems.
WAOA
Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle
2005 A conf
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions.
ESA
Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin