Mutual exclusion scheduling, Theoretical Computer Science, vol.162, pp.225-243, 1996. ,
Locally bounded k-colorings of trees, RAIRO-RO, vol.43, pp.27-34, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-01125556
Equitable colorings of bounded treewidth graphs, Theoretical Computer Science, vol.349, pp.22-30, 2005. ,
Restrictions of graph partition problems: Part I, Theoretical Computer Science, vol.148, pp.93-109, 1995. ,
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem, Theoretical Computer Science, vol.412, pp.6261-6268, 2011. ,
, Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications, vol.2, 1999.
On the complexity of a restricted list-coloring problem, Discrete Mathematics, vol.195, pp.103-109, 1999. ,
Parameterized complexity of coloring problems: Treewidth versus vertex cover, Theoretical Computer Science, vol.412, pp.2513-2523, 2011. ,
Computers and Intractability, a Guide to the Theory of NP-Completeness, 1979. ,
Complexity of list coloring problems with a fixed total number of colors, Discrete Applied Mathematics, vol.117, pp.65-79, 2002. ,
Bounded vertex colorings of graphs, Discrete Mathematics, vol.111, pp.305-312, 1993. ,
The NP-Completeness of Edge-Colouring, SIAM Journal on Computing, vol.10, pp.718-720, 1981. ,
Bin packing with fixed number of bins revisited, Journal of Computer and System Sciences, vol.79, pp.39-49, 2013. ,
Generalized coloring for tree-like graphs, Discrete Applied Mathematics, vol.75, pp.135-155, 1997. ,
Treewidth: Computations and Approximations, Lecture Notes in Computer Science, vol.842, 1994. ,