Fabrizio Montecchiani

ORCID

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 174

Top Venues

CoRR

Graph Drawing

Theor. Comput. Sci.

J. Graph Algorithms Appl.

Publications

Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis
On the complexity of the storyplan problem. J. Comput. Syst. Sci. 139 (2024)
Emilio Di Giacomo, Henry Förster, Daria Kokhovich, Tamara Mchedlidze, Fabrizio Montecchiani, Antonios Symvonis, Anaïs Villedieu
On 1-bend Upward Point-set Embeddings of st-digraphs. CoRR (2024)
Emilio Di Giacomo, Henry Förster, Daria Kokhovich, Tamara Mchedlidze, Fabrizio Montecchiani, Antonios Symvonis, Anaïs Villedieu
On 1-Bend Upward Point-Set Embeddings of st-Digraphs. LATIN (1) (2024)
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis
Convex grid drawings of planar graphs with constant edge-vertex resolution. Theor. Comput. Sci. 982 (2024)
Steven Chaplick, Giordano Da Lozzo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees. Algorithmica 86 (8) (2024)
Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini
Recognizing Map Graphs of Bounded Treewidth. Algorithmica 86 (2) (2024)
Jacopo Cancellieri, Walter Didimo, Andrea Fronzetti Colladon, Fabrizio Montecchiani, Roberto Vestrelli
Brand Network Booster: A new system for improving brand connectivity. Comput. Ind. Eng. 194 (2024)
Michael A. Bekos, Giordano Da Lozzo, Svenja M. Griesbach, Martin Gronemann, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou
-map graphs. Discret. Math. 347 (1) (2024)
Riccardo Dondi, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini
Partial Temporal Vertex Cover with Bounded Activity Intervals. SAND (2024)
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini
Comparative Study and Evaluation of Hybrid Visualizations of Graphs. IEEE Trans. Vis. Comput. Graph. 30 (7) (2024)
Maurizio Atzori, Angelo Ciaramella, Claudia Diamantini, Beniamino Di Martino, Salvatore Distefano, Tullio Facchinetti, Fabrizio Montecchiani, Antonino Nocera, Giancarlo Ruffo, Roberto Trasarti
Dataspaces: Concepts, Architectures and Initiatives. itaDATA (2023)
Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth. GD (2) (2023)
Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges. MFCS (2023)
Michele Baglioni, Fabrizio Montecchiani, Mario Rosati
Large-scale Computing Frameworks: Experiments and Guidelines. itaDATA (2023)
Emilio Di Giacomo, Fabrizio Montecchiani
Editorial. Comput. Geom. 111 (2023)
Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira
Geodesic obstacle representation of graphs. Comput. Geom. 109 (2023)
Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
Upward and Orthogonal Planarity are W[1]-hard Parameterized by Treewidth. CoRR (2023)
Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
The st-Planar Edge Completion Problem is Fixed-Parameter Tractable. CoRR (2023)
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
New Bounds on the Local and Global Edge-length Ratio of Planar Graphs. CoRR (2023)
Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms
The Influence of Dimensions on the Complexity of Computing Decision Trees. AAAI (2023)
Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg
Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable. CoRR (2023)
Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable. ISAAC (2023)
Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini
On the parameterized complexity of s-club cluster deletion problems. Theor. Comput. Sci. 969 (2023)
Walter Didimo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity. CoRR (2023)
Emilio Di Giacomo, Beniamino Di Martino, Walter Didimo, Antonio Esposito, Giuseppe Liotta, Fabrizio Montecchiani
Design of a Process and a Container-Based Cloud Architecture for the Automatic Generation of Storyline Visualizations. AINA (3) (2023)
J. Cancellieri, Walter Didimo, Andrea Fronzetti Colladon, Fabrizio Montecchiani
Brand Network Booster: A New System for Improving Brand Connectivity. CoRR (2023)
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity. GD (2) (2023)
Carla Binucci, Walter Didimo, Fabrizio Montecchiani
1-planarity testing and embedding: An experimental study. Comput. Geom. 108 (2023)
Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges (short paper). ICTCS (2023)
Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi, Liana Khazaliya
New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162). Dagstuhl Reports 13 (4) (2023)
Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg
On the upward book thickness problem: Combinatorial and complexity results. Eur. J. Comb. 110 (2023)
Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges. CoRR (2023)
Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg
Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable. SoCG (2023)
Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini
On the Parameterized Complexity of s-club Cluster Deletion Problems. SOFSEM (2023)
Carla Binucci, Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Fabrizio Montecchiani
Placing Arrows in Directed Graph Layouts: Algorithms and Experiments. Comput. Graph. Forum 41 (1) (2022)
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Parameterized Algorithms for Queue Layouts. J. Graph Algorithms Appl. 26 (3) (2022)
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis
Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution. IWOCA (2022)
Luca Consalvi, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
In-browser Visualization of Large-scale Graphs. itaDATA (2022)
Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis
On the Complexity of the Storyplan Problem. GD (2022)
Luca Consalvi, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
BrowVis: Visualizing Large Graphs in the Browser. IEEE Access 10 (2022)
Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini
On the Parametrized Complexity of the s-Club Cluster Edge Deletion Problem. ICTCS (2022)
Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini
Recognizing Map Graphs of Bounded Treewidth. CoRR (2022)
Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani, Maximilian Pfister
On morphs of 1-plane graphs. J. Comput. Geom. 13 (1) (2022)
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
Orthogonal planarity testing of bounded treewidth graphs. J. Comput. Syst. Sci. 125 (2022)
Alessio Arleo, Walter Didimo, Giuseppe Liotta, Silvia Miksch, Fabrizio Montecchiani
Influence Maximization With Visual Analytics. IEEE Trans. Vis. Comput. Graph. 28 (10) (2022)
Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr
Crossing numbers of beyond-planar graphs. Theor. Comput. Sci. 898 (2022)
Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms
The Influence of Dimensions on the Complexity of Computing Decision Trees. CoRR (2022)
Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis
On the Complexity of the Storyplan Problem. CoRR (2022)
Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
Universal Slope Sets for Upward Planar Drawings. Algorithmica 84 (9) (2022)
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis
Strictly-Convex Drawings of 3-Connected Planar Graphs. CoRR (2022)
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis
Convex Grid Drawings of Planar Graphs\\with Constant Edge-Vertex Resolution. CoRR (2022)
Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini
Recognizing Map Graphs of Bounded Treewidth. SWAT (2022)
Lorenzo Angori, Walter Didimo, Fabrizio Montecchiani, Daniele Pagliuca, Alessandra Tappini
Hybrid Graph Visualizations With ChordLink: Algorithms, Experiments, and Applications. IEEE Trans. Vis. Comput. Graph. 28 (2) (2022)
Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini
On the Parameterized Complexity of the s-Club Cluster Edge Deletion Problem. CoRR (2022)
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis
Strictly-Convex Drawings of 3-Connected Planar Graphs. GD (2022)
Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani, Maximilian Pfister
On Morphing 1-Planar Drawings. WG (2021)
Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi
Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293). Dagstuhl Reports 11 (6) (2021)
Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg
On the Upward Book Thickness Problem: Combinatorial and Complexity Results. CoRR (2021)
Therese C. Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
Optimal-area visibility representations of outer-1-plane graphs. CoRR (2021)
Steven Chaplick, Giordano Da Lozzo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees. CoRR (2021)
Therese C. Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
Generalized LR-drawings of trees. CoRR (2021)
Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. J. Graph Algorithms Appl. 25 (1) (2021)
Steven Chaplick, Giordano Da Lozzo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees. WADS (2021)
Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Alessandra Tappini
A User Study on Hybrid Graph Visualizations. Graph Drawing (2021)
Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani, Maximilian Pfister
On Morphing 1-Planar Drawings. CoRR (2021)
Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Alessandra Tappini
A User Study on Hybrid Graph Visualizations. CoRR (2021)
Therese C. Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
Generalized LR-Drawings of Trees. CCCG (2021)
Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini
Ortho-polygon visibility representations of 3-connected 1-plane graphs. Theor. Comput. Sci. 863 (2021)
Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr
The Stub Resolution of 1-planar Graphs. J. Graph Algorithms Appl. 25 (2) (2021)
Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg
On the Upward Book Thickness Problem: Combinatorial and Complexity Results. Graph Drawing (2021)
Therese C. Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
Optimal-Area Visibility Representations of Outer-1-Plane Graphs. Graph Drawing (2021)
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Dömötör Pálvölgyi, Antonios Symvonis, Leonidas Theocharous
Grid drawings of graphs with constant edge-vertex resolution. Comput. Geom. 98 (2021)
Michael A. Bekos, Giordano Da Lozzo, Svenja Griesbach, Martin Gronemann, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou
Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages. SoCG (2020)
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Parameterized Algorithms for Queue Layouts. CoRR (2020)
Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Michael Hoffmann, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth
 + 1)-quasiplanar. J. Comb. Theory, Ser. B 142 (2020)
Therese C. Biedl, Steven Chaplick, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou
Layered Fan-Planar Graph Drawings. MFCS (2020)
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
1-bend upward planar slope number of SP-digraphs. Comput. Geom. 90 (2020)
Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr
The Stub Resolution of 1-Planar Graphs. WALCOM (2020)
Alessio Arleo, Walter Didimo, Giuseppe Liotta, Silvia Miksch, Fabrizio Montecchiani
VAIM: Visual Analytics for Influence Maximization. CoRR (2020)
Michael A. Bekos, Giordano Da Lozzo, Svenja Griesbach, Martin Gronemann, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou
Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages. CoRR (2020)
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini
Storyline Visualizations with Ubiquitous Actors. CoRR (2020)
Walter Didimo, Luca Grilli, Giuseppe Liotta, Lorenzo Menconi, Fabrizio Montecchiani, Daniele Pagliuca
Combining Network Visualization and Data Mining for Tax Risk Assessment. IEEE Access 8 (2020)
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Parameterized Algorithms for Book Embedding Problems. J. Graph Algorithms Appl. 24 (4) (2020)
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis, Leonidas Theocharous
Grid Drawings of Graphs with Constant Edge-Vertex Resolution. CoRR (2020)
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Parameterized Algorithms for Queue Layouts. Graph Drawing (2020)
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini
Storyline Visualizations with Ubiquitous Actors. Graph Drawing (2020)
Alessio Arleo, Walter Didimo, Giuseppe Liotta, Silvia Miksch, Fabrizio Montecchiani
VAIM: Visual Analytics for Influence Maximization. Graph Drawing (2020)
Therese C. Biedl, Steven Chaplick, Jirí Fiala, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou
On Layered Fan-Planar Graph Drawings. CoRR (2020)
Carla Binucci, Walter Didimo, Fabrizio Montecchiani
An Experimental Study of a 1-Planarity Testing and Embedding Algorithm. WALCOM (2020)
Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani
Polyline drawings with topological constraints. Theor. Comput. Sci. 809 (2020)
Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta, Fabrizio Montecchiani
Visual Analytics for Financial Crime Detection at the University of Perugia. AVI-BDA/ITAVIS@AVI (2020)
Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt
Planar graphs of bounded degree have bounded queue number. STOC (2019)
Therese C. Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour, Ziting Yu
Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation. Algorithmica 81 (1) (2019)
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs. CoRR (2019)
Lorenzo Angori, Walter Didimo, Fabrizio Montecchiani, Daniele Pagliuca, Alessandra Tappini
ChordLink: A New Hybrid Visualization Model. Graph Drawing (2019)
Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr
Crossing Numbers of Beyond-Planar Graphs. CoRR (2019)
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Parameterized Algorithms for Book Embedding Problems. CoRR (2019)
Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
A Distributed Multilevel Force-Directed Algorithm. IEEE Trans. Parallel Distributed Syst. 30 (4) (2019)
Walter Didimo, Luca Grilli, Giuseppe Liotta, Fabrizio Montecchiani, Daniele Pagliuca
Visual querying and analysis of temporal fiscal networks. Inf. Sci. 505 (2019)
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs. Graph Drawing (2019)

Fabrizio Montecchiani.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Fabrizio Montecchiani