|
Search the dblp DataBase
Maurizio Patrignani:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia
Industrial Plant Drawer. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2001, pp:475-476 [Conf]
- 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]
- Neal Lesh, Joe Marks, Maurizio Patrignani
Interactive Partitioning (System Demonstration, Short). [Citation Graph (0, 0)][DBLP] Graph Drawing, 2000, pp:31-36 [Conf]
- Maurizio Patrignani
A Note on the Self-similarity of Some Orthogonal Drawings. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2004, pp:389-394 [Conf]
- Maurizio Patrignani
Complexity Results for Three-Dimensional Orthogonal Graph Drawing. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2005, pp:368-379 [Conf]
- Maurizio Patrignani
On Extending a Partial Straight-Line Drawing. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2005, pp:380-385 [Conf]
- Maurizio Patrignani, Francesco Vargiu
3DCube: A Tool for Three Dimensional Graph Drawing. [Citation Graph (0, 0)][DBLP] Graph Drawing, 1997, pp:284-290 [Conf]
- 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]
- 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]
- Maurizio Patrignani
On the Complexity of Orthogonal Compaction. [Citation Graph (0, 0)][DBLP] WADS, 1999, pp:56-61 [Conf]
- Maurizio Patrignani, Maurizio Pizzonia
The Complexity of the Matching-Cut Problem. [Citation Graph (0, 0)][DBLP] WG, 2001, pp:284-295 [Conf]
- Maurizio Patrignani
On the complexity of orthogonal compaction. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2001, v:19, n:1, pp:47-67 [Journal]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
Visual analysis of large graphs using (X, Y)-clustering and hybrid visualizations. [Citation Graph (, )][DBLP]
Drawing Trees in a Streaming Model. [Citation Graph (, )][DBLP]
Non-convex Representations of Graphs. [Citation Graph (, )][DBLP]
Splitting Clusters to Get C-Planarity. [Citation Graph (, )][DBLP]
A Note on Minimum-Area Straight-Line Drawings of Planar Graphs. [Citation Graph (, )][DBLP]
Topological Morphing of Planar Graphs. [Citation Graph (, )][DBLP]
Testing Planarity of Partially Embedded Graphs. [Citation Graph (, )][DBLP]
Discovering IPv6-in-IPv4 tunnels in the Internet. [Citation Graph (, )][DBLP]
On embedding a cycle in a plane graph. [Citation Graph (, )][DBLP]
Search in 0.062secs, Finished in 0.064secs
|