| Large scale properties of the webgraph D Donato, L Laura, S Leonardi, S Millozzi The European Physical Journal B 38, 239-243, 2004 | 138 | 2004 |
| Finding strong bridges and strong articulation points in linear time GF Italiano, L Laura, F Santaroni Theoretical Computer Science 447, 74-84, 2012 | 121 | 2012 |
| Directed hypergraphs: Introduction and fundamental algorithms—a survey G Ausiello, L Laura Theoretical Computer Science 658, 293-306, 2017 | 100 | 2017 |
| Algorithms for the on-line quota traveling salesman problem G Ausiello, M Demange, L Laura, V Paschos International Computing and Combinatorics Conference, 290-299, 2004 | 75 | 2004 |
| The online prize-collecting traveling salesman problem G Ausiello, V Bonifaci, L Laura Information Processing Letters 107 (6), 199-204, 2008 | 67 | 2008 |
| The web as a graph: How far we are D Donato, L Laura, S Leonardi, S Millozzi ACM Transactions on Internet Technology (TOIT) 7 (1), 4-es, 2007 | 67 | 2007 |
| 2-edge connectivity in directed graphs L Georgiadis, GF Italiano, L Laura, N Parotsidis ACM Transactions on Algorithms (TALG) 13 (1), 1-24, 2016 | 55 | 2016 |
| Non-abusiveness Helps: An O (1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem. SO Krumke, L Laura, M Lipmann, A Marchetti-Spaccamela, W de Paepe, ... APPROX, 200-214, 2002 | 55 | 2002 |
| Multi-layer model for the web graph L Laura, S Leonardi, G Caldarelli, P De Los Rios | 47 | 2002 |
| 2-vertex connectivity in directed graphs L Georgiadis, GF Italiano, L Laura, N Parotsidis Information and Computation 261, 248-264, 2018 | 46 | 2018 |
| Multiproduct slot allocation heuristic to minimize storage space C Battista, A Fumi, L Laura, M M. Schiraldi International Journal of Retail & Distribution Management 42 (3), 172-186, 2014 | 40 | 2014 |
| Algorithms and experiments for the webgraph L Laura, S Leonardi, S Millozzi, U Meyer, JF Sibeyn Algorithms-ESA 2003: 11th Annual European Symposium, Budapest, Hungary …, 2003 | 39 | 2003 |
| The on-line asymmetric traveling salesman problem G Ausiello, V Bonifaci, L Laura Journal of Discrete Algorithms 6 (2), 290-298, 2008 | 30 | 2008 |
| On the power of lookahead in on-line vehicle routing problems L Allulli, G Ausiello, L Laura International Computing and Combinatorics Conference, 728-736, 2005 | 30 | 2005 |
| Computing strong articulation points and strong bridges in large scale graphs D Firmani, GF Italiano, L Laura, A Orlandi, F Santaroni Experimental Algorithms: 11th International Symposium, SEA 2012, Bordeaux …, 2012 | 28 | 2012 |
| The (betweenness) centrality of critical nodes and network cores G Ausiello, D Firmani, L Laura 2013 9th International Wireless Communications and Mobile Computing …, 2013 | 26 | 2013 |
| Cognitive analytics management of the customer lifetime value: an artificial neural network approach M De Marco, P Fantozzi, C Fornaro, L Laura, A Miloso Journal of Enterprise Information Management 34 (2), 679-696, 2021 | 25 | 2021 |
| A framework for personalized competitive programming training T Di Mascio, L Laura, M Temperini 2018 17th International Conference on Information Technology Based Higher …, 2018 | 25 | 2018 |
| On the power of lookahead in on-line server routing problems L Allulli, G Ausiello, V Bonifaci, L Laura Theoretical Computer Science 408 (2-3), 116-128, 2008 | 24 | 2008 |
| Is timetabling routing always reliable for public transportl D Firmani, GF Italiano, L Laura, F Santaroni ATMOS-13th Workshop on Algorithmic Approaches for Transportation Modelling …, 2013 | 23 | 2013 |
Giuseppe F. ItalianoProfessor of Computer Science, LUISS University, Rome, ItalyEmail verificata su luiss.it
