Fabrizio Montecchiani

Orcid: 0000-0002-0543-8912

Affiliations:
  • University of Perugia, Italy


According to our database1, Fabrizio Montecchiani authored at least 142 papers between 2011 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Introducing fairness in network visualization.
Inf. Sci., 2025

2024
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity.
Algorithmica, October, 2024

Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees.
Algorithmica, August, 2024

Comparative Study and Evaluation of Hybrid Visualizations of Graphs.
IEEE Trans. Vis. Comput. Graph., July, 2024

On the complexity of the storyplan problem.
J. Comput. Syst. Sci., February, 2024

Recognizing Map Graphs of Bounded Treewidth.
Algorithmica, February, 2024

Convex grid drawings of planar graphs with constant edge-vertex resolution.
Theor. Comput. Sci., January, 2024

Book embeddings of <i>k</i>-framed graphs and <i>k</i>-map graphs.
Discret. Math., January, 2024

Optimal-area visibility representations of outer-1-plane graphs.
J. Comput. Geom., 2024

Strictly-convex drawings of 3-connected planar graphs.
J. Comput. Geom., 2024

Brand Network Booster: A new system for improving brand connectivity.
Comput. Ind. Eng., 2024

Partial Temporal Vertex Cover with Bounded Activity Intervals.
Proceedings of the 3rd Symposium on Algorithmic Foundations of Dynamic Networks, 2024

On 1-Bend Upward Point-Set Embeddings of st-Digraphs.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Simple Realizability of Abstract Topological Graphs.
Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

GraphTrials: Visual Proofs of Graph Properties.
Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

On the Complexity of Recognizing k^+-Real Face Graphs.
Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

Introducing Fairness in Graph Visualization (Poster Abstract).
Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

2023
On the parameterized complexity of s-club cluster deletion problems.
Theor. Comput. Sci., August, 2023

On the upward book thickness problem: Combinatorial and complexity results.
Eur. J. Comb., May, 2023

Editorial.
Comput. Geom., April, 2023

New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162).
Dagstuhl Reports, 2023

New Bounds on the Local and Global Edge-length Ratio of Planar Graphs.
CoRR, 2023

Brand Network Booster: A New System for Improving Brand Connectivity.
CoRR, 2023

Geodesic obstacle representation of graphs.
Comput. Geom., 2023

1-planarity testing and embedding: An experimental study.
Comput. Geom., 2023

On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Large-scale Computing Frameworks: Experiments and Guidelines.
Proceedings of the 2nd Italian Conference on Big Data and Data Science (ITADATA 2023), 2023

Dataspaces: Concepts, Architectures and Initiatives.
Proceedings of the 2nd Italian Conference on Big Data and Data Science (ITADATA 2023), 2023

The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges (short paper).
Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

Design of a Process and a Container-Based Cloud Architecture for the Automatic Generation of Storyline Visualizations.
Proceedings of the Advanced Information Networking and Applications, 2023

The Influence of Dimensions on the Complexity of Computing Decision Trees.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Influence Maximization With Visual Analytics.
IEEE Trans. Vis. Comput. Graph., 2022

Hybrid Graph Visualizations With ChordLink: Algorithms, Experiments, and Applications.
IEEE Trans. Vis. Comput. Graph., 2022

Crossing numbers of beyond-planar graphs.
Theor. Comput. Sci., 2022

On morphs of 1-plane graphs.
J. Comput. Geom., 2022

Parameterized Algorithms for Queue Layouts.
J. Graph Algorithms Appl., 2022

Orthogonal planarity testing of bounded treewidth graphs.
J. Comput. Syst. Sci., 2022

On the Parameterized Complexity of the s-Club Cluster Edge Deletion Problem.
CoRR, 2022

Placing Arrows in Directed Graph Layouts: Algorithms and Experiments.
Comput. Graph. Forum, 2022

Universal Slope Sets for Upward Planar Drawings.
Algorithmica, 2022

BrowVis: Visualizing Large Graphs in the Browser.
IEEE Access, 2022

In-browser Visualization of Large-scale Graphs.
Proceedings of the 1st Italian Conference on Big Data and Data Science (itaDATA 2022), 2022

