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="Steiner, George"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximation algorithms for minimizing the total weighted tardiness on a single machine
Stavros G. Kolliopoulos
,
George Steiner
Theoretical Computer Science
355
(3), 2006, pp. 261-273
On minimizing the total weighted tardiness on a single machine
Stavros G. Kolliopoulos
,
George Steiner
Lecture Notes in Computer Science
2996
, 2004, pp. 176-186
On the
k
-path partition of graphs
George Steiner
Theoretical Computer Science
290
(3), 2003, pp. 2147-2155
Partially-ordered knapsack and applications to scheduling
Stavros G. Kolliopoulos
,
George Steiner
Lecture Notes in Computer Science
2461
, 2002, pp. 612-624
Efficient algorithms on distributive lattices
Michel Habib
,
Raoul Medina
,
Lhouari Nourine
,
George Steiner
Discrete Applied Mathematics
110
(2-3), 2001, pp. 169-187
Subset-restricted interchange for dynamic min-max scheduling problems
George Steiner
,
Paul Stephenson
SIAM Journal on Discrete Mathematics
13
(4), 2000, pp. 419-435
An approximation algorithm for clustering graphs with dominating diametral path
Jitender S. Deogun
,
Dieter Kratsch
,
George Steiner
Information Processing Letters
61
(3), 1997, pp. 121-127
Gray codes for the ideals of interval orders
Michel Habib
,
Lhouari Nourine
,
George Steiner
Journal of Algorithms
25
(1), 1997, pp. 52-66
Minimizing the number of tardy jobs with precedence constraints and agreeable due dates
George Steiner
Discrete Applied Mathematics
72
(1-2), 1997, pp. 167-177
The recognition of indifference digraphs and generalized semiorders
George Steiner
Journal of Graph Theory
21
(2), 1996, pp. 235-241
Polynomial algorithms for Hamiltonian cycle in cocomparability graphs
Jitender S. Deogun
,
George Steiner
SIAM Journal on Computing
23
(3), 1994, June, pp. 520-552
A note on ``Scheduling unit-time tasks with integer release times and deadlines''
George Steiner
,
Scott Yeomans
Information Processing Letters
47
(3), 1993, pp. 165-166
Hamiltonian cycle is polynomial on cocomparability graphs
Jitender S. Deogun
,
George Steiner
Discrete Applied Mathematics
39
, 1992, pp. 165-172
A compact labeling scheme for series-parallel graphs
George Steiner
Discrete Applied Mathematics
11
, 1985, pp. 281-297