✦ LIBER ✦

On the Computational Complexity of Upward and Rectilinear Planarity Testing

✍ Scribed by Garg, Ashim; Tamassia, Roberto

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the definition and computation of rec

✍ Thomas Ottmann; Eljas Soisalon-Soininen; Derick Wood 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 747 KB

On the Computational Complexity of Best

✍ Paulo Oliva 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB 👁 3 views

On the Computational Complexity of the F

✍ Harary, Frank; Slany, Wolfgang; Verbitsky, Oleg 📂 Article 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 284 KB

On the computational complexity of the m

✍ Z. -Q. Luo; D. L. Parnas 📂 Article 📅 1994 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 617 KB

On the computational complexity of an ex

✍ Tsutomu Kimoto; Shuji Tsukiyama; Isao Shirakawa; Regular Members 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 570 KB

On the Computational Complexity of the R

✍ Magnus Bordewich; Charles Semple 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 212 KB