152 results on '"Di Battista, Giuseppe"'
Search Results
2. Treebar Maps: Schematic Representation of Networks at Scale
3. Quantum Graph Drawing
4. Computational complexity of traffic hijacking under BGP and S-BGP
5. The importance of being proper: (In clustered-level planarity and T-level planarity)
6. Relaxing the constraints of clustered planarity
7. Unit-length Rectangular Drawings of Graphs
8. Planar Straight-line Realizations of 2-Trees with Prescribed Edge Lengths
9. Topological morphing of planar graphs
10. On embedding a cycle in a plane graph
11. From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-Line Drawings and Morphs
12. Incremental Convex Planarity Testing
13. Turn-regularity and optimal area drawings of orthogonal representations
14. GDToolkit
15. MPLS Virtual Private Networks
16. Computer Networks
17. Graph animation
18. RAC and LAC Drawings of Planar Graphs in Subquadratic Area
19. On the Complexity of Clustered-Level Planarity and T-Level Planarity
20. (Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective (Invited Lecture)
21. Clustered Planarity (Invited Lecture)
22. Towards Optimal Prepending for Incoming Traffic Engineering
23. Algorithms for the Inference of the Commercial Relationships between Autonomous Systems: Results Analysis and Model Validation
24. Computing with BGP: from Routing Configurations to Turing Machines
25. Infinite Trees and the Future
26. Orthogonal and Quasi-Upward Drawings with Vertices of Prescribed Size
27. Graph Drawing: the Aesthetics-Complexity Trade-Off (Invited Lecture)
28. Output-Sensitive Reporting of Disjoint Paths
29. Optimal Upward Planarity Testing for Single Source Acyclic Digraphs
30. Spirality and Optimal Orthogonal Drawings
31. An Experimental Comparison of Four Graph Drawing Algorithms
32. On-Line Planarity Testing
33. An Experimental Comparison of Three Graph Drawing Algorithms
34. On-Line Convex Planarity Testing
35. Orthogonal Drawings with the Minimum Number of Bends
36. Spirality of Orthogonal Representations and Optimal Drawings of Series-Parallel Graphs and 3-Planar Graphs
37. Structuring Primitives for a Dictionary of Entity-Relationship Data Schemas
38. Deductive Entity-Relationship Modeling
39. Constrained Visibility Representations of Graphs
40. Diagram Server
41. Area Requirement and Symmetry Display of Planar Upward Drawings
42. A Formal Framework for Multilevel Schema Documentation in a Data Dictionary
43. On upward drawing testing of triconnected digraphs
44. Bipartite Graphs Upward Drawings and Planarity
45. Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph.
46. How to draw a clustered tree.
47. Megalos: A Scalable Architecture for the Virtualization of Large Network Scenarios †.
48. The strength of weak proximity.
49. Parametric Graph Drawing.
50. Structuring Primitives for a Dictionary of Entity Relationship Data 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.