1542 search results - page 52 / 309 » Kernelization of packing problems |
100
click to vote
ANOR
2005
14 years 11 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
105
click to vote
FSTTCS
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a signi cantly improved FPT algor...
ALGORITHMICA
2004
14 years 11 months ago
2004
We consider the d-dimensional cube packing problem (d-CPP): given a list L of d-dimensional cubes and (an unlimited quantity of) d-dimensional unit-capacity cubes, called bins, fi...
IWOCA
2009
Springer
15 years 6 months ago
2009
Springer
ECAI
2004
Springer
15 years 5 months ago
2004
Springer