List View List View   Icon View Icon View

Showing items 1 - 13 of 13.

Add to Quick Collection   All 13 Results

  • First
  • Previous
  • 1
  • Next
  • Last
Title Author/Creator Date Full Text Reviewed
Add Quadratic kernelization for convex recoloring of trees Bodlaender, Hans L.; Fellows, Michael R.; Langston, Michael A.; Ragan, Mark A.; Rosamond, Frances A.... More 2011 — Reviewed
Add Clique-width is NP-complete Fellows, Michael R.; Rosamond, Frances A.; Rotics, Udi; Szeider, Stefan 2009 — Reviewed
Add Distortion is fixed parameter tractable Fellows, Michael R.; Fomin, Fedor V.; Lokshtanov, Daniel; Losievskaja, Eelena; Rosamond, Frances A.... More 2009 — Reviewed
Add Fixed-parameter algorithms for Kemeny rankings Betzler, Nadja; Fellows, Michael R.; Guo, Jiong; Niedermeier, Rolf; Rosamond, Frances A. 2009 — Reviewed
Add Parameterized complexity of stabbing rectangles and squares in the plane Dom, Michael; Fellows, Michael R.; Rosamond, Frances A. 2009 — Reviewed
Add Well-quasi-orders in subclasses of bounded treewidth graphs Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances A. 2009 — Reviewed
Add Computing Kemeny rankings, parameterized by the average K-T distance Betzler, Nadja; Fellows, Michael R.; Guo, Jiong; Niedemeier, Rolf; Rosamond, Frances A. 2008 — Reviewed
Add Fixed-parameter algorithms for Kemeny Scores Betzler, Nadja; Fellows, Michael R.; Guo, Jiong; Niedermeier, Rolf; Rosamond, Frances A. 2008 — Reviewed
Add Graph layout problems parameterized by vertex cover Fellows, Michael R.; Lokshtanov, Daniel; Misra, Neeldhara; Rosamond, Frances A.; Saurabh, Saket 2008 — Reviewed
Add Leaf powers and their properties: using the trees Fellows, Michael R.; Meister, Daniel; Rosamond, Frances A.; Sritharan, R.; Telle, Jan Arne 2008 — Reviewed
Add Clique width minimization is NP-hard Fellows, Michael R.; Rosamond, Frances A.; Rotics, Udi; Szeider, Stefan 2006 — Reviewed
Add FPT is P-Time extremal structure I Fellows, Michael R.; Estivill-Castro, Vladimir; Langston, Michael A.; Rosamond, Frances A. 2005 — Reviewed
Add Cutting up is hard to do: the parameterized complexity of k-Cut and related probelms Downey, Rodney G.; Estivill-Castro, Vladimir; Fellows, Michael R.; Prieto, Elena; Rosamond, Frances A. 2003 — Reviewed
  • First
  • Previous
  • 1
  • Next
  • Last
Author/Creator
Keyword
Format Type
Resource Type