default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabrizio Montecchiani
Person information
- affiliation: University of Perugia, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j71]Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini:
Recognizing Map Graphs of Bounded Treewidth. Algorithmica 86(2): 613-637 (2024)- [j70]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): 2413-2447 (2024) - [j69]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali:
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity. Algorithmica 86(10): 3231-3251 (2024) - [j68]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: 110389 (2024) - [j67]Michael A. Bekos, Giordano Da Lozzo, Svenja M. Griesbach, Martin Gronemann, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou:
Book embeddings of k-framed graphs and k-map graphs. Discret. Math. 347(1): 113690 (2024) - [j66]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: 103466 (2024) - [j65]Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis:
Strictly-convex drawings of 3-connected planar graphs. J. Comput. Geom. 15(1): 1-20 (2024) - [j64]Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani:
Optimal-area visibility representations of outer-1-plane graphs. J. Comput. Geom. 15(1): 109-142 (2024) - [j63]Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis:
Convex grid drawings of planar graphs with constant edge-vertex resolution. Theor. Comput. Sci. 982: 114290 (2024) - [j62]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): 3503-3515 (2024) - [c85]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:
GraphTrials: Visual Proofs of Graph Properties. GD 2024: 16:1-16:18 - [c84]Michael A. Bekos, Giuseppe Di Battista, Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, Fabrizio Montecchiani:
On the Complexity of Recognizing k^+-Real Face Graphs. GD 2024: 32:1-32:22 - [c83]Seok-Hee Hong, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Tommaso Piselli:
Introducing Fairness in Graph Visualization (Poster Abstract). GD 2024: 49:1-49:3 - [c82]Giordano Da Lozzo, Walter Didimo, Fabrizio Montecchiani, Miriam Münch, Maurizio Patrignani, Ignaz Rutter:
Simple Realizability of Abstract Topological Graphs. ISAAC 2024: 23:1-23:15 - [c81]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: 3-18 - [c80]Riccardo Dondi, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini:
Partial Temporal Vertex Cover with Bounded Activity Intervals. SAND 2024: 11:1-11:14 - [i65]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 abs/2401.03226 (2024) - [i64]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:
GraphTrials: Visual Proofs of Graph Properties. CoRR abs/2409.02907 (2024) - [i63]Giordano Da Lozzo, Walter Didimo, Fabrizio Montecchiani, Miriam Münch, Maurizio Patrignani, Ignaz Rutter:
Simple Realizability of Abstract Topological Graphs. CoRR abs/2409.20108 (2024) - 2023
- [j61]Carla Binucci, Walter Didimo, Fabrizio Montecchiani:
1-planarity testing and embedding: An experimental study. Comput. Geom. 108: 101900 (2023) - [j60]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: 101946 (2023) - [j59]Emilio Di Giacomo, Fabrizio Montecchiani:
Editorial. Comput. Geom. 111: 101980 (2023) - [j58]Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg:
On the upward book thickness problem: Combinatorial and complexity results. Eur. J. Comb. 110: 103662 (2023) - [j57]Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini:
On the parameterized complexity of s-club cluster deletion problems. Theor. Comput. Sci. 969: 114041 (2023) - [c79]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: 8343-8350 - [c78]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: 90-99 - [c77]Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg:
Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable. SoCG 2023: 18:1-18:16 - [c76]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali:
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity. GD (2) 2023: 53-65 - [c75]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: 203-217 - [c74]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: 98-103 - [c73]Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov:
The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable. ISAAC 2023: 46:1-46:13 - [c72]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 - [c71]Michele Baglioni, Fabrizio Montecchiani, Mario Rosati:
Large-scale Computing Frameworks: Experiments and Guidelines. itaDATA 2023 - [c70]Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli:
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges. MFCS 2023: 18:1-18:15 - [c69]Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini:
On the Parameterized Complexity of s-club Cluster Deletion Problems. SOFSEM 2023: 159-173 - [i62]Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg:
Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable. CoRR abs/2302.10046 (2023) - [i61]Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli:
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges. CoRR abs/2306.03196 (2023) - [i60]Walter Didimo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali:
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity. CoRR abs/2308.13665 (2023) - [i59]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 abs/2309.01264 (2023) - [i58]Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov:
The st-Planar Edge Completion Problem is Fixed-Parameter Tractable. CoRR abs/2309.15454 (2023) - [i57]Jacopo Cancellieri, Walter Didimo, Andrea Fronzetti Colladon, Fabrizio Montecchiani:
Brand Network Booster: A New System for Improving Brand Connectivity. CoRR abs/2309.16228 (2023) - [i56]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 abs/2311.14634 (2023) - [i55]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): 58-97 (2023) - 2022
- [j56]Luca Consalvi, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
BrowVis: Visualizing Large Graphs in the Browser. IEEE Access 10: 115776-115786 (2022) - [j55]Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Universal Slope Sets for Upward Planar Drawings. Algorithmica 84(9): 2556-2580 (2022) - [j54]Carla Binucci, Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Fabrizio Montecchiani:
Placing Arrows in Directed Graph Layouts: Algorithms and Experiments. Comput. Graph. Forum 41(1): 364-376 (2022) - [j53]Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Orthogonal planarity testing of bounded treewidth graphs. J. Comput. Syst. Sci. 125: 129-148 (2022) - [j52]Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Queue Layouts. J. Graph Algorithms Appl. 26(3): 335-352 (2022) - [j51]Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani, Maximilian Pfister:
On morphs of 1-plane graphs. J. Comput. Geom. 13(1): 244-262 (2022) - [j50]Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr:
Crossing numbers of beyond-planar graphs. Theor. Comput. Sci. 898: 44-49 (2022) - [j49]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): 1288-1300 (2022) - [j48]Alessio Arleo, Walter Didimo, Giuseppe Liotta, Silvia Miksch, Fabrizio Montecchiani:
Influence Maximization With Visual Analytics. IEEE Trans. Vis. Comput. Graph. 28(10): 3428-3440 (2022) - [c68]Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis:
Strictly-Convex Drawings of 3-Connected Planar Graphs. GD 2022: 144-156 - [c67]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: 304-318 - [c66]Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini:
On the Parametrized Complexity of the s-Club Cluster Edge Deletion Problem. ICTCS 2022: 14-20 - [c65]Luca Consalvi, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
In-browser Visualization of Large-scale Graphs. itaDATA 2022: 27-38 - [c64]Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis:
Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution. IWOCA 2022: 157-171 - [c63]Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini:
Recognizing Map Graphs of Bounded Treewidth. SWAT 2022: 8:1-8:18 - [i54]Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis:
Convex Grid Drawings of Planar Graphs\\with Constant Edge-Vertex Resolution. CoRR abs/2204.14040 (2022) - [i53]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 abs/2205.07756 (2022) - [i52]Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini:
On the Parameterized Complexity of the s-Club Cluster Edge Deletion Problem. CoRR abs/2205.10834 (2022) - [i51]Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini:
Recognizing Map Graphs of Bounded Treewidth. CoRR abs/2206.14898 (2022) - [i50]Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis:
Strictly-Convex Drawings of 3-Connected Planar Graphs. CoRR abs/2208.13388 (2022) - [i49]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 abs/2209.00453 (2022) - 2021
- [j47]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: 101789 (2021) - [j46]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): 1-28 (2021) - [j45]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): 625-642 (2021) - [j44]Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini:
Ortho-polygon visibility representations of 3-connected 1-plane graphs. Theor. Comput. Sci. 863: 40-52 (2021) - [c62]Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani:
Generalized LR-Drawings of Trees. CCCG 2021: 78-88 - [c61]Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Alessandra Tappini:
A User Study on Hybrid Graph Visualizations. GD 2021: 21-38 - [c60]Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg:
On the Upward Book Thickness Problem: Combinatorial and Complexity Results. GD 2021: 242-256 - [c59]Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani:
Optimal-Area Visibility Representations of Outer-1-Plane Graphs. GD 2021: 287-303 - [c58]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: 271-285 - [c57]Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani, Maximilian Pfister:
On Morphing 1-Planar Drawings. WG 2021: 270-282 - [i48]Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani:
Generalized LR-drawings of trees. CoRR abs/2105.06992 (2021) - [i47]Steven Chaplick, Giordano Da Lozzo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees. CoRR abs/2105.08124 (2021) - [i46]Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani, Maximilian Pfister:
On Morphing 1-Planar Drawings. CoRR abs/2105.13040 (2021) - [i45]Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Alessandra Tappini:
A User Study on Hybrid Graph Visualizations. CoRR abs/2108.10270 (2021) - [i44]Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani:
Optimal-area visibility representations of outer-1-plane graphs. CoRR abs/2108.11768 (2021) - [i43]Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg:
On the Upward Book Thickness Problem: Combinatorial and Complexity Results. CoRR abs/2108.12327 (2021) - [i42]Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi:
Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293). Dagstuhl Reports 11(6): 82-123 (2021) - 2020
- [j43]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: 16073-16086 (2020) - [j42]Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
1-bend upward planar slope number of SP-digraphs. Comput. Geom. 90: 101628 (2020) - [j41]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:
Simple k-planar graphs are simple (k + 1)-quasiplanar. J. Comb. Theory B 142: 1-35 (2020) - [j40]Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Book Embedding Problems. J. Graph Algorithms Appl. 24(4): 603-620 (2020) - [j39]Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani:
Polyline drawings with topological constraints. Theor. Comput. Sci. 809: 250-264 (2020) - [c56]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: 195-200 - [c55]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: 16:1-16:17 - [c54]Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Queue Layouts. GD 2020: 40-54 - [c53]Alessio Arleo, Walter Didimo, Giuseppe Liotta, Silvia Miksch, Fabrizio Montecchiani:
VAIM: Visual Analytics for Influence Maximization. GD 2020: 115-123 - [c52]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini:
Storyline Visualizations with Ubiquitous Actors. GD 2020: 324-332 - [c51]Therese Biedl, Steven Chaplick, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou:
Layered Fan-Planar Graph Drawings. MFCS 2020: 14:1-14:13 - [c50]Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr:
The Stub Resolution of 1-Planar Graphs. WALCOM 2020: 170-182 - [c49]Carla Binucci, Walter Didimo, Fabrizio Montecchiani:
An Experimental Study of a 1-Planarity Testing and Embedding Algorithm. WALCOM 2020: 329-335 - [p1]Giuseppe Liotta, Fabrizio Montecchiani:
Edge Partitions and Visibility Representations of 1-planar Graphs. Beyond Planar Graphs 2020: 89-107 - [i41]Therese Biedl, Steven Chaplick, Jirí Fiala, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou:
On Layered Fan-Planar Graph Drawings. CoRR abs/2002.09597 (2020) - [i40]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 abs/2003.07655 (2020) - [i39]Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis, Leonidas Theocharous:
Grid Drawings of Graphs with Constant Edge-Vertex Resolution. CoRR abs/2005.02082 (2020) - [i38]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini:
Storyline Visualizations with Ubiquitous Actors. CoRR abs/2008.04125 (2020) - [i37]Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Queue Layouts. CoRR abs/2008.08288 (2020) - [i36]Alessio Arleo, Walter Didimo, Giuseppe Liotta, Silvia Miksch, Fabrizio Montecchiani:
VAIM: Visual Analytics for Influence Maximization. CoRR abs/2008.08821 (2020)
2010 – 2019
- 2019
- [j38]Therese 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): 69-97 (2019) - [j37]Patrizio Angelini, Michael A. Bekos, Giuseppe Liotta, Fabrizio Montecchiani:
Universal Slope Sets for 1-Bend Planar Drawings. Algorithmica 81(6): 2527-2556 (2019) - [j36]Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
A Survey on Graph Drawing Beyond Planarity. ACM Comput. Surv. 52(1): 4:1-4:37 (2019) - [j35]Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou:
Edge partitions of optimal 2-plane and 3-plane graphs. Discret. Math. 342(4): 1038-1047 (2019) - [j34]Walter Didimo, Luca Grilli, Giuseppe Liotta, Fabrizio Montecchiani, Daniele Pagliuca:
Visual querying and analysis of temporal fiscal networks. Inf. Sci. 505: 406-421 (2019) - [j33]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. SIAM J. Comput. 48(5): 1487-1502 (2019) - [j32]Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Fabrizio Montecchiani:
On 3D visibility representations of graphs with few crossings per edge. Theor. Comput. Sci. 784: 11-20 (2019) - [j31]Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
A Distributed Multilevel Force-Directed Algorithm. IEEE Trans. Parallel Distributed Syst. 30(4): 754-765 (2019) - [c48]Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr:
Crossing Numbers of Beyond-Planar Graphs. GD 2019: 78-86 - [c47]Lorenzo Angori, Walter Didimo, Fabrizio Montecchiani, Daniele Pagliuca, Alessandra Tappini:
ChordLink: A New Hybrid Visualization Model. GD 2019: 276-290 - [c46]Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Book Embedding Problems. GD 2019: 365-378 - [c45]Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs. GD 2019: 379-392 - [c44]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: 176-184 - [i35]Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr:
Crossing Numbers of Beyond-Planar Graphs. CoRR abs/1908.03153 (2019) - [i34]Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs. CoRR abs/1908.05015 (2019) - [i33]Lorenzo Angori, Walter Didimo, Fabrizio Montecchiani, Daniele Pagliuca, Alessandra Tappini:
ChordLink: A New Hybrid Visualization Model. CoRR abs/1908.08412 (2019) - [i32]Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Book Embedding Problems. CoRR abs/1908.08911 (2019) - [i31]