default search action
Luca Grilli 0001
Person information
- affiliation: University of Perugia, Italy
Other persons with the same name
- Luca Grilli 0002
— Politecnico di Milano, Department of Management, Economics and Industrial Engineering, Milan, Italy
- Luca Grilli 0003
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j20]Luca Grilli
Combining Git and Blockchain for Trusted Information Sharing. IEEE Access 12: 88383-88409 (2024) - 2023
- [j19]Luca Grilli
Drawing Simultaneously Embedded Graphs with Few Bends. Int. J. Found. Comput. Sci. 34(7): 807-824 (2023) - [j18]Giuseppe Di Battista, Walter Didimo, Luca Grilli
Small Point-Sets Supporting Graph Stories. J. Graph Algorithms Appl. 27(8): 651-677 (2023) - [c20]Sabine Cornelsen
The Parametrized Complexity of the Segment Number. GD (2) 2023: 97-113 - [i8]Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli, Siddharth Gupta, Jan Kratochvíl, Alexander Wolff:
The Parametrized Complexity of the Segment Number. CoRR abs/2308.15416 (2023) - 2022
- [j17]Emanuele Buchicchio
Invisible Supply Chain Attacks Based on Trojan Source. Computer 55(10): 18-25 (2022) - [c19]Giuseppe Di Battista
Small Point-Sets Supporting Graph Stories. GD 2022: 289-303 - [i7]Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso
Small Point-Sets Supporting Graph Stories. CoRR abs/2208.14126 (2022) - 2020
- [j16]Walter Didimo
Combining Network Visualization and Data Mining for Tax Risk Assessment. IEEE Access 8: 16073-16086 (2020) - [j15]Claudio Fassio, Luca Grilli:
Can a technology turn (also) into a symbol? The 3D printers case. Int. J. Technol. Manag. 82(3/4): 244-275 (2020) - [c18]Emilio Di Giacomo, Walter Didimo, Luca Grilli
Visual Analytics for Financial Crime Detection at the University of Perugia. AVI-BDA/ITAVIS@AVI 2020: 195-200 - [p1]Michael A. Bekos, Luca Grilli:
Fan-Planar Graphs. Beyond Planar Graphs 2020: 131-148
2010 – 2019
- 2019
- [j14]Walter Didimo
Visual querying and analysis of temporal fiscal networks. Inf. Sci. 505: 406-421 (2019) - [j13]Patrizio Angelini
Greedy rectilinear drawings. Theor. Comput. Sci. 795: 375-397 (2019) - 2018
- [j12]Alessio Arleo
Visibility representations of boxes in 2.5 dimensions. Comput. Geom. 72: 19-33 (2018) - [j11]Luca Grilli
On the NP-hardness of GRacSim drawing and k-SEFE Problems. J. Graph Algorithms Appl. 22(1): 101-116 (2018) - [j10]Sang Won Bae
Gap-planar graphs. Theor. Comput. Sci. 745: 36-52 (2018) - [c17]Patrizio Angelini
Greedy Rectilinear Drawings. GD 2018: 495-508 - [i6]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
- [j9]Michael A. Bekos
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs. Algorithmica 79(2): 401-427 (2017) - [c16]Sang Won Bae
Gap-Planar Graphs. GD 2017: 531-545 - [i5]Sang Won Bae, Jean-François Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth:
Gap-planar Graphs. CoRR abs/1708.07653 (2017) - 2016
- [c15]Alessio Arleo
Visibility Representations of Boxes in 2.5 Dimensions. GD 2016: 251-265 - [i4]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) - [i3]Luca Grilli:
On the $\mathcal{NP}$-hardness of GRacSim Drawing and k-SEFE Problems. CoRR abs/1611.04178 (2016) - 2015
- [j8]Emilio Di Giacomo, Walter Didimo, Luca Grilli
Heuristics for the Maximum 2-Layer RAC Subgraph Problem. Comput. J. 58(5): 1085-1098 (2015) - [j7]Patrizio Angelini
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs. Comput. Geom. 50: 34-48 (2015) - 2014
- [c14]Luca Grilli, Seok-Hee Hong, Jan Kratochvíl, Ignaz Rutter:
Drawing Simultaneously Embedded Graphs with Few Bends. GD 2014: 40-51 - [c13]Michael A. Bekos, Sabine Cornelsen, Luca Grilli, Seok-Hee Hong, Michael Kaufmann:
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs. GD 2014: 198-209 - [i2]Michael A. Bekos, Sabine Cornelsen, Luca Grilli, Seok-Hee Hong, Michael Kaufmann:
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs. CoRR abs/1409.0461 (2014) - 2013
- [j6]Emilio Di Giacomo
Orthogeodesic point-set embedding of trees. Comput. Geom. 46(8): 929-944 (2013) - [c12]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 - [i1]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
- [j5]Emilio Di Giacomo
Hamiltonian orthogeodesic alternating paths. J. Discrete Algorithms 16: 34-52 (2012) - [c11]Emilio Di Giacomo
Heuristics for the Maximum 2-layer RAC Subgraph Problem. WALCOM 2012: 211-216 - 2011
- [c10]Emilio Di Giacomo
Orthogeodesic Point-Set Embedding of Trees. GD 2011: 52-63 - [c9]Emilio Di Giacomo
Hamiltonian Orthogeodesic Alternating Paths. IWOCA 2011: 170-181 - 2010
- [j4]Luca Grilli
Matched drawability of graph pairs and of graph triples. Comput. Geom. 43(6-7): 611-634 (2010) - [j3]Patrizio Angelini, Fabrizio Frati
An Algorithm to Construct Greedy Drawings of Triangulations. J. Graph Algorithms Appl. 14(1): 19-51 (2010)
2000 – 2009
- 2009
- [c8]Luca Grilli
Matched Drawability of Graph Pairs and of Graph Triples. WALCOM 2009: 322-333 - 2008
- [j2]Emilio Di Giacomo, Luca Grilli, Giuseppe Liotta:
Drawing Bipartite Graphs on Two Parallel Convex Curves. J. Graph Algorithms Appl. 12(1): 97-112 (2008) - [c7]Emilio Di Giacomo
WhatsOnWeb+ : An Enhanced Visual Search Clustering Engine. PacificVis 2008: 167-174 - [c6]Patrizio Angelini, Fabrizio Frati
An Algorithm to Construct Greedy Drawings of Triangulations. GD 2008: 26-37 - [c5]Luca Grilli
Locally Delaunay Realizability of Regular Series-Parallel Graphs. ICCSA Workshops 2008: 461-467 - 2007
- [j1]Emilio Di Giacomo
Graph Visualization Techniques for Web Clustering Engines. IEEE Trans. Vis. Comput. Graph. 13(2): 294-304 (2007) - 2006
- [c4]Pier Francesco Cortese, Giuseppe Di Battista
On the Topologies of Local Minimum Spanning Trees. CAAN 2006: 31-44 - [c3]Emilio Di Giacomo
Drawing Bipartite Graphs on Two Curves. GD 2006: 380-385 - 2005
- [c2]Emilio Di Giacomo
WhatsOnWeb: Using Graph Drawing to Search the Web. GD 2005: 480-491 - [c1]Emilio Di Giacomo
A Topology-Driven Approach to the Design of Web Meta-search Clustering Engines. SOFSEM 2005: 106-116
Coauthor Index
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-11-07 20:28 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: