Fabrizio Montecchiani

238 papers A* 8A 38B 18C 2Journal 149Unranked 22
YearRankTypeTitle / Venue / Authors
2026 J jnl
F
IEEE Trans. Vis. Comput. Graph.
Tommaso Piselli, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Sara Di Bartolomeo
2026 J jnl
The Complexity of Extending Storylines with Minimum Local Crossing Number.
CoRR
Alexander Dobler, Siddharth Gupta, Philipp Kindermann, Fabrizio Montecchiani, Martin Nöllenburg
2025 A ed.
33rd International Symposium on Graph Drawing and Network Visualization, GD 2025, Norrköping, Sweden, September 24-26, 2025
GD
Vida Dujmovic, Fabrizio Montecchiani
2025 J jnl
Bounds on the edge-length ratio of 2-outerplanar graphs.
Comput. Geom.
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
2025 J jnl
Drawing graphs with k vertices per face: Complexity and algorithms.
Theor. Comput. Sci.
Michael A. Bekos, Giuseppe Di Battista, Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, Fabrizio Montecchiani
2025 J jnl
Flipping Matchings is Hard.
CoRR
Carla Binucci, Fabrizio Montecchiani, Daniel Perz, Alessandra Tappini
2025 A* conf
Geometric Realizations of Dichotomous Ordinal Graphs.
SoCG
Patrizio Angelini, Sabine Cornelsen, Carolina Haase, Michael Hoffmann, Eleni Katsanou, Fabrizio Montecchiani, Raphael Steiner, Antonios Symvonis
2025 J jnl
Geometric realizations of dichotomous ordinal graphs.
CoRR
Patrizio Angelini, Sabine Cornelsen, Carolina Haase, Michael Hoffmann, Eleni Katsanou, Fabrizio Montecchiani, Raphael Steiner, Antonios Symvonis
2025 J jnl
Graph Drawing for LLMs: An Empirical Evaluation.
CoRR
Walter Didimo, Fabrizio Montecchiani, Tommaso Piselli
2025 J jnl
GraphTrials: Visual Proofs of Graph Properties.
IEEE Trans. Vis. Comput. Graph.
Henry Förster, Felix Klesen, Tim Dwyer, Peter Eades, Seok-Hee Hong, Stephen G. Kobourov, Giuseppe Liotta, Kazuo Misue, Fabrizio Montecchiani, Alexander Pastukhov, Falk Schreiber
2025 J jnl
Introducing fairness in network visualization.
Inf. Sci.
Peter Eades, Seokhee Hong, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Tommaso Piselli, Stephen K. Wismath
2025 J jnl
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges.
J. Graph Algorithms Appl.
Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli
2025 J jnl
The influence of dimensions on the complexity of computing decision trees.
Artif. Intell.
Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms
2024 J jnl
Book embeddings of
Discret. Math.
Michael A. Bekos, Giordano Da Lozzo, Svenja M. Griesbach, Martin Gronemann, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou
2024 J jnl
Brand Network Booster: A new system for improving brand connectivity.
Comput. Ind. Eng.
Jacopo Cancellieri, Walter Didimo, Andrea Fronzetti Colladon, Fabrizio Montecchiani, Roberto Vestrelli
2024 J jnl
Collaborative Problem Solving in Mixed Reality: A Study on Visual Graph Analysis.
CoRR
Dimitar Garkov, Tommaso Piselli, Emilio Di Giacomo, Karsten Klein, Giuseppe Liotta, Fabrizio Montecchiani, Falk Schreiber
2024 J jnl
Comparative Study and Evaluation of Hybrid Visualizations of Graphs.
IEEE Trans. Vis. Comput. Graph.
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini
2024 J jnl
Convex grid drawings of planar graphs with constant edge-vertex resolution.
Theor. Comput. Sci.
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis
2024 A conf
GraphTrials: Visual Proofs of Graph Properties.
GD
Henry Förster, Felix Klesen, Tim Dwyer, Peter Eades, Seok-Hee Hong, Stephen G. Kobourov, Giuseppe Liotta, Kazuo Misue, Fabrizio Montecchiani, Alexander Pastukhov, Falk Schreiber
2024 J jnl
GraphTrials: Visual Proofs of Graph Properties.
CoRR
Henry Förster, Felix Klesen, Tim Dwyer, Peter Eades, Seok-Hee Hong, Stephen G. Kobourov, Giuseppe Liotta, Kazuo Misue, Fabrizio Montecchiani, Alexander Pastukhov, Falk Schreiber
2024 A conf
Introducing Fairness in Graph Visualization (Poster Abstract).
GD
Seok-Hee Hong, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Tommaso Piselli
2024 — conf
Introducing Fairness in Graph Visualization via Gradient Descent.
MLVis@EuroVis
Seok-Hee Hong, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Tommaso Piselli
2024 — conf
On 1-Bend Upward Point-Set Embeddings of st-Digraphs.
LATIN (1)
Emilio Di Giacomo, Henry Förster, Daria Kokhovich, Tamara Mchedlidze, Fabrizio Montecchiani, Antonios Symvonis, Anaïs Villedieu
2024 J jnl
On 1-bend Upward Point-set Embeddings of st-digraphs.
CoRR
Emilio Di Giacomo, Henry Förster, Daria Kokhovich, Tamara Mchedlidze, Fabrizio Montecchiani, Antonios Symvonis, Anaïs Villedieu
2024 A conf
On the Complexity of Recognizing k^+-Real Face Graphs.
GD
Michael A. Bekos, Giuseppe Di Battista, Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, Fabrizio Montecchiani
2024 J jnl
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity.
Algorithmica
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali
2024 J jnl
On the complexity of the storyplan problem.
J. Comput. Syst. Sci.
Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis
2024 J jnl
Optimal-area visibility representations of outer-1-plane graphs.
J. Comput. Geom.
Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
2024 — conf
Partial Temporal Vertex Cover with Bounded Activity Intervals.
SAND
Riccardo Dondi, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini
2024 J jnl
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees.
Algorithmica
Steven Chaplick, Giordano Da Lozzo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
2024 J jnl
Recognizing Map Graphs of Bounded Treewidth.
Algorithmica
Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini
2024 B conf
Simple Realizability of Abstract Topological Graphs.
ISAAC
Giordano Da Lozzo, Walter Didimo, Fabrizio Montecchiani, Miriam Münch, Maurizio Patrignani, Ignaz Rutter
2024 J jnl
Simple Realizability of Abstract Topological Graphs.
CoRR
Giordano Da Lozzo, Walter Didimo, Fabrizio Montecchiani, Miriam Münch, Maurizio Patrignani, Ignaz Rutter
2024 J jnl
Strictly-convex drawings of 3-connected planar graphs.
J. Comput. Geom.
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis
2023 J jnl
1-planarity testing and embedding: An experimental study.
Comput. Geom.
Carla Binucci, Walter Didimo, Fabrizio Montecchiani
2023 J jnl
Brand Network Booster: A New System for Improving Brand Connectivity.
CoRR
Jacopo Cancellieri, Walter Didimo, Andrea Fronzetti Colladon, Fabrizio Montecchiani
2023 — conf
Dataspaces: Concepts, Architectures and Initiatives.
itaDATA
Maurizio Atzori, Angelo Ciaramella, Claudia Diamantini, Beniamino Di Martino, Salvatore Distefano, Tullio Facchinetti, Fabrizio Montecchiani, Antonino Nocera, Giancarlo Ruffo, Roberto Trasarti
2023 — conf
Design of a Process and a Container-Based Cloud Architecture for the Automatic Generation of Storyline Visualizations.
AINA (3)
Emilio Di Giacomo, Beniamino Di Martino, Walter Didimo, Antonio Esposito, Giuseppe Liotta, Fabrizio Montecchiani
2023 J jnl
Editorial.
Comput. Geom.
Emilio Di Giacomo, Fabrizio Montecchiani
2023 A* conf
Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable.
SoCG
Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg
2023 J jnl
Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable.
CoRR
Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg
2023 J jnl
Extending orthogonal planar graph drawings is fixed-parameter tractable.
J. Comput. Geom.
Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg
2023 J jnl
Geodesic obstacle representation of graphs.
Comput. Geom.
Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira
2023 — conf
Large-scale Computing Frameworks: Experiments and Guidelines.
itaDATA
Michele Baglioni, Fabrizio Montecchiani, Mario Rosati
2023 J jnl
New Bounds on the Local and Global Edge-length Ratio of Planar Graphs.
CoRR
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
2023 J jnl
New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162).
Dagstuhl Reports
Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi, Liana Khazaliya
2023 — conf
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity.
GD (2)
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali
2023 J jnl
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity.
CoRR
Walter Didimo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali
2023 — conf
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges (short paper).
ICTCS
Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli
2023 B conf
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges.
MFCS
Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli
2023 J jnl
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges.
CoRR
Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli
2023 B conf
On the Parameterized Complexity of s-club Cluster Deletion Problems.
SOFSEM
Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini
2023 J jnl
On the parameterized complexity of s-club cluster deletion problems.
Theor. Comput. Sci.
Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini
2023 J jnl
On the upward book thickness problem: Combinatorial and complexity results.
Eur. J. Comb.
Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg
2023 A* conf
The Influence of Dimensions on the Complexity of Computing Decision Trees.
AAAI
Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms
2023 B conf
The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable.
ISAAC
Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
2023 J jnl
The st-Planar Edge Completion Problem is Fixed-Parameter Tractable.
CoRR
Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
2023 — conf
Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth.
GD (2)
Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
2023 J jnl
Upward and Orthogonal Planarity are W[1]-hard Parameterized by Treewidth.
CoRR
Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
2022 J jnl
BrowVis: Visualizing Large Graphs in the Browser.
IEEE Access
Luca Consalvi, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
2022 C conf
Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution.
IWOCA
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis
2022 J jnl
Convex Grid Drawings of Planar Graphs\\with Constant Edge-Vertex Resolution.
CoRR
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis
2022 J jnl
Crossing numbers of beyond-planar graphs.
Theor. Comput. Sci.
Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr
2022 J jnl
Hybrid Graph Visualizations With ChordLink: Algorithms, Experiments, and Applications.
IEEE Trans. Vis. Comput. Graph.
Lorenzo Angori, Walter Didimo, Fabrizio Montecchiani, Daniele Pagliuca, Alessandra Tappini
2022 — conf
In-browser Visualization of Large-scale Graphs.
itaDATA
Luca Consalvi, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
2022 J jnl
Influence Maximization With Visual Analytics.
IEEE Trans. Vis. Comput. Graph.
Alessio Arleo, Walter Didimo, Giuseppe Liotta, Silvia Miksch, Fabrizio Montecchiani
2022 J jnl
On morphs of 1-plane graphs.
J. Comput. Geom.
Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani, Maximilian Pfister
2022 A conf
On the Complexity of the Storyplan Problem.
GD
Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis
2022 J jnl
On the Complexity of the Storyplan Problem.
CoRR
Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis
2022 J jnl
On the Parameterized Complexity of the s-Club Cluster Edge Deletion Problem.
CoRR
Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini
2022 — conf
On the Parametrized Complexity of the s-Club Cluster Edge Deletion Problem.
ICTCS
Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini
2022 J jnl
Orthogonal planarity testing of bounded treewidth graphs.
J. Comput. Syst. Sci.
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
2022 J jnl
Parameterized Algorithms for Queue Layouts.
J. Graph Algorithms Appl.
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
2022 J jnl
Placing Arrows in Directed Graph Layouts: Algorithms and Experiments.
Comput. Graph. Forum
Carla Binucci, Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Fabrizio Montecchiani
2022 — conf
Recognizing Map Graphs of Bounded Treewidth.
SWAT
Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini
2022 J jnl
Recognizing Map Graphs of Bounded Treewidth.
CoRR
Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini
2022 A conf
Strictly-Convex Drawings of 3-Connected Planar Graphs.
GD
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis
2022 J jnl
Strictly-Convex Drawings of 3-Connected Planar Graphs.
CoRR
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis
2022 J jnl
The Influence of Dimensions on the Complexity of Computing Decision Trees.
CoRR
Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms
2022 J jnl
Universal Slope Sets for Upward Planar Drawings.
Algorithmica
Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
2021 A conf
A User Study on Hybrid Graph Visualizations.
GD
Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Alessandra Tappini
2021 J jnl
A User Study on Hybrid Graph Visualizations.
CoRR
Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Alessandra Tappini
2021 J jnl
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles.
J. Graph Algorithms Appl.
Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz
2021 — conf
Generalized LR-Drawings of Trees.
CCCG
Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
2021 J jnl
Generalized LR-drawings of trees.
CoRR
Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
2021 J jnl
Grid drawings of graphs with constant edge-vertex resolution.
Comput. Geom.
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Dömötör Pálvölgyi, Antonios Symvonis, Leonidas Theocharous
2021 B conf
On Morphing 1-Planar Drawings.
WG
Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani, Maximilian Pfister
2021 J jnl
On Morphing 1-Planar Drawings.
CoRR
Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani, Maximilian Pfister
2021 A conf
On the Upward Book Thickness Problem: Combinatorial and Complexity Results.
GD
Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg
2021 J jnl
On the Upward Book Thickness Problem: Combinatorial and Complexity Results.
CoRR
Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg
2021 A conf
Optimal-Area Visibility Representations of Outer-1-Plane Graphs.
GD
Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
2021 J jnl
Optimal-area visibility representations of outer-1-plane graphs.
CoRR
Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani
2021 J jnl
Ortho-polygon visibility representations of 3-connected 1-plane graphs.
Theor. Comput. Sci.
Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini
2021 J jnl
Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293).
Dagstuhl Reports
Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi
2021 B conf
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees.
WADS
Steven Chaplick, Giordano Da Lozzo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
2021 J jnl
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees.
CoRR
Steven Chaplick, Giordano Da Lozzo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
2021 J jnl
The Stub Resolution of 1-planar Graphs.
J. Graph Algorithms Appl.
Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr
2020 J jnl
1-bend upward planar slope number of SP-digraphs.
Comput. Geom.
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
2020 B conf
An Experimental Study of a 1-Planarity Testing and Embedding Algorithm.
WALCOM
Carla Binucci, Walter Didimo, Fabrizio Montecchiani
2020 A* conf
Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages.
SoCG
Michael A. Bekos, Giordano Da Lozzo, Svenja Griesbach, Martin Gronemann, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou
2020 J jnl
Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages.
CoRR
Michael A. Bekos, Giordano Da Lozzo, Svenja Griesbach, Martin Gronemann, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou
2020 J jnl
Combining Network Visualization and Data Mining for Tax Risk Assessment.
IEEE Access
Walter Didimo, Luca Grilli, Giuseppe Liotta, Lorenzo Menconi, Fabrizio Montecchiani, Daniele Pagliuca
2020 — ch.
Edge Partitions and Visibility Representations of 1-planar Graphs.
Beyond Planar Graphs
Giuseppe Liotta, Fabrizio Montecchiani
2020 J jnl
Grid Drawings of Graphs with Constant Edge-Vertex Resolution.
CoRR
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis, Leonidas Theocharous
2020 B conf
Layered Fan-Planar Graph Drawings.
MFCS
Therese Biedl, Steven Chaplick, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou
2020 J jnl
On Layered Fan-Planar Graph Drawings.
CoRR
Therese Biedl, Steven Chaplick, Jirí Fiala, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou
2020 J jnl
Parameterized Algorithms for Book Embedding Problems.
J. Graph Algorithms Appl.
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
2020 A conf
Parameterized Algorithms for Queue Layouts.
GD
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
2020 J jnl
Parameterized Algorithms for Queue Layouts.
CoRR
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
2020 J jnl
Polyline drawings with topological constraints.
Theor. Comput. Sci.
Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani
2020 J jnl
Simple
J. Comb. Theory B
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
2020 A conf
Storyline Visualizations with Ubiquitous Actors.
GD
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini
2020 J jnl
Storyline Visualizations with Ubiquitous Actors.
CoRR
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini
2020 B conf
The Stub Resolution of 1-Planar Graphs.
WALCOM
Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr
2020 A conf
VAIM: Visual Analytics for Influence Maximization.
GD
Alessio Arleo, Walter Didimo, Giuseppe Liotta, Silvia Miksch, Fabrizio Montecchiani
2020 J jnl
VAIM: Visual Analytics for Influence Maximization.
CoRR
Alessio Arleo, Walter Didimo, Giuseppe Liotta, Silvia Miksch, Fabrizio Montecchiani
2020 — conf
Visual Analytics for Financial Crime Detection at the University of Perugia.
AVI-BDA/ITAVIS@AVI
Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta, Fabrizio Montecchiani
2019 J jnl
A Distributed Multilevel Force-Directed Algorithm.
IEEE Trans. Parallel Distributed Syst.
Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
2019 J jnl
A Survey on Graph Drawing Beyond Planarity.
ACM Comput. Surv.
Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
2019 J jnl
An Experimental Study of a 1-planarity Testing and Embedding Algorithm.
CoRR
Carla Binucci, Walter Didimo, Fabrizio Montecchiani
2019 A conf
ChordLink: A New Hybrid Visualization Model.
GD
Lorenzo Angori, Walter Didimo, Fabrizio Montecchiani, Daniele Pagliuca, Alessandra Tappini
2019 J jnl
ChordLink: A New Hybrid Visualization Model.
CoRR
Lorenzo Angori, Walter Didimo, Fabrizio Montecchiani, Daniele Pagliuca, Alessandra Tappini
2019 A conf
Crossing Numbers of Beyond-Planar Graphs.
GD
Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr
2019 J jnl
Crossing Numbers of Beyond-Planar Graphs.
CoRR
Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr
2019 J jnl
Edge partitions of optimal 2-plane and 3-plane graphs.
Discret. Math.
Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou
2019 J jnl
Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation.
Algorithmica
Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour, Ziting Yu
2019 J jnl
On 3D visibility representations of graphs with few crossings per edge.
Theor. Comput. Sci.
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani
2019 A conf
Parameterized Algorithms for Book Embedding Problems.
GD
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
2019 J jnl
Parameterized Algorithms for Book Embedding Problems.
CoRR
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
2019 J jnl
Planar Graphs of Bounded Degree Have Bounded Queue Number.
SIAM J. Comput.
Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt
2019 A* conf
Planar graphs of bounded degree have bounded queue number.
STOC
Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt
2019 J jnl
Simple k-Planar Graphs are Simple (k+1)-Quasiplanar.
CoRR
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
2019 A conf
Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs.
GD
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
2019 J jnl
Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs.
CoRR
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
2019 J jnl
Universal Slope Sets for 1-Bend Planar Drawings.
Algorithmica
Patrizio Angelini, Michael A. Bekos, Giuseppe Liotta, Fabrizio Montecchiani
2019 J jnl
Visual querying and analysis of temporal fiscal networks.
Inf. Sci.
Walter Didimo, Luca Grilli, Giuseppe Liotta, Fabrizio Montecchiani, Daniele Pagliuca
2018 J jnl
A Survey on Graph Drawing Beyond Planarity.
CoRR
Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
2018 J jnl
A Visualization Framework and User Studies for Overloaded Orthogonal Drawings.
Comput. Graph. Forum
Walter Didimo, Evgenios M. Kornaropoulos, Fabrizio Montecchiani, Ioannis G. Tollis
2018 J jnl
A visual analytics system to support tax evasion discovery.
Decis. Support Syst.
Walter Didimo, Luca Giamminonni, Giuseppe Liotta, Fabrizio Montecchiani, Daniele Pagliuca
2018 — conf
Bounded Stub Resolution for Some Maximal 1-Planar Graphs.
CALDAM
Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr
2018 A conf
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles.
GD
Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz
2018 J jnl
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles.
CoRR
Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz
2018 J jnl
Drawing subcubic planar graphs with four slopes and optimal angular resolution.
Theor. Comput. Sci.
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
2018 B conf
Edge Partitions of Optimal 2-plane and 3-plane Graphs.
WG
Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou
2018 J jnl
Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs.
Discret. Comput. Geom.
Therese Biedl, Giuseppe Liotta, Fabrizio Montecchiani
2018 J jnl
Gap-planar graphs.
Theor. Comput. Sci.
Sang Won Bae, Jean-François Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth
2018 A* conf
Geodesic Obstacle Representation of Graphs.
ICALP
Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira
2018 J jnl
Geodesic Obstacle Representation of Graphs.
CoRR
Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira
2018 J jnl
Guest Editors' Foreword and Overview.
J. Graph Algorithms Appl.
Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani
2018 J jnl
New results on edge partitions of 1-plane graphs.
Theor. Comput. Sci.
Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
2018 A conf
Ortho-Polygon Visibility Representations of 3-Connected 1-Plane Graphs.
GD
Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini
2018 J jnl
Ortho-polygon Visibility Representations of 3-connected 1-plane Graphs.
CoRR
Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini
2018 J jnl
Ortho-polygon Visibility Representations of Embedded Graphs.
Algorithmica
Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
2018 J jnl
Planar Graphs of Bounded Degree have Constant Queue Number.
CoRR
Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt
2018 B conf
Polyline Drawings with Topological Constraints.
ISAAC
Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani
2018 J jnl
Polyline Drawings with Topological Constraints.
CoRR
Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani
2018 J jnl
Profiling distributed graph processing systems through visual analytics.
Future Gener. Comput. Syst.
Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
2018 A conf
Universal Slope Sets for Upward Planar Drawings.
GD
Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
2018 J jnl
Universal Slope Sets for Upward Planar Drawings.
CoRR
Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
2018 J jnl
Visibility representations of boxes in 2.5 dimensions.
Comput. Geom.
Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath
2017 A conf
3D Visibility Representations of 1-planar Graphs.
GD
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani
2017 J jnl
3D Visibility Representations of 1-planar Graphs.
CoRR
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani
2017 A* conf
A Universal Slope Set for 1-Bend Planar Drawings.
SoCG
Patrizio Angelini, Michael A. Bekos, Giuseppe Liotta, Fabrizio Montecchiani
2017 J jnl
Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus.
J. Graph Algorithms Appl.
Carla Binucci, Markus Chimani, Walter Didimo, Martin Gronemann, Karsten Klein, Jan Kratochvíl, Fabrizio Montecchiani, Ioannis G. Tollis
2017 J jnl
An annotated bibliography on 1-planarity.
CoRR
Stephen G. Kobourov, Giuseppe Liotta, Fabrizio Montecchiani
2017 J jnl
An annotated bibliography on 1-planarity.
Comput. Sci. Rev.
Stephen G. Kobourov, Giuseppe Liotta, Fabrizio Montecchiani
2017 J jnl
Area-Thickness Trade-Offs for Straight-Line Drawings of Planar Graphs.
Comput. J.
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
2017 J jnl
Designing the Content Analyzer of a Travel Recommender System.
Expert Syst. Appl.
Carla Binucci, Felice De Luca, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
2017 A conf
Gap-Planar Graphs.
GD
Sang Won Bae, Jean-François Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth
2017 J jnl
Gap-planar Graphs.
CoRR
Sang Won Bae, Jean-François Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth
2017 A conf
GiViP: A Visual Profiler for Distributed Graph Processing Systems.
GD
Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
2017 J jnl
GiViP: A Visual Profiler for Distributed Graph Processing Systems.
CoRR
Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
2017 J jnl
Large graph visualizations using a distributed computing platform.
Inf. Sci.
Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
2017 J jnl
New Results on Edge Partitions of 1-plane Graphs.
CoRR
Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
2017 B conf
On Guarding Orthogonal Polygons with Sliding Cameras.
WALCOM
Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour
2017 J jnl
On RAC drawings of 1-planar graphs.
Theor. Comput. Sci.
Michael A. Bekos, Walter Didimo, Giuseppe Liotta, Saeed Mehrabi, Fabrizio Montecchiani
2017 J jnl
On partitioning the edges of 1-plane graphs.
Theor. Comput. Sci.
William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani
2017 B conf
On the Relationship Between k-Planar and k-Quasi-Planar Graphs.
WG
Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter
2017 J jnl
Progress on Partial Edge Drawings.
J. Graph Algorithms Appl.
Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff
2017 J jnl
Universal Slope Sets for 1-Bend Planar Drawings.
CoRR
Patrizio Angelini, Michael A. Bekos, Giuseppe Liotta, Fabrizio Montecchiani
2017 J jnl
Vertex-Coloring with Defects.
J. Graph Algorithms Appl.
Patrizio Angelini, Michael A. Bekos, Felice De Luca, Walter Didimo, Michael Kaufmann, Stephen G. Kobourov, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Vincenzo Roselli, Antonios Symvonis
2016 A conf
1-Bend RAC Drawings of 1-Planar Graphs.
GD
Walter Didimo, Giuseppe Liotta, Saeed Mehrabi, Fabrizio Montecchiani
2016 J jnl
1-Bend RAC Drawings of 1-Planar Graphs.
CoRR
Walter Didimo, Giuseppe Liotta, Saeed Mehrabi, Fabrizio Montecchiani
2016 A conf
1-Bend Upward Planar Drawings of SP-Digraphs.
GD
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
2016 J jnl
1-bend Upward Planar Drawings of SP-digraphs.
CoRR
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
2016 J jnl
A Distributed Force-Directed Algorithm on Giraph: Design and Experiments.
CoRR
Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
2016 A conf
A Distributed Multilevel Force-Directed Algorithm.
GD
Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
2016 J jnl
A Distributed Multilevel Force-directed Algorithm.
CoRR
Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
2016 J jnl
L-visibility drawings of IC-planar graphs.
Inf. Process. Lett.
Giuseppe Liotta, Fabrizio Montecchiani
2016 J jnl
On Guarding Orthogonal Polygons with Sliding Cameras.
CoRR
Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour
2016 A* conf
On Visibility Representations of Non-Planar Graphs.
SoCG
Therese Biedl, Giuseppe Liotta, Fabrizio Montecchiani
2016 A conf
Ortho-Polygon Visibility Representations of Embedded Graphs.
GD
Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
2016 J jnl
Ortho-polygon Visibility Representations of Embedded Graphs.
CoRR
Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
2016 — conf
Partial edge drawing: Homogeneity is more important than crossings and ink.
IISA
Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini
2016 A conf
Placing Arrows in Directed Graph Drawings.
GD
Carla Binucci, Markus Chimani, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
2016 J jnl
Placing Arrows in Directed Graph Drawings.
CoRR
Carla Binucci, Markus Chimani, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
2016 J jnl
Recognizing and drawing IC-planar graphs.
Theor. Comput. Sci.
Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani
2016 J jnl
Simultaneous visibility representations of plane st-graphs using L-shapes.
Theor. Comput. Sci.
William S. Evans, Giuseppe Liotta, Fabrizio Montecchiani
2016 A conf
Visibility Representations of Boxes in 2.5 Dimensions.
GD
Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath
2016 J jnl
Visibility Representations of Boxes in 2.5 Dimensions.
CoRR
Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath
2015 A conf
2-Layer Fan-Planarity: From Caterpillar to Stegosaurus.
GD
Carla Binucci, Markus Chimani, Walter Didimo, Martin Gronemann, Karsten Klein, Jan Kratochvíl, Fabrizio Montecchiani, Ioannis G. Tollis
2015 A conf
A Million Edge Drawing for a Fistful of Dollars.
GD
Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
2015 J jnl
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs.
Comput. Geom.
Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis
2015 J jnl
Drawing Outer 1-planar Graphs with Few Slopes.
J. Graph Algorithms Appl.
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
2015 J jnl
Fan-planarity: Properties and complexity.
Theor. Comput. Sci.
Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Antonios Symvonis, Ioannis G. Tollis
2015 A conf
Kojaph: Visual Definition and Exploration of Patterns in Graph Databases.
GD
Walter Didimo, Francesco Giacchè, Fabrizio Montecchiani
2015 A conf
L-Visibility Drawings of IC-Planar Graphs.
GD
Giuseppe Liotta, Fabrizio Montecchiani
2015 J jnl
L-Visibility Drawings of IC-planar Graphs.
CoRR
Giuseppe Liotta, Fabrizio Montecchiani
2015 — conf
Network visualization retargeting.
IISA
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
2015 J jnl
On Partitioning the Edges of 1-Planar Graphs.
CoRR
William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani
2015 J jnl
On Visibility Representations of Non-planar Graphs.
CoRR
Therese Biedl, Giuseppe Liotta, Fabrizio Montecchiani
2015 A conf
Recognizing and Drawing IC-Planar Graphs.
GD
Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani
2015 J jnl
Recognizing and Drawing IC-planar Graphs.
CoRR
Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani
2015 B conf
Simultaneous Visibility Representations of Plane st-graphs Using L-shapes.
WG
William S. Evans, Giuseppe Liotta, Fabrizio Montecchiani
2015 J jnl
Simultaneous Visibility Representations of Plane st-graphs Using L-shapes.
CoRR
William S. Evans, Giuseppe Liotta, Fabrizio Montecchiani
2015 — conf
VisFLOWer: Visual analysis of touristic flows.
IISA
Carla Binucci, Felice De Luca, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
2014 J jnl
1-Bend Orthogonal Partial Edge Drawing.
J. Graph Algorithms Appl.
Till Bruckdorfer, Michael Kaufmann, Fabrizio Montecchiani
2014 A conf
Drawing Outer 1-planar Graphs with Few Slopes.
GD
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
2014 A conf
Fan-Planar Graphs: Combinatorial Properties and Complexity Results.
GD
Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis
2014 J jnl
Fast layout computation of clustered networks: Algorithmic advances and experimental analysis.
Inf. Sci.
Walter Didimo, Fabrizio Montecchiani
2014 — conf
How to visualize directed graphs: A user study.
IISA
Walter Didimo, Fabrizio Montecchiani, Evangelos Pallas, Ioannis G. Tollis
2014 J jnl
Network visualization for financial crime detection.
J. Vis. Lang. Comput.
Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
2014 J jnl
Properties and Complexity of Fan-Planarity.
CoRR
Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis
2014 J jnl
Techniques for Edge Stratification of Complex Graph Drawings.
J. Vis. Lang. Comput.
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ioannis G. Tollis
2014 B conf
The Planar Slope Number of Subcubic Graphs.
LATIN
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
2014 — conf
Upward-rightward planar drawings.
IISA
Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Fabrizio Montecchiani
2013 J jnl
Area requirement of graph drawings with few crossings per edge.
Comput. Geom.
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
2013 A conf
Drawing Non-Planar Graphs with Crossing-Free Subgraphs.
GD
Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis
2013 J jnl
Drawings of Non-planar Graphs with Crossing-free Subgraphs.
CoRR
Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis
2013 A conf
Exploring Complex Drawings via Edge Stratification.
GD
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ioannis G. Tollis
2013 — conf
On the robustness of the Drosophila neural network.
NSW
Hsiu-Ming Chang, Ann-Shyn Chiang, Walter Didimo, Ching-Yao Lin, Giuseppe Liotta, Fabrizio Montecchiani
2013 B conf
TRART: A system to support territorial policies.
Intelligent Environments (Workshops)
Carla Binucci, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Mariano Sartore
2012 C conf
Fast Layout Computation of Hierarchically Clustered Networks: Algorithmic Advances and Experimental Analysis.
IV
Walter Didimo, Fabrizio Montecchiani
2012 J jnl
Progress on Partial Edge Drawings
CoRR
Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff
2012 A conf
Progress on Partial Edge Drawings.
GD
Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff
2012 — conf
Vis4AUI: Visual Analysis of Banking Activity Networks.
GRAPP/IVAPP
Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
2012 B conf
h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area.
WG
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
2011 B conf
An advanced network visualization system for financial crime detection.
PacificVis
Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Pietro Palladino