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=9
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On approximation problems related to the independent set and vertex cover problems
R. Bar-Yehuda
,
S. Moran
Discrete Applied Mathematics
9
, 1984, pp. 1-10
Extensions of a theorem of Balas
C.E. Blair
,
R.G. Jeroslow
Discrete Applied Mathematics
9
, 1984, pp. 11-26
Clustering and domination in perfect graphs
D.G. Corneil
,
Y. Perl
Discrete Applied Mathematics
9
, 1984, pp. 27-39
On the windy postman problem
Meigu Guan
Discrete Applied Mathematics
9
, 1984, pp. 41-46
Gale diagrams of convex polytopes and positive spanning sets of vectors
Daniel A. Marcus
Discrete Applied Mathematics
9
, 1984, pp. 47-67
A note on off-line machines with `Brownian' input heads
Keijo Ruohonen
Discrete Applied Mathematics
9
, 1984, pp. 69-75
An algebraic and combinatorial approach to the analysis of line drawings of polyhedra
Kōkichi Sugihara
Discrete Applied Mathematics
9
, 1984, pp. 77-104
On the bipartition of graphs
Peter Buser
Discrete Applied Mathematics
9
, 1984, pp. 105-109
Note on a pursuit game played on graphs
Thomas Andreae
Discrete Applied Mathematics
9
, 1984, pp. 111-115
Polynomial testing of the query `Is
a^b > c^d
?' with application to finding a minimal cost reliability ratio spanning tree
R. Chandrasekaran
,
A. Tamir
Discrete Applied Mathematics
9
, 1984, pp. 117-123
On extendibility of unavoidable sets
Christian Choffrut
,
Karel Culik II
Discrete Applied Mathematics
9
, 1984, pp. 125-137
Frustration and stability in random boolean networks
Françoise Fogelman-Soulié
Discrete Applied Mathematics
9
, 1984, pp. 139-156
Tolerance graphs
Martin Charles Golumbic
,
Clyde L. Monma
,
William T., Jr. Trotter
Discrete Applied Mathematics
9
, 1984, pp. 157-170
Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope
Daniel Granot
,
Frieda Granot
Discrete Applied Mathematics
9
, 1984, pp. 171-185
Linear binary codes with intersection properties
D. Miklós
Discrete Applied Mathematics
9
, 1984, pp. 187-196
An optimal parallel connectivity algorithm
Uzi Vishkin
Discrete Applied Mathematics
9
, 1984, pp. 197-207
A vector exchange property of submodular systems
Ulrich Faigle
Discrete Applied Mathematics
9
, 1984, pp. 209-211
A matroid generalization of theorems of Lewin and Gallai
Yoji Kajitani
,
Shuichi Ueno
Discrete Applied Mathematics
9
, 1984, pp. 213-216
Constructive characterizations of the value function of a mixed-integer program I
C.E. Blair
,
R.G. Jeroslow
Discrete Applied Mathematics
9
, 1984, pp. 217-233
On certain classes of fractional matchings
J.R. Mühlbacher
,
F.X. Steinparz
,
G. Tinhofer
Discrete Applied Mathematics
9
, 1984, pp. 235-244
Diameter vulnerability of graphs
C. Peyrat
Discrete Applied Mathematics
9
, 1984, pp. 245-250
Applications of Ramsey theory
Fred S. Roberts
Discrete Applied Mathematics
9
, 1984, pp. 251-261
A perfect matching algorithm for sparse bipartite graphs
Eugeniusz Toczyƚowski
Discrete Applied Mathematics
9
, 1984, pp. 263-268
A correspondence between scene analysis and motions of frameworks
Walter Whiteley
Discrete Applied Mathematics
9
, 1984, pp. 269-295
On
k
-repetition freeness of length uniform morphisms over a binary alphabet
Veikko Keränen
Discrete Applied Mathematics
9
, 1984, pp. 297-300
Seiten 1
2
>