| Large scale properties of the webgraph D Donato, L Laura, S Leonardi, S Millozzi The European Physical Journal B 38, 239-243, 2004 | 132 | 2004 |
| Finding strong bridges and strong articulation points in linear time GF Italiano, L Laura, F Santaroni Theoretical Computer Science 447, 74-84, 2012 | 114 | 2012 |
| Algorithms for the on-line quota traveling salesman problem G Ausiello, M Demange, L Laura, V Paschos Computing and Combinatorics: 10th Annual International Conference, COCOON …, 2004 | 77 | 2004 |
| Directed hypergraphs: Introduction and fundamental algorithms—a survey G Ausiello, L Laura Theoretical Computer Science 658, 293-306, 2017 | 63 | 2017 |
| The online prize-collecting traveling salesman problem G Ausiello, V Bonifaci, L Laura Information Processing Letters 107 (6), 199-204, 2008 | 61 | 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 | 61 | 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 | 52 | 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 | 51 | 2002 |
| Multi-layer model for the web graph L Laura, S Leonardi, G Caldarelli, P De Los Rios | 48 | 2002 |
| 2-vertex connectivity in directed graphs L Georgiadis, GF Italiano, L Laura, N Parotsidis Information and Computation 261, 248-264, 2018 | 45 | 2018 |
| 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 | 40 | 2003 |
| 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 | 35 | 2014 |
| On the power of lookahead in on-line vehicle routing problems L Allulli, G Ausiello, L Laura Computing and Combinatorics: 11th Annual International Conference, COCOON …, 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 | 29 | 2012 |
| The on-line asymmetric traveling salesman problem G Ausiello, V Bonifaci, L Laura Journal of Discrete Algorithms 6 (2), 290-298, 2008 | 27 | 2008 |
| Searching the Web for illegal content: the anatomy of a semantic search engine L Laura, G Me Soft computing 21 (5), 1245-1252, 2017 | 23 | 2017 |
| 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 | 23 | 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 | 21 | 2013 |
| Simulating the webgraph: A comparative analysis of models D Donato, L Laura, S Leonardi, S Millozzi Computing in science & engineering 6 (6), 84-89, 2004 | 21 | 2004 |
| 2-connectivity in directed graphs: An experimental study W Di Luigi, L Georgiadis, GF Italiano, L Laura, N Parotsidis 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and …, 2014 | 20 | 2014 |
