Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Laura, Luigi"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Finding strong bridges and strong articulation points in linear time
Giuseppe F. Italiano
,
Luigi Laura
,
Federico Santaroni
Theoretical Computer Science
447
, 2012, pp. 74-84
Linear time analysis of properties of conflict-free and general Petri nets
Paola Alimonti
,
Esteban Feuerstein
,
Luigi Laura
,
Umberto Nanni
Theoretical Computer Science
412
(4-5), 2011, pp. 320-338
On the power of lookahead in on-line server routing problems
Luca Allulli
,
Giorgio Ausiello
,
Vincenzo Bonifaci
,
Luigi Laura
Theoretical Computer Science
408
(2-3), 2008, pp. 116-128
The online Prize-Collecting Traveling Salesman Problem
Giorgio Ausiello
,
Vincenzo Bonifaci
,
Luigi Laura
Information Processing Letters
107
(6), 2008, pp. 199-204
The complexity of uniform Nash equilibria and related regular subgraph problems
Vincenzo Bonifaci
,
Ugo Di Iorio
,
Luigi Laura
Theoretical Computer Science
401
(1-3), 2008, pp. 144-152
On the power of lookahead in on-line vehicle routing problems
Luca Allulli
,
Giorgio Ausiello
,
Luigi Laura
Lecture Notes in Computer Science
3595
, 2005, pp. 728-736
The on-line asymmetric Traveling Salesman Problem
Giorgio Ausiello
,
Vincenzo Bonifaci
,
Luigi Laura
Lecture Notes in Computer Science
3608
, 2005, pp. 306-317
Algorithms for the on-line quota Traveling Salesman Problem
Giorgio Ausiello
,
Marc Demange
,
Luigi Laura
,
Vangelis Paschos
Lecture Notes in Computer Science
3106
, 2004, pp. 290-299
Analysis and experimental evaluation of a simple algorithm for collaborative filtering in planted partition models
Devdatt Dubhashi
,
Luigi Laura
,
Alessandro Panconesi
Lecture Notes in Computer Science
2914
, 2003, pp. 168-182
Algorithms and experiments for the webgraph
Luigi Laura
,
Stefano Leonardi
,
Stefano Millozzi
,
Ulrich Meyer
,
Jop F. Sibeyn
Lecture Notes in Computer Science
2832
, 2003, pp. 703-714