default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWalter Didimo
Person information
- affiliation: University of Perugia, Department of Engineering, Italy
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j88]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)- [j87]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) - [j86]Jacopo Cancellieri, Walter Didimo, Andrea Fronzetti Colladon, Fabrizio Montecchiani, Roberto Vestrelli:
Brand Network Booster: A new system for improving brand connectivity. Comput. Ind. Eng. 194: 110389 (2024) - [j85]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) - [j84]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) - [c108]Michael A. Bekos, Giuseppe Di Battista, Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, Fabrizio Montecchiani:
On the Complexity of Recognizing k^+-Real Face Graphs. GD 2024: 32:1-32:22 - [i38]Giordano Da Lozzo, Walter Didimo, Fabrizio Montecchiani, Miriam Münch, Maurizio Patrignani, Ignaz Rutter:
Simple Realizability of Abstract Topological Graphs. CoRR abs/2409.20108 (2024) - 2023
- [j83]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) - [j82]Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, Maurizio Patrignani:
Upward Book Embeddability of st-Graphs: Complexity and Algorithms. Algorithmica 85(12): 3521-3571 (2023) - [j81]Carla Binucci, Walter Didimo, Fabrizio Montecchiani:
1-planarity testing and embedding: An experimental study. Comput. Geom. 108: 101900 (2023) - [j80]Carla Binucci, Walter Didimo, Maurizio Patrignani:
st-Orientations with Few Transitive Edges. J. Graph Algorithms Appl. 27(8): 625-650 (2023) - [j79]Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, Alessandra Tappini:
Small Point-Sets Supporting Graph Stories. J. Graph Algorithms Appl. 27(8): 651-677 (2023) - [j78]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Rectilinear Planarity of Partial 2-Trees. J. Graph Algorithms Appl. 27(8): 679-719 (2023) - [c107]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 - [c106]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 - [c105]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 - [c104]Walter Didimo, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Stephen G. Kobourov, Marie Diana Sieper:
Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem. GD (2) 2023: 189-202 - [c103]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani:
Rectilinear-Upward Planarity Testing of Digraphs. ISAAC 2023: 26:1-26:20 - [c102]Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi:
Parameterized Approaches to Orthogonal Compaction. SOFSEM 2023: 111-125 - [c101]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 - [i37]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) - [i36]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) - [i35]Walter Didimo, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Stephen G. Kobourov, Marie Diana Sieper:
Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem. CoRR abs/2308.15635 (2023) - [i34]Jacopo Cancellieri, Walter Didimo, Andrea Fronzetti Colladon, Fabrizio Montecchiani:
Brand Network Booster: A New System for Improving Brand Connectivity. CoRR abs/2309.16228 (2023) - [i33]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
- [j77]Luca Consalvi, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
BrowVis: Visualizing Large Graphs in the Browser. IEEE Access 10: 115776-115786 (2022) - [j76]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) - [j75]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) - [j74]Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter:
On Turn-Regular Orthogonal Representations. J. Graph Algorithms Appl. 26(3): 285-306 (2022) - [j73]Lorenzo Angori, Walter Didimo, Fabrizio Montecchiani, Daniele Pagliuca, Alessandra Tappini:
Hybrid Graph Visualizations With ChordLink: Algorithms, Experiments, and Applications. IEEE Trans. Vis. Comput. Graph. 28(2): 1288-1300 (2022) - [j72]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) - [c100]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Rectilinear Planarity of Partial 2-Trees. GD 2022: 157-172 - [c99]Carla Binucci, Walter Didimo, Maurizio Patrignani:
st-Orientations with Few Transitive Edges. GD 2022: 201-216 - [c98]Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, Alessandra Tappini:
Small Point-Sets Supporting Graph Stories. GD 2022: 289-303 - [c97]Luca Consalvi, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
In-browser Visualization of Large-scale Graphs. itaDATA 2022: 27-38 - [i32]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) - [i31]Carla Binucci, Walter Didimo, Maurizio Patrignani:
st-Orientations with Few Transitive Edges. CoRR abs/2208.11414 (2022) - [i30]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Rectilinear Planarity of Partial 2-Trees. CoRR abs/2208.12558 (2022) - [i29]Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, Alessandra Tappini:
Small Point-Sets Supporting Graph Stories. CoRR abs/2208.14126 (2022) - [i28]Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi:
Parameterized Approaches to Orthogonal Compaction. CoRR abs/2210.05019 (2022) - 2021
- [j71]Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, Giuseppe Liotta:
Stable visualization of connected components in dynamic graphs. Inf. Vis. 20(1): 3-19 (2021) - [c96]Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Alessandra Tappini:
A User Study on Hybrid Graph Visualizations. GD 2021: 21-38 - [i27]Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Alessandra Tappini:
A User Study on Hybrid Graph Visualizations. CoRR abs/2108.10270 (2021) - [i26]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Spirality and Rectilinear Planarity Testing of Independent-Parallel SP-Graphs. CoRR abs/2110.00548 (2021) - 2020
- [j70]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) - [j69]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) - [c95]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 - [c94]Alessio Arleo, Walter Didimo, Giuseppe Liotta, Silvia Miksch, Fabrizio Montecchiani:
VAIM: Visual Analytics for Influence Maximization. GD 2020: 115-123 - [c93]Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter:
On Turn-Regular Orthogonal Representations. GD 2020: 250-264 - [c92]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini:
Storyline Visualizations with Ubiquitous Actors. GD 2020: 324-332 - [c91]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time. GD 2020: 436-449 - [c90]Walter Didimo, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani:
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time. SODA 2020: 806-825 - [c89]Carla Binucci, Walter Didimo, Fabrizio Montecchiani:
An Experimental Study of a 1-Planarity Testing and Embedding Algorithm. WALCOM 2020: 329-335 - [p3]Walter Didimo:
Right Angle Crossing Drawings of Graphs. Beyond Planar Graphs 2020: 149-169 - [i25]Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time. CoRR abs/2008.03784 (2020) - [i24]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini:
Storyline Visualizations with Ubiquitous Actors. CoRR abs/2008.04125 (2020) - [i23]Alessio Arleo, Walter Didimo, Giuseppe Liotta, Silvia Miksch, Fabrizio Montecchiani:
VAIM: Visual Analytics for Influence Maximization. CoRR abs/2008.08821 (2020) - [i22]Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter:
On Turn-Regular Orthogonal Representations. CoRR abs/2008.09002 (2020)
2010 – 2019
- 2019
- [j68]Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
A Survey on Graph Drawing Beyond Planarity. ACM Comput. Surv. 52(1): 4:1-4:37 (2019) - [j67]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) - [j66]Walter Didimo, Luca Grilli, Giuseppe Liotta, Fabrizio Montecchiani, Daniele Pagliuca:
Visual querying and analysis of temporal fiscal networks. Inf. Sci. 505: 406-421 (2019) - [j65]Walter Didimo, Giuseppe Liotta, Maurizio Patrignani:
HV-planarity: Algorithms and complexity. J. Comput. Syst. Sci. 99: 72-90 (2019) - [j64]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) - [j63]Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini:
Greedy rectilinear drawings. Theor. Comput. Sci. 795: 375-397 (2019) - [j62]Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis G. Tollis:
Planar drawings of fixed-mobile bigraphs. Theor. Comput. Sci. 795: 408-419 (2019) - [j61]Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
A Distributed Multilevel Force-Directed Algorithm. IEEE Trans. Parallel Distributed Syst. 30(4): 754-765 (2019) - [c88]Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, Maurizio Patrignani:
Upward Book Embeddings of st-Graphs. SoCG 2019: 13:1-13:22 - [c87]Lorenzo Angori, Walter Didimo, Fabrizio Montecchiani, Daniele Pagliuca, Alessandra Tappini:
ChordLink: A New Hybrid Visualization Model. GD 2019: 276-290 - [i21]Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, Maurizio Patrignani:
Upward Book Embeddings of st-Graphs. CoRR abs/1903.07966 (2019) - [i20]Lorenzo Angori, Walter Didimo, Fabrizio Montecchiani, Daniele Pagliuca, Alessandra Tappini:
ChordLink: A New Hybrid Visualization Model. CoRR abs/1908.08412 (2019) - [i19]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) - [i18]Walter Didimo, Giuseppe Liotta, Giacomo Ortali, Maurizio Patrignani:
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time. CoRR abs/1910.11782 (2019) - [i17]Carla Binucci, Walter Didimo, Fabrizio Montecchiani:
An Experimental Study of a 1-planarity Testing and Embedding Algorithm. CoRR abs/1911.00573 (2019) - 2018
- [j60]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) - [j59]Walter Didimo, Evgenios M. Kornaropoulos, Fabrizio Montecchiani, Ioannis G. Tollis:
A Visualization Framework and User Studies for Overloaded Orthogonal Drawings. Comput. Graph. Forum 37(1): 288-300 (2018) - [j58]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) - [j57]Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Profiling distributed graph processing systems through visual analytics. Future Gener. Comput. Syst. 87: 43-57 (2018) - [j56]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) - [c86]Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Universal Slope Sets for Upward Planar Drawings. GD 2018: 77-91 - [c85]Walter Didimo, Giuseppe Liotta, Maurizio Patrignani:
Bend-Minimum Orthogonal Drawings in Quadratic Time. GD 2018: 481-494 - [c84]Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini:
Greedy Rectilinear Drawings. GD 2018: 495-508 - [c83]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 - [i16]Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Universal Slope Sets for Upward Planar Drawings. CoRR abs/1803.09949 (2018) - [i15]Walter Didimo, Giuseppe Liotta, Maurizio Patrignani:
Efficient Algorithms for Bend-minimum Orthogonal Drawings of Planar 3-Graphs. CoRR abs/1804.05813 (2018) - [i14]Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
A Survey on Graph Drawing Beyond Planarity. CoRR abs/1804.07257 (2018) - [i13]Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini:
Greedy Rectilinear Drawings. CoRR abs/1808.09063 (2018) - 2017
- [j55]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) - [j54]Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Large graph visualizations using a distributed computing platform. Inf. Sci. 381: 124-141 (2017) - [j53]Carla Binucci, Markus Chimani, Walter Didimo, Martin Gronemann, Karsten Klein, Jan Kratochvíl, Fabrizio Montecchiani, Ioannis G. Tollis:
Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus. J. Graph Algorithms Appl. 21(1): 81-102 (2017) - [j52]Patrizio Angelini, Michael A. Bekos, Felice De Luca, Walter Didimo, Michael Kaufmann, Stephen G. Kobourov, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Vincenzo Roselli, Antonios Symvonis:
Vertex-Coloring with Defects. J. Graph Algorithms Appl. 21(3): 313-340 (2017) - [j51]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) - [c82]Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
GiViP: A Visual Profiler for Distributed Graph Processing Systems. GD 2017: 256-271 - [c81]Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis G. Tollis:
Planar Drawings of Fixed-Mobile Bigraphs. GD 2017: 426-439 - [c80]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 - [c79]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 - [i12]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) - [i11]Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
GiViP: A Visual Profiler for Distributed Graph Processing Systems. CoRR abs/1708.07985 (2017) - [i10]Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis G. Tollis:
Planar Drawings of Fixed-Mobile Bigraphs. CoRR abs/1708.09238 (2017) - 2016
- [j50]Carla Binucci, Walter Didimo:
Computing Quasi-Upward Planar Drawings of Mixed Graphs. Comput. J. 59(1): 133-150 (2016) - [j49]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) - [c78]Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
A Distributed Multilevel Force-Directed Algorithm. GD 2016: 3-17 - [c77]Carla Binucci, Markus Chimani, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Placing Arrows in Directed Graph Drawings. GD 2016: 44-51 - [c76]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 - [c75]Walter Didimo, Giuseppe Liotta, Saeed Mehrabi, Fabrizio Montecchiani:
1-Bend RAC Drawings of 1-Planar Graphs. GD 2016: 335-343 - [c74]Carla Binucci, Walter Didimo, Enrico Spataro:
Fully dynamic semantic word clouds. IISA 2016: 1-6 - [r3]Walter Didimo:
Upward Graph Drawing. Encyclopedia of Algorithms 2016: 2308-2312 - [i9]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) - [i8]Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
A Distributed Force-Directed Algorithm on Giraph: Design and Experiments. CoRR abs/1606.02162 (2016) - [i7]Walter Didimo, Giuseppe Liotta, Saeed Mehrabi, Fabrizio Montecchiani:
1-Bend RAC Drawings of 1-Planar Graphs. CoRR abs/1608.08418 (2016) - [i6]Carla Binucci, Markus Chimani, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Placing Arrows in Directed Graph Drawings. CoRR abs/1608.08505 (2016) - [i5]Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
A Distributed Multilevel Force-directed Algorithm. CoRR abs/1608.08522 (2016) - 2015
- [j48]Patrizio Angelini, Walter Didimo, Stephen G. Kobourov, Tamara Mchedlidze, Vincenzo Roselli, Antonios Symvonis, Stephen K. Wismath:
Monotone Drawings of Graphs with Fixed Embedding. Algorithmica 71(2): 233-257 (2015) - [j47]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) - [j46]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) - [j45]Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis:
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs. Comput. Geom. 50: 34-48 (2015) - [j44]Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Antonios Symvonis, Ioannis G. Tollis:
Fan-planarity: Properties and complexity. Theor. Comput. Sci. 589: 76-86 (2015) - [c73]Alessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
A Million Edge Drawing for a Fistful of Dollars. GD 2015: 44-51 - [c72]Walter Didimo, Francesco Giacchè, Fabrizio Montecchiani:
Kojaph: Visual Definition and Exploration of Patterns in Graph Databases. GD 2015: 272-278 - [c71]Carla Binucci, Markus Chimani, Walter Didimo, Martin Gronemann, Karsten Klein, Jan Kratochvíl, Fabrizio Montecchiani, Ioannis G. Tollis:
2-Layer Fan-Planarity: From Caterpillar to Stegosaurus. GD 2015: 281-294 - [c70]Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani:
Recognizing and Drawing IC-Planar Graphs. GD 2015: 295-308 - [c69]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 - [c68]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Network visualization retargeting. IISA 2015: 1-6 - [i4]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) - 2014
- [j43]Emilio Di Giacomo, Walter Didimo, Peter Eades, Giuseppe Liotta:
2-Layer Right Angle Crossing Drawings. Algorithmica 68(4): 954-997 (2014) - [j42]Walter Didimo, Giuseppe Liotta:
Special Issue on the 28th European Workshop on Computational Geometry, Guest Editors' Foreword. Comput. Geom. 47(3): 459 (2014) - [j41]Walter Didimo, Fabrizio Montecchiani:
Fast layout computation of clustered networks: Algorithmic advances and experimental analysis. Inf. Sci. 260: 185-199 (2014) - [j40]Carla Binucci, Walter Didimo, Maurizio Patrignani:
Upward and quasi-upward planarity testing of embedded mixed graphs. Theor. Comput. Sci. 526: 75-89 (2014) - [j39]Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Network visualization for financial crime detection. J. Vis. Lang. Comput. 25(4): 433-451 (2014) - [j38]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) - [c67]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Planar and Quasi Planar Simultaneous Geometric Embedding. GD 2014: 52-63 - [c66]Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis:
Fan-Planar Graphs: Combinatorial Properties and Complexity Results. GD 2014: 186-197 - [c65]Walter Didimo, Giuseppe Liotta, Maurizio Patrignani:
On the Complexity of HV-rectilinear Planarity Testing. GD 2014: 343-354 - [c64]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 - [c63]Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Fabrizio Montecchiani:
Upward-rightward planar drawings. IISA 2014: 145-150 - [c62]Walter Didimo, Fabrizio Montecchiani, Evangelos Pallas, Ioannis G. Tollis:
How to visualize directed graphs: A user study. IISA 2014: 152-157 - [c61]Carla Binucci, Walter Didimo:
Quasi-Upward Planar Drawings of Mixed Graphs with Few Bends: Heuristics and Exact Methods. WALCOM 2014: 298-309 - [i3]Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis:
Properties and Complexity of Fan-Planarity. CoRR abs/1406.5299 (2014) - 2013
- [j37]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) - [j36]Walter Didimo:
Density of straight-line 1-planar graph drawings. Inf. Process. Lett. 113(7): 236-240 (2013) - [j35]Walter Didimo, Maurizio Patrignani:
Guest Editors' Foreword. J. Graph Algorithms Appl. 17(4): 363-365 (2013) - [c60]Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis:
Drawing Non-Planar Graphs with Crossing-Free Subgraphs. GD 2013: 292-303 - [c59]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ioannis G. Tollis:
Exploring Complex Drawings via Edge Stratification. GD 2013: 304-315 - [c58]Carla Binucci, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Mariano Sartore:
TRART: A system to support territorial policies. Intelligent Environments (Workshops) 2013: 629-634 - [c57]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 - [e1]Walter Didimo, Maurizio Patrignani:
Graph Drawing - 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7704, Springer 2013, ISBN 978-3-642-36762-5 [contents] - [r2]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta:
Spine and Radial Drawings. Handbook of Graph Drawing and Visualization 2013: 247-284 - [r1]Giuseppe Di Battista, Walter Didimo:
GDToolkit. Handbook of Graph Drawing and Visualization 2013: 571-597 - [i2]Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis:
Drawings of Non-planar Graphs with Crossing-free Subgraphs. CoRR abs/1308.6706 (2013) - 2012
- [j34]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) - [j33]Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina Anna Zweig:
Drawing trees in a streaming model. Inf. Process. Lett. 112(11): 418-422 (2012) - [j32]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) - [j31]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) - [c56]Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
Vis4AUI: Visual Analysis of Banking Activity Networks. GRAPP/IVAPP 2012: 799-802 - [c55]Walter Didimo, Fabrizio Montecchiani:
Fast Layout Computation of Hierarchically Clustered Networks: Algorithmic Advances and Experimental Analysis. IV 2012: 18-23 - [c54]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 - [c53]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area. WG 2012: 91-102 - 2011
- [j30]Patrizio Angelini, Luca Cittadini, Walter Didimo, Fabrizio Frati, Giuseppe Di Battista, Michael Kaufmann, Antonios Symvonis:
On the Perspectives Opened by Right Angle Crossing Drawings. J. Graph Algorithms Appl. 15(1): 53-78 (2011) - [j29]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) - [j28]Carla Binucci, Emilio Di Giacomo, Walter Didimo, Aimal Rextin:
Switch-Regular Upward Planarity Testing of Directed Trees. J. Graph Algorithms Appl. 15(5): 587-629 (2011) - [j27]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) - [j26]Walter Didimo, Peter Eades, Giuseppe Liotta:
Drawing graphs with right angle crossings. Theor. Comput. Sci. 412(39): 5156-5166 (2011) - [j25]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) - [c52]Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Pietro Palladino:
An advanced network visualization system for financial crime detection. PacificVis 2011: 203-210 - [c51]Patrizio Angelini, Walter Didimo, Stephen G. Kobourov, Tamara Mchedlidze, Vincenzo Roselli, Antonios Symvonis, Stephen K. Wismath:
Monotone Drawings of Graphs with Fixed Embedding. GD 2011: 379-390 - [c50]Carla Binucci, Walter Didimo:
Upward Planarity Testing of Embedded Mixed Graphs. GD 2011: 427-432 - [c49]Emilio Di Giacomo, Walter Didimo, Peter Eades, Giuseppe Liotta:
2-Layer Right Angle Crossing Drawings. IWOCA 2011: 156-169 - [c48]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
- [j24]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) - [j23]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) - [j22]Walter Didimo, Peter Eades, Giuseppe Liotta:
A characterization of complete bipartite RAC graphs. Inf. Process. Lett. 110(16): 687-691 (2010) - [j21]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) - [c47]Walter Didimo, Giuseppe Liotta, Salvatore Agostino Romeo:
Graph visualization techniques for conceptual Web site traffic analysis. PacificVis 2010: 193-200 - [c46]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 - [c45]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Pietro Palladino:
Visual analysis of financial crimes: [system paper]. AVI 2010: 393-394 - [c44]Walter Didimo, Giuseppe Liotta, Salvatore Agostino Romeo:
Topology-Driven Force-Directed Algorithms. GD 2010: 165-176 - [c43]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
Drawing a Tree as a Minimum Spanning Tree Approximation. ISAAC (2) 2010: 61-72 - [c42]Carla Binucci, Emilio Di Giacomo, Walter Didimo, Aimal Rextin:
Switch-Regular Upward Planar Embeddings of Trees. WALCOM 2010: 58-69
2000 – 2009
- 2009
- [j20]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) - [j19]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) - [j18]Walter Didimo, Francesco Giordano, Giuseppe Liotta:
Upward Spirality and Upward Planarity Testing. SIAM J. Discret. Math. 23(4): 1842-1899 (2009) - [c41]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 - [c40]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings. GD 2009: 15-20 - [c39]Patrizio Angelini, Luca Cittadini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Michael Kaufmann, Antonios Symvonis:
On the Perspectives Opened by Right Angle Crossing Drawings. GD 2009: 21-32 - [c38]Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina Anna Zweig:
Drawing Trees in a Streaming Model. GD 2009: 292-303 - [c37]Walter Didimo, Peter Eades, Giuseppe Liotta:
Drawing Graphs with Right Angle Crossings. WADS 2009: 206-217 - 2008
- [j17]Carla Binucci, Walter Didimo, Francesco Giordano:
Maximum upward planar subgraphs of embedded planar digraphs. Comput. Geom. 41(3): 230-246 (2008) - [j16]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta:
Radial drawings of graphs: Geometric constraints and trade-offs. J. Discrete Algorithms 6(1): 109-124 (2008) - [j15]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) - [j14]Walter Didimo, Francesco Giordano, Giuseppe Liotta:
Overlapping Cluster Planarity. J. Graph Algorithms Appl. 12(3): 267-291 (2008) - [c36]Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta, Pietro Palladino:
WhatsOnWeb+ : An Enhanced Visual Search Clustering Engine. PacificVis 2008: 167-174 - [c35]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Pietro Palladino:
Visual Analysis of One-to-Many Matched Graphs. GD 2008: 133-144 - [c34]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Constrained Point-Set Embeddability of Planar Graphs. GD 2008: 360-371 - [i1]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
- [j13]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) - [c33]Walter Didimo, Francesco Giordano, Giuseppe Liotta:
Overlapping cluster planarity. APVIS 2007: 73-80 - [c32]Melanie Badent, Carla Binucci, Emilio Di Giacomo, Walter Didimo, Stefan Felsner, Francesco Giordano, Jan Kratochvíl, Pietro Palladino, Maurizio Patrignani, Francesco Trotta:
Homothetic Triangle Contact Representations of Planar Graphs. CCCG 2007: 233-236 - [c31]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Point-Set Embedding of Trees with Edge Constraints. GD 2007: 113-124 - [c30]Emilio Di Giacomo, Walter Didimo, Marc J. van Kreveld, Giuseppe Liotta, Bettina Speckmann:
Matched Drawings of Planar Graphs. GD 2007: 183-194 - [c29]Carla Binucci, Walter Didimo, Francesco Giordano:
Maximum Upward Planar Subgraphs of Embedded Planar Digraphs. GD 2007: 195-206 - 2006
- [j12]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath:
Book Embeddability of Series-Parallel Digraphs. Algorithmica 45(4): 531-547 (2006) - [j11]Walter Didimo:
Upward Planar Drawings and Switch-regularity Heuristics. J. Graph Algorithms Appl. 10(2): 259-285 (2006) - [j10]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Matthew Suderman:
k-Spine, 1-bend planarity. Theor. Comput. Sci. 359(1-3): 148-175 (2006) - [c28]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 - [c27]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta:
Radial Drawings of Graphs: Geometric Constraints and Trade-Offs. GD 2006: 355-366 - 2005
- [j9]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath:
Curve-constrained drawings of planar graphs. Comput. Geom. 30(1): 1-23 (2005) - [j8]Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato:
Orthogonal drawings of graphs with vertex and edge labels. Comput. Geom. 32(2): 71-114 (2005) - [j7]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) - [c26]Carla Binucci, Walter Didimo:
Experiments on Area Compaction Algorithms for Orthogonal Drawings. CCCG 2005: 113-116 - [c25]Walter Didimo, Francesco Giordano, Giuseppe Liotta:
Upward Spirality and Upward Planarity Testing. GD 2005: 117-128 - [c24]Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta:
WhatsOnWeb: Using Graph Drawing to Search the Web. GD 2005: 480-491 - [c23]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 - [c22]Walter Didimo:
Computing Upward Planar Drawings Using Switch-Regularity Heuristics. SOFSEM 2005: 117-126 - 2004
- [c21]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
Computing Radial Drawings on the Minimum Number of Circles. GD 2004: 251-261 - [c20]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Matthew Suderman:
Hamiltonian-with-Handles Graphs and the k-Spine Drawability Problem. GD 2004: 262-272 - [p2]Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia:
DBdraw - Automatic Layout of Relational Database Schemas. Graph Drawing Software 2004: 237-256 - [p1]Gabriele Barbagallo, Andrea Carmignani, Giuseppe Di Battista, Walter Didimo, Maurizio Pizzonia:
Polyphemus and Hermes - Exploration and Visualization of Computer Networks. Graph Drawing Software 2004: 341-364 - 2003
- [j6]Walter Didimo, Maurizio Pizzonia:
Upward Embeddings and Orientations of Undirected Planar Graphs. J. Graph Algorithms Appl. 7(2): 221-241 (2003) - [c19]Emilio Di Giacomo, Walter Didimo:
Straight-Line Drawings of 2-Outerplanar Graphs on Two Curves. GD 2003: 419-424 - [c18]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath:
Drawing Planar Graphs on a Curve. WG 2003: 192-204 - 2002
- [j5]Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo:
Quasi-Upward Planarity. Algorithmica 32(3): 474-506 (2002) - [j4]Andrea Carmignani, Giuseppe Di Battista, Walter Didimo, Francesco Matera, Maurizio Pizzonia:
Visualization of the High Level Structure of the Internet with HERMES. J. Graph Algorithms Appl. 6(3): 281-311 (2002) - [j3]Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia:
Drawing database schemas. Softw. Pract. Exp. 32(11): 1065-1098 (2002) - [c17]Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato:
Computing Labeled Orthogonal Drawings. GD 2002: 66-73 - [c16]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath:
Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs. GD 2002: 162-173 - [c15]Carla Binucci, Walter Didimo:
A Software System for Computing Labeled Orthogonal Drawings of Graphs. GraBaTs 2002: 81-90 - 2001
- [c14]Giuseppe Di Battista, Walter Didimo, A. Marcandalli:
Planarization of Clustered Graphs. GD 2001: 60-74 - [c13]Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato:
Labeling Heuristics for Orthogonal Drawings. GD 2001: 139-153 - [c12]Gabriele Barbagallo, Andrea Carmignani, Giuseppe Di Battista, Walter Didimo, Maurizio Pizzonia:
Exploration and Visualization of Computer Networks: Polyphemus and Hermes. GD 2001: 444-445 - [c11]Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia:
Drawing Database Schemas with DBdraw. GD 2001: 451-452 - [c10]Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia:
Industrial Plant Drawer. GD 2001: 475-476 - [c9]Walter Didimo, Maurizio Pizzonia:
Upward Embeddings and Orientations of Undirected Planar Graphs. WADS 2001: 339-351 - 2000
- [j2]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) - [j1]Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo:
Computing Orthogonal Drawings with the Minimum Number of Bends. IEEE Trans. Computers 49(8): 826-840 (2000) - [c8]Andrea Carmignani, Giuseppe Di Battista, Walter Didimo, Francesco Matera, Maurizio Pizzonia:
Visualization of the Autonomous Systems Interconnections with HERMES. GD 2000: 150-163 - [c7]Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia:
Drawing Relational Schemas. VisSym 2000: 53-62
1990 – 1999
- 1999
- [c6]Stina S. Bridgeman, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Roberto Tamassia, Luca Vismara:
Turn-Regularity and Planar Orthogonal Drawings. GD 1999: 8-26 - [c5]Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia:
Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size. GD 1999: 297-310 - 1998
- [c4]Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo:
Quasi-Upward Planarity. GD 1998: 15-29 - [c3]Walter Didimo, Giuseppe Liotta:
Computing Orthogonal Drawings in a Variable Embedding Setting. ISAAC 1998: 79-88 - 1997
- [c2]Walter Didimo, Antonio Leonforte:
GRID: An Interactive Tool for Computing Orthogonal Drawings With the Minimum Number of Bends. GD 1997: 309-315 - [c1]Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo:
Computing Orthogonal Drawings with the Minimum Number of Bends. WADS 1997: 331-344
Coauthor Index
[j87] [j84] [c108] [j82] [c107] [c105] [i36] [i33] [j76] [j71] [c96] [i27] [c95] [c92] [i24] [j67] [j64] [c88] [i21] [j60] [j56] [c86] [c83] [i16] [j55] [c80] [i12] [c76] [i9] [j47] [j46] [j44] [c69] [c68] [j43] [j38] [c67] [c66] [c63] [i3] [j37] [c59] [r2] [j34] [j31] [c54] [c53] [j28] [j27] [c49] [j24] [j23] [j21] [c45] [c43] [c42] [j20] [j19] [c41] [c40] [j16] [j15] [c36] [c35] [c34] [j13] [c32] [c31] [c30] [j12] [j10] [c28] [c27] [j9] [j7] [c24] [c23] [c21] [c20] [c19] [c18] [c16]
[j88] [j87] [j85] [j84] [j83] [j78] [c107] [c106] [c105] [c103] [c102] [c101] [i37] [i36] [i33] [j77] [j76] [j75] [j72] [c100] [c97] [i32] [i30] [i28] [j71] [i26] [j70] [j69] [c95] [c94] [c92] [c91] [c90] [i25] [i24] [i23] [j68] [j67] [j66] [j65] [j64] [j61] [i19] [i18] [j60] [j58] [j57] [j56] [c86] [c85] [c83] [i16] [i15] [i14] [j55] [j54] [j51] [c82] [c80] [c79] [i12] [i11] [j49] [c78] [c77] [c76] [c75] [i9] [i8] [i7] [i6] [i5] [j47] [j46] [c73] [c70] [c69] [c68] [i4] [j43] [j42] [j39] [j38] [c67] [c65] [c64] [c63] [j37] [c59] [c58] [c57] [r2] [j34] [j32] [j31] [c56] [c54] [c53] [j29] [j27] [j26] [j25] [c52] [c49] [c48] [j24] [j23] [j22] [j21] [c47] [c46] [c45] [c44] [c43] [j20] [j19] [j18] [c41] [c40] [c37] [j16] [j15] [j14] [c36] [c35] [c34] [i1] [j13] [c33] [c31] [c30] [j12] [j10] [c28] [c27] [j9] [j8] [j7] [c25] [c24] [c23] [c21] [c20] [c18] [c17] [c16] [c13] [j2] [c6] [c3]
[j87] [j86] [j84] [c108] [i38] [j81] [c107] [c105] [i36] [i34] [i33] [j77] [j76] [j75] [j73] [j72] [c97] [c96] [i27] [j70] [j69] [c95] [c94] [c92] [c89] [i24] [i23] [j68] [j67] [j66] [j61] [c87] [i20] [i19] [i17] [j60] [j59] [j58] [j57] [j56] [c86] [c83] [i16] [i14] [j55] [j54] [j53] [j52] [j51] [c82] [c79] [i12] [i11] [j49] [c78] [c77] [c76] [c75] [i9] [i8] [i7] [i6] [i5] [j45] [j44] [c73] [c72] [c71] [c70] [c68] [i4] [j41] [j39] [j38] [c66] [c63] [c62] [i3] [j37] [c60] [c59] [c58] [c57] [i2] [c56] [c55] [c53] [c52]
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:31 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:
