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.
Disjunctive programming: Properties of the convex hull of feasible points
Egon Balas
Discrete Applied Mathematics
89
(1-3), 1998, pp. 3-44
Triangulating graphs with few
P_4
's
Luitpold Babel
Discrete Applied Mathematics
89
(1-3), 1998, pp. 45-57
The complexity of some problems related to graph 3-colorability
Andreas Brandstädt
,
Van Bang Le
,
Thomas Szymczak
Discrete Applied Mathematics
89
(1-3), 1998, pp. 59-73
Fringe thickness and maximum path length of binary trees
Helen Cameron
Discrete Applied Mathematics
89
(1-3), 1998, pp. 75-97
Efficient broadcasting with linearly bounded faults
Krzysztof Ciebiera
,
Adam Malinowski
Discrete Applied Mathematics
89
(1-3), 1998, pp. 99-105
Large generalized cycles
J. Gómez
,
C. Padró
,
S. Perennes
Discrete Applied Mathematics
89
(1-3), 1998, pp. 107-123
Approximation algorithms for min-sum
p
-clustering
Nili Guttmann-Beck
,
Refael Hassin
Discrete Applied Mathematics
89
(1-3), 1998, pp. 125-142
Partial and perfect path covers of cographs
D.G. Kirkpatrick
,
K. Madhukar Reddy
,
C. Pandu Rangan
,
A. Srinivasan
Discrete Applied Mathematics
89
(1-3), 1998, pp. 143-153
Minimal vertex separators of chordal graphs
P. Sreenivasa Kumar
,
C.E. Veni Madhavan
Discrete Applied Mathematics
89
(1-3), 1998, pp. 155-168
Linking discrete orthogonality with dilation and translation for incomplete sigma-pi neural networks of Hopfield-type
Burkhard Lenze
Discrete Applied Mathematics
89
(1-3), 1998, pp. 169-180
Median hyperplanes in normed spaces - A survey
Horst Martini
,
Anita Schöbel
Discrete Applied Mathematics
89
(1-3), 1998, pp. 181-195
A fast algorithm for strongly correlated knapsack problems
David Pisinger
Discrete Applied Mathematics
89
(1-3), 1998, pp. 197-212
The complexity of multidimensional periodic scheduling
W.F.J. Verhaegh
,
P.E.R. Lippens
,
E.H.L. Aarts
,
J.L. van Meerbergen
,
A. van der Werf
Discrete Applied Mathematics
89
(1-3), 1998, pp. 213-242
d
-minimal languages
S.S. Yu
Discrete Applied Mathematics
89
(1-3), 1998, pp. 243-262
On perfect switching classes
Alain Hertz
Discrete Applied Mathematics
89
(1-3), 1998, pp. 263-267
On the average Hamming distance for binary codes
Shutao Xia
,
Fangwei Fu
Discrete Applied Mathematics
89
(1-3), 1998, pp. 269-276
A note on spanning local tournaments in locally semicomplete digraphs
Jing Huang
Discrete Applied Mathematics
89
(1-3), 1998, pp. 277-279
How good are branching rules in DPLL?
Ming Ouyang
Discrete Applied Mathematics
89
(1-3), 1998, pp. 281-286
On testing consecutive-ones property in parallel
Fred Annexstein
,
Ram Swaminathan
Discrete Applied Mathematics
88
(1-3), 1998, pp. 7-28
A
2\frac{2}{3}
superstring approximation algorithm
Chris Armen
,
Clifford Stein
Discrete Applied Mathematics
88
(1-3), 1998, pp. 29-57
On the complexity and approximation of syntenic distance
Bhaskar DasGupta
,
Tao Jiang
,
Sampath Kannan
,
Ming Li
,
Elizabeth Sweedyk
Discrete Applied Mathematics
88
(1-3), 1998, pp. 59-82
On the definition and the construction of pockets in macromolecules
Herbert Edelsbrunner
,
Michael Facello
,
Jie Liang
Discrete Applied Mathematics
88
(1-3), 1998, pp. 83-102
On the equivalence of two tree mapping measures
O. Eulenstein
,
M. Vingron
Discrete Applied Mathematics
88
(1-3), 1998, pp. 103-128
On the approximability of the Steiner tree problem in phylogeny
David Fernández-Baca
,
Jens Lagergren
Discrete Applied Mathematics
88
(1-3), 1998, pp. 129-145
Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
Vladimir Grebinski
,
Gregory Kucherov
Discrete Applied Mathematics
88
(1-3), 1998, pp. 147-165
Seiten 1
2
3
4
5
6
7
>