Related content

On the Parameterized Complexity of Layered Graph Drawing

By Dujmović Vida   Fellows Michael   Kitching Matthew   Liotta Giuseppe   McCartin Catherine   Nishimura Naomi   Ragde Prabhakar   Rosamond Frances   Whitesides Sue   Wood David  

Algorithmica, Vol. 52, Iss. 2, 2008-10 ,pp. : 267-292

Springer Publishing Company

Access to resources Recommend Favorite

Efficient enumeration of all minimal separators in a graph

By Hong S.   Weifa L.  

Theoretical Computer Science, Vol. 180, Iss. 1, 1997-06 ,pp. : 169-180

Elsevier

Access to resources Recommend Favorite

A Graph Transformation View on the Specification of Applications using Mobile Code

By Corradini A.   Dotti F.L.   Ribeiro L.  

Electronic Notes in Theoretical Computer Science, Vol. 50, Iss. 3, 2004-01 ,pp. : 1-9

Elsevier

Access to resources Recommend Favorite

On the existence of subexponential parameterized algorithms

By Cai L.   Juedes D.  

Journal of Computer and System Sciences, Vol. 67, Iss. 4, 2003-12 ,pp. : 789-807

Elsevier

Access to resources Recommend Favorite

Multiple matching of parameterized patterns

By Idury R.M.   Schaffer A.A.  

Theoretical Computer Science, Vol. 154, Iss. 2, 1996-02 ,pp. : 203-224

Elsevier

Access to resources Recommend Favorite