3 citations · 3 across the 5 of their papers we have counts for
5 papers
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…
Parameterized Complexity of k-Chinese Postman Problem
Gregory Gutin, Gabriele Muciaccia, Anders Yeo
We consider the following problem called the -Chinese Postman Problem (-CPP): given a connected edge-weighted graph and integers and , decide whether there are at…
Maximum Balanced Subgraph Problem Parameterized Above Lower Bound
R. Crowston, G. Gutin, M. Jones +1
We consider graphs without loops or parallel edges in which every edge is assigned + or -. Such a signed graph is balanced if its vertex set can be partitioned into parts and…
Parameterizations of Test Cover with Bounded Test Sizes
Robert Crowston, Gregory Gutin, Mark Jones +2
In the {\sc Test Cover} problem we are given a hypergraph with , and we assume that is a test cover, i.e. for every pair…
(Non-)existence of Polynomial Kernels for the Test Cover Problem
G. Gutin, G. Muciaccia, A. Yeo
The input of the Test Cover problem consists of a set of vertices, and a collection of distinct subsets of , called tests. A test separates…