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="Milis, I."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The MAX QUASI-INDEPENDENT SET problem
N. Bourgeois
,
A. Giannakos
,
G. Lucarelli
,
I. Milis
,
V.Th. Paschos
,
O. PottiƩ
Lecture Notes in Computer Science
6072
, 2010, pp. 60-71
Approximating the max-edge-coloring problem
N. Bourgeois
,
G. Lucarelli
,
I. Milis
,
V.Th. Paschos
Theoretical Computer Science
411
(34-36), 2010, pp. 3055-3067
Scheduling on a constant number of machines
F. Afrati
,
E. Bampis
,
C. Kenyon
,
I. Milis
Lecture Notes in Computer Science
1671
, 1999, pp. 281-287
A parallel algorithm for finding a perfect matching in a planar graph
E. Bampis
,
A. Giannakos
,
A. Karzanov
,
Y. Manoussakis
,
I. Milis
Parallel Processing Letters
8
(3), 1998, pp. 399-405
On the parallel complexity of the alternating Hamiltonian cycle problem
E. Bampis
,
Y. Manoussakis
,
I. Milis
Lecture Notes in Computer Science
1120
, 1996, pp. 367-377
NC algorithms for antidirected Hamiltonian paths and cycles in tournaments
E. Bampis
,
Y. Manoussakis
,
I. Milis
Lecture Notes in Computer Science
903
, 1995, pp. 387-394