We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...
: Suppose that independent U 0 1 weights are assigned to the d 2 n2 edges of the complete d-partite graph with n vertices in each of the d = maximal independent sets. Then the expe...
Anewheuristic algorithm is presented for mapping probes to locations along the genome,given noisy pairwise distance data as input. Themodel consideredis quite general: Theinput co...