The following pages link to Patrizio Angelini (Q386888):
Displaying 50 items.
- Topological morphing of planar graphs (Q386891) (← links)
- On the area requirements of Euclidean minimum spanning trees (Q390122) (← links)
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph (Q450560) (← links)
- Monotone drawings of graphs with few directions (Q506161) (← links)
- Strip planarity testing for embedded planar graphs (Q524364) (← links)
- Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time (Q547303) (← links)
- Straight-line rectangular drawings of clustered graphs (Q629827) (← links)
- Acyclically 3-colorable planar graphs (Q695319) (← links)
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs (Q904086) (← 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)
- 1-fan-bundle-planar drawings of graphs (Q1708027) (← links)
- Turning cliques into paths to achieve planarity (Q1725735) (← links)
- Small universal point sets for \(k\)-outerplanar graphs (Q1991093) (← links)
- On mixed linear layouts of series-parallel graphs (Q2087464) (← links)
- Bitonic st-orderings for upward planar graphs: the variable embedding setting (Q2110637) (← links)
- One-bend drawings of outerplanar graphs inside simple polygons (Q2151442) (← links)
- Relaxing the constraints of clustered planarity (Q2261574) (← links)
- Beyond level planarity: cyclic, torus, and simultaneous level planarity (Q2283039) (← links)
- Geometric representations of dichotomous ordinal data (Q2301543) (← links)
- Advancements on SEFE and partitioned book embedding problems (Q2339452) (← links)
- Monotone drawings of graphs with fixed embedding (Q2346955) (← links)
- Clustered planarity with pipes (Q2414866) (← links)
- Universal slope sets for 1-bend planar drawings (Q2414867) (← links)
- The importance of being proper (Q2512653) (← links)
- On morphing 1-planar drawings (Q2672443) (← links)
- L-Drawings of Directed Graphs (Q2794352) (← links)
- Vertex-Coloring with Star-Defects (Q2803807) (← links)
- SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs (Q2811194) (← links)
- Strip Planarity Testing (Q2867641) (← links)
- Morphing Planar Graph Drawings Efficiently (Q2867642) (← links)
- Drawing Non-Planar Graphs with Crossing-Free Subgraphs (Q2867666) (← links)
- SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs (Q2872083) (← links)
- Testing Mutual Duality of Planar Graphs (Q2872099) (← links)
- Succinct greedy drawings do not always exist (Q2894243) (← links)
- The Importance of Being Proper (Q2936931) (← links)
- Anchored Drawings of Planar Graphs (Q2936948) (← links)
- Intersection-Link Representations of Graphs (Q2959759) (← links)
- A Universal Point Set for 2-Outerplanar Graphs (Q2959774) (← links)
- Low Ply Drawings of Trees (Q2961519) (← links)
- Beyond Level Planarity (Q2961540) (← links)
- Simultaneous Orthogonal Planarity (Q2961544) (← links)
- Vertex-Coloring with Defects (Q2971395) (← links)
- Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree (Q3000509) (← links)
- Upward Geometric Graph Embeddings into Point Sets (Q3073656) (← links)
- On a Tree and a Path with No Geometric Simultaneous Embedding (Q3073657) (← links)
- Simultaneous Embedding of Embedded Planar Graphs (Q3104621) (← links)
- On a Tree and a Path with no Geometric Simultaneous Embedding (Q3112624) (← links)
- Algorithms and Bounds for L-Drawings of Directed Graphs (Q3177336) (← links)
- Straight-Line Rectangular Drawings of Clustered Graphs (Q3183438) (← links)
