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=1984
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem
Michele Conforti
,
Gérard Cornuéjols
Discrete Applied Mathematics
7
, 1984, pp. 251-274
The absolute centre of a graph
R.A. Cuninghame-Green
Discrete Applied Mathematics
7
, 1984, pp. 275-283
A note on cake cutting
S. Even
,
A. Paz
Discrete Applied Mathematics
7
, 1984, pp. 285-296
A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
Jean-Jacques Pansiot
Discrete Applied Mathematics
7
, 1984, pp. 297-311
A network theory approach to the rigidity of skeletal structures, part I. Modelling and interconnection
András Recski
Discrete Applied Mathematics
7
, 1984, pp. 313-324
Some aspects of perfect elimination orderings in chordal graphs
D.R. Shier
Discrete Applied Mathematics
7
, 1984, pp. 325-331
Seiten
<
1
2
3
4