✦ LIBER ✦

Area requirement of graph drawings with few crossings per edge

✍ Scribed by Di Giacomo, Emilio; Didimo, Walter; Liotta, Giuseppe; Montecchiani, Fabrizio

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs drawn with few crossings per edge

✍ János Pach; Géza Tóth 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 553 KB

Algorithms for Graphs Embeddable with Fe

✍ Alexander Grigoriev; Hans L. Bodlaender 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 194 KB

Drawing Colored Graphs with Constrained

✍ Emilio Di Giacomo; Giuseppe Liotta; Francesco Trotta 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 650 KB

Drawings of graphs on surfaces with few

✍ F. Shahrokhi, L. A. Székely, O. Sýkora and I. Vrt'o 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 305 KB