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
[2]
Hilfe
Suche: Journal=Discrete Appl.~Math. AND YEAR=1990
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the continuous working problem
R.S. Chang
,
R.C.T. Lee
Discrete Applied Mathematics
28
, 1990, pp. 93-109
Fixed edge-length graph drawing is NP-hard
Peter Eades
,
Nicholas C. Wormald
Discrete Applied Mathematics
28
, 1990, pp. 111-134
Resource allocation under limited sharing
Michael A. Langston
,
Michael P. Morford
Discrete Applied Mathematics
28
, 1990, pp. 135-147
The minimum weight of the Grassmann codes
C(k,n)
Charles T. Ryan
,
Kevin M. Ryan
Discrete Applied Mathematics
28
, 1990, pp. 149-156
On optimal strategies for a betting game
Zhuocheng Yang
Discrete Applied Mathematics
28
, 1990, pp. 157-169
Perfect error-correcting databases
Zoltán Füredi
Discrete Applied Mathematics
28
, 1990, pp. 171-176
The solution of a nonlinear partial difference equation
Zhixiong Wang
Discrete Applied Mathematics
28
, 1990, pp. 177-181
A smallest augmentation to 3-connect a graph
Toshimasa Watanabe
,
Akira Nakamura
Discrete Applied Mathematics
28
, 1990, pp. 183-186
Recognizing tough graphs is NP-hard
D. Bauer
,
S.L. Hakimi
,
E. Schmeichel
Discrete Applied Mathematics
28
, 1990, pp. 191-195
An algorithmic characterization of antimatroids
E. Andrew Boyd
,
Ulrich Faigle
Discrete Applied Mathematics
28
, 1990, pp. 197-205
Canonical equation sets for classes of concordant polytopes
Jon Lee
Discrete Applied Mathematics
28
, 1990, pp. 207-221
On the growth of random knapsacks
John W. Mamer
,
Kenneth E. Schilling
Discrete Applied Mathematics
28
, 1990, pp. 223-230
Classification of three-valued logical functions preserving 0
Masahiro Miyakawa
,
Ivo G. Rosenberg
,
Ivan Stojmenović
Discrete Applied Mathematics
28
, 1990, pp. 231-249
The structure of an integral monoid and integer programming feasibility
Jennifer Ryan
Discrete Applied Mathematics
28
, 1990, pp. 251-263
The double competition number of some triangle-free graphs
Suzanne M. Seager
Discrete Applied Mathematics
28
, 1990, pp. 265-269
Factorization of symmetric circulant matrices in finite fields
Marcelo J. Weinberger
,
Abraham Lempel
Discrete Applied Mathematics
28
, 1990, pp. 271-285
Local medians in chordal graphs
Heiko Wittenberg
Discrete Applied Mathematics
28
, 1990, pp. 287-296
Communication in
m
-connected graphs
Adam Idzik
Discrete Applied Mathematics
28
, 1990, pp. 297-301
Succinct representation of general unlabeled graphs
Moni Naor
Discrete Applied Mathematics
28
, 1990, pp. 303-307
Low complexity normal bases for
F_{2^{mn}}
Gérald E. Séguin
Discrete Applied Mathematics
28
, 1990, pp. 309-312
Applications of generalized matrix searching to geometric algorithms
Alok Aggarwal
,
Maria Klawe
Discrete Applied Mathematics
27
, 1990, pp. 3-23
Universal sequences for complete graphs
N. Alon
,
Y. Azar
,
Y. Ravid
Discrete Applied Mathematics
27
, 1990, pp. 25-28
Simplified existence theorems for
(g,f)
-factors
R.P. Anstee
Discrete Applied Mathematics
27
, 1990, pp. 29-38
Algorithms for high dimensional stabbing problems
David Avis
,
Mike Doskas
Discrete Applied Mathematics
27
, 1990, pp. 39-48
Parallel selection
Yossi Azar
,
Nicholas Pippenger
Discrete Applied Mathematics
27
, 1990, pp. 49-58
Seiten
<
1
2
3
4
>