Frances A. Rosamond

Recent Publications

On the Complexity of Some Colorful Problems Parameterized by Treewidth
Michael R. Fellows, Fedor v. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen
Proceedings of COCOA 2007, Combinatorial Optimization and Applications, First International Conference, Xi’an, China, August 14-16, 2007, volume 4616 of Lecture Notes in Computer Science, pages 366-377, 2007, Springer Verlag.
bib
Clique-width Minimization is NP-hard
Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
Proceedings of STOC 2006; the 38th ACM Symposium on Theory of Computing, Seattle, Washington, USA, pages 354-362, 2006, ACM.
bib DOI