WhatsOnWeb: Using Graph Drawing to Search the Web. - Emilio Di Giacomo; Walter Didimo; Luca Grilli 001; Giuseppe Liotta (GD, 2005)

A Topology-Driven Approach to the Design of Web Meta-search Clustering Engines. - Emilio Di Giacomo; Walter Didimo; Luca Grilli 001; Giuseppe Liotta (SOFSEM, 2005)

On the Topologies of Local Minimum Spanning Trees. - Pier Francesco Cortese; Giuseppe Di Battista; Fabrizio Frati; Luca Grilli 001; Katharina Anna Lehmann; Giuseppe Liotta; Maurizio Patrignani; Ioannis G. Tollis; Francesco Trotta (CAAN, 2006)

Drawing Bipartite Graphs on Two Curves. - Emilio Di Giacomo; Luca Grilli 001; Giuseppe Liotta (GD, 2006)

Graph Visualization Techniques for Web Clustering Engines. - Emilio Di Giacomo; Walter Didimo; Luca Grilli 001; Giuseppe Liotta (IEEE Trans. Vis. Comput. Graph., 2007)

WhatsOnWeb+ : An Enhanced Visual Search Clustering Engine. - Emilio Di Giacomo; Walter Didimo; Luca Grilli 001; Giuseppe Liotta; Pietro Palladino (PacificVis, 2008)

Locally Delaunay Realizability of Regular Series-Parallel Graphs. - Luca Grilli 001; Seok-Hee Hong 001; Antonios Symvonis; Camille Wormser (ICCSA Workshops, 2008)

Drawing Bipartite Graphs on Two Parallel Convex Curves. - Emilio Di Giacomo; Luca Grilli 001; Giuseppe Liotta (J. Graph Algorithms Appl., 2008)

Matched drawability of graph pairs and of graph triples. - Luca Grilli 001; Seok-Hee Hong 001; Giuseppe Liotta; Henk Meijer; Stephen K. Wismath (Comput. Geom., 2010)

An Algorithm to Construct Greedy Drawings of Triangulations. - Patrizio Angelini; Fabrizio Frati; Luca Grilli 001 (J. Graph Algorithms Appl., 2010)

Hamiltonian orthogeodesic alternating paths. - Emilio Di Giacomo; Luca Grilli 001; Marcus Krug; Giuseppe Liotta; Ignaz Rutter (J. Discrete Algorithms, 2012)

Drawing Non-Planar Graphs with Crossing-Free Subgraphs. - Patrizio Angelini; Carla Binucci; Giordano Da Lozzo; Walter Didimo; Luca Grilli 001; Fabrizio Montecchiani; Maurizio Patrignani; Ioannis G. Tollis (GD, 2013)

Orthogeodesic point-set embedding of trees. - Emilio Di Giacomo; Fabrizio Frati; Radoslav Fulek; Luca Grilli 001; Marcus Krug (Comput. Geom., 2013)

Drawings of Non-planar Graphs with Crossing-free Subgraphs. - Patrizio Angelini; Carla Binucci; Giordano Da Lozzo; Walter Didimo; Luca Grilli 001; Fabrizio Montecchiani; Maurizio Patrignani; Ioannis G. Tollis (CoRR, 2013)

Heuristics for the Maximum 2-Layer RAC Subgraph Problem. - Emilio Di Giacomo; Walter Didimo; Luca Grilli 001; Giuseppe Liotta; Salvatore Agostino Romeo (Comput. J., 2015)

Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs. - Patrizio Angelini; Carla Binucci; Giordano Da Lozzo; Walter Didimo; Luca Grilli 001; Fabrizio Montecchiani; Maurizio Patrignani; Ioannis G. Tollis (Comput. Geom., 2015)

On the $ mathcal{NP}$-hardness of GRacSim Drawing and k-SEFE Problems. - Luca Grilli 001 (CoRR, 2016)

On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs. - Michael A. Bekos; Sabine Cornelsen; Luca Grilli 001; Seok-Hee Hong 001; Michael Kaufmann 001 (Algorithmica, 2017)

Visibility representations of boxes in 2.5 dimensions. - Alessio Arleo; Carla Binucci; Emilio Di Giacomo; William S. Evans; Luca Grilli 001; Giuseppe Liotta; Henk Meijer; Fabrizio Montecchiani; Sue Whitesides; Stephen K. Wismath (Comput. Geom., 2018)

On the NP-hardness of GRacSim drawing and k-SEFE Problems. - Luca Grilli 001 (J. Graph Algorithms Appl., 2018)

Gap-planar graphs. - Sang Won Bae 001; Jean-François Baffier; Jinhee Chun; Peter Eades; Kord Eickmeyer; Luca Grilli 001; Seok-Hee Hong 001; Matias Korman; Fabrizio Montecchiani; Ignaz Rutter; Csaba D. Tóth (Theor. Comput. Sci., 2018)

Visual querying and analysis of temporal fiscal networks. - Walter Didimo; Luca Grilli 001; Giuseppe Liotta; Fabrizio Montecchiani; Daniele Pagliuca (Inf. Sci., 2019)

Greedy rectilinear drawings. - Patrizio Angelini; Michael A. Bekos; Walter Didimo; Luca Grilli 001; Philipp Kindermann; Tamara Mchedlidze; Roman Prutkin; Antonios Symvonis; Alessandra Tappini (Theor. Comput. Sci., 2019)

Fan-Planar Graphs. - Michael A. Bekos; Luca Grilli 001 (Beyond Planar Graphs, 2020)

Visual Analytics for Financial Crime Detection at the University of Perugia. - Emilio Di Giacomo; Walter Didimo; Luca Grilli 001; Giuseppe Liotta; Fabrizio Montecchiani (AVI-BDA/ITAVIS@AVI, 2020)

Combining Network Visualization and Data Mining for Tax Risk Assessment. - Walter Didimo; Luca Grilli 001; Giuseppe Liotta; Lorenzo Menconi; Fabrizio Montecchiani; Daniele Pagliuca (IEEE Access, 2020)

Can a technology turn (also) into a symbol? The 3D printers case. - Claudio Fassio; Luca Grilli 001 (Int. J. Technol. Manag., 2020)

Invisible Supply Chain Attacks Based on Trojan Source. - Emanuele Buchicchio; Luca Grilli 001; Eros Capobianco; Salvatore Cipriano; Diego Antonini (Computer, 2022)

The Parametrized Complexity of the Segment Number. - Sabine Cornelsen; Giordano Da Lozzo; Luca Grilli 001; Siddharth Gupta 002; Jan Kratochvíl; Alexander Wolff 001 (GD (2), 2023)

Small Point-Sets Supporting Graph Stories. - Giuseppe Di Battista; Walter Didimo; Luca Grilli 001; Fabrizio Grosso; Giacomo Ortali; Maurizio Patrignani; Alessandra Tappini (J. Graph Algorithms Appl., 2023)

Drawing Simultaneously Embedded Graphs with Few Bends. - Luca Grilli 001; Seok-Hee Hong 001; Jan Kratochvíl; Ignaz Rutter (Int. J. Found. Comput. Sci., 2023)

Combining Git and Blockchain for Trusted Information Sharing. - Luca Grilli 001; Paolo Speziali (IEEE Access, 2024)

On Planar Straight-Line Dominance Drawings. - Patrizio Angelini; Michael A. Bekos; Giuseppe Di Battista; Fabrizio Frati; Luca Grilli 001; Giacomo Ortali (WADS, 2025)