18 results on '"Di Battista, Giuseppe"'
Search Results
2. Computational complexity of traffic hijacking under BGP and S-BGP
3. The importance of being proper: (In clustered-level planarity and T-level planarity)
4. Relaxing the constraints of clustered planarity
5. Topological morphing of planar graphs
6. On embedding a cycle in a plane graph
7. Parametric graph drawing
8. Structuring primitives for a dictionary of entity relationship data schemas
9. Incremental Convex Planarity Testing
10. Turn-regularity and optimal area drawings of orthogonal representations
11. Computing orthogonal drawings with a minimum number of bends
12. Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph.
13. How to draw a clustered tree.
14. Megalos: A Scalable Architecture for the Virtualization of Large Network Scenarios †.
15. The strength of weak proximity.
16. Beyond level planarity: Cyclic, torus, and simultaneous level planarity.
17. An experimental comparison of four graph drawing algorithms
18. Algorithms for plane representations of acyclic digraphs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.