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=66
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Linear cellular automata, finite automata and Pascal's triangle
J.-P. Allouche
,
F. von Haeseler
,
H.-O. Peitgen
,
G. Skordev
Discrete Applied Mathematics
66
(1), 1996, pp. 1-22
Homomorphically full graphs
Richard Brewster
,
Gary MacGillivray
Discrete Applied Mathematics
66
(1), 1996, pp. 23-31
The dominant of the 2-connected-Steiner-subgraph polytope for
W_4
-free graphs
Collette R. Coullard
,
Abdur Rais
,
Ronald L. Rardin
,
Donald K. Wagner
Discrete Applied Mathematics
66
(1), 1996, pp. 33-43
Intersection graphs of Helly families of subtrees
Fănică Gavril
Discrete Applied Mathematics
66
(1), 1996, pp. 45-56
Performances of parallel branch and bound algorithms with best-first search
Bernard Mans
,
Catherine Roucairol
Discrete Applied Mathematics
66
(1), 1996, pp. 57-74
On a problem of P. Erdös
Carla Antoni
,
Angela Dalena
Discrete Applied Mathematics
66
(1), 1996, pp. 75-79
An improved lower bound for the bin packing problem
Bintong Chen
,
Bharatendu Srivastava
Discrete Applied Mathematics
66
(1), 1996, pp. 81-94
Intertwined infinite binary words
Jarosƚaw Grytczuk
Discrete Applied Mathematics
66
(1), 1996, pp. 95-99
Two-
\phi
-tolerance competition graphs
R.C. Brigham
,
F.R. McMorris
,
R.P. Vitray
Discrete Applied Mathematics
66
(2), 1996, pp. 101-108
On the structure of trapezoid graphs
F. Cheah
,
D.G. Corneil
Discrete Applied Mathematics
66
(2), 1996, pp. 109-133
An infinite class of
Z
-cyclic whist tournaments on
\cal v
players,
\cal v \equiv 1 \pmod{4}
Norman J. Finizio
Discrete Applied Mathematics
66
(2), 1996, pp. 135-146
The weighted perfect domination problem and its variants
Chain-Chin Yen
,
R.C.T. Lee
Discrete Applied Mathematics
66
(2), 1996, pp. 147-160
A sequencing problem with family setup times
Stanisƚaw Zdraƚka
Discrete Applied Mathematics
66
(2), 1996, pp. 161-183
A group testing problem for hypergraphs of bounded rank
Eberhard Triesch
Discrete Applied Mathematics
66
(2), 1996, pp. 185-188
Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
Maw-Shang Chang
,
Yi-Hua Chen
,
Gerard J. Chang
,
Jing-Ho Yan
Discrete Applied Mathematics
66
(3), 1996, pp. 189-203
On the geometric separability of Boolean functions
Tibor Hegedüs
,
Nimrod Megiddo
Discrete Applied Mathematics
66
(3), 1996, pp. 205-218
On the complexity of recognizing a class of perfectly orderable graphs
Chính T. Hoàng
Discrete Applied Mathematics
66
(3), 1996, pp. 219-226
Lower probabilities and function representation
Thomas Kämpke
Discrete Applied Mathematics
66
(3), 1996, pp. 227-243
The expected number of symmetries in locally restricted trees II
Kathleen A. McKeon
Discrete Applied Mathematics
66
(3), 1996, pp. 245-253
Bounded depth broadcasting
David B. Peters
,
Joseph G. Peters
Discrete Applied Mathematics
66
(3), 1996, pp. 255-270
Arrow's Theorem for closed weak hierarchies
R.C. Powers
Discrete Applied Mathematics
66
(3), 1996, pp. 271-278