The following pages link to Fabrizio Montecchiani (Q290512):
Displaying 50 items.
- Recognizing and drawing IC-planar graphs (Q290513) (← links)
- Simultaneous visibility representations of plane \(st\)-graphs using L-shapes (Q306259) (← links)
- On partitioning the edges of 1-plane graphs (Q501676) (← links)
- Ortho-polygon visibility representations of embedded graphs (Q724238) (← links)
- An experimental study of a 1-planarity testing and embedding algorithm (Q782206) (← links)
- Planar drawings with few slopes of Halin graphs and nested pseudotrees (Q832866) (← links)
- L-visibility drawings of IC-planar graphs (Q903189) (← links)
- Fast layout computation of clustered networks: algorithmic advances and experimental analysis (Q903597) (← links)
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs (Q904086) (← links)
- Visibility representations of boxes in 2.5 dimensions (Q1615673) (← links)
- On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs (Q1687902) (← links)
- New results on edge partitions of 1-plane graphs (Q1694686) (← links)
- Drawing subcubic planar graphs with four slopes and optimal angular resolution (Q1694729) (← links)
- Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles (Q1725748) (← links)
- Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation (Q1755780) (← links)
- Gap-planar graphs (Q1786592) (← links)
- Embedding-preserving rectangle visibility representations of nonplanar graphs (Q1991089) (← links)
- Orthogonal planarity testing of bounded treewidth graphs (Q2071827) (← links)
- 1-planarity testing and embedding: an experimental study (Q2088879) (← links)
- Geodesic obstacle representation of graphs (Q2096390) (← links)
- A user study on hybrid graph visualizations (Q2151426) (← links)
- Optimal-area visibility representations of outer-1-plane graphs (Q2151451) (← links)
- Convex grid drawings of planar graphs with constant edge-vertex resolution (Q2169950) (← links)
- 1-bend upward planar slope number of SP-digraphs (Q2206732) (← links)
- ChordLink: a new hybrid visualization model (Q2206859) (← links)
- Parameterized algorithms for book embedding problems (Q2206870) (← links)
- Sketched representations and orthogonal planarity of bounded treewidth graphs (Q2206871) (← links)
- Grid drawings of graphs with constant edge-vertex resolution (Q2230412) (← links)
- Polyline drawings with topological constraints (Q2290634) (← links)
- Fan-planarity: properties and complexity (Q2346379) (← links)
- Area requirement of graph drawings with few crossings per edge (Q2391538) (← links)
- On RAC drawings of 1-planar graphs (Q2402260) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- Universal slope sets for 1-bend planar drawings (Q2414867) (← links)
- Bounded stub resolution for some maximal 1-planar graphs (Q2636565) (← links)
- On morphing 1-planar drawings (Q2672443) (← links)
- Simultaneous Visibility Representations of Plane st-graphs Using L-shapes (Q2827815) (← links)
- Drawing Non-Planar Graphs with Crossing-Free Subgraphs (Q2867666) (← links)
- Exploring Complex Drawings via Edge Stratification (Q2867667) (← links)
- Fan-Planar Graphs: Combinatorial Properties and Complexity Results (Q2936925) (← links)
- A Million Edge Drawing for a Fistful of Dollars (Q2959741) (← links)
- Kojaph: Visual Definition and Exploration of Patterns in Graph Databases (Q2959763) (← links)
- 2-Layer Fan-Planarity: From Caterpillar to Stegosaurus (Q2959764) (← links)
- A Distributed Multilevel Force-Directed Algorithm (Q2961498) (← links)
- Placing Arrows in Directed Graph Drawings (Q2961503) (← links)
- 1-Bend Upward Planar Drawings of SP-Digraphs (Q2961509) (← links)
- Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus (Q2971387) (← links)
- Vertex-Coloring with Defects (Q2971395) (← links)
- On Guarding Orthogonal Polygons with Sliding Cameras (Q2980898) (← links)
- (Q3132853) (← links)
