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=85
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Consecutive interval query and dynamic programming on intervals
Alok Aggarwal
,
Takeshi Tokuyama
Discrete Applied Mathematics
85
(1), 1998, pp. 1-24
Two-path subsets: Efficient counting and applications to performability analysis
Michael O. Ball
,
Jane N. Hagstrom
,
J. Scott Provan
Discrete Applied Mathematics
85
(1), 1998, pp. 25-45
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