The following pages link to Patrizio Angelini (Q386888):
Displaying 50 items.
- Small Point Sets for Simply-Nested Planar Graphs (Q3223945) (← links)
- Monotone Drawings of Graphs with Fixed Embedding (Q3223970) (← links)
- Acyclically 3-Colorable Planar Graphs (Q3404434) (← links)
- SIMULTANEOUS EMBEDDING OF EMBEDDED PLANAR GRAPHS (Q3459356) (← links)
- Splitting Clusters to Get C-Planarity (Q3557871) (← links)
- Succinct Greedy Drawings Do Not Always Exist (Q3557876) (← links)
- Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time (Q3603534) (← links)
- Topological Morphing of Planar Graphs (Q3611848) (← links)
- Windrose Planarity: Embedding Graphs with Direction-Constrained Edges (Q4575650) (← links)
- A universal slope set for 1-bend planar drawings (Q4580081) (← links)
- On Vertex- and Empty-Ply Proximity Drawings (Q4625098) (← links)
- Windrose Planarity (Q4629968) (← links)
- Clustered Planarity with Pipes (Q4636495) (← links)
- Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area (Q4899278) (← links)
- Universal Point Subsets for Planar Graphs (Q4909559) (← links)
- Implementing a Partitioned 2-Page Book Embedding Testing Algorithm (Q4912192) (← links)
- Testing Planarity of Partially Embedded Graphs (Q4962193) (← links)
- Multi-level Steiner Trees (Q4984869) (← links)
- Beyond Clustered Planar Graphs (Q5001664) (← links)
- On Mixed Linear Layouts of Series-Parallel Graphs (Q5014112) (← links)
- Planar L-Drawings of Bimodal Graphs (Q5014118) (← links)
- Extending Partial Orthogonal Drawings (Q5014122) (← links)
- 2-Layer k-Planar Graphs (Q5014133) (← links)
- Planar L-Drawings of Bimodal Graphs (Q5050000) (← links)
- Extending Partial Orthogonal Drawings (Q5084696) (← links)
- Morphing Contact Representations of Graphs (Q5088937) (← links)
- Multi-Level Steiner Trees. (Q5140725) (← links)
- Morphing Planar Graph Drawings Optimally (Q5167736) (← links)
- On the Area Requirements of Euclidean Minimum Spanning Trees (Q5199228) (← links)
- TESTING MUTUAL DUALITY OF PLANAR GRAPHS (Q5261018) (← links)
- Intersection-Link Representations of Graphs (Q5367021) (← links)
- Optimal Morphs of Convex Drawings (Q5368681) (← links)
- (Q5417619) (← links)
- Universal Point Sets for Drawing Planar Graphs with Circular Arcs (Q5419482) (← links)
- How to Morph Planar Graph Drawings (Q5737811) (← links)
- Morphing Planar Graph Drawings with a Polynomial Number of Steps (Q5741828) (← links)
- On Some $\mathcal{NP}$ -complete SEFE Problems (Q5746258) (← links)
- Monotone Drawings of Graphs (Q5894094) (← links)
- Monotone Drawings of Graphs (Q5894483) (← links)
- On the Perspectives Opened by Right Angle Crossing Drawings (Q5894996) (← links)
- An Algorithm to Construct Greedy Drawings of Triangulations (Q5897052) (← links)
- On the Perspectives Opened by Right Angle Crossing Drawings (Q5900853) (← links)
- An Algorithm to Construct Greedy Drawings of Triangulations (Q5901462) (← links)
- Hierarchical partial planarity (Q5915789) (← links)
- Greedy rectilinear drawings (Q5915947) (← links)
- Greedy rectilinear drawings (Q5919678) (← links)
- Morphing triangle contact representations of triangulations (Q6050235) (← links)
- Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario (Q6053469) (← links)
- (Q6104072) (← links)
- Recognizing map graphs of bounded treewidth (Q6182682) (← links)
