30 results on '"PATRIGNANI, MAURIZIO"'
Search Results
2. Clique-TF-IDF: A New Partitioning Framework Based on Dense Substructures
3. Fan-Planar Graphs: Combinatorial Properties and Complexity Results
4. Anchored Drawings of Planar Graphs
5. Morphing Planar Graph Drawings Optimally
6. On the Complexity of HV-rectilinear Planarity Testing
7. Drawing Non-Planar Graphs with Crossing-Free Subgraphs
8. Morphing Planar Graph Drawings Efficiently
9. Computational Complexity of Traffic Hijacking under BGP and S-BGP
10. Monotone Drawings of Graphs
11. Drawing Trees in a Streaming Model
12. Splitting Clusters to Get C-Planarity
13. Topological Morphing of Planar Graphs
14. Non-convex Representations of Graphs
15. On Embedding a Cycle in a Plane Graph
16. On Extending a Partial Straight-Line Drawing
17. Complexity Results for Three-Dimensional Orthogonal Graph Drawing
18. Clustering Cycles into Cycles of Clusters
19. A Note on the Self-similarity of Some Orthogonal Drawings
20. BGPlay: A System for Visualizing the Interdomain Routing Evolution
21. Stop Minding Your P’s and Q’s: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm
22. Orthogonal 3D Shapes of Theta Graphs
23. Industrial Plant Drawer
24. Drawing Database Schemas with DBdraw
25. Interactive Partitioning System Demonstration, Short
26. The Complexity of the Matching-Cut Problem
27. Infinite Trees and the Future
28. Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size
29. A Split&Push Approach to 3D Orthogonal Drawing
30. A Note on Minimum-Area Straight-Line Drawings of Planar Graphs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.