599 results on '"PATRIGNANI, MAURIZIO"'
Search Results
52. Planar L-Drawings of Directed Graphs
53. NodeTrix Planarity Testing with Small Clusters
54. Visualizing Co-phylogenetic Reconciliations
55. 2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees
56. Planar Straight-Line Realizations of 2-Trees with Prescribed Edge Lengths
57. Relaxing the Constraints of Clustered Planarity
58. Computational Complexity of Traffic Hijacking under BGP and S-BGP
59. Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
60. On Turn-Regular Orthogonal Representations
61. A Tipping Point for the Planarity of Small and Medium Sized Graphs
62. Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
63. NodeTrix Planarity Testing with Small Clusters
64. Bend Minimization for Orthogonal Drawings of Plane Graphs
65. L-Drawings of Directed Graphs
66. Beyond Level Planarity
67. How to Morph a Tree on a Small Grid
68. Graph Stories in Small Area
69. The QuaSEFE Problem
70. Nesting Containers for Faithful Datacenters Emulations
71. Rectilinear-Upward Planarity Testing of Digraphs
72. Non-convex Representations of Graphs
73. Topological Morphing of Planar Graphs
74. On the Complexity of HV-rectilinear Planarity Testing
75. Fan-Planar Graphs: Combinatorial Properties and Complexity Results
76. Anchored Drawings of Planar Graphs
77. Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs
78. Clustered Planarity = Flat Clustered Planarity
79. Upward Planar Morphs
80. Bend-Minimum Orthogonal Drawings in Quadratic Time
81. Computational complexity of traffic hijacking under BGP and S-BGP
82. Fan-planarity: Properties and complexity
83. On the Relationship Between Map Graphs and Clique Planar Graphs
84. Relaxing the constraints of clustered planarity
85. Drawing Non-Planar Graphs with Crossing-Free Subgraphs
86. Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree
87. Monotone Drawings of Graphs
88. Splitting Clusters to Get C-Planarity
89. Drawing Trees in a Streaming Model
90. Upward and quasi-upward planarity testing of embedded mixed graphs
91. A Note on Minimum-Area Straight-Line Drawings of Planar Graphs
92. Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time
93. On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features
94. Complexity Results for Three-Dimensional Orthogonal Graph Drawing : (Extended Abstract)
95. On Embedding a Cycle in a Plane Graph : (Extended Abstract)
96. On Extending a Partial Straight-Line Drawing
97. Topological morphing of planar graphs
98. A Note on the Self-similarity of Some Orthogonal Drawings
99. Clustering Cycles into Cycles of Clusters
100. DBdraw — Automatic Layout of Relational Database Schemas
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.