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 YEAR=2002
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Almost resolvable perfect Mendelsohn designs with block size five
R.J.R. Abel
,
F.E. Bennett
,
G. Ge
Discrete Applied Mathematics
116
(1-2), 2002, pp. 1-15
Measures on monotone properties of graphs
Jòzsef Balogh
,
Béla Bollobás
,
David Weinreich
Discrete Applied Mathematics
116
(1-2), 2002, pp. 17-36
Uniform emulations of Cartesian-product and Cayley graphs
D. Barth
,
P. Fragopoulou
,
M.-C. Heydemann
Discrete Applied Mathematics
116
(1-2), 2002, pp. 37-54
A constructive enumeration of nanotube caps
G. Brinkmann
,
U.V. Nathusius
,
A.H.R. Palser
Discrete Applied Mathematics
116
(1-2), 2002, pp. 55-71
Optimal embeddings of odd ladders into a hypercube
R. Caha
,
V. Koubek
Discrete Applied Mathematics
116
(1-2), 2002, pp. 73-102
Domination in distance-hereditary graphs
Maw-Shang Chang
,
Shaur-Ching Wu
,
Gerard J. Chang
,
Hong-Gwa Yeh
Discrete Applied Mathematics
116
(1-2), 2002, pp. 103-113
Convexity in oriented graphs
Gary Chartrand
,
John Frederick Fink
,
Ping Zhang
Discrete Applied Mathematics
116
(1-2), 2002, pp. 115-126
Minimal elimination ordering for graphs of bounded degree
Elias Dahlhaus
Discrete Applied Mathematics
116
(1-2), 2002, pp. 127-143
Augmenting trees so that every three vertices lie on a cycle
Peter Dankelmann
,
Wayne Goddard
,
Ortrud R. Oellermann
,
Henda C. Swart
Discrete Applied Mathematics
116
(1-2), 2002, pp. 145-159
Rearrangement of DNA fragments: A branch-and-cut algorithms
C.E. Ferreira
,
C.C. de Souza
,
Y. Wakabayashi
Discrete Applied Mathematics
116
(1-2), 2002, pp. 161-177
Partitioning problems in dense hypergraphs
A. Czygrinow
Discrete Applied Mathematics
116
(3), 2002, pp. 179-191
The vehicle routing problem with pickups and deliveries on some special graphs
Tali Eilam Tzoreff
,
Daniel Granot
,
Frieda Granot
,
Greys Sos̑ić
Discrete Applied Mathematics
116
(3), 2002, pp. 193-229
Group testing and fault detection for replicated files
F.K. Hwang
,
Wenan Zang
Discrete Applied Mathematics
116
(3), 2002, pp. 231-242
Partitioning a matrix with non-guillotine cuts to minimize the maximum cost
Aristide Mingozzi
,
Serena Morigi
Discrete Applied Mathematics
116
(3), 2002, pp. 243-260
Recognizing pseudo-median graphs
Aleksander Vesel
Discrete Applied Mathematics
116
(3), 2002, pp. 261-269
A note on orientations of mixed graphs
Esther M. Arkin
,
Refael Hassin
Discrete Applied Mathematics
116
(3), 2002, pp. 271-278
On the complexity of exchange-stable roommates
Katarína Cechlárová
Discrete Applied Mathematics
116
(3), 2002, pp. 279-287
The underlying line digraph structure of some
(0,1)
-matrix equations
Joan Gimbert
,
Yaokun Wu
Discrete Applied Mathematics
116
(3), 2002, pp. 289-296
On infinite words generated by polynomial D0L systems
Juha Honkala
Discrete Applied Mathematics
116
(3), 2002, pp. 297-305