On the Parametrized Complexity of the s-Club Cluster Edge Deletion Problem.
Proceedings of the 23rd Italian Conference on Theoretical Computer Science, 2022

2021
Ortho-polygon visibility representations of 3-connected 1-plane graphs.
Theor. Comput. Sci., 2021

Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles.
J. Graph Algorithms Appl., 2021

The Stub Resolution of 1-planar Graphs.
J. Graph Algorithms Appl., 2021

Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293).
Dagstuhl Reports, 2021

Grid drawings of graphs with constant edge-vertex resolution.
Comput. Geom., 2021

On Morphing 1-Planar Drawings.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

A User Study on Hybrid Graph Visualizations.
Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

Generalized LR-Drawings of Trees.
Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020
Polyline drawings with topological constraints.
Theor. Comput. Sci., 2020

Parameterized Algorithms for Book Embedding Problems.
J. Graph Algorithms Appl., 2020

Simple <i>k</i>-planar graphs are simple (<i>k</i> + 1)-quasiplanar.
J. Comb. Theory B, 2020

Grid Drawings of Graphs with Constant Edge-Vertex Resolution.
CoRR, 2020

On Layered Fan-Planar Graph Drawings.
CoRR, 2020

1-bend upward planar slope number of SP-digraphs.
Comput. Geom., 2020

Combining Network Visualization and Data Mining for Tax Risk Assessment.
IEEE Access, 2020

An Experimental Study of a 1-Planarity Testing and Embedding Algorithm.
Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

Layered Fan-Planar Graph Drawings.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Storyline Visualizations with Ubiquitous Actors.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

VAIM: Visual Analytics for Influence Maximization.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

Visual Analytics for Financial Crime Detection at the University of Perugia.
Proceedings of the Advanced Visual Interfaces. Supporting Artificial Intelligence and Big Data Applications, 2020

Edge Partitions and Visibility Representations of 1-planar Graphs.
Proceedings of the Beyond Planar Graphs, Communications of NII Shonan Meetings., 2020

2019
A Distributed Multilevel Force-Directed Algorithm.
IEEE Trans. Parallel Distributed Syst., 2019

On 3D visibility representations of graphs with few crossings per edge.
Theor. Comput. Sci., 2019

Planar Graphs of Bounded Degree Have Bounded Queue Number.
SIAM J. Comput., 2019

Visual querying and analysis of temporal fiscal networks.
Inf. Sci., 2019

Edge partitions of optimal 2-plane and 3-plane graphs.
Discret. Math., 2019

A Survey on Graph Drawing Beyond Planarity.
ACM Comput. Surv., 2019

Simple k-Planar Graphs are Simple (k+1)-Quasiplanar.
CoRR, 2019

Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation.
Algorithmica, 2019

Universal Slope Sets for 1-Bend Planar Drawings.
Algorithmica, 2019

Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

ChordLink: A New Hybrid Visualization Model.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

2018
Drawing subcubic planar graphs with four slopes and optimal angular resolution.
Theor. Comput. Sci., 2018

New results on edge partitions of 1-plane graphs.
Theor. Comput. Sci., 2018

Gap-planar graphs.
Theor. Comput. Sci., 2018

Guest Editors' Foreword and Overview.
J. Graph Algorithms Appl., 2018

Profiling distributed graph processing systems through visual analytics.
Future Gener. Comput. Syst., 2018

A visual analytics system to support tax evasion discovery.
Decis. Support Syst., 2018

Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs.
Discret. Comput. Geom., 2018

Planar Graphs of Bounded Degree have Constant Queue Number.
CoRR, 2018

Visibility representations of boxes in 2.5 dimensions.
Comput. Geom., 2018

A Visualization Framework and User Studies for Overloaded Orthogonal Drawings.
Comput. Graph. Forum, 2018

Ortho-polygon Visibility Representations of Embedded Graphs.
Algorithmica, 2018

Bounded Stub Resolution for Some Maximal 1-Planar Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017
On partitioning the edges of 1-plane graphs.
Theor. Comput. Sci., 2017

