29 citations · 53 across the 16 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DM2013
Polynomial Kernels for λ-extendible Properties Parameterized Above the Poljak-Turzík Bound
Robert Crowston, Mark Jones, Gabriele Muciaccia +3
Poljak and Turzik (Discrete Mathematics 1986) introduced the notion of λ-extendible properties of graphs as a generalization of the property of being bipartite. They showed that fo…
cs.DS2013
Point Line Cover: The Easy Kernel is Essentially Tight
Stefan Kratsch, Geevarghese Philip, Saurabh Ray
The input to the NP-hard Point Line Cover problem (PLC) consists of a set of points on the plane and a positive integer , and the question is whether there exists a set…