Maurizio Patrignani

According to our database1, Maurizio Patrignani authored at least 107 papers between 1997 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Beyond level planarity: Cyclic, torus, and simultaneous level planarity.
Theor. Comput. Sci., 2020

LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs.
J. Comput. Syst. Sci., 2020

Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
HV-planarity: Algorithms and complexity.
J. Comput. Syst. Sci., 2019

Graph Stories in Small Area.
CoRR, 2019

On the Area Requirements of Planar Straight-Line Orthogonal Drawings of Ternary Trees.
CoRR, 2019

NodeTrix Planarity Testing with Small Clusters.
Algorithmica, 2019

How to Morph a Tree on a Small Grid.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Graph Stories in Small Area.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

The QuaSEFE Problem.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Upward Book Embeddings of st-Graphs.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

Shared-Nothing Distributed Enumeration of 2-Plexes.
Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019

2018
Computing NodeTrix Representations of Clustered Graphs.
J. Graph Algorithms Appl., 2018

Algorithms and Bounds for L-Drawings of Directed Graphs.
Int. J. Found. Comput. Sci., 2018

Efficient Algorithms for Bend-minimum Orthogonal Drawings of Planar 3-Graphs.
CoRR, 2018

Cliques are Too Strict for Representing Communities: Finding Large k-plexes in Real Networks.
Proceedings of the 26th Italian Symposium on Advanced Database Systems, 2018

On the Area Requirements of Straight-Line Orthogonal Drawings of Ternary Trees.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

Exploring Flow Metrics in Dense Geographical Networks.
Proceedings of the 13th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP 2018), 2018

Upward Planar Morphs.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

Bend-Minimum Orthogonal Drawings in Quadratic Time.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

Clustered Planarity = Flat Clustered Planarity.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

2017
How to Morph Planar Graph Drawings.
SIAM J. Comput., 2017

Intersection-Link Representations of Graphs.
J. Graph Algorithms Appl., 2017

Fast Enumeration of Large k-Plexes.
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

NodeTrix Planarity Testing with Small Clusters.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Planar L-Drawings of Directed Graphs.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Visualizing Co-phylogenetic Reconciliations.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Efficiently Clustering Very Large Attributed Graphs.
Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, Sydney, Australia, July 31, 2017

2016
Bend Minimization for Orthogonal Drawings of Plane Graphs.
Encyclopedia of Algorithms, 2016

L-Drawings of Directed Graphs.
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

Community Detection in Social Networks: Breaking the Taboos.
Proceedings of the 24th Italian Symposium on Advanced Database Systems, 2016

RoutingWatch: Visual exploration and analysis of routing events.
Proceedings of the 2016 IEEE/IFIP Network Operations and Management Symposium, 2016

Beyond Level Planarity.
Proceedings of the Graph Drawing and Network Visualization, 2016

Finding All Maximal Cliques in Very Large Social Networks.
Proceedings of the 19th International Conference on Extending Database Technology, 2016

NetFork: Mapping Time to Space in Network Visualization.
Proceedings of the International Working Conference on Advanced Visual Interfaces, 2016

2015
Computational complexity of traffic hijacking under BGP and S-BGP.
Theor. Comput. Sci., 2015

Fan-planarity: Properties and complexity.
Theor. Comput. Sci., 2015

Testing Planarity of Partially Embedded Graphs.
ACM Trans. Algorithms, 2015

Testing Cyclic Level and Simultaneous Level Planarity.
CoRR, 2015

Relaxing the constraints of clustered planarity.
Comput. Geom., 2015

Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs.
Comput. Geom., 2015

Bitconeview: visualization of flows in the bitcoin transaction graph.
Proceedings of the 2015 IEEE Symposium on Visualization for Cyber Security, 2015

Drawing Georeferenced Graphs - Combining Graph Drawing and Geographic Data.
Proceedings of the IVAPP 2015, 2015

On the Relationship Between Map Graphs and Clique Planar Graphs.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Optimal Morphs of Convex Drawings.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014
Upward and quasi-upward planarity testing of embedded mixed graphs.
Theor. Comput. Sci., 2014

Properties and Complexity of Fan-Planarity.
CoRR, 2014

Morphing Planar Graph Drawings Optimally.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

On the Complexity of HV-rectilinear Planarity Testing.
Proceedings of the Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, 2014

Fan-Planar Graphs: Combinatorial Properties and Complexity Results.
Proceedings of the Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, 2014

Anchored Drawings of Planar Graphs.
Proceedings of the Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, 2014

2013
Planarity Testing and Embedding.
Proceedings of the Handbook on Graph Drawing and Visualization., 2013

Topological morphing of planar graphs.
Theor. Comput. Sci., 2013

Guest Editors' Foreword.
J. Graph Algorithms Appl., 2013

Morphing Planar Graphs Drawings Efficiently.
CoRR, 2013

Drawings of Non-planar Graphs with Crossing-free Subgraphs.
CoRR, 2013

