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="Gambosi, Giorgio"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Distributed community detection in dynamic graphs
Andrea Clementi
,
Miriam Di Ianni
,
Giorgio Gambosi
,
Emanuele Natale
,
Riccardo Silvestri
Theoretical Computer Science
584
, 2015, pp. 19-41
Online load balancing made simple: Greedy strikes back
Pilu Crescenzi
,
Giorgio Gambosi
,
Gaia Nicosia
,
Paolo Penna
,
Walter Unger
Lecture Notes in Computer Science
2719
, 2003, pp. 1108-1122
On the design of efficient ATM routing schemes
Luca Becchetti
,
Paola Bertolazzi
,
Carlo Gaibisso
,
Giorgio Gambosi
Theoretical Computer Science
270
(1-2), 2002, pp. 341-359
On Salesmen, Repairmen, Spiders, and other Traveling agents
Giorgio Ausiello
,
Stefano Leonardi
,
Alberto Marchetti-Spaccamela
Lecture Notes in Computer Science
1767
, 2000, pp. 1-16
Reconstruction of discrete sets from three or more X-rays
Elena Barcucci
,
Sara Brunetti
,
Alberto Del Lungo
,
Maurice Nivat
Lecture Notes in Computer Science
1767
, 2000, pp. 199-210
An efficient algorithm for the approximate median selection problem
Sebastiano Battiato
,
Domenico Cantone
,
Dario Catalano
,
Gianluca Cincotti
,
Micha Hofri
Lecture Notes in Computer Science
1767
, 2000, pp. 226-238
The online-TSP against fair adversaries
Michiel Blom
,
Sven O. Krumke
,
Willem de Paepe
,
Leen Stougie
Lecture Notes in Computer Science
1767
, 2000, pp. 137-149
Towards the notion of stability of approximation for hard optimization tasks and the Traveling Salesman Problem
Hans-Joachim Böckenhauer
,
Juraj Hromkovic̑
,
Ralf Klasing
,
Sebastian Seibert
,
Walter Unger
Lecture Notes in Computer Science
1767
, 2000, pp. 72-86
On the Lovász number of certain circulant graphs
Valentin E. Brimkov
,
Bruno Codenotti
,
Valentino Crespi
,
Mauro Leoncini
Lecture Notes in Computer Science
1767
, 2000, pp. 291-305
QuickHeapsort, an efficient mix of classical sorting algorithms
Domenico Cantone
,
Gianluca Cincotti
Lecture Notes in Computer Science
1767
, 2000, pp. 150-162
Extending the implicit computational complexity approach to the sub-elementary time-space classes
Emanuele Covino
,
Giovanni Pani
,
Salvatore Caporaso
Lecture Notes in Computer Science
1767
, 2000, pp. 239-252
Online strategies for backups
Peter Damaschke
Lecture Notes in Computer Science
1767
, 2000, pp. 63-71
Computing a diameter-constrained minimum spanning tree in parallel
Narsingh Deo
,
Ayman Abdalla
Lecture Notes in Computer Science
1767
, 2000, pp. 17-31
Approximating SVP
\infty
to within almost-polynomial factors is
NP
-hard
Irit Dinur
Lecture Notes in Computer Science
1767
, 2000, pp. 263-276
On-line scheduling with setup costs
Giorgio Gambosi
,
Gaia Nicosia
Information Processing Letters
73
(1-2), 2000, pp. 61-68
Algorithms for the relaxed online bin-packing model
Giorgio Gambosi
,
Alberto Postiglione
,
Maurizio Talamo
SIAM Journal on Computing
30
(5), 2000, pp. 1532-1551
Faster exact solutions for MAX2SAT
Jens Gramm
,
Rolf Niedermeier
Lecture Notes in Computer Science
1767
, 2000, pp. 174-186
Group updates for red-black trees
Sabine Hanke
,
Eljas Soisalon-Soininen
Lecture Notes in Computer Science
1767
, 2000, pp. 253-262
The online dial-a-ride problem under reasonable load
Dietrich Hauptmeier
,
Sven O. Krumke
,
Jörg Rambau
Lecture Notes in Computer Science
1767
, 2000, pp. 125-136
Modified binary searching for static tables
Donatella Merlini
,
Renzo Sprugnoli
,
M. Cecilia Verri
Lecture Notes in Computer Science
1767
, 2000, pp. 211-225
Dynamically maintaining the widest
k
-dense corridor
Subhas C. Nandy
,
Tomohiro Harayama
,
Tetsuo Asano
Lecture Notes in Computer Science
1767
, 2000, pp. 187-198
Labeling downtown
Gabriele Neyer
,
Frank Wagner
Lecture Notes in Computer Science
1767
, 2000, pp. 113-124
Semantical counting circuits
Fabrice Noilhan
,
Miklos Santha
Lecture Notes in Computer Science
1767
, 2000, pp. 87-101
Algorithms for a simple point placement problem
Joshua Redstone
,
Walter L. Ruzzo
Lecture Notes in Computer Science
1767
, 2000, pp. 32-43
The hardness of placing street names in a Manhattan type map
Sebastian Seibert
,
Walter Unger
Lecture Notes in Computer Science
1767
, 2000, pp. 102-112
Seiten 1
2
>