The following pages link to Giordano Da Lozzo (Q524363):
Displaying 50 items.
- Strip planarity testing for embedded planar graphs (Q524364) (← links)
- Planar drawings with few slopes of Halin graphs and nested pseudotrees (Q832866) (← links)
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs (Q904086) (← links)
- Subexponential-time and FPT algorithms for embedded flat clustered planarity (Q1627160) (← links)
- Analogies between the crossing number and the tangle crossing number (Q1627199) (← links)
- 3-coloring arrangements of line segments with 4 slopes is hard (Q1641160) (← links)
- On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs (Q1687902) (← links)
- On the area requirements of planar greedy drawings of triconnected planar graphs (Q2019489) (← links)
- C-planarity testing of embedded clustered graphs with bounded dual carving-width (Q2041980) (← links)
- Planar straight-line realizations of 2-trees with prescribed edge lengths (Q2151440) (← links)
- Graph stories in small area (Q2206885) (← links)
- Relaxing the constraints of clustered planarity (Q2261574) (← links)
- Beyond level planarity: cyclic, torus, and simultaneous level planarity (Q2283039) (← links)
- On planar greedy drawings of 3-connected planar graphs (Q2283114) (← links)
- Reaching 3-connectivity via edge-edge additions (Q2301743) (← links)
- Planarity of streamed graphs (Q2333805) (← links)
- Advancements on SEFE and partitioned book embedding problems (Q2339452) (← links)
- Clustered planarity with pipes (Q2414866) (← links)
- The importance of being proper (Q2512653) (← links)
- Recognizing DAGs with page-number 2 is NP-complete (Q2682927) (← links)
- L-Drawings of Directed Graphs (Q2794352) (← links)
- Strip Planarity Testing (Q2867641) (← links)
- Drawing Non-Planar Graphs with Crossing-Free Subgraphs (Q2867666) (← links)
- The Importance of Being Proper (Q2936931) (← links)
- Anchored Drawings of Planar Graphs (Q2936948) (← links)
- Planar Embeddings with Small and Uniform Faces (Q2942666) (← links)
- Intersection-Link Representations of Graphs (Q2959759) (← links)
- Computing NodeTrix Representations of Clustered Graphs (Q2961508) (← links)
- Drawing Planar Graphs with Many Collinear Vertices (Q2961512) (← links)
- Beyond Level Planarity (Q2961540) (← links)
- Simultaneous Orthogonal Planarity (Q2961544) (← links)
- Drawing Graphs on a Smartphone (Q3112626) (← links)
- Algorithms and Bounds for L-Drawings of Directed Graphs (Q3177336) (← links)
- Windrose Planarity: Embedding Graphs with Direction-Constrained Edges (Q4575650) (← links)
- On planar greedy drawings of 3-connected planar graphs (Q4580108) (← links)
- Planar L-Drawings of Directed Graphs (Q4625136) (← links)
- Drawing planar graphs with many collinear vertices (Q4626290) (← links)
- Windrose Planarity (Q4629968) (← links)
- Clustered Planarity with Pipes (Q4636495) (← links)
- Beyond Clustered Planar Graphs (Q5001664) (← links)
- Planar L-Drawings of Bimodal Graphs (Q5014118) (← links)
- 2-Layer k-Planar Graphs (Q5014133) (← links)
- Planar L-Drawings of Bimodal Graphs (Q5050000) (← links)
- Computing k-modal embeddings of planar digraphs (Q5075755) (← links)
- Morphing Contact Representations of Graphs (Q5088937) (← links)
- Upward Book Embeddings of st-Graphs (Q5088940) (← links)
- Approximation Algorithms for Facial Cycles in Planar Embeddings (Q5091033) (← links)
- Graph Stories in Small Area (Q5119379) (← links)
- Morphing Planar Graph Drawings Optimally (Q5167736) (← links)
- Intersection-Link Representations of Graphs (Q5367021) (← links)
