✦ LIBER ✦

The Complexity of Upward Drawings on Spheres

✍ Scribed by S. Mehdi Hashemi; Ivan Rival; Andrzej Kisielewicz

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Computational Complexity of Upwar

✍ Garg, Ashim; Tamassia, Roberto 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 400 KB

A note on optimal area algorithms for up

✍ P. Crescenzi; G. Di Battista; A. Piperno 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 793 KB

A note on minimum-area upward drawing of

✍ Luca Trevisan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 503 KB

On the Complexity Distribution of Sphere

✍ Seethaler, D.; Jalden, J.; Studer, C.; Bolcskei, H. 📂 Article 📅 2011 🏛 IEEE 🌐 English ⚖ 398 KB

On the Parameterized Complexity of Layer

✍ Vida Dujmović; Michael R. Fellows; Matthew Kitching; Giuseppe Liotta; Catherine 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 537 KB

On the complexity of sphere decoding in

✍ Jalden, J.; Ottersten, B. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 391 KB