Partitioning a Weighted Tree into Subtrees with Weights in a Given Range

By Ito Takehiro   Nishizeki Takao   Schröder Michael   Uno Takeaki   Zhou Xiao  

Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. : 823-841

Springer Publishing Company

Access to resources Recommend Favorite

On the approximation of largest common subtrees and largest common point sets

By Akutsu T.   Halldorsson M.M.  

Theoretical Computer Science, Vol. 233, Iss. 1, 2000-02 ,pp. : 33-50

Elsevier

Access to resources Recommend Favorite

Proper Interval Vertex Deletion

By Hof Pim   Villanger Yngve  

Algorithmica, Vol. 65, Iss. 4, 2013-04 ,pp. : 845-867

Springer Publishing Company

Access to resources Recommend Favorite

The bounded eight-vertex model

By Eloranta K.  

Theoretical Computer Science, Vol. 303, Iss. 2, 2003-07 ,pp. : 539-552

Elsevier

Access to resources Recommend Favorite

On Cutwidth Parameterized by Vertex Cover

By Cygan Marek   Lokshtanov Daniel   Pilipczuk Marcin   Pilipczuk Michał   Saurabh Saket  

Algorithmica, Vol. 68, Iss. 4, 2014-04 ,pp. : 940-953

Springer Publishing Company

Access to resources Recommend Favorite