Morphing Planar Graph Drawings with a Polynomial Number of Steps.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Morphing Planar Graph Drawings Efficiently.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

Drawing Non-Planar Graphs with Crossing-Free Subgraphs.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012
Nonconvex Representations of Plane Graphs.
SIAM J. Discrete Math., 2012

Monotone Drawings of Graphs.
J. Graph Algorithms Appl., 2012

Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph.
J. Discrete Algorithms, 2012

Drawing trees in a streaming model.
Inf. Process. Lett., 2012

2011
Visual Analysis of Large Graphs Using (X, Y)-Clustering and Hybrid Visualizations.
IEEE Trans. Vis. Comput. Graph., 2011

Finding a Minimum-depth Embedding of a Planar Graph in O(n4) Time.
Algorithmica, 2011

2010
Guest Editor's Foreword.
J. Graph Algorithms Appl., 2010

Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Assigning AS relationships to satisfy the Gao-Rexford conditions.
Proceedings of the 18th annual IEEE International Conference on Network Protocols, 2010

Visual analysis of large graphs using (X, Y)-clustering and hybrid visualizations.
Proceedings of the IEEE Pacific Visualization Symposium PacificVis 2010, 2010

2009
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features.
Theory Comput. Syst., 2009

On embedding a cycle in a plane graph.
Discrete Mathematics, 2009

Covert Channel for One-Way Delay Measurements.
Proceedings of the 18th International Conference on Computer Communications and Networks, 2009

Splitting Clusters to Get C-Planarity.
Proceedings of the Graph Drawing, 17th International Symposium, 2009

2008
C-Planarity of C-Connected Clustered Graphs.
J. Graph Algorithms Appl., 2008

Complexity results for three-dimensional orthogonal graph drawing.
J. Discrete Algorithms, 2008

Non-convex Representations of Graphs.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

08191 Working Group Report - X-graphs of Y-graphs and their Representations.
Proceedings of the Graph Drawing with Applications to Bioinformatics and Social Sciences, 04.05., 2008

2007
Computing the types of the relationships between autonomous systems.
IEEE/ACM Trans. Netw., 2007

Investigating prefix propagation through active BGP probing.
Microprocessors and Microsystems, 2007

Computing a Minimum-Depth Planar Graph Embedding in O ( n 4) Time.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

A Note on Minimum-Area Straight-Line Drawings of Planar Graphs.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

Homothetic Triangle Contact Representations of Planar Graphs.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Topographic Visualization of Prefix Propagation in the Internet.
IEEE Trans. Vis. Comput. Graph., 2006

On Extending a Partial Straight-line Drawing.
Int. J. Found. Comput. Sci., 2006

On the Topologies of Local Minimum Spanning Trees.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

2005
Clustering Cycles into Cycles of Clusters.
J. Graph Algorithms Appl., 2005

Visualizing Interdomain Routing with BGPlay.
J. Graph Algorithms Appl., 2005

2004
IPv6-in-IPv4 Tunnel Discovery: Methods and Experimental Results.
IEEE Trans. Network and Service Management, 2004

A note on 3D orthogonal drawings with direction constrained edges.
Inf. Process. Lett., 2004

Discovering IPv6-in-IPv4 tunnels in the Internet.
Proceedings of the Managing Next Generation Convergence Networks and Services, 2004

A Note on the Self-similarity of Some Orthogonal Drawings.
Proceedings of the Graph Drawing, 12th International Symposium, 2004

DBdraw - Automatic Layout of Relational Database Schemas.
Proceedings of the Graph Drawing Software, 2004

2003
Computing the Types of the Relationships between Autonomous Systems.
Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003

Stop Minding Your P's and Q's: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

BGPlay: A System for Visualizing the Interdomain Routing Evolution.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002
Drawing database schemas.
Softw., Pract. Exper., 2002

Orthogonal 3D Shapes of Theta Graphs.
Proceedings of the Graph Drawing, 10th International Symposium, 2002

2001
On the complexity of orthogonal compaction.
Comput. Geom., 2001

The Complexity of the Matching-Cut Problem.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

Industrial Plant Drawer.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

Drawing Database Schemas with DBdraw.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

2000
A Split & Push Approach to 3D Orthogonal Drawing.
J. Graph Algorithms Appl., 2000

Drawing Relational Schemas.
Proceedings of the 2000 Joint Eurographics and IEEE TCVG Symposium on Visualization, 2000

Interactive Partitioning (System Demonstration, Short).
Proceedings of the Graph Drawing, 8th International Symposium, 2000

1999
Infinite Trees and the Future.
Proceedings of the Graph Drawing, 7th International Symposium, 1999

Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size.
Proceedings of the Graph Drawing, 7th International Symposium, 1999

1997
3DCube: A Tool for Three Dimensional Graph Drawing.
Proceedings of the Graph Drawing, 5th International Symposium, 1997


  Loading...