The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Maurizio Patrignani: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli, Katharina Anna Lehmann, Giuseppe Liotta, Maurizio Patrignani, Ioannis G. Tollis, Francesco Trotta
    On the Topologies of Local Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    CAAN, 2006, pp:31-44 [Conf]
  2. John M. Boyer, Pier Francesco Cortese, Maurizio Patrignani, Giuseppe Di Battista
    Stop Minding Your P's and Q's: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:25-36 [Conf]
  3. Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia
    Drawing Database Schemas with DBdraw. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:451-452 [Conf]
  4. Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia
    Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:297-310 [Conf]
  5. Giuseppe Di Battista, Federico Mariani, Maurizio Patrignani, Maurizio Pizzonia
    BGPlay: A System for Visualizing the Interdomain Routing Evolution. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:295-306 [Conf]
  6. Giuseppe Di Battista, Maurizio Patrignani, Francesco Vargiu
    A Split&Push Approach to 3D Orthogonal Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:87-101 [Conf]
  7. Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia
    Clustering Cycles into Cycles of Clusters. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:100-110 [Conf]
  8. Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia
    On Embedding a Cycle in a Plane Graph. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:49-60 [Conf]
  9. Camil Demetrescu, Giuseppe Di Battista, Irene Finocchi, Giuseppe Liotta, Maurizio Patrignani, Maurizio Pizzonia
    Infinite Trees and the Future. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:379-391 [Conf]
  10. Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia
    Industrial Plant Drawer. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:475-476 [Conf]
  11. Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani
    Orthogonal 3D Shapes of Theta Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:142-149 [Conf]
  12. Neal Lesh, Joe Marks, Maurizio Patrignani
    Interactive Partitioning (System Demonstration, Short). [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:31-36 [Conf]
  13. Maurizio Patrignani
    A Note on the Self-similarity of Some Orthogonal Drawings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:389-394 [Conf]
  14. Maurizio Patrignani
    Complexity Results for Three-Dimensional Orthogonal Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:368-379 [Conf]
  15. Maurizio Patrignani
    On Extending a Partial Straight-Line Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:380-385 [Conf]
  16. Maurizio Patrignani, Francesco Vargiu
    3DCube: A Tool for Three Dimensional Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:284-290 [Conf]
  17. Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia
    Computing the Types of the Relationships between Autonomous Systems. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2003, pp:- [Conf]
  18. Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia, Massimo Rimondini
    Investigating Prefix Propagation through Active BGP Probing. [Citation Graph (0, 0)][DBLP]
    ISCC, 2006, pp:497-504 [Conf]
  19. Maurizio Patrignani
    On the Complexity of Orthogonal Compaction. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:56-61 [Conf]
  20. Maurizio Patrignani, Maurizio Pizzonia
    The Complexity of the Matching-Cut Problem. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:284-295 [Conf]
  21. Maurizio Patrignani
    On the complexity of orthogonal compaction. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2001, v:19, n:1, pp:47-67 [Journal]
  22. Maurizio Patrignani
    On Extending a Partial Straight-line Drawing. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:5, pp:1061-1070 [Journal]
  23. Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani
    A note on 3D orthogonal drawings with direction constrained edges. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:90, n:2, pp:97-101 [Journal]
  24. Giuseppe Di Battista, Maurizio Patrignani, Francesco Vargiu
    A Split & Push Approach to 3D Orthogonal Drawing. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2000, v:4, n:3, pp:105-133 [Journal]
  25. Lorenzo Colitti, Giuseppe Di Battista, Federico Mariani, Maurizio Patrignani, Maurizio Pizzonia
    Visualizing Interdomain Routing with BGPlay. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2005, v:9, n:1, pp:117-148 [Journal]
  26. Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia
    Drawing database schemas. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 2002, v:32, n:11, pp:1065-1098 [Journal]
  27. Pier Francesco Cortese, Giuseppe Di Battista, Antonello Moneta, Maurizio Patrignani, Maurizio Pizzonia
    Topographic Visualization of Prefix Propagation in the Internet. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Vis. Comput. Graph., 2006, v:12, n:5, pp:725-732 [Journal]
  28. Melanie Badent, Carla Binucci, Emilio Di Giacomo, Walter Didimo, Stefan Felsner, Francesco Giordano, Jan Kratochvíl, Pietro Palladino, Maurizio Patrignani, Francesco Trotta
    Homothetic Triangle Contact Representations of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:233-236 [Conf]
  29. Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani
    Computing a Minimum-Depth Planar Graph Embedding in O ( n 4) Time. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:287-299 [Conf]
  30. Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani
    On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:1-13 [Conf]
  31. Giuseppe Di Battista, Thomas Erlebach, Alexander Hall, Maurizio Patrignani, Maurizio Pizzonia, Thomas Schank
    Computing the types of the relationships between autonomous systems. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2007, v:15, n:2, pp:267-280 [Journal]
  32. Lorenzo Colitti, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia, Massimo Rimondini
    Investigating prefix propagation through active BGP probing. [Citation Graph (0, 0)][DBLP]
    Microprocessors and Microsystems, 2007, v:31, n:7, pp:460-474 [Journal]

  33. Visual analysis of large graphs using (X, Y)-clustering and hybrid visualizations. [Citation Graph (, )][DBLP]


  34. Drawing Trees in a Streaming Model. [Citation Graph (, )][DBLP]


  35. Non-convex Representations of Graphs. [Citation Graph (, )][DBLP]


  36. Splitting Clusters to Get C-Planarity. [Citation Graph (, )][DBLP]


  37. A Note on Minimum-Area Straight-Line Drawings of Planar Graphs. [Citation Graph (, )][DBLP]


  38. Topological Morphing of Planar Graphs. [Citation Graph (, )][DBLP]


  39. Testing Planarity of Partially Embedded Graphs. [Citation Graph (, )][DBLP]


  40. Discovering IPv6-in-IPv4 tunnels in the Internet. [Citation Graph (, )][DBLP]


  41. On embedding a cycle in a plane graph. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002