On RAC drawings of 1-planar graphs.
Theor. Comput. Sci., 2017

Progress on Partial Edge Drawings.
J. Graph Algorithms Appl., 2017

Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus.
J. Graph Algorithms Appl., 2017

Vertex-Coloring with Defects.
J. Graph Algorithms Appl., 2017

Large graph visualizations using a distributed computing platform.
Inf. Sci., 2017

Designing the Content Analyzer of a Travel Recommender System.
Expert Syst. Appl., 2017

An annotated bibliography on 1-planarity.
Comput. Sci. Rev., 2017

Area-Thickness Trade-Offs for Straight-Line Drawings of Planar Graphs.
Comput. J., 2017

On the Relationship Between k-Planar and k-Quasi-Planar Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

On Guarding Orthogonal Polygons with Sliding Cameras.
Proceedings of the WALCOM: Algorithms and Computation, 2017

GiViP: A Visual Profiler for Distributed Graph Processing Systems.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

3D Visibility Representations of 1-planar Graphs.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

A Universal Slope Set for 1-Bend Planar Drawings.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
Simultaneous visibility representations of plane st-graphs using L-shapes.
Theor. Comput. Sci., 2016

Recognizing and drawing IC-planar graphs.
Theor. Comput. Sci., 2016

L-visibility drawings of IC-planar graphs.
Inf. Process. Lett., 2016

A Distributed Force-Directed Algorithm on Giraph: Design and Experiments.
CoRR, 2016

Partial edge drawing: Homogeneity is more important than crossings and ink.
Proceedings of the 7th International Conference on Information, 2016

1-Bend Upward Planar Drawings of SP-Digraphs.
Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

1-Bend RAC Drawings of 1-Planar Graphs.
Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

Placing Arrows in Directed Graph Drawings.
Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

On Visibility Representations of Non-Planar Graphs.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

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

Drawing Outer 1-planar Graphs with Few Slopes.
J. Graph Algorithms Appl., 2015

On Partitioning the Edges of 1-Planar Graphs.
CoRR, 2015

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

Network visualization retargeting.
Proceedings of the 6th International Conference on Information, 2015

VisFLOWer: Visual analysis of touristic flows.
Proceedings of the 6th International Conference on Information, 2015

Kojaph: Visual Definition and Exploration of Patterns in Graph Databases.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2-Layer Fan-Planarity: From Caterpillar to Stegosaurus.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

A Million Edge Drawing for a Fistful of Dollars.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014
Techniques for Edge Stratification of Complex Graph Drawings.
J. Vis. Lang. Comput., 2014

Network visualization for financial crime detection.
J. Vis. Lang. Comput., 2014

1-Bend Orthogonal Partial Edge Drawing.
J. Graph Algorithms Appl., 2014

Fast layout computation of clustered networks: Algorithmic advances and experimental analysis.
Inf. Sci., 2014

Properties and Complexity of Fan-Planarity.
CoRR, 2014

The Planar Slope Number of Subcubic Graphs.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Upward-rightward planar drawings.
Proceedings of the 5th International Conference on Information, 2014

How to visualize directed graphs: A user study.
Proceedings of the 5th International Conference on Information, 2014

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

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

Area requirement of graph drawings with few crossings per edge.
Comput. Geom., 2013

On the robustness of the Drosophila neural network.
Proceedings of the 2nd IEEE Network Science Workshop, 2013

TRART: A system to support territorial policies.
Proceedings of the Workshop Proceedings of the 9th International Conference on Intelligent Environments, 2013

Exploring Complex Drawings via Edge Stratification.
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
h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

Fast Layout Computation of Hierarchically Clustered Networks: Algorithmic Advances and Experimental Analysis.
Proceedings of the 16th International Conference on Information Visualisation, 2012

Vis4AUI: Visual Analysis of Banking Activity Networks.
Proceedings of the GRAPP & IVAPP 2012: Proceedings of the International Conference on Computer Graphics Theory and Applications and International Conference on Information Visualization Theory and Applications, 2012

2011
An advanced network visualization system for financial crime detection.
Proceedings of the IEEE Pacific Visualization Symposium, 2011


  Loading...