The following pages link to Giuseppe Di Battista (Q386890):
Displayed 50 items.
- Topological morphing of planar graphs (Q386891) (← links)
- The shape of orthogonal cycles in three dimensions (Q411405) (← 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)
- Strip planarity testing for embedded planar graphs (Q524364) (← links)
- Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time (Q547303) (← links)
- The strength of weak proximity (Q849629) (← links)
- Bipartite graphs, upward drawings, and planarity (Q918730) (← links)
- Item:Q386890 (redirect page) (← links)
- Upward drawings of triconnected digraphs. (Q960528) (← links)
- On embedding a cycle in a plane graph (Q1011765) (← links)
- Small area drawings of outerplanar graphs (Q1024211) (← links)
- Item:Q386890 (redirect page) (← links)
- How to draw a clustered tree (Q1044037) (← links)
- Algorithms for plane representations of acyclic digraphs (Q1124349) (← links)
- Constrained visibility representations of graphs (Q1186563) (← links)
- Area requirement and symmetry display of planar upward drawings (Q1189288) (← links)
- A note on optimal area algorithms for upward drawings of binary trees (Q1208428) (← links)
- Output-sensitive reporting of disjoint paths (Q1283681) (← links)
- Algorithms for drawing graphs: An annotated bibliography (Q1337400) (← links)
- Quasi-upward planarity (Q1348947) (← links)
- Turn-regularity and optimal area drawings of orthogonal representations (Q1567307) (← links)
- On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs (Q1687902) (← links)
- Embedding problems for paths with direction constrained edges. (Q1853570) (← links)
- Incremental convex planarity testing (Q1854448) (← links)
- On-line maintenance of triconnected components with SPQR-trees (Q1911463) (← links)
- Small universal point sets for \(k\)-outerplanar graphs (Q1991093) (← links)
- From Tutte to Floater and Gotsman: on the resolution of planar straight-line drawings and morphs (Q2151435) (← links)
- Planar straight-line realizations of 2-trees with prescribed edge lengths (Q2151440) (← 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)
- An experimental comparison of four graph drawing algorithms. (Q2482890) (← links)
- The importance of being proper (Q2512653) (← links)
- DRAWING DIRECTED ACYCLIC GRAPHS: AN EXPERIMENTAL STUDY (Q2708043) (← links)
- (Q2712307) (← links)
- (Q2766815) (← links)
- Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area (Q2849802) (← links)
- Strip Planarity Testing (Q2867641) (← links)
- Dynamic Traceroute Visualization at Multiple Abstraction Levels (Q2867688) (← links)
- On the stability of interdomain routing (Q2875089) (← links)
- Succinct greedy drawings do not always exist (Q2894243) (← links)
- The Importance of Being Proper (Q2936931) (← links)
- Anchored Drawings of Planar Graphs (Q2936948) (← links)
- Advances on Testing C-Planarity of Embedded Flat Clustered Graphs (Q2936949) (← links)
- Intersection-Link Representations of Graphs (Q2959759) (← links)
- Computing NodeTrix Representations of Clustered Graphs (Q2961508) (← links)
- Beyond Level Planarity (Q2961540) (← links)
- Simultaneous Orthogonal Planarity (Q2961544) (← links)