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=1998
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A representation theorem of the suffixes of characteristic sequences
Wai-Fong Chuan
Discrete Applied Mathematics
85
(1), 1998, pp. 47-57
Helicopter search problems, bandwidth and pathwidth
F.V. Fomin
Discrete Applied Mathematics
85
(1), 1998, pp. 59-70
Edge ranking of graphs is hard
Tak Wah Lam
,
Fung Ling Yue
Discrete Applied Mathematics
85
(1), 1998, pp. 71-86
Bisecting de Bruijn and Kautz graphs
José Rolim
,
Pavel Tvrdík
,
Jan Trdlic̑ka
,
Imrich Vrto
Discrete Applied Mathematics
85
(1), 1998, pp. 87-97
Algorithms and outerplanar conditions for A-trails in plane Eulerian graphs
Lars Dvling Andersen
,
Herbert Fleischner
,
Sussanne Regner
Discrete Applied Mathematics
85
(2), 1998, pp. 99-112
The disjoint shortest paths problem
Tali Eilam-Tzoreff
Discrete Applied Mathematics
85
(2), 1998, pp. 113-138
A communication problem and directed triple systems
András Gyárfás
,
R.H. Schelp
Discrete Applied Mathematics
85
(2), 1998, pp. 139-147
Is a unit-time job shop not easier than identical parallel machines?
Vadim G. Timkovsky
Discrete Applied Mathematics
85
(2), 1998, pp. 149-162
Source sink flows with capacity installation in batches
Sunil Chopra
,
Itzhak Gilboa
,
S. Trilochan Sastry
Discrete Applied Mathematics
85
(3), 1998, pp. 165-192
More
ZCPS-WH(v)
and several new infinite classes of
Z
-cyclic whist tournaments
Norman J. Finizio
,
Philip A. Leonard
Discrete Applied Mathematics
85
(3), 1998, pp. 193-202
The planar multiterminal cut problem
David Hartvigsen
Discrete Applied Mathematics
85
(3), 1998, pp. 203-222
Neither reading few bits twice nor reading illegally helps much
S. Jukna
,
A. Razborov
Discrete Applied Mathematics
85
(3), 1998, pp. 223-238
Efficient optimal equation formulation in lumped power-conserving systems
J.D. Lamb
Discrete Applied Mathematics
85
(3), 1998, pp. 239-249
The exact bound of Lee's MLPT
Guo-Hui Lin
Discrete Applied Mathematics
85
(3), 1998, pp. 251-254
On the structure of graphs with few
P_4s
Luitpold Babel
,
Stephan Olariu
Discrete Applied Mathematics
84
(1-3), 1998, pp. 1-13
Optimal wavelength-routed multicasting
Bruno Beauqier
,
Pavol Hell
,
Stéphane Pérennes
Discrete Applied Mathematics
84
(1-3), 1998, pp. 15-20
Hamilton circuits in the directed wrapped Butterfly network
J-C. Bermond
,
E. Darrot
,
O. Delmas
,
S. Pérennes
Discrete Applied Mathematics
84
(1-3), 1998, pp. 21-42
Separability generalizes Dirac's theorem
Anne Berry
,
Jean-Paul Bordat
Discrete Applied Mathematics
84
(1-3), 1998, pp. 43-53
Multi-machine scheduling with variance minimization
Xiaoqiang Cai
,
T.C.E. Cheng
Discrete Applied Mathematics
84
(1-3), 1998, pp. 55-70
Maximum vertex-weighted matching in strongly chordal graphs
Manoel B. Campêlo
,
Sulamita Klein
Discrete Applied Mathematics
84
(1-3), 1998, pp. 71-77
Matching and multidimensional matching in chordal and strongly chordal graphs
Elias Dahlhaus
,
Marek Karpinski
Discrete Applied Mathematics
84
(1-3), 1998, pp. 79-91
Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
David C. Fisher
,
Patricia A. McKenna
,
Elizabeth D. Boyer
Discrete Applied Mathematics
84
(1-3), 1998, pp. 93-105
EP theorem and linear complementarity problems
Komei Fukuda
,
Makoto Namiki
,
Akihisa Tamura
Discrete Applied Mathematics
84
(1-3), 1998, pp. 107-119
Simple planar graph partition into three forests
Roberto Grossi
,
Elena Lodi
Discrete Applied Mathematics
84
(1-3), 1998, pp. 121-132
Comparison of permanental bounds of (0,1)-matrices
Suk-Geun Hwang
,
Arnold R. Kräuter
Discrete Applied Mathematics
84
(1-3), 1998, pp. 133-144
Seiten
<
1
2
3
4
5
6
7
>