Остановите войну!
for scientists:
default search action
Walter Didimo
- > Home > Persons > Walter Didimo
Publications
- 2023
- [j81]Carla Binucci, Walter Didimo, Fabrizio Montecchiani:
1-planarity testing and embedding: An experimental study. Comput. Geom. 108: 101900 (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 - [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 - [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) - [i34]J. 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) - [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) - [c97]Luca Consalvi, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
In-browser Visualization of Large-scale Graphs. itaDATA 2022: 27-38 - 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) - 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, Ser. 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 - [c92]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini:
Storyline Visualizations with Ubiquitous Actors. GD 2020: 324-332 - [c89]Carla Binucci, Walter Didimo, Fabrizio Montecchiani:
An Experimental Study of a 1-Planarity Testing and Embedding Algorithm. WALCOM 2020: 329-335 - [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) - 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) - [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) - [c87]Lorenzo Angori, Walter Didimo, Fabrizio Montecchiani, Daniele Pagliuca, Alessandra Tappini:
ChordLink: A New Hybrid Visualization Model. GD 2019: 276-290 - [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) - [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 - [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) - [i14]Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
A Survey on Graph Drawing Beyond Planarity. CoRR abs/1804.07257 (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 - [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) - 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 - [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
- [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 - [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
- [j41]Walter Didimo, Fabrizio Montecchiani:
Fast layout computation of clustered networks: Algorithmic advances and experimental analysis. Inf. Sci. 260: 185-199 (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) - [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 - [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 - [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) - [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 - [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
- [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 - [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
- [c52]Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Pietro Palladino:
An advanced network visualization system for financial crime detection. PacificVis 2011: 203-210
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-03-07 04:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint