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="de Werra, D."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On a graph coloring problem arising from discrete tomography
C. Bentz
,
M.C. Costa
,
D. de Werra
,
C. Picouleau
,
B. Ries
Networks
51
(4), 2008, pp. 256-267
Addendum to ``Bicolored matchings in some classes of graphs''
M.C. Costa
,
D. de Werra
,
C. Picouleau
,
B. Ries
Graphs and Combinatorics
24
(2), 2008, pp. 127-128
Bicolored matchings in some classes of graphs
M.C. Costa
,
D. de Werra
,
C. Picouleau
,
B. Ries
Graphs and Combinatorics
23
(1), 2007, pp. 47-60
On some properties of suboptimal colorings of graphs
Ivo Blöchliger
,
D. de Werra
Networks
43
(2), 2004, pp. 103-108
Using stable sets to bound the chromatic number
D. de Werra
,
P. Hansen
Information Processing Letters
87
(3), 2003, pp. 127-131
On a graph-theoretical model for cyclic register allocation
D. de Werra
,
Ch. Eisenbeis
,
S. Lelait
,
B. Marmol
Discrete Applied Mathematics
93
(2-3), 1999, pp. 191-203
On a multiconstrained model for chromatic scheduling
D. de Werra
Discrete Applied Mathematics
94
(1-3), 1999, pp. 171-180
Preassignment requirements in chromatic scheduling
D. de Werra
,
N.V.R. Mahadev
Discrete Applied Mathematics
76
(1-3), 1997, pp. 93-101
Open shop scheduling with some additional constraints
D. de Werra
,
J. Erschler
Graphs and Combinatorics
12
, 1996, pp. 81-93
Restrictions and preassignments in preemptive open shop scheduling
D. de Werra
,
A.J. Hoffman
,
N.V.R. Mahadev
,
U.N. Peled
Discrete Applied Mathematics
68
(1-2), 1996, pp. 169-188
Chromatic scheduling and frequency assignment
D. de Werra
,
Y. Gay
Discrete Applied Mathematics
49
, 1994, pp. 165-174
On an optimization problem occurring in FMSs: A hypergraph-theoretical formulation
D. de Werra
Discrete Applied Mathematics
55
, 1994, pp. 107-111
Graph endpoint coloring and distributed processing
D. de Werra
,
P. Hell
,
T. Kameda
,
N. Katoh
,
Ph. Solot
,
M. Yamashita
Networks
23
(2), 1993, pp. 93-98
Edge-chromatic scheduling with simultaneity constraints
D. de Werra
,
N.V.R. Mahadev
,
U.N. Peled
SIAM Journal on Discrete Mathematics
6
(4), 1993, November, pp. 631-641
Some graph-theoretical models for scheduling in automated production systems
D. de Werra
,
Ph. Solot
Networks
23
(8), 1993, pp. 651-660
Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
D. de Werra
,
J. Bƚażewicz
Discrete Applied Mathematics
35
, 1992, pp. 205-219
On the use of augmenting chains in chain packings
D. de Werra
,
F.S. Roberts
Discrete Applied Mathematics
30
, 1991, pp. 137-149
Compact cylindrical chromatic scheduling
D. de Werra
,
Ph. Solot
SIAM Journal on Discrete Mathematics
4
(4), 1991, November, pp. 528-534
A constrained sports scheduling problem
D. de Werra
,
L. Jacot-Descombes
,
P. Masson
Discrete Applied Mathematics
26
, 1990, pp. 41-49
Heuristics for graph coloring
D. de Werra
Computing Supplementum
7
, 1990, pp. 191-208
Heuristics for graph coloring
D. de Werra
misc, 1989, January
Some models of graphs for scheduling sports competitions
D. de Werra
Discrete Applied Mathematics
21
, 1988, pp. 47-65
Node coverings with odd chains
D. de Werra
Journal of Graph Theory
10
(2), 1986, pp. 177-185
Preemptive scheduling, linear programming and network flows
D. de Werra
SIAM Journal on Algebraic Discrete Methods
5
(1), 1984, March, pp. 11-20
Obstructions for regular colorings
D. de Werra
Journal of Combinatorial Theory Series B
32
, 1982, pp. 326-335
Seiten 1
2
>