Luigi Laura
Título
Citado por
Citado por
Año
Large scale properties of the webgraph
D Donato, L Laura, S Leonardi, S Millozzi
The European Physical Journal B 38 (2), 239-243, 2004
1202004
Finding strong bridges and strong articulation points in linear time
GF Italiano, L Laura, F Santaroni
Theoretical Computer Science 447, 74-84, 2012
882012
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
622004
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
572007
The online prize-collecting traveling salesman problem
G Ausiello, V Bonifaci, L Laura
Information Processing Letters 107 (6), 199-204, 2008
532008
2-edge connectivity in directed graphs
L Georgiadis, GF Italiano, L Laura, N Parotsidis
ACM Transactions on Algorithms (TALG) 13 (1), 1-24, 2016
432016
Multi-layer model for the web graph
L Laura, S Leonardi, G Caldarelli, P De Los Rios
412002
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
392002
Algorithms and experiments for the webgraph
L Laura, S Leonardi, S Millozzi, U Meyer, JF Sibeyn
European Symposium on Algorithms, 703-714, 2003
372003
2-vertex connectivity in directed graphs
L Georgiadis, GF Italiano, L Laura, N Parotsidis
Information and Computation 261, 248-264, 2018
332018
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
272005
The on-line asymmetric traveling salesman problem
G Ausiello, V Bonifaci, L Laura
Journal of Discrete Algorithms 6 (2), 290-298, 2008
252008
Multiproduct slot allocation heuristic to minimize storage space
C Battista, A Fumi, L Laura, MM Schiraldi
International Journal of Retail & Distribution Management, 2014
242014
Computing strong articulation points and strong bridges in large scale graphs
D Firmani, GF Italiano, L Laura, A Orlandi, F Santaroni
International Symposium on Experimental Algorithms, 195-207, 2012
232012
Is timetabling routing always reliable for public transportl
D Firmani, GF Italiano, L Laura, F Santaroni
202013
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
202008
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
202004
Linguaggi, modelli, complessità
LL Giorgio Ausiello , Fabrizio D'Amore , Giorgio Gambosi
Franco Angeli, 2014
19*2014
Searching the Web for illegal content: the anatomy of a semantic search engine
L Laura, G Me
Soft computing 21 (5), 1245-1252, 2017
182017
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
182014
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20