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=75
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Matchings and paths in the cube
Béla Bollobás
,
Imre Leader
Discrete Applied Mathematics
75
(1), 1997, pp. 1-8
Rectangle-visibility representations of bipartite graphs
Alice M. Dean
,
Joan P. Hutchinson
Discrete Applied Mathematics
75
(1), 1997, pp. 9-25
Independence and average distance in graphs
Peter Firby
,
Julie Haviland
Discrete Applied Mathematics
75
(1), 1997, pp. 27-37
The discrete Radon transform and its approximate inversion via linear programming
Peter Fishburn
,
Peter Schwander
,
Larry Shepp
,
Robert J. Vanderbei
Discrete Applied Mathematics
75
(1), 1997, pp. 39-61
Computing matrix period in max-min algebra
Martin Gavalec
Discrete Applied Mathematics
75
(1), 1997, pp. 63-70
Stage-graph representations
Evangelos Kranakis
,
Danny Krizanc
,
Anil Maheshwari
,
Marc Noy
,
Jörg-Rüdiger Sack
,
Jorge Urrutia
Discrete Applied Mathematics
75
(1), 1997, pp. 71-80
Optimal transmission schedules in TWDM optical passive star networks
Sang-Kyu Lee
,
A. Duksu Oh
,
Hongsik Choi
,
Hyeong-Ah Choi
Discrete Applied Mathematics
75
(1), 1997, pp. 81-91
Minimum dispersion problems
Abraham P. Punnen
,
Y.P. Aneja
Discrete Applied Mathematics
75
(1), 1997, pp. 93-102
Catastrophic faults in reconfigurable systolic linear arrays
Roberto de Prisco
,
Alfredo de Santis
Discrete Applied Mathematics
75
(2), 1997, pp. 105-123
Large Cayley graphs on an Abelian group
C. Carcia
,
C. Peyrat
Discrete Applied Mathematics
75
(2), 1997, pp. 125-133
Generalized coloring for tree-like graphs
Klaus Jansen
,
Petra Scheffler
Discrete Applied Mathematics
75
(2), 1997, pp. 135-155
Periodic gossiping in back-to-back trees
Roger Labahn
,
André Raspaud
Discrete Applied Mathematics
75
(2), 1997, pp. 157-168
Exact and approximation algorithms for makespan minimization on unrelated parallel machines
Silvano Martello
,
François Soumis
,
Paolo Toth
Discrete Applied Mathematics
75
(2), 1997, pp. 169-188
Better bounds for perpetual gossiping
A.D. Scott
Discrete Applied Mathematics
75
(2), 1997, pp. 189-197
(p-1)/(p+1)
-approximate algorithms for
p
-traveling salesmen problems on a tree with minmax objective
Igor Averbakh
,
Oded Berman
Discrete Applied Mathematics
75
(3), 1997, pp. 201-216
Variable and term removal from Boolean formulae
Yves Crama
,
Oya Ekin
,
Peter L. Hammer
Discrete Applied Mathematics
75
(3), 1997, pp. 217-230
On the subword equivalence problem for morphic words
Isabelle Fagnot
Discrete Applied Mathematics
75
(3), 1997, pp. 231-253
Minimum-cost line broadcast in paths
Satoshi Fujita
,
Arthur M. Farley
Discrete Applied Mathematics
75
(3), 1997, pp. 255-268
Orbits of Boolean functions
J. Gorodkin
Discrete Applied Mathematics
75
(3), 1997, pp. 269-275
On broadcasting multiple messages in a
d
-dimensional grid
Y. Roditty
,
B. Shoham
Discrete Applied Mathematics
75
(3), 1997, pp. 277-284
Computing optimal assignments for residual network reliability
C. Stivaros
,
K. Sutner
Discrete Applied Mathematics
75
(3), 1997, pp. 285-295