Search

Your search keyword '"PATRIGNANI, MAURIZIO"' showing total 168 results

Search Constraints

Start Over You searched for: Author "PATRIGNANI, MAURIZIO" Remove constraint Author: "PATRIGNANI, MAURIZIO" Publication Type eBooks Remove constraint Publication Type: eBooks
168 results on '"PATRIGNANI, MAURIZIO"'

Search Results

1. Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs

2. Clique-TF-IDF: A New Partitioning Framework Based on Dense Substructures

3. Small Point-Sets Supporting Graph Stories

4. st-Orientations with Few Transitive Edges

5. Unit-length Rectangular Drawings of Graphs

6. Planar Straight-Line Realizations of 2-Trees with Prescribed Edge Lengths

7. On Turn-Regular Orthogonal Representations

8. A Tipping Point for the Planarity of Small and Medium Sized Graphs

9. Schematic Representation of Biconnected Graphs

10. Graph Stories in Small Area

11. The QuaSEFE Problem

12. How to Morph a Tree on a Small Grid

13. On the Area Requirements of Straight-Line Orthogonal Drawings of Ternary Trees

14. Planar L-Drawings of Directed Graphs

15. NodeTrix Planarity Testing with Small Clusters

16. Visualizing Co-phylogenetic Reconciliations

17. Upward Planar Morphs

18. Clustered Planarity = Flat Clustered Planarity

19. Bend-Minimum Orthogonal Drawings in Quadratic Time

21. L-Drawings of Directed Graphs

22. Beyond Level Planarity

23. Computing NodeTrix Representations of Clustered Graphs

24. Intersection-Link Representations of Graphs

25. Non-convex Representations of Graphs

26. Topological Morphing of Planar Graphs

27. On the Complexity of HV-rectilinear Planarity Testing

28. Fan-Planar Graphs: Combinatorial Properties and Complexity Results

29. Anchored Drawings of Planar Graphs

30. Morphing Planar Graph Drawings Optimally

31. On the Relationship Between Map Graphs and Clique Planar Graphs

32. Drawing Non-Planar Graphs with Crossing-Free Subgraphs

33. Morphing Planar Graph Drawings Efficiently

34. Computational Complexity of Traffic Hijacking under BGP and S-BGP

35. Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree

36. Monotone Drawings of Graphs

37. Splitting Clusters to Get C-Planarity

38. Drawing Trees in a Streaming Model

39. A Note on Minimum-Area Straight-Line Drawings of Planar Graphs

40. Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time

41. On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features

42. Complexity Results for Three-Dimensional Orthogonal Graph Drawing : (Extended Abstract)

43. On Embedding a Cycle in a Plane Graph : (Extended Abstract)

44. On Extending a Partial Straight-Line Drawing

45. A Note on the Self-similarity of Some Orthogonal Drawings

46. Clustering Cycles into Cycles of Clusters

47. DBdraw — Automatic Layout of Relational Database Schemas

50. Orthogonal 3D Shapes of Theta Graphs

Catalog

Books, media, physical & digital resources