Walter Didimo

Latest

• Simple k-planar graphs are simple (k + 1)-quasiplanar
• Upward Book Embeddings of st-Graphs
• On the Relationship Between k-Planar and k-Quasi-Planar Graphs
• Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs
• Drawing Non-Planar Graphs with Crossing-Free Subgraphs