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: Journal=Discrete Appl.~Math. AND Volume=94
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On perfect switching classes
Alain Hertz
Discrete Applied Mathematics
94
(1-3), 1999, pp. 3-7
On minimal imperfect graphs without induced
P_5
Vincent Barré
,
Jean-Luc Fouquet
Discrete Applied Mathematics
94
(1-3), 1999, pp. 9-33
Scheduling a divisible task in a two-dimensional toroidal mesh
Jacek Bƚażewicz
,
Maciej Drozdowski
,
Frédéric Guinand
,
Denis Trystram
Discrete Applied Mathematics
94
(1-3), 1999, pp. 35-50
An exact method for minimizing the makespan of an application processed on a master slave bus oriented multiprocessor system
J.P. Boufflet
,
J. Carlier
Discrete Applied Mathematics
94
(1-3), 1999, pp. 51-76
A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
Peter Brucker
,
Thomas Hilbig
,
Johann Hurink
Discrete Applied Mathematics
94
(1-3), 1999, pp. 77-99
Domination number of the cross product of paths
Rachid Chérifi
,
Sylvain Gravier
,
Xavier Lagraula
,
Charles Payan
,
Ismaïl Zighem
Discrete Applied Mathematics
94
(1-3), 1999, pp. 101-139
List schedules for cyclic scheduling
Philippe Chrétienne
Discrete Applied Mathematics
94
(1-3), 1999, pp. 141-159
On the odd cycles of normal graphs
Caterina de Simone
,
János Körner
Discrete Applied Mathematics
94
(1-3), 1999, pp. 161-169
On a multiconstrained model for chromatic scheduling
D. de Werra
Discrete Applied Mathematics
94
(1-3), 1999, pp. 171-180
Approximation algorithms for partitioning small items in unequal bins to minimize the total size
P. Dell'Olmo
,
M. Grazia Speranza
Discrete Applied Mathematics
94
(1-3), 1999, pp. 181-191
On the deficiency of bipartite graphs
Krzysztof Giaro
,
Marek Kubale
,
Michaƚ Maƚafiejski
Discrete Applied Mathematics
94
(1-3), 1999, pp. 193-203
On lower bounds for numbered complete graphs
Pierre Hansen
,
Brigitte Jaumard
,
Christoph Meyer
Discrete Applied Mathematics
94
(1-3), 1999, pp. 205-225
The Hall number, the Hall index, and the total Hall number of a graph
A.J.W. Hilton
,
P.D., Jr. Johnson
Discrete Applied Mathematics
94
(1-3), 1999, pp. 227-245
On the disc-structure of perfect graphs I - The co-paw-structure
Chính T. Hoàng
Discrete Applied Mathematics
94
(1-3), 1999, pp. 247-262
Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
Joanna Józefowska
,
Marek Mika
,
Rafaƚ Różycki
,
Grzegorz Waligóra
,
Jan Wȩglarz
Discrete Applied Mathematics
94
(1-3), 1999, pp. 263-285
Sequential colorings and perfect graphs
Frédéric Maffray
,
Myriam Preissmann
Discrete Applied Mathematics
94
(1-3), 1999, pp. 287-296
A technique to find multiple motif occurrences in a biomolecular sequence
Nicolas Moeri
Discrete Applied Mathematics
94
(1-3), 1999, pp. 297-319
Recognizing clique graphs of directed and rooted path graphs
Erich Prisner
,
Jayme L. Szwarcfiter
Discrete Applied Mathematics
94
(1-3), 1999, pp. 321-328
P_4
-domination in minimal imperfect graphs
Irena Rusu
Discrete Applied Mathematics
94
(1-3), 1999, pp. 329-336