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
[1]
Hilfe
Suche: Author="Dell'Olmo, Paolo"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bounding vertex coloring by truncated multistage branch and bound
Massimiliano Caramia
,
Paolo Dell'Olmo
Networks
44
(4), 2004, pp. 231-242
Solving the minimum-weighted coloring problem
Massimiliano Caramia
,
Paolo Dell'Olmo
Networks
38
(2), 2001, pp. 88-101
An aproximation result for a periodic allocation problem
Giuseppe Confessore
,
Paolo Dell'Olmo
,
Stefano Giordani
Discrete Applied Mathematics
112
(1-3), 2001, pp. 53-72
A fast and simple local search for graph coloring
Massimiliano Caramia
,
Paolo Dell'Olmo
Lecture Notes in Computer Science
1668
, 1999, pp. 316-329
Vertex partitioning of crown-free interval graphs
Giuseppe Confessore
,
Paolo Dell'Olmo
,
Stefano Giordani
Lecture Notes in Computer Science
1665
, 1999, pp. 391-401
A 13/12 approximation algorithm for bin packing with extendable bins
Paolo Dell'Olmo
,
Hans Kellerer
,
Maria Grazia Speranza
,
Zsolt Tuza
Information Processing Letters
65
(5), 1998, pp. 229-233
Scheduling chains to minimize mean flow time
Moshe Dror
,
Wieslaw Kubiak
,
Paolo Dell'Olmo
Information Processing Letters
61
(6), 1997, pp. 297-301