The following pages link to Maurizio Patrignani (Q202653):
Displaying 50 items.
- Topological morphing of planar graphs (Q386891) (← links)
- Drawing trees in a streaming model (Q436551) (← links)
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph (Q450560) (← links)
- Computational complexity of traffic hijacking under BGP and S-BGP (Q496018) (← links)
- Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time (Q547303) (← links)
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs (Q904086) (← links)
- Complexity results for three-dimensional orthogonal graph drawing (Q954967) (← links)
- On embedding a cycle in a plane graph (Q1011765) (← links)
- HV-planarity: algorithms and complexity (Q1628786) (← links)
- On the area requirements of straight-line orthogonal drawings of ternary trees (Q1670991) (← links)
- Clustered planarity = flat clustered planarity (Q1725728) (← links)
- Bend-minimum orthogonal drawings in quadratic time (Q1725783) (← links)
- LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs (Q2009630) (← links)
- Planar straight-line realizations of 2-trees with prescribed edge lengths (Q2151440) (← links)
- Graph stories in small area (Q2206885) (← links)
- On the area requirements of planar straight-line orthogonal drawings of ternary trees (Q2220843) (← links)
- Relaxing the constraints of clustered planarity (Q2261574) (← links)
- On embedding a graph in the grid with the maximum number of bends and other bad features (Q2272195) (← links)
- Beyond level planarity: cyclic, torus, and simultaneous level planarity (Q2283039) (← links)
- Visualizing co-phylogenetic reconciliations (Q2310765) (← links)
- NodeTrix planarity testing with small clusters (Q2319629) (← links)
- Fan-planarity: properties and complexity (Q2346379) (← links)
- A note on 3D orthogonal drawings with direction constrained edges (Q2390232) (← links)
- Upward and quasi-upward planarity testing of embedded mixed graphs (Q2437763) (← links)
- L-Drawings of Directed Graphs (Q2794352) (← links)
- Morphing Planar Graph Drawings Efficiently (Q2867642) (← links)
- Drawing Non-Planar Graphs with Crossing-Free Subgraphs (Q2867666) (← links)
- Fan-Planar Graphs: Combinatorial Properties and Complexity Results (Q2936925) (← links)
- On the Complexity of HV-rectilinear Planarity Testing (Q2936940) (← links)
- Anchored Drawings of Planar Graphs (Q2936948) (← links)
- Intersection-Link Representations of Graphs (Q2959759) (← links)
- Computing NodeTrix Representations of Clustered Graphs (Q2961508) (← links)
- Beyond Level Planarity (Q2961540) (← links)
- Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree (Q3000509) (← links)
- (Q3024762) (← links)
- (Q3043759) (← links)
- (Q3043781) (← links)
- Computational Complexity of Traffic Hijacking under BGP and S-BGP (Q3167036) (← links)
- Algorithms and Bounds for L-Drawings of Directed Graphs (Q3177336) (← links)
- Visualizing Interdomain Routing with BGPlay (Q3378512) (← links)
- Splitting Clusters to Get C-Planarity (Q3557871) (← links)
- Drawing Trees in a Streaming Model (Q3557886) (← links)
- Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time (Q3603534) (← links)
- Topological Morphing of Planar Graphs (Q3611848) (← links)
- Non-convex Representations of Graphs (Q3611875) (← links)
- (Q4422270) (← links)
- (Q4448767) (← links)
- (Q4472289) (← links)
- A Split&Push Approach to 3D Orthogonal Drawing (Q4511259) (← links)
- Planar L-Drawings of Directed Graphs (Q4625136) (← links)
