default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiuseppe 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
- 2024
[j149]Carla Binucci
, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Graphs Drawn With Some Vertices per Face: Density and Relationships. IEEE Access 12: 68828-68846 (2024)- [j148]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) - [j147]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) - [j146]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) - [j145]Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Min-k-planar Drawings of Graphs. J. Graph Algorithms Appl. 28(2): 1-35 (2024) - [j144]Chun-Cheng Lin, Bertrand M. T. Lin, Giuseppe Liotta:
Special Issue on WALCOM 2023: Guest Editors' Foreword. J. Graph Algorithms Appl. 28(3): 1-2 (2024) - [j143]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) - [c192]Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, Alexander Wolff:
The Price of Upwardness. GD 2024: 13:1-13:20 - [c191]Daniel Archambault, Giuseppe Liotta, Martin Nöllenburg, Tommaso Piselli, Alessandra Tappini, Markus Wallinger:
Bundling-Aware Graph Drawing. GD 2024: 15:1-15:19 - [c190]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 - [c189]Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter, Ioannis G. Tollis:
Weakly Leveled Planarity with Bounded Span. GD 2024: 19:1-19:19 - [c188]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 - [c187]Jirí Fiala, Oksana Firman, Giuseppe Liotta, Alexander Wolff, Johannes Zink:
Outerplanar and Forest Storyplans. SOFSEM 2024: 211-225 - [i72]Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, Alexander Wolff:
The Price of Upwardness. CoRR abs/2409.01475 (2024) - [i71]Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter, Ioannis G. Tollis:
Weakly Leveled Planarity with Bounded Span. CoRR abs/2409.01889 (2024) - [i70]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) - 2023
- [j142]William J. Lenhart, Giuseppe Liotta, Debajyoti Mondal, Rahnuma Islam Nishat:
Drawing Partial 2-Trees with Few Slopes. Algorithmica 85(5): 1156-1175 (2023) - [j141]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time. Algorithmica 85(9): 2605-2666 (2023) - [j140]Carla Binucci, Emilio Di Giacomo, Michael Kaufmann, Giuseppe Liotta, Alessandra Tappini:
k-Planar Placement and Packing of Δ-Regular Caterpillars. Int. J. Found. Comput. Sci. 34(7): 875-902 (2023) - [j139]Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini:
Parameterized complexity of graph planarity with restricted cyclic orders. J. Comput. Syst. Sci. 135: 125-144 (2023) - [j138]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Rectilinear Planarity of Partial 2-Trees. J. Graph Algorithms Appl. 27(8): 679-719 (2023) - [j137]William J. Lenhart, Giuseppe Liotta:
Mutual witness Gabriel drawings of complete bipartite graphs. Theor. Comput. Sci. 974: 114115 (2023) - [c186]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 - [c185]Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Min-k-planar Drawings of Graphs. GD (1) 2023: 39-52 - [c184]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 - [c183]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 - [c182]Carolina Haase, Philipp Kindermann, William J. Lenhart, Giuseppe Liotta:
Mutual Witness Proximity Drawings of Isomorphic Trees. GD (1) 2023: 304-319 - [c181]Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta, Pavel Valtr:
Three Edge-Disjoint Plane Spanning Paths in a Point Set. GD (1) 2023: 323-338 - [c180]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 - [c179]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani:
Rectilinear-Upward Planarity Testing of Digraphs. ISAAC 2023: 26:1-26:20 - [c178]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 - [c177]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 - [c176]Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi:
Parameterized Approaches to Orthogonal Compaction. SOFSEM 2023: 111-125 - [c175]Carla Binucci, Giuseppe Di Battista, Walter Didimo, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Nonplanar Graph Drawings with k Vertices per Face. WG 2023: 86-100 - [e2]Chun-Cheng Lin, Bertrand M. T. Lin, Giuseppe Liotta:
WALCOM: Algorithms and Computation - 17th International Conference and Workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023, Proceedings. Lecture Notes in Computer Science 13973, Springer 2023, ISBN 978-3-031-27050-5 [contents] - [i69]Carla Binucci, Emilio Di Giacomo, Michael Kaufmann, Giuseppe Liotta, Alessandra Tappini:
k-planar Placement and Packing of Δ-regular Caterpillars. CoRR abs/2301.01226 (2023) - [i68]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) - [i67]Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta, Pavel Valtr:
Three Edge-disjoint Plane Spanning Paths in a Point Set. CoRR abs/2306.07237 (2023) - [i66]Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Min-k-planar Drawings of Graphs. CoRR abs/2308.13401 (2023) - [i65]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) - [i64]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) - [i63]Carolina Haase, Philipp Kindermann, William J. Lenhart, Giuseppe Liotta:
Mutual Witness Proximity Drawings of Isomorphic Trees. CoRR abs/2309.01463 (2023) - [i62]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) - [i61]Jirí Fiala, Oksana Firman, Giuseppe Liotta, Alexander Wolff, Johannes Zink:
Outerplanar and Forest Storyplans. CoRR abs/2311.13523 (2023) - [i60]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) - 2022
- [j136]Luca Consalvi, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
BrowVis: Visualizing Large Graphs in the Browser. IEEE Access 10: 115776-115786 (2022) - [j135]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) - [j134]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) - [j133]Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Orthogonal planarity testing of bounded treewidth graphs. J. Comput. Syst. Sci. 125: 129-148 (2022) - [j132]Giuseppe Liotta:
Editor in Chief's Foreword. J. Graph Algorithms Appl. 26(3): 283-284 (2022) - [j131]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) - [c174]William J. Lenhart, Giuseppe Liotta:
Mutual Witness Gabriel Drawings of Complete Bipartite Graphs. GD 2022: 25-39 - [c173]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Rectilinear Planarity of Partial 2-Trees. GD 2022: 157-172 - [c172]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 - [c171]Luca Consalvi, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
In-browser Visualization of Large-scale Graphs. itaDATA 2022: 27-38 - [c170]Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini:
Parameterized Complexity of Graph Planarity with Restricted Cyclic Orders. WG 2022: 383-397 - [i59]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) - [i58]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Rectilinear Planarity of Partial 2-Trees. CoRR abs/2208.12558 (2022) - [i57]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) - [i56]William J. Lenhart, Giuseppe Liotta:
Mutual Witness Gabriel Drawings of Complete Bipartite Graphs. CoRR abs/2209.01004 (2022) - [i55]Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi:
Parameterized Approaches to Orthogonal Compaction. CoRR abs/2210.05019 (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 J. 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 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. GD 2021: 195-209 - [c167]Therese Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani:
Optimal-Area Visibility Representations of Outer-1-Plane Graphs. GD 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 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 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 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. GD 2020: 85-98 - [c161]Alessio Arleo, Walter Didimo, Giuseppe Liotta, Silvia Miksch, Fabrizio Montecchiani:
VAIM: Visual Analytics for Influence Maximization. GD 2020: 115-123 - [c160]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini:
Storyline Visualizations with Ubiquitous Actors. GD 2020: 324-332 - [c159]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time. GD 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 J. 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. GD 2019: 268-275 - [c154]Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs. GD 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 J. 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 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. GD 2018: 67-74 - [c151]Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Universal Slope Sets for Upward Planar Drawings. GD 2018: 77-91 - [c150]Walter Didimo, Giuseppe Liotta, Maurizio Patrignani:
Bend-Minimum Orthogonal Drawings in Quadratic Time. GD 2018: 481-494 - [c149]Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini:
Ortho-Polygon Visibility Representations of 3-Connected 1-Plane Graphs. GD 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 J. Lenhart, Giuseppe Liotta:
On the Edge-Length Ratio of Outerplanar Graphs. GD 2017: 17-23 - [c144]Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
GiViP: A Visual Profiler for Distributed Graph Processing Systems. GD 2017: 256-271 - [c143]Emilio Di Giacomo, Leszek Gasieniec, Giuseppe Liotta, Alfredo Navarra:
Colored Point-Set Embeddings of Acyclic Graphs. GD 2017: 413-425 - [c142]Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Alessandra Tappini:
NodeTrix Planarity Testing with Small Clusters. GD 2017: 479-491 - [c141]Steven Chaplick, Myroslav Kryven, Giuseppe Liotta, Andre Löffler, Alexander Wolff:
Beyond Outerplanarity. GD 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 J. 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 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. GD 2016: 3-17 - [c136]Carla Binucci, Markus Chimani, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Placing Arrows in Directed Graph Drawings. GD 2016: 44-51 - [c135]Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
1-Bend Upward Planar Drawings of SP-Digraphs. GD 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. GD 2016: 251-265 - [c133]Steven Chaplick, Grzegorz Guspiel, Grzegorz Gutowski, Tomasz Krawczyk, Giuseppe Liotta:
The Partial Visibility Representation Extension Problem. GD 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. GD 2016: 280-294 - [c131]Walter Didimo, Giuseppe Liotta, Saeed Mehrabi, Fabrizio Montecchiani:
1-Bend RAC Drawings of 1-Planar Graphs. GD 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. GD 2016: 546-553 - [c129]Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini:
Partial edge drawing: Homogeneity is more important than crossings and ink. IISA 2016: 1-6 - [c128]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. LATIN 2016: 403-415 - [i22]Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath:
Ortho-polygon Visibility Representations of Embedded Graphs. CoRR abs/1604.08797 (2016) - [i21]Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
A Distributed Force-Directed Algorithm on Giraph: Design and Experiments. CoRR abs/1606.02162 (2016) - [i20]Walter Didimo, Giuseppe Liotta, Saeed Mehrabi, Fabrizio Montecchiani:
1-Bend RAC Drawings of 1-Planar Graphs. CoRR abs/1608.08418 (2016) - [i19]Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
1-bend Upward Planar Drawings of SP-digraphs. CoRR abs/1608.08425 (2016) - [i18]Carla Binucci, Markus Chimani, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Placing Arrows in Directed Graph Drawings. CoRR abs/1608.08505 (2016) - [i17]Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
A Distributed Multilevel Force-directed Algorithm. CoRR abs/1608.08522 (2016) - [i16]David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Sue Whitesides, Stephen K. Wismath:
Monotone Simultaneous Embeddings of Paths in R^d. CoRR abs/1608.08791 (2016) - [i15]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. CoRR abs/1608.08899 (2016) - [i14]Takayuki Itoh, Karsten Klein, Giuseppe Liotta:
Dynamic Networks Visual Analytics: Approaches to facilitate visual analysis of complex and dynamic network data (NII Shonan Meeting 2016-11). NII Shonan Meet. Rep. 2016 (2016) - 2015
- [j84]Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer:
The Approximate Rectangle of Influence Drawability Problem. Algorithmica 72(2): 620-655 (2015) - [j83]Seok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki:
A Linear-Time Algorithm for Testing Outer-1-Planarity. Algorithmica 72(4): 1033-1054 (2015) - [j82]Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta, Salvatore Agostino Romeo:
Heuristics for the Maximum 2-Layer RAC Subgraph Problem. Comput. J. 58(5): 1085-1098 (2015) - [j81]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Planar and Quasi-Planar Simultaneous Geometric Embedding. Comput. J. 58(11): 3126-3140 (2015) - [j80]Francesco Giordano, Giuseppe Liotta, Tamara Mchedlidze, Antonios Symvonis, Sue Whitesides:
Computing upward topological book embeddings of upward planar digraphs. J. Discrete Algorithms 30: 45-69 (2015) - [j79]Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Drawing Outer 1-planar Graphs with Few Slopes. J. Graph Algorithms Appl. 19(2): 707-741 (2015) - [c127]Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
A Million Edge Drawing for a Fistful of Dollars. GD 2015: 44-51 - [c126]Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani:
Recognizing and Drawing IC-Planar Graphs. GD 2015: 295-308 - [c125]William S. Evans, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Alternating Paths and Cycles of Minimum Length. GD 2015: 383-394 - [c124]Giuseppe Liotta, Fabrizio Montecchiani:
L-Visibility Drawings of IC-Planar Graphs. GD 2015: 545-547 - [c123]Carla Binucci, Felice De Luca, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
VisFLOWer: Visual analysis of touristic flows. IISA 2015: 1-6 - [c122]Emilio Di Giacomo, Walter Didimo, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Kazuo Misue, Antonios Symvonis, Hsu-Chun Yen:
Low ply graph drawing. IISA 2015: 1-6 - [c121]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Network visualization retargeting. IISA 2015: 1-6 - [c120]Carla Binucci, Emilio Di Giacomo, Md. Iqbal Hossain, Giuseppe Liotta:
1-Page and 2-Page Drawings with Bounded Number of Crossings per Edge. IWOCA 2015: 38-51 - [c119]Peter Eades, Seok-Hee Hong, Giuseppe Liotta, Naoki Katoh, Sheung-Hung Poon:
Straight-Line Drawability of a Planar Graph Plus an Edge. WADS 2015: 301-313 - [c118]William S. Evans, Giuseppe Liotta, Fabrizio Montecchiani:
Simultaneous Visibility Representations of Plane st-graphs Using L-shapes. WG 2015: 252-265 - [i13]Peter Eades, Seok-Hee Hong, Giuseppe Liotta, Naoki Katoh, Sheung-Hung Poon:
Straight-line Drawability of a Planar Graph Plus an Edge. CoRR abs/1504.06540 (2015) - [i12]William S. Evans, Giuseppe Liotta, Fabrizio Montecchiani:
Simultaneous Visibility Representations of Plane st-graphs Using L-shapes. CoRR abs/1505.04388 (2015) - [i11]Giuseppe Liotta, Fabrizio Montecchiani:
L-Visibility Drawings of IC-planar Graphs. CoRR abs/1507.08879 (2015) - [i10]Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani:
Recognizing and Drawing IC-planar Graphs. CoRR abs/1509.00388 (2015) - [i9]William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani:
On Partitioning the Edges of 1-Planar Graphs. CoRR abs/1511.07303 (2015) - [i8]Therese Biedl, Giuseppe Liotta, Fabrizio Montecchiani:
On Visibility Representations of Non-planar Graphs. CoRR abs/1511.08592 (2015) - [i7]Steven Chaplick, Grzegorz Guspiel, Grzegorz Gutowski, Tomasz Krawczyk, Giuseppe Liotta:
The Partial Visibility Representation Extension Problem. CoRR abs/1512.00174 (2015) - [i6]Takayuki Itoh, Karsten Klein, Giuseppe Liotta:
Big Graph Drawing: Metrics and Methods (NII Shonan Meeting 2015-1). NII Shonan Meet. Rep. 2015 (2015) - 2014
- [j78]Emilio Di Giacomo, Walter Didimo, Peter Eades, Giuseppe Liotta:
2-Layer Right Angle Crossing Drawings. Algorithmica 68(4): 954-997 (2014) - [j77]Walter Didimo, Giuseppe Liotta:
Special Issue on the 28th European Workshop on Computational Geometry, Guest Editors' Foreword. Comput. Geom. 47(3): 459 (2014) - [j76]Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Network visualization for financial crime detection. J. Vis. Lang. Comput. 25(4): 433-451 (2014) - [j75]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ioannis G. Tollis:
Techniques for Edge Stratification of Complex Graph Drawings. J. Vis. Lang. Comput. 25(4): 533-543 (2014) - [c117]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Planar and Quasi Planar Simultaneous Geometric Embedding. GD 2014: 52-63 - [c116]Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Drawing Outer 1-planar Graphs with Few Slopes. GD 2014: 174-185 - [c115]Walter Didimo, Giuseppe Liotta, Maurizio Patrignani:
On the Complexity of HV-rectilinear Planarity Testing. GD 2014: 343-354 - [c114]Stefano Federici, Maria Laura Mele, Salvatore Agostino Romeo, Walter Didimo, Giuseppe Liotta, Simone Borsci, Fabio Meloni:
A Model of Web-Based Follow-Up to Reduce Assistive Technology Abandonment. HCI (3) 2014: 674-682 - [c113]Giuseppe Liotta:
Graph drawing beyond planarity: some results and open problems. ICTCS 2014: 3-8 - [c112]Md. Jawaherul Alam, Stephen G. Kobourov, Giuseppe Liotta, Sergey Pupyrev, Sankar Veeramoni:
3D proportional contact representations of graphs. IISA 2014: 27-32 - [c111]Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Fabrizio Montecchiani:
Upward-rightward planar drawings. IISA 2014: 145-150 - [c110]Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
The Planar Slope Number of Subcubic Graphs. LATIN 2014: 132-143 - 2013
- [j74]Vida Dujmovic, William S. Evans, Sylvain Lazard, William J. Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath:
On point-sets that support planar graphs. Comput. Geom. 46(1): 29-50 (2013) - [j73]William S. Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner:
Approximate proximity drawings. Comput. Geom. 46(6): 604-614 (2013) - [j72]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Area requirement of graph drawings with few crossings per edge. Comput. Geom. 46(8): 909-916 (2013) - [j71]Peter Eades, Giuseppe Liotta:
Right angle crossing graphs and 1-planarity. Discret. Appl. Math. 161(7-8): 961-969 (2013) - [j70]Ferran Hurtado, Giuseppe Liotta, David R. Wood:
Proximity Drawings of High-Degree Trees. Int. J. Comput. Geom. Appl. 23(3): 213- (2013) - [j69]Peter Eades, Seok-Hee Hong, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki:
A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system. Theor. Comput. Sci. 513: 65-76 (2013) - [c109]Seok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki:
A Linear-Time Algorithm for Testing Outer-1-Planarity. GD 2013: 71-82 - [c108]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ioannis G. Tollis:
Exploring Complex Drawings via Edge Stratification. GD 2013: 304-315 - [c107]William J. Lenhart, Giuseppe Liotta, Debajyoti Mondal, Rahnuma Islam Nishat:
Planar and Plane Slope Number of Partial 2-Trees. GD 2013: 412-423 - [c106]Carla Binucci, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Mariano Sartore:
TRART: A system to support territorial policies. Intelligent Environments (Workshops) 2013: 629-634 - [c105]Hsiu-Ming Chang, Ann-Shyn Chiang, Walter Didimo, Ching-Yao Lin, Giuseppe Liotta, Fabrizio Montecchiani:
On the robustness of the Drosophila neural network. NSW 2013: 168-171 - [c104]Emilio Di Giacomo, Giuseppe Liotta, Tamara Mchedlidze:
Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs. WG 2013: 213-224 - [r3]Giuseppe Liotta:
Proximity Drawings. Handbook of Graph Drawing and Visualization 2013: 115-154 - [r2]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta:
Spine and Radial Drawings. Handbook of Graph Drawing and Visualization 2013: 247-284 - [i5]William S. Evans, Michael Kaufmann, William J. Lenhart, Giuseppe Liotta, Tamara Mchedlidze, Stephen K. Wismath:
Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs. CoRR abs/1312.5520 (2013) - 2012
- [j68]Emilio Di Giacomo, Walter Didimo, Peter Eades, Seok-Hee Hong, Giuseppe Liotta:
Bounds on the crossing resolution of complete geometric graphs. Discret. Appl. Math. 160(1-2): 132-139 (2012) - [j67]Giuseppe Di Battista, Ethan Kim, Giuseppe Liotta, Anna Lubiw, Sue Whitesides:
The Shape of Orthogonal Cycles in Three Dimensions. Discret. Comput. Geom. 47(3): 461-491 (2012) - [j66]Mereke van Garderen, Giuseppe Liotta, Henk Meijer:
Universal point sets for 2-coloured trees. Inf. Process. Lett. 112(8-9): 346-350 (2012) - [j65]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Yoshio Okamoto, Andreas Spillner:
Vertex angle and crossing angle resolution of leveled tree drawings. Inf. Process. Lett. 112(16): 630-635 (2012) - [j64]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
Drawing a tree as a minimum spanning tree approximation. J. Comput. Syst. Sci. 78(2): 491-503 (2012) - [j63]Emilio Di Giacomo, Luca Grilli, Marcus Krug, Giuseppe Liotta, Ignaz Rutter:
Hamiltonian orthogeodesic alternating paths. J. Discrete Algorithms 16: 34-52 (2012) - [c103]Seok-Hee Hong, Peter Eades, Giuseppe Liotta, Sheung-Hung Poon:
Fáry's Theorem for 1-Planar Graphs. COCOON 2012: 335-346 - [c102]Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer:
The Approximate Rectangle of Influence Drawability Problem. GD 2012: 114-125 - [c101]David Bremner, William S. Evans, Fabrizio Frati, Laurie J. Heyer, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, David Rappaport, Sue Whitesides:
On Representing Graphs by Touching Cuboids. GD 2012: 187-198 - [c100]Fabrizio Frati, Marc Glisse, William J. Lenhart, Giuseppe Liotta, Tamara Mchedlidze, Rahnuma Islam Nishat:
Point-Set Embeddability of 2-Colored Trees. GD 2012: 291-302 - [c99]Peter Eades, Seok-Hee Hong, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki:
Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract). GD 2012: 339-345 - [c98]Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Vis4AUI: Visual Analysis of Banking Activity Networks. GRAPP/IVAPP 2012: 799-802 - [c97]Patrizio Angelini, Carla Binucci, William S. Evans, Ferran Hurtado, Giuseppe Liotta, Tamara Mchedlidze, Henk Meijer, Yoshio Okamoto:
Universal Point Subsets for Planar Graphs. ISAAC 2012: 423-432 - [c96]Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta, Salvatore Agostino Romeo:
Heuristics for the Maximum 2-layer RAC Subgraph Problem. WALCOM 2012: 211-216 - [c95]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area. WG 2012: 91-102 - [i4]Emilio Di Giacomo, Giuseppe Liotta, Tamara Mchedlidze:
How many vertex locations can be arbitrarily chosen when drawing planar graphs? CoRR abs/1212.0804 (2012) - 2011
- [j62]Ulrik Brandes, Cesim Erten, Alejandro Estrella-Balderrama, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis:
Colored Simultaneous Geometric Embeddings and Universal Pointsets. Algorithmica 60(3): 569-592 (2011) - [j61]Sergio Cabello, Marc J. van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek:
Geometric Simultaneous Embeddings of a Graph and a Matching. J. Graph Algorithms Appl. 15(1): 79-96 (2011) - [j60]Walter Didimo, Giuseppe Liotta, Salvatore Agostino Romeo:
A Graph Drawing Application to Web Site Traffic Analysis. J. Graph Algorithms Appl. 15(2): 229-251 (2011) - [j59]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings. Theory Comput. Syst. 49(3): 565-575 (2011) - [j58]Emilio Di Giacomo, Francesco Giordano, Giuseppe Liotta:
Upward Topological Book Embeddings of DAGs. SIAM J. Discret. Math. 25(2): 479-489 (2011) - [j57]Walter Didimo, Peter Eades, Giuseppe Liotta:
Drawing graphs with right angle crossings. Theor. Comput. Sci. 412(39): 5156-5166 (2011) - [j56]Vladimir Batagelj, Franz-Josef Brandenburg, Walter Didimo, Giuseppe Liotta, Pietro Palladino, Maurizio Patrignani:
Visual Analysis of Large Graphs Using (X, Y)-Clustering and Hybrid Visualizations. IEEE Trans. Vis. Comput. Graph. 17(11): 1587-1598 (2011) - [c94]Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Pietro Palladino:
An advanced network visualization system for financial crime detection. PacificVis 2011: 203-210 - [c93]Vida Dujmovic, William S. Evans, Sylvain Lazard, William J. Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath:
On Point-Sets That Support Planar Graphs. GD 2011: 64-74 - [c92]Peter Eades, Giuseppe Liotta:
Right Angle Crossing Graphs and 1-Planarity. GD 2011: 148-153 - [c91]William S. Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner:
Approximate Proximity Drawings. GD 2011: 166-178 - [c90]Emilio Di Giacomo, Walter Didimo, Peter Eades, Giuseppe Liotta:
2-Layer Right Angle Crossing Drawings. IWOCA 2011: 156-169 - [c89]Emilio Di Giacomo, Luca Grilli, Marcus Krug, Giuseppe Liotta, Ignaz Rutter:
Hamiltonian Orthogeodesic Alternating Paths. IWOCA 2011: 170-181 - [c88]Patrizio Angelini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Anna Lubiw:
Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area. EGC 2011: 200-209 - 2010
- [j55]Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta:
Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge. Algorithmica 57(4): 796-818 (2010) - [j54]Carla Binucci, Emilio Di Giacomo, Walter Didimo, Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov, Giuseppe Liotta:
Upward straight-line embeddings of directed graphs into point sets. Comput. Geom. 43(2): 219-232 (2010) - [j53]Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Matched drawability of graph pairs and of graph triples. Comput. Geom. 43(6-7): 611-634 (2010) - [j52]Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath:
Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices. Discret. Comput. Geom. 43(2): 272-288 (2010) - [j51]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Constrained Point-Set Embeddability of Planar Graphs. Int. J. Comput. Geom. Appl. 20(5): 577-600 (2010) - [j50]Walter Didimo, Peter Eades, Giuseppe Liotta:
A characterization of complete bipartite RAC graphs. Inf. Process. Lett. 110(16): 687-691 (2010) - [j49]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Pietro Palladino:
Visual Analysis of One-To-Many Matched Graphs. J. Graph Algorithms Appl. 14(1): 97-119 (2010) - [c87]Walter Didimo, Giuseppe Liotta, Salvatore Agostino Romeo:
Graph visualization techniques for conceptual Web site traffic analysis. PacificVis 2010: 193-200 - [c86]Vladimir Batagelj, Walter Didimo, Giuseppe Liotta, Pietro Palladino, Maurizio Patrignani:
Visual analysis of large graphs using (X, Y)-clustering and hybrid visualizations. PacificVis 2010: 209-216 - [c85]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Pietro Palladino:
Visual analysis of financial crimes: [system paper]. AVI 2010: 393-394 - [c84]Emilio Di Giacomo, Giuseppe Liotta, Stefano Federici:
Information Visualization Techniques for Motion Impaired People. HEALTHINF 2010: 361-366 - [c83]Walter Didimo, Giuseppe Liotta, Salvatore Agostino Romeo:
Topology-Driven Force-Directed Algorithms. GD 2010: 165-176 - [c82]Vida Dujmovic, William S. Evans, Stephen G. Kobourov, Giuseppe Liotta, Christophe Weibel, Stephen K. Wismath:
On Graphs Supported by Line Sets. GD 2010: 177-182 - [c81]Mereke van Garderen, Giuseppe Liotta, Henk Meijer:
Universal Pointsets for 2-Coloured Trees. GD 2010: 365-370 - [c80]Maria Laura Mele, Stefano Federici, Simone Borsci, Giuseppe Liotta:
Beyond a Visuocentric Way of a Visual Web Search Clustering Engine: The Sonification of WhatsOnWeb. ICCHP (1) 2010: 351-357 - [c79]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
Drawing a Tree as a Minimum Spanning Tree Approximation. ISAAC (2) 2010: 61-72 - [c78]Emilio Di Giacomo, Giuseppe Liotta:
The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing. WALCOM 2010: 35-46 - [i3]Ferran Hurtado, Giuseppe Liotta, David R. Wood:
Proximity Drawings of High-Degree Trees. CoRR abs/1008.3193 (2010)
2000 – 2009
- 2009
- [j48]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Point-set embeddings of trees with given partial drawings. Comput. Geom. 42(6-7): 664-676 (2009) - [j47]Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Volume requirements of 3D upward drawings. Discret. Math. 309(7): 1824-1837 (2009) - [j46]Emilio Di Giacomo, Walter Didimo, Marc J. van Kreveld, Giuseppe Liotta, Bettina Speckmann:
Matched Drawings of Planar Graphs. J. Graph Algorithms Appl. 13(3): 423-445 (2009) - [j45]Walter Didimo, Francesco Giordano, Giuseppe Liotta:
Upward Spirality and Upward Planarity Testing. SIAM J. Discret. Math. 23(4): 1842-1899 (2009) - [c77]Carla Binucci, Emilio Di Giacomo, Walter Didimo, Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov, Giuseppe Liotta:
On Directed Graphs with an Upward Straight-line. CCCG 2009: 21-24 - [c76]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings. GD 2009: 15-20 - [c75]Sergio Cabello, Marc J. van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek:
Geometric Simultaneous Embeddings of a Graph and a Matching. GD 2009: 183-194 - [c74]Walter Didimo, Peter Eades, Giuseppe Liotta:
Drawing Graphs with Right Angle Crossings. WADS 2009: 206-217 - [c73]Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Matched Drawability of Graph Pairs and of Graph Triples. WALCOM 2009: 322-333 - 2008
- [j44]Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood:
On the Parameterized Complexity of Layered Graph Drawing. Algorithmica 52(2): 267-292 (2008) - [j43]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta:
Radial drawings of graphs: Geometric constraints and trade-offs. J. Discrete Algorithms 6(1): 109-124 (2008) - [j42]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Francesco Trotta, Stephen K. Wismath:
k-colored Point-set Embeddability of Outerplanar Graphs. J. Graph Algorithms Appl. 12(1): 29-49 (2008) - [j41]Emilio Di Giacomo, Luca Grilli, Giuseppe Liotta:
Drawing Bipartite Graphs on Two Parallel Convex Curves. J. Graph Algorithms Appl. 12(1): 97-112 (2008) - [j40]Walter Didimo, Francesco Giordano, Giuseppe Liotta:
Overlapping Cluster Planarity. J. Graph Algorithms Appl. 12(3): 267-291 (2008) - [j39]Melanie Badent, Emilio Di Giacomo, Giuseppe Liotta:
Drawing colored graphs on colored points. Theor. Comput. Sci. 408(2-3): 129-142 (2008) - [c72]Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta, Pietro Palladino:
WhatsOnWeb+ : An Enhanced Visual Search Clustering Engine. PacificVis 2008: 167-174 - [c71]Svetlana Stolpner, Jonathan Lenchner, Giuseppe Liotta, David Bremner, Christophe Paul, Marc Pouget, Stephen K. Wismath:
A note on alpha-drawable k-trees. CCCG 2008 - [c70]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Pietro Palladino:
Visual Analysis of One-to-Many Matched Graphs. GD 2008: 133-144 - [c69]Francesco Giordano, Giuseppe Liotta, Sue Whitesides:
Embeddability Problems for Upward Planar Digraphs. GD 2008: 242-253 - [c68]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Constrained Point-Set Embeddability of Planar Graphs. GD 2008: 360-371 - [i2]Vladimir Batagelj, Franz J. Brandenburg, Walter Didimo, Giuseppe Liotta, Maurizio Patrignani:
08191 Working Group Report - X-graphs of Y-graphs and their Representations. Graph Drawing with Applications to Bioinformatics and Social Sciences 2008 - 2007
- [j38]Giuseppe Liotta, Henk Meijer:
Advances in graph drawing: The 11th International Symposium on Graph Drawing. Discret. Appl. Math. 155(9): 1077 (2007) - [j37]Emilio Di Giacomo, Giuseppe Liotta:
Simultaneous Embedding of Outerplanar Graphs, Paths, and Cycles. Int. J. Comput. Geom. Appl. 17(2): 139-160 (2007) - [j36]Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta:
Graph Visualization Techniques for Web Clustering Engines. IEEE Trans. Vis. Comput. Graph. 13(2): 294-304 (2007) - [c67]Walter Didimo, Francesco Giordano, Giuseppe Liotta:
Overlapping cluster planarity. APVIS 2007: 73-80 - [c66]Ethan Kim, Sue Whitesides, Giuseppe Liotta:
A Note on Drawing Direction-constrained Paths in 3D. CCCG 2007: 193-196 - [c65]Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis:
Colored Simultaneous Geometric Embeddings. COCOON 2007: 254-263 - [c64]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Point-Set Embedding of Trees with Edge Constraints. GD 2007: 113-124 - [c63]Emilio Di Giacomo, Walter Didimo, Marc J. van Kreveld, Giuseppe Liotta, Bettina Speckmann:
Matched Drawings of Planar Graphs. GD 2007: 183-194 - [c62]Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta:
Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge. GD 2007: 315-326 - [c61]Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath:
Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices. GD 2007: 345-351 - [c60]Francesco Giordano, Giuseppe Liotta, Tamara Mchedlidze, Antonios Symvonis:
Computing Upward Topological Book Embeddings of Upward Planar Digraphs. ISAAC 2007: 172-183 - [c59]Melanie Badent, Emilio Di Giacomo, Giuseppe Liotta:
Drawing Colored Graphs on Colored Points. WADS 2007: 102-113 - 2006
- [j35]Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood:
A Fixed-Parameter Approach to 2-Layer Planarization. Algorithmica 45(2): 159-182 (2006) - [j34]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath:
Book Embeddability of Series-Parallel Digraphs. Algorithmica 45(4): 531-547 (2006) - [j33]Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta:
On Embedding a Graph on Two Sets of Points. Int. J. Found. Comput. Sci. 17(5): 1071-1094 (2006) - [j32]Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides:
The strength of weak proximity. J. Discrete Algorithms 4(3): 384-400 (2006) - [j31]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Matthew Suderman:
k-Spine, 1-bend planarity. Theor. Comput. Sci. 359(1-3): 148-175 (2006) - [c58]Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli, Katharina Anna Lehmann, Giuseppe Liotta, Maurizio Patrignani, Ioannis G. Tollis, Francesco Trotta:
On the Topologies of Local Minimum Spanning Trees. CAAN 2006: 31-44 - [c57]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Francesco Trotta, Stephen K. Wismath:
k -Colored Point-Set Embeddability of Outerplanar Graphs. GD 2006: 318-329 - [c56]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta:
Radial Drawings of Graphs: Geometric Constraints and Trade-Offs. GD 2006: 355-366 - [c55]Emilio Di Giacomo, Luca Grilli, Giuseppe Liotta:
Drawing Bipartite Graphs on Two Curves. GD 2006: 380-385 - 2005
- [j30]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath:
Curve-constrained drawings of planar graphs. Comput. Geom. 30(1): 1-23 (2005) - [j29]Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer:
Computing straight-line 3D grid drawings of graphs in linear volume. Comput. Geom. 32(1): 26-58 (2005) - [j28]Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato:
Orthogonal drawings of graphs with vertex and edge labels. Comput. Geom. 32(2): 71-114 (2005) - [j27]Giuseppe Liotta:
Guest Editor's Foreword. J. Graph Algorithms Appl. 9(1): 3-5 (2005) - [j26]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
Computing Radial Drawings on the Minimum Number of Circles. J. Graph Algorithms Appl. 9(3): 365-389 (2005) - [c54]Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Volume Requirements of 3D Upward Drawings. GD 2005: 101-110 - [c53]Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta:
How to Embed a Path onto Two Sets of Points. GD 2005: 111-116 - [c52]Walter Didimo, Francesco Giordano, Giuseppe Liotta:
Upward Spirality and Upward Planarity Testing. GD 2005: 117-128 - [c51]Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta:
WhatsOnWeb: Using Graph Drawing to Search the Web. GD 2005: 480-491 - [c50]Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta:
A Topology-Driven Approach to the Design of Web Meta-search Clustering Engines. SOFSEM 2005: 106-116 - [i1]Emilio Di Giacomo, Giuseppe Liotta:
A note on simultaneous embedding of planar graphs. EuroCG 2005: 207-210 - 2004
- [j25]Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani:
A note on 3D orthogonal drawings with direction constrained edges. Inf. Process. Lett. 90(2): 97-101 (2004) - [c49]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
Computing Radial Drawings on the Minimum Number of Circles. GD 2004: 251-261 - [c48]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Matthew Suderman:
Hamiltonian-with-Handles Graphs and the k-Spine Drawability Problem. GD 2004: 262-272 - [e1]Giuseppe Liotta:
Graph Drawing, 11th International Symposium, GD 2003, Perugia, Italy, September 21-24, 2003, Revised Papers. Lecture Notes in Computer Science 2912, Springer 2004, ISBN 3-540-20831-3 [contents] - [r1]Roberto Tamassia, Giuseppe Liotta:
Graph drawing. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 1163-1185 - 2003
- [j24]Giuseppe Liotta, Henk Meijer:
Voronoi drawings of trees. Comput. Geom. 24(3): 147-178 (2003) - [j23]Ferran Hurtado, Giuseppe Liotta, Henk Meijer:
Optimal and suboptimal robust algorithms for proximity graphs. Comput. Geom. 25(1-2): 35-49 (2003) - [j22]Giuseppe Liotta, Ioannis G. Tollis:
Guest Editors' Foreword. J. Graph Algorithms Appl. 7(2): 101-103 (2003) - [j21]Stefan Felsner, Giuseppe Liotta, Stephen K. Wismath:
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions. J. Graph Algorithms Appl. 7(4): 363-398 (2003) - [c47]Franz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel:
Selected Open Problems in Graph Drawing. GD 2003: 515-539 - [c46]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath:
Drawing Planar Graphs on a Curve. WG 2003: 192-204 - [p1]Harold N. Gabow, Camil Demetrescu, Irene Finocchi, Giuseppe Francesco Italiano, Giuseppe Liotta, Roberto Tamassia, Richard B. Borie, R. Gary Parker, Craig A. Tovey:
Graphs in Computer Science. Handbook of Graph Theory 2003: 952-1073 - 2002
- [j20]William J. Lenhart, Giuseppe Liotta:
The drawability problem for minimum weight triangulations. Theor. Comput. Sci. 270(1-2): 261-286 (2002) - [j19]Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides:
Embedding problems for paths with direction constrained edges. Theor. Comput. Sci. 289(2): 897-917 (2002) - [c45]Emilio Di Giacomo, Giuseppe Liotta, Stephen K. Wismath:
Drawing series-parallel graphs on a box. CCCG 2002: 149-153 - [c44]Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato:
Computing Labeled Orthogonal Drawings. GD 2002: 66-73 - [c43]Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani:
Orthogonal 3D Shapes of Theta Graphs. GD 2002: 142-149 - [c42]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath:
Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs. GD 2002: 162-173 - 2001
- [c41]Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood:
On the Parameterized Complexity of Layered Graph Drawing. ESA 2001: 488-499 - [c40]Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood:
A Fixed-Parameter Approach to Two-Layer Planarization. GD 2001: 1-15 - [c39]Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato:
Labeling Heuristics for Orthogonal Drawings. GD 2001: 139-153 - [c38]Stefan Felsner, Giuseppe Liotta, Stephen K. Wismath:
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions. GD 2001: 328-342 - [c37]Emilio Di Giacomo, Giuseppe Liotta:
WAVE. GD 2001: 440-441 - [c36]Ferran Hurtado, Giuseppe Liotta, Henk Meijer:
Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs. WADS 2001: 2-13 - 2000
- [j18]Stina S. Bridgeman, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Roberto Tamassia, Luca Vismara:
Turn-regularity and optimal area drawings of orthogonal representations. Comput. Geom. 16(1): 53-93 (2000) - [j17]Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Armando Parise, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu, Luca Vismara:
Drawing Directed Acyclic Graphs: An Experimental Study. Int. J. Comput. Geom. Appl. 10(6): 623-648 (2000) - [j16]Giuseppe Liotta, Sue Whitesides:
Guest Editors' Foreword. J. Graph Algorithms Appl. 4(3): 1-3 (2000) - [j15]Luca Vismara, Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Francesco Vargiu:
Experimental studies on graph drawing algorithms. Softw. Pract. Exp. 30(11): 1235-1284 (2000) - [c35]Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides:
Embedding Problems for Paths with Direction Constrained Edges. COCOON 2000: 64-73 - [c34]Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides:
Orthogonal Drawings of Cycles in 3D Space (Extended Abstract). GD 2000: 272-283 - [c33]William J. Lenhart, Giuseppe Liotta:
Minimum Weight Drawings of Maximal Triangulations (Extended Abstract). GD 2000: 338-349 - [c32]Camil Demetrescu, Irene Finocchi, Giuseppe Liotta:
Visualizing Algorithms over the Web with the Publication-Driven Approach. WAE 2000: 147-158
1990 – 1999
- 1999
- [j14]James E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia:
Visualizing geometric algorithms over the Web. Comput. Geom. 12(1-2): 125-152 (1999) - [c31]Stina S. Bridgeman, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Roberto Tamassia, Luca Vismara:
Turn-Regularity and Planar Orthogonal Drawings. GD 1999: 8-26 - [c30]Ashim Garg, Giuseppe Liotta:
Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time. GD 1999: 38-48 - [c29]Giuseppe Liotta, Henk Meijer:
Voronoi Drawings of Trees. GD 1999: 369-378 - [c28]Camil Demetrescu, Giuseppe Di Battista, Irene Finocchi, Giuseppe Liotta, Maurizio Patrignani, Maurizio Pizzonia:
Infinite Trees and the Future. GD 1999: 379-391 - 1998
- [j13]Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides:
The rectangle of influence drawability problem. Comput. Geom. 10(1): 1-22 (1998) - [j12]Olivier Devillers, Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia:
Checking the convexity of polytopes and the planarity of subdivisions. Comput. Geom. 11(3-4): 187-208 (1998) - [j11]Giuseppe Di Battista, Giuseppe Liotta, Francesco Vargiu:
Spirality and Optimal Orthogonal Drawings. SIAM J. Comput. 27(6): 1764-1811 (1998) - [j10]Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia:
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design. SIAM J. Comput. 28(3): 864-889 (1998) - [c27]Giuseppe Liotta:
A note on checking proximity graphs. CCCG 1998 - [c26]Fabrizio d'Amore, Paolo Giulio Franciosa, Giuseppe Liotta:
Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract). ESA 1998: 175-186 - [c25]Giuseppe Di Battista, Giuseppe Liotta:
Upward Planarity Checking: "Faces Are More than Polygons". GD 1998: 72-86 - [c24]Walter Didimo, Giuseppe Liotta:
Computing Orthogonal Drawings in a Variable Embedding Setting. ISAAC 1998: 79-88 - 1997
- [j9]Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu:
An Experimental Comparison of Four Graph Drawing Algorithms. Comput. Geom. 7: 303-325 (1997) - [j8]Goos Kant, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis:
Area Requirement of Visibility Representations of Trees. Inf. Process. Lett. 62(2): 81-88 (1997) - [c23]Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis, Paola Vocca:
Area Requirement of Gabriel Drawings. CIAC 1997: 135-146 - [c22]Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia:
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design. SCG 1997: 156-165 - [c21]William J. Lenhart, Giuseppe Liotta:
Drawable and Forbidden Minimum Weight Triangulations. GD 1997: 1-12 - [c20]Olivier Devillers, Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia:
Checking the Convexity of Polytopes and the Planarity of Subdivisions (Extended Abstract). WADS 1997: 186-199 - 1996
- [j7]Prosenjit Bose, William J. Lenhart, Giuseppe Liotta:
Characterizing Proximity Trees. Algorithmica 16(1): 83-110 (1996) - [j6]William J. Lenhart, Giuseppe Liotta:
Drawing Outerplanar Minimum Weight Triangulations. Inf. Process. Lett. 57(5): 253-260 (1996) - [c19]James E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia:
Algorithm animation over the World Wide Web. AVI 1996: 203-212 - [c18]James E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia:
The Mocha algorithm animation system. AVI 1996: 248-250 - [c17]Roberto Tamassia, Giuseppe Liotta, Franco P. Preparata:
Robust Proximity Queries in Implicit Voronoi Diagrams. CCCG 1996: 1 - [c16]James E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia:
Animating Geometric Algorithms Over the Web. SCG 1996: C-3-C-4 - [c15]Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Armando Parise, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu, Luca Vismara:
Drawing Directed Acyclic Graphs: An Experimental Study. GD 1996: 76-91 - [c14]William J. Lenhart, Giuseppe Liotta:
Proximity Drawings of Outerplanar Graphs. GD 1996: 286-302 - 1995
- [j5]James E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia:
A New Model for Algorithm Animation Over the WWW. ACM Comput. Surv. 27(4): 568-572 (1995) - [j4]Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta:
Parametric Graph Drawing. IEEE Trans. Software Eng. 21(8): 662-673 (1995) - [j3]Giuseppe Di Battista, Giuseppe Liotta, Francesco Vargiu:
Diagram Server. J. Vis. Lang. Comput. 6(3): 275-298 (1995) - [c13]Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu:
An Experimental Comparison of Three Graph Drawing Algorithms (Extended Abstract). SCG 1995: 306-315 - [c12]Luciano Buti, Giuseppe Di Battista, Giuseppe Liotta, Emanuele Tassinari, Francesco Vargiu, Luca Vismara:
GD-Workbench: A System for Prototyping and Testing Graph Drawing Algorithms. GD 1995: 111-122 - [c11]Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides:
The Strength of Weak Proximity. GD 1995: 178-189 - [c10]William J. Lenhart, Giuseppe Liotta:
How to Draw Outerplanar Minimum Weight Triangulations. GD 1995: 373-384 - [c9]Giuseppe Liotta, Giuseppe Di Battista:
Computing Proximity Drawings of Trees in the 3-Dimemsional Space. WADS 1995: 239-250 - 1994
- [j2]Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta, Carlo Mannino:
Upward Drawings of Triconnected Digraphs. Algorithmica 12(6): 476-497 (1994) - [c8]Giuseppe Liotta, Francesco Vargiu, Giuseppe Di Battista:
Orthogonal Drawings with the Minimum Number of Bends. CCCG 1994: 281-286 - [c7]Giuseppe Di Battista, William J. Lenhart, Giuseppe Liotta:
Proximity Drawability: a Survey. GD 1994: 328-339 - [c6]Prosenjit Bose, Giuseppe Di Battista, William J. Lenhart, Giuseppe Liotta:
Proximity Constraints and Representable Trees. GD 1994: 340-351 - [c5]Hossam A. ElGindy, Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides:
Recognizing Rectangle of Influence Drawable Graphs. GD 1994: 352-363 - 1993
- [j1]Giuseppe Liotta:
An automatic layout facility (abstract). SIGACT News 24(1): 60 (1993) - [c4]Goos Kant, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis:
Area Requirement of Visibility Representations of Trees. CCCG 1993: 192-197 - [c3]Giuseppe Di Battista, Giuseppe Liotta, Francesco Vargiu:
Spirality of Orthogonal Representations and Optimal Drawings of Series-Parallel Graphs and 3-Planar Graphs (Extended Abstract). WADS 1993: 151-162 - 1992
- [c2]Giuseppe Di Battista, Giuseppe Liotta, M. Strani, Francesco Vargiu:
Diagram Server. Advanced Visual Interfaces 1992: 415-117 - 1991
- [c1]Massimiliano Beccaria, Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta:
A Tailorable and Extensible Automatic Layout Facility. VL 1991: 68-73
Coauthor Index
Franz-Josef Brandenburg
aka: Franz J. Brandenburg
aka: Franz J. Brandenburg
[j149] [j147] [j145] [j143] [j141] [j138] [c186] [c185] [c184] [c179] [c176] [c175] [i66] [i65] [i60] [j136] [j135] [j134] [j131] [c173] [c171] [i59] [i58] [i55] [j129] [i50] [j123] [j119] [c163] [c161] [c160] [c159] [c158] [i49] [i48] [i47] [j113] [j112] [j111] [j110] [j109] [j107] [i42] [i39] [j104] [j100] [j98] [j97] [c151] [c150] [c147] [i37] [i36] [i35] [j95] [j92] [j90] [c144] [c140] [c139] [i28] [i27] [j87] [c137] [c136] [c132] [c131] [i22] [i21] [i20] [i18] [i17] [j82] [j81] [c127] [c126] [c122] [c121] [i10] [j78] [j77] [j76] [j75] [c117] [c115] [c114] [c111] [j72] [c108] [c106] [c105] [r2] [j68] [j65] [j64] [c98] [c96] [c95] [j60] [j59] [j57] [j56] [c94] [c90] [c88] [j54] [j51] [j50] [j49] [c87] [c86] [c85] [c83] [c79] [j48] [j46] [j45] [c77] [c76] [c74] [j43] [j42] [j40] [c72] [c70] [c68] [i2] [j36] [c67] [c64] [c63] [j34] [j31] [c57] [c56] [j30] [j28] [j26] [c52] [c51] [c50] [c49] [c48] [c46] [c44] [c42] [c39] [j18] [c31] [c24]
[j148] [j147] [j146] [j143] [j140] [c186] [c184] [i69] [i65] [i60] [j135] [j133] [c172] [i57] [j129] [j128] [j125] [j124] [c168] [c165] [c164] [i53] [i52] [j121] [j120] [j117] [j116] [c163] [c160] [c156] [i48] [j114] [j112] [j109] [c154] [c153] [i44] [i38] [j104] [j103] [j99] [j97] [j96] [c151] [c148] [c147] [i37] [i34] [i31] [j95] [j93] [c143] [c142] [c140] [i28] [i25] [i24] [j86] [c135] [c134] [c132] [i22] [i19] [i15] [j84] [j82] [j81] [j79] [c123] [c122] [c121] [c120] [j78] [j75] [c117] [c116] [c111] [c110] [j72] [c108] [c104] [r2] [j68] [j64] [j63] [c102] [c96] [c95] [i4] [j59] [j58] [c90] [c89] [j55] [j54] [j51] [j49] [c85] [c84] [c79] [c78] [j48] [j47] [j46] [c77] [c76] [j43] [j42] [j41] [j39] [c72] [c70] [c68] [j37] [j36] [c64] [c63] [c62] [c59] [j34] [j33] [j31] [c57] [c56] [c55] [j30] [j29] [j26] [c54] [c53] [c51] [c50] [i1] [j25] [c49] [c48] [c46] [c45] [c43] [c42] [c37]
[i60] [j128] [j121] [j117] [c156] [i38] [j104] [j103] [j97] [c148] [i31] [i28] [j89] [c134] [c132] [i22] [i15] [j84] [j81] [c125] [c117] [j73] [j66] [j64] [c102] [c97] [j61] [j59] [c91] [j53] [j51] [c81] [c79] [j48] [j47] [c76] [c75] [c73] [j42] [c68] [j38] [c64] [c57] [j29] [j26] [c54] [c49] [j24] [j23] [c36] [c29] [j13] [c5]
[j148] [j147] [j146] [j143] [c190] [c188] [i70] [c186] [c184] [c183] [c180] [c178] [c177] [i68] [i65] [i64] [i62] [i60] [j136] [j135] [j134] [j133] [j131] [c172] [c171] [i57] [j127] [c169] [c167] [c165] [i54] [i53] [i51] [j123] [j120] [j119] [j117] [c163] [c161] [c160] [p2] [i48] [i47] [j115] [j113] [j112] [j111] [j107] [c154] [i44] [i42] [j104] [j103] [j102] [j100] [j98] [j97] [j96] [c151] [c149] [c148] [c147] [i37] [i35] [i33] [i31] [j95] [j94] [j93] [j92] [j91] [j90] [c146] [c144] [c139] [i30] [i29] [i28] [i27] [j88] [j87] [j85] [c138] [c137] [c136] [c135] [c134] [c132] [c131] [c129] [i22] [i21] [i20] [i19] [i18] [i17] [i15] [j79] [c127] [c126] [c124] [c123] [c121] [c118] [i12] [i11] [i10] [i9] [i8] [j76] [j75] [c116] [c111] [c110] [j72] [c108] [c106] [c105] [c98] [c95] [c94]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
