✦ LIBER ✦

On the Parameterized Complexity of Layered Graph Drawing

✍ Scribed by Vida Dujmović; Michael R. Fellows; Matthew Kitching; Giuseppe Liotta; Catherine McCartin; Naomi Nishimura; Prabhakar Ragde; Frances Rosamond; Sue Whitesides; David R. Wood

Publisher: Springer
Year: 2007
Tongue: English
Weight: 537 KB
Volume: 52
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-007-9151-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Parameterized Complexity of Stabbing

The Parameterized Complexity of Stabbing Rectangles

✍ Michael Dom; Michael R. Fellows; Frances A. Rosamond; Somnath Sikdar 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 951 KB

On the parameterized complexity of short

On the parameterized complexity of short computation and factorization

✍ Liming Cai; Jianer Chen; Rodney G. Downey; Michael R. Fellows 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 169 KB

On the complexity of graph reconstructio

On the complexity of graph reconstruction

✍ Dieter Kratsch; Lane A. Hemaspaandra 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 942 KB

On the computational complexity of graph

On the computational complexity of graph closures

✍ Angelo Monti 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 375 KB

On the parameterized complexity of the M

On the parameterized complexity of the Multi-MCT and Multi-MCST problems

✍ Wenbin Chen; Matthew C. Schmidt; Nagiza F. Samatova 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 244 KB

On the recognition complexity of some gr

On the recognition complexity of some graph properties

✍ Eberhard Triesch 📂 Article 📅 1996 🏛 Springer-Verlag 🌐 English ⚖ 487 KB