


Остановите войну!
for scientists:
Giuseppe Liotta
Person information

- affiliation: University of Perugia, Department of Engineering, Italy
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
- [j132]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) - [j131]Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Orthogonal planarity testing of bounded treewidth graphs. J. Comput. Syst. Sci. 125: 129-148 (2022) - [i55]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time. CoRR abs/2205.07500 (2022) - 2021
- [j130]Václav Blazj, Jirí Fiala, Giuseppe Liotta:
On Edge-Length Ratios of Partial 2-Trees. Int. J. Comput. Geom. Appl. 31(2-3): 141-162 (2021) - [j129]Emilio Di Giacomo, Walter Didimo
, Michael Kaufmann, Giuseppe Liotta:
Stable visualization of connected components in dynamic graphs. Inf. Vis. 20(1): 3-19 (2021) - [j128]Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini
, Stephen K. Wismath:
Packing Trees into 1-planar Graphs. J. Graph Algorithms Appl. 25(2): 605-624 (2021) - [j127]Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini
:
Ortho-polygon visibility representations of 3-connected 1-plane graphs. Theor. Comput. Sci. 863: 40-52 (2021) - [j126]Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini
:
Simultaneous FPQ-ordering and hybrid planarity testing. Theor. Comput. Sci. 874: 59-79 (2021) - [j125]Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph, Alessandra Tappini
:
(k, p)-planarity: A relaxation of hybrid planarity. Theor. Comput. Sci. 896: 19-30 (2021) - [j124]Emilio Di Giacomo, Jaroslav Hancl Jr., Giuseppe Liotta:
2-colored point-set embeddings of partial 2-trees. Theor. Comput. Sci. 896: 31-45 (2021) - [c169]Therese C. Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani:
Generalized LR-Drawings of Trees. CCCG 2021: 78-88 - [c168]Carla Binucci
, Emilio Di Giacomo
, Giuseppe Liotta
, Alessandra Tappini
:
Quasi-upward Planar Drawings with Minimum Curve Complexity. Graph Drawing 2021: 195-209 - [c167]Therese C. Biedl, Giuseppe Liotta
, Jayson Lynch, Fabrizio Montecchiani
:
Optimal-Area Visibility Representations of Outer-1-Plane Graphs. Graph Drawing 2021: 287-303 - [c166]Lorenzo Ariemma
, Giuseppe Liotta, Massimo Candela
, Giuseppe Di Battista
:
Long-Lasting Sequences of BGP Updates. PAM 2021: 213-229 - [c165]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 - [c164]Emilio Di Giacomo, Jaroslav Hancl, Giuseppe Liotta:
2-Colored Point-Set Embeddings of Partial 2-Trees. WALCOM 2021: 247-259 - [i54]Therese C. Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani:
Generalized LR-drawings of trees. CoRR abs/2105.06992 (2021) - [i53]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) - [i52]Carla Binucci, Emilio Di Giacomo, Giuseppe Liotta, Alessandra Tappini:
Quasi-upward Planar Drawings with Minimum Curve Complexity. CoRR abs/2108.10784 (2021) - [i51]Therese C. Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani:
Optimal-area visibility representations of outer-1-plane graphs. CoRR abs/2108.11768 (2021) - [i50]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Spirality and Rectilinear Planarity Testing of Independent-Parallel SP-Graphs. CoRR abs/2110.00548 (2021) - 2020
- [j123]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) - [j122]Patrizio Angelini
, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen G. Kobourov, Giuseppe Liotta, Alfredo Navarra
, Alessandra Tappini
:
Graph Planarity by Replacing Cliques with Paths. Algorithms 13(8): 194 (2020) - [j121]Carla Binucci
, Emilio Di Giacomo
, Seok-Hee Hong, Giuseppe Liotta
, Henk Meijer
, Vera Sacristán, Stephen K. Wismath
:
Colored anchored visibility representations in 2D and 3D space. Comput. Geom. 89: 101592 (2020) - [j120]Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
1-bend upward planar slope number of SP-digraphs. Comput. Geom. 90: 101628 (2020) - [j119]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, Ser. B 142: 1-35 (2020) - [j118]Sylvain Lazard, William J. Lenhart, Giuseppe Liotta:
Corrigendum to "On the edge-length ratio of outerplanar graphs" [Theoret. Comput. Sci. 770 (2019) 88-94]. Theor. Comput. Sci. 806: 689 (2020) - [j117]Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani:
Polyline drawings with topological constraints. Theor. Comput. Sci. 809: 250-264 (2020) - [j116]Emilio Di Giacomo, Leszek Gasieniec, Giuseppe Liotta, Alfredo Navarra:
On the curve complexity of 3-colored point-set embeddings. Theor. Comput. Sci. 846: 114-140 (2020) - [c163]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 - [c162]Václav Blazej
, Jirí Fiala, Giuseppe Liotta
:
On the Edge-Length Ratio of 2-Trees. Graph Drawing 2020: 85-98 - [c161]Alessio Arleo
, Walter Didimo
, Giuseppe Liotta
, Silvia Miksch
, Fabrizio Montecchiani
:
VAIM: Visual Analytics for Influence Maximization. Graph Drawing 2020: 115-123 - [c160]Emilio Di Giacomo
, Walter Didimo
, Giuseppe Liotta
, Fabrizio Montecchiani
, Alessandra Tappini
:
Storyline Visualizations with Ubiquitous Actors. Graph Drawing 2020: 324-332 - [c159]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time. Graph Drawing 2020: 436-449 - [c158]Walter Didimo, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani:
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time. SODA 2020: 806-825 - [c157]Giuseppe Liotta
, Ignaz Rutter
, Alessandra Tappini
:
Simultaneous FPQ-Ordering and Hybrid Planarity Testing. SOFSEM 2020: 617-626 - [c156]Felice De Luca
, Emilio Di Giacomo
, Seok-Hee Hong
, Stephen G. Kobourov
, William Lenhart
, Giuseppe Liotta
, Henk Meijer, Alessandra Tappini
, Stephen K. Wismath
:
Packing Trees into 1-Planar Graphs. WALCOM 2020: 81-93 - [p2]Giuseppe Liotta, Fabrizio Montecchiani:
Edge Partitions and Visibility Representations of 1-planar Graphs. Beyond Planar Graphs 2020: 89-107 - [i49]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time. CoRR abs/2008.03784 (2020) - [i48]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini:
Storyline Visualizations with Ubiquitous Actors. CoRR abs/2008.04125 (2020) - [i47]Alessio Arleo, Walter Didimo, Giuseppe Liotta, Silvia Miksch, Fabrizio Montecchiani:
VAIM: Visual Analytics for Influence Maximization. CoRR abs/2008.08821 (2020) - [i46]Steven Chaplick, Takayuki Itoh, Giuseppe Liotta, Kwan-Liu Ma, Ignaz Rutter:
Trends and Perspectives for Graph Drawing and Network Visualization (NII Shonan Meeting 171). NII Shonan Meet. Rep. 2020 (2020)
2010 – 2019
- 2019
- [j115]Patrizio Angelini
, Michael A. Bekos, Giuseppe Liotta, Fabrizio Montecchiani
:
Universal Slope Sets for 1-Bend Planar Drawings. Algorithmica 81(6): 2527-2556 (2019) - [j114]Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Ignaz Rutter
, Alessandra Tappini
:
NodeTrix Planarity Testing with Small Clusters. Algorithmica 81(9): 3464-3493 (2019) - [j113]Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
:
A Survey on Graph Drawing Beyond Planarity. ACM Comput. Surv. 52(1): 4:1-4:37 (2019) - [j112]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) - [j111]Walter Didimo
, Luca Grilli, Giuseppe Liotta
, Fabrizio Montecchiani
, Daniele Pagliuca
:
Visual querying and analysis of temporal fiscal networks. Inf. Sci. 505: 406-421 (2019) - [j110]Walter Didimo
, Giuseppe Liotta
, Maurizio Patrignani
:
HV-planarity: Algorithms and complexity. J. Comput. Syst. Sci. 99: 72-90 (2019) - [j109]Felice De Luca, Emilio Di Giacomo, Walter Didimo, Stephen G. Kobourov, Giuseppe Liotta:
An Experimental Study on the Ply Number of Straight-line Drawings. J. Graph Algorithms Appl. 23(1): 71-91 (2019) - [j108]Sylvain Lazard, William J. Lenhart, Giuseppe Liotta
:
On the edge-length ratio of outerplanar graphs. Theor. Comput. Sci. 770: 88-94 (2019) - [j107]Alessio Arleo
, Walter Didimo
, Giuseppe Liotta
, Fabrizio Montecchiani
:
A Distributed Multilevel Force-Directed Algorithm. IEEE Trans. Parallel Distributed Syst. 30(4): 754-765 (2019) - [c155]Patrizio Angelini
, Henry Förster
, Michael Hoffmann
, Michael Kaufmann
, Stephen G. Kobourov
, Giuseppe Liotta, Maurizio Patrignani:
The QuaSEFE Problem. Graph Drawing 2019: 268-275 - [c154]Emilio Di Giacomo
, Giuseppe Liotta
, Fabrizio Montecchiani
:
Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs. Graph Drawing 2019: 379-392 - [c153]Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph, Alessandra Tappini
:
(k, p)-Planarity: A Relaxation of Hybrid Planarity. WALCOM 2019: 148-159 - [i45]Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini:
Graph Planarity Testing with Hierarchical Embedding Constraints. CoRR abs/1904.12596 (2019) - [i44]Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs. CoRR abs/1908.05015 (2019) - [i43]Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani:
The QuaSEFE Problem. CoRR abs/1908.08708 (2019) - [i42]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. CoRR abs/1909.00223 (2019) - [i41]Václav Blazej, Jirí Fiala, Giuseppe Liotta, Simon Lomic:
On the edge-length ratio of 2-trees. CoRR abs/1909.11152 (2019) - [i40]Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini:
Simultaneous FPQ-Ordering and Hybrid Planarity Testing. CoRR abs/1910.10113 (2019) - [i39]Walter Didimo, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani:
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time. CoRR abs/1910.11782 (2019) - [i38]Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath:
Packing Trees into 1-planar Graphs. CoRR abs/1911.01761 (2019) - 2018
- [j106]David Eppstein, Philipp Kindermann
, Stephen G. Kobourov
, Giuseppe Liotta
, Anna Lubiw, Aude Maignan
, Debajyoti Mondal, Hamideh Vosoughpour, Sue Whitesides, Stephen K. Wismath:
On the Planar Split Thickness of Graphs. Algorithmica 80(3): 977-994 (2018) - [j105]Steven Chaplick
, Grzegorz Guspiel, Grzegorz Gutowski, Tomasz Krawczyk, Giuseppe Liotta:
The Partial Visibility Representation Extension Problem. Algorithmica 80(8): 2286-2323 (2018) - [j104]Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani
, Stephen K. Wismath:
Ortho-polygon Visibility Representations of Embedded Graphs. Algorithmica 80(8): 2345-2383 (2018) - [j103]Alessio Arleo
, Carla Binucci
, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani
, Sue Whitesides, Stephen K. Wismath:
Visibility representations of boxes in 2.5 dimensions. Comput. Geom. 72: 19-33 (2018) - [j102]Therese C. Biedl, Giuseppe Liotta, Fabrizio Montecchiani
:
Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs. Discret. Comput. Geom. 60(2): 345-380 (2018) - [j101]David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Guillaume Moroz, Sue Whitesides, Stephen K. Wismath:
Monotone Simultaneous Paths Embeddings in ℝd. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - [j100]Walter Didimo
, Luca Giamminonni
, Giuseppe Liotta
, Fabrizio Montecchiani
, Daniele Pagliuca
:
A visual analytics system to support tax evasion discovery. Decis. Support Syst. 110: 71-83 (2018) - [j99]Carla Binucci
, Emilio Di Giacomo, Md. Iqbal Hossain
, Giuseppe Liotta:
1-page and 2-page drawings with bounded number of crossings per edge. Eur. J. Comb. 68: 24-37 (2018) - [j98]Alessio Arleo
, Walter Didimo
, Giuseppe Liotta
, Fabrizio Montecchiani
:
Profiling distributed graph processing systems through visual analytics. Future Gener. Comput. Syst. 87: 43-57 (2018) - [j97]Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta
, Henk Meijer, Fabrizio Montecchiani
, Stephen K. Wismath:
New results on edge partitions of 1-plane graphs. Theor. Comput. Sci. 713: 78-84 (2018) - [j96]Emilio Di Giacomo
, Giuseppe Liotta, Fabrizio Montecchiani
:
Drawing subcubic planar graphs with four slopes and optimal angular resolution. Theor. Comput. Sci. 714: 51-73 (2018) - [c152]Patrizio Angelini
, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen G. Kobourov, Giuseppe Liotta, Alfredo Navarra
, Alessandra Tappini
:
Turning Cliques into Paths to Achieve Planarity. Graph Drawing 2018: 67-74 - [c151]Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
:
Universal Slope Sets for Upward Planar Drawings. Graph Drawing 2018: 77-91 - [c150]Walter Didimo, Giuseppe Liotta, Maurizio Patrignani:
Bend-Minimum Orthogonal Drawings in Quadratic Time. Graph Drawing 2018: 481-494 - [c149]Giuseppe Liotta, Fabrizio Montecchiani
, Alessandra Tappini
:
Ortho-Polygon Visibility Representations of 3-Connected 1-Plane Graphs. Graph Drawing 2018: 524-537 - [c148]Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani
:
Polyline Drawings with Topological Constraints. ISAAC 2018: 39:1-39:13 - [c147]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. WG 2018: 27-39 - [i37]Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Universal Slope Sets for Upward Planar Drawings. CoRR abs/1803.09949 (2018) - [i36]Walter Didimo, Giuseppe Liotta, Maurizio Patrignani:
Efficient Algorithms for Bend-minimum Orthogonal Drawings of Planar 3-Graphs. CoRR abs/1804.05813 (2018) - [i35]Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
A Survey on Graph Drawing Beyond Planarity. CoRR abs/1804.07257 (2018) - [i34]Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph, Alessandra Tappini:
(k, p)-Planarity: A Generalization of Hybrid Planarity. CoRR abs/1806.11413 (2018) - [i33]Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini:
Ortho-polygon Visibility Representations of 3-connected 1-plane Graphs. CoRR abs/1807.01247 (2018) - [i32]Patrizio Angelini, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen G. Kobourov, Giuseppe Liotta, Alfredo Navarra, Alessandra Tappini:
Turning Cliques into Paths to Achieve Planarity. CoRR abs/1808.08925 (2018) - [i31]Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani:
Polyline Drawings with Topological Constraints. CoRR abs/1809.08111 (2018) - 2017
- [j95]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
:
Area-Thickness Trade-Offs for Straight-Line Drawings of Planar Graphs. Comput. J. 60(1): 135-142 (2017) - [j94]Stephen G. Kobourov
, Giuseppe Liotta
, Fabrizio Montecchiani
:
An annotated bibliography on 1-planarity. Comput. Sci. Rev. 25: 49-67 (2017) - [j93]Carla Binucci
, Felice De Luca, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
:
Designing the Content Analyzer of a Travel Recommender System. Expert Syst. Appl. 87: 199-208 (2017) - [j92]Alessio Arleo
, Walter Didimo
, Giuseppe Liotta, Fabrizio Montecchiani
:
Large graph visualizations using a distributed computing platform. Inf. Sci. 381: 124-141 (2017) - [j91]William J. Lenhart
, Giuseppe Liotta, Fabrizio Montecchiani
:
On partitioning the edges of 1-plane graphs. Theor. Comput. Sci. 662: 59-65 (2017) - [j90]Michael A. Bekos
, Walter Didimo, Giuseppe Liotta, Saeed Mehrabi, Fabrizio Montecchiani
:
On RAC drawings of 1-planar graphs. Theor. Comput. Sci. 689: 48-57 (2017) - [c146]Patrizio Angelini
, Michael A. Bekos, Giuseppe Liotta, Fabrizio Montecchiani
:
A Universal Slope Set for 1-Bend Planar Drawings. SoCG 2017: 9:1-9:16 - [c145]Sylvain Lazard, William Lenhart, Giuseppe Liotta:
On the Edge-Length Ratio of Outerplanar Graphs. Graph Drawing 2017: 17-23 - [c144]Alessio Arleo
, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
:
GiViP: A Visual Profiler for Distributed Graph Processing Systems. Graph Drawing 2017: 256-271 - [c143]Emilio Di Giacomo, Leszek Gasieniec, Giuseppe Liotta, Alfredo Navarra
:
Colored Point-Set Embeddings of Acyclic Graphs. Graph Drawing 2017: 413-425 - [c142]Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Alessandra Tappini
:
NodeTrix Planarity Testing with Small Clusters. Graph Drawing 2017: 479-491 - [c141]Steven Chaplick
, Myroslav Kryven, Giuseppe Liotta, Andre Löffler, Alexander Wolff
:
Beyond Outerplanarity. Graph Drawing 2017: 546-559 - [c140]Felice De Luca, Emilio Di Giacomo, Walter Didimo, Stephen G. Kobourov, Giuseppe Liotta:
An Experimental Study on the Ply Number of Straight-Line Drawings. WALCOM 2017: 135-148 - [c139]Patrizio Angelini
, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo
, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
, Ignaz Rutter
:
On the Relationship Between k-Planar and k-Quasi-Planar Graphs. WG 2017: 59-74 - [i30]Stephen G. Kobourov, Giuseppe Liotta, Fabrizio Montecchiani:
An annotated bibliography on 1-planarity. CoRR abs/1703.02261 (2017) - [i29]Patrizio Angelini, Michael A. Bekos, Giuseppe Liotta, Fabrizio Montecchiani:
Universal Slope Sets for 1-Bend Planar Drawings. CoRR abs/1703.04283 (2017) - [i28]Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath:
New Results on Edge Partitions of 1-plane Graphs. CoRR abs/1706.05161 (2017) - [i27]Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
GiViP: A Visual Profiler for Distributed Graph Processing Systems. CoRR abs/1708.07985 (2017) - [i26]Steven Chaplick, Myroslav Kryven, Giuseppe Liotta, Andre Löffler, Alexander Wolff:
Beyond Outerplanarity. CoRR abs/1708.08723 (2017) - [i25]Emilio Di Giacomo, Leszek Gasieniec, Giuseppe Liotta, Alfredo Navarra:
Colored Point-set Embeddings of Acyclic Graphs. CoRR abs/1708.09167 (2017) - [i24]Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Alessandra Tappini:
NodeTrix Planarity Testing with Small Clusters. CoRR abs/1708.09281 (2017) - [i23]Sylvain Lazard, William Lenhart, Giuseppe Liotta:
On the Edge-length Ratio of Outerplanar Graphs. CoRR abs/1709.00043 (2017) - 2016
- [j89]William S. Evans, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Alternating paths and cycles of minimum length. Comput. Geom. 58: 124-135 (2016) - [j88]Giuseppe Liotta, Fabrizio Montecchiani
:
L-visibility drawings of IC-planar graphs. Inf. Process. Lett. 116(3): 217-222 (2016) - [j87]Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp Kindermann
, Giuseppe Liotta
, Fabrizio Montecchiani
:
Recognizing and drawing IC-planar graphs. Theor. Comput. Sci. 636: 1-16 (2016) - [j86]Emilio Di Giacomo
, Giuseppe Liotta, Tamara Mchedlidze:
Lower and upper bounds for long induced paths in 3-connected planar graphs. Theor. Comput. Sci. 636: 47-55 (2016) - [j85]William S. Evans, Giuseppe Liotta, Fabrizio Montecchiani
:
Simultaneous visibility representations of plane st-graphs using L-shapes. Theor. Comput. Sci. 645: 100-111 (2016) - [c138]Therese C. Biedl, Giuseppe Liotta, Fabrizio Montecchiani
:
On Visibility Representations of Non-Planar Graphs. SoCG 2016: 19:1-19:16 - [c137]Alessio Arleo
, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
:
A Distributed Multilevel Force-Directed Algorithm. Graph Drawing 2016: 3-17 - [c136]Carla Binucci
, Markus Chimani, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
:
Placing Arrows in Directed Graph Drawings. Graph Drawing 2016: 44-51 - [c135]Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
:
1-Bend Upward Planar Drawings of SP-Digraphs. Graph Drawing 2016: 123-130 - [c134]Alessio Arleo
, Carla Binucci
, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani
, Sue Whitesides, Stephen K. Wismath:
Visibility Representations of Boxes in 2.5 Dimensions. Graph Drawing 2016: 251-265 - [c133]Steven Chaplick, Grzegorz Guspiel, Grzegorz Gutowski, Tomasz Krawczyk, Giuseppe Liotta:
The Partial Visibility Representation Extension Problem. Graph Drawing 2016: 266-279 - [c132]Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani
, Stephen K. Wismath:
Ortho-Polygon Visibility Representations of Embedded Graphs. Graph Drawing 2016: 280-294 - [c131]Walter Didimo, Giuseppe Liotta, Saeed Mehrabi, Fabrizio Montecchiani
:
1-Bend RAC Drawings of 1-Planar Graphs. Graph Drawing 2016: 335-343 - [c130]David Bremner, Olivier Devillers
, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Sue Whitesides, Stephen K. Wismath:
Monotone Simultaneous Embeddings of Paths in d Dimensions. Graph Drawing 2016: 546-553 - [c129]Carla Binucci
, Giuseppe Liotta, Fabrizio Montecchiani
, Alessandra Tappini
:
Partial edge drawing: Homogeneity is more important than crossings and ink. IISA