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=7
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs
Takao Asano
,
Shunji Kikuchi
,
Nobuji Saito
Discrete Applied Mathematics
7
, 1984, pp. 1-15
The Tietäväinen bound for spherical codes
Jaakko T. Astola
Discrete Applied Mathematics
7
, 1984, pp. 17-21
The indefinite zero-one quadratic problem
Michael W. Carter
Discrete Applied Mathematics
7
, 1984, pp. 23-44
Matchings in benzene chains
E.J. Farrell
,
S.A. Wahid
Discrete Applied Mathematics
7
, 1984, pp. 45-54
Space graphs and sphericity
Hiroshi Maehara
Discrete Applied Mathematics
7
, 1984, pp. 55-64
Lattice valued relations and automata
A. Muir
,
M.W. Warner
Discrete Applied Mathematics
7
, 1984, pp. 65-78
A new LAD curve-fitting algorithm: Slighthly overdetermined equation systems in
L_1
Eugene Seneta
,
W.L. Steiger
Discrete Applied Mathematics
7
, 1984, pp. 79-91
A duality theorem for linear congruences
H.P. Williams
Discrete Applied Mathematics
7
, 1984, pp. 93-103
A note on Frank's generalized polymatroids
Satoru Fujishige
Discrete Applied Mathematics
7
, 1984, pp. 105-109
Domination, independent domination, and duality in strongly chordal graphs
Martin Farber
Discrete Applied Mathematics
7
, 1984, pp. 115-130
Probabilities of dominant candidates based on first-place votes
Peter C. Fishburn
Discrete Applied Mathematics
7
, 1984, pp. 131-140
Counting and coding identity trees with fixed diameter and bounded degree
Claude W. Haigh
,
John W. Kennedy
,
Louis V. Quintas
Discrete Applied Mathematics
7
, 1984, pp. 141-160
On the average shape of monotonically labelled tree structures
Peter Kirschenhofer
Discrete Applied Mathematics
7
, 1984, pp. 161-181
Toward optimal gossiping schemes with conference calls
Arthur L. Liestman
,
Dana Richards
Discrete Applied Mathematics
7
, 1984, pp. 183-189
Counting dendrograms: A survey
Fionn Murtagh
Discrete Applied Mathematics
7
, 1984, pp. 191-199
An algorithm to recognize a middle graph
Miroslawa Skowrońska
,
Maciej M. Sysƚo
Discrete Applied Mathematics
7
, 1984, pp. 201-208
Optimal constructions of reversible digraphs
Maciej M. Sysƚo
Discrete Applied Mathematics
7
, 1984, pp. 209-220
Isometric embedding in products of complete graphs
Peter M. Winkler
Discrete Applied Mathematics
7
, 1984, pp. 221-225
On permutations of wires and states
Frank M. Brown
,
Yoshihide Igarashi
Discrete Applied Mathematics
7
, 1984, pp. 231-241
Jump number of dags having Dilworth number 2
M. Chein
,
M. Habib
Discrete Applied Mathematics
7
, 1984, pp. 243-250
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
Seiten 1
2
>