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=95
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On maximal shadows of members in left-compressed sets
Rudolf Ahlswede
,
Zhen Zhang
Discrete Applied Mathematics
95
(1-3), 1999, pp. 3-9
On the
p
-connectedness of graphs - A survey
Luitpold Babel
,
Stephan Olariu
Discrete Applied Mathematics
95
(1-3), 1999, pp. 11-33
On the complexity of linear programming in the BSS-model
G. Bär
Discrete Applied Mathematics
95
(1-3), 1999, pp. 35-40
On the complexity of Hamiltonian path and cycle problems in certain classes of digraphs
Jrgen Bang-Jensen
,
Gregory Gutin
Discrete Applied Mathematics
95
(1-3), 1999, pp. 41-60
A new sufficient condition for a digraph to be Hamiltonian
Jrgen Bang-Jensen
,
Yubao Guo
,
Anders Yeo
Discrete Applied Mathematics
95
(1-3), 1999, pp. 61-72
A brief survey of perfect Mendelsohn packing covering designs
F.E. Bennett
Discrete Applied Mathematics
95
(1-3), 1999, pp. 73-81
The proper linear spaces on 17 points
A. Betten
,
D. Betten
Discrete Applied Mathematics
95
(1-3), 1999, pp. 83-108
Simple
8-(40,11,1440)
designs
Anton Betten
,
Reinhard Laue
,
Alfred Wassermann
Discrete Applied Mathematics
95
(1-3), 1999, pp. 109-114
The Erd\Hos-Ko-Rado bound for the function lattice
Christian Bey
Discrete Applied Mathematics
95
(1-3), 1999, pp. 115-125
On
k
-partitioning of Hamming graphs
S.L. Bezrukov
,
R. Elsässer
,
U.-P. Schroeder
Discrete Applied Mathematics
95
(1-3), 1999, pp. 127-140
Tree- and forest-perfect graphs
Andreas Brandtstädt
,
Van Bang Le
Discrete Applied Mathematics
95
(1-3), 1999, pp. 141-162
On the stability number of claw-free
P_5
-free and more general graphs
Andreas Brandstädt
,
Peter L. Hammer
Discrete Applied Mathematics
95
(1-3), 1999, pp. 163-167
An upper bound for the size of the largest antichain in the poset of partitions of an integer
E. Rodney Canfield
,
Konrad Engel
Discrete Applied Mathematics
95
(1-3), 1999, pp. 169-180
On the extension of bipartite to parity graphs
Serafino Cicerone
,
Gabriele di Stefano
Discrete Applied Mathematics
95
(1-3), 1999, pp. 181-195
Graph classes between parity and distance-hereditary graphs
Serafino Cicerone
,
Gabriele di Stefano
Discrete Applied Mathematics
95
(1-3), 1999, pp. 197-216
The Steiner ratio of
{\cal L}^d_{2k}
Dietmar Cieslik
Discrete Applied Mathematics
95
(1-3), 1999, pp. 217-221
Almost diameter of a house-hole-free graph in linear time via LexBFS
Feodor F. Dragan
Discrete Applied Mathematics
95
(1-3), 1999, pp. 223-239
Note on a helicopter search problem on graphs
Fedor V. Fomin
Discrete Applied Mathematics
95
(1-3), 1999, pp. 241-249
On the PBD-closure of sets containing 3
M. Grüttmüller
Discrete Applied Mathematics
95
(1-3), 1999, pp. 251-272
Outpaths in semicomplete multipartite graphs
Yubao Guo
Discrete Applied Mathematics
95
(1-3), 1999, pp. 273-277
Weakened Ramsey numbers
Heiko Harborth
,
Meinhard Möller
Discrete Applied Mathematics
95
(1-3), 1999, pp. 279-284
On an isoperimetric problem for Hamming graphs
L.H. Harper
Discrete Applied Mathematics
95
(1-3), 1999, pp. 285-309
Asymptotic results on suborthogonal
\vec{G}
-decompositions of complete digraphs
Sven Hartmann
Discrete Applied Mathematics
95
(1-3), 1999, pp. 311-320
Recognizing graphs of acyclic cubical complexes
Wilfried Imrich
,
Sandi Klavz̑ar
Discrete Applied Mathematics
95
(1-3), 1999, pp. 321-330
Perfect and almost perfect sequences
Dieter Jungnickel
,
Alexander Pott
Discrete Applied Mathematics
95
(1-3), 1999, pp. 331-359
Seiten 1
2
>