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=78
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Efficient computation of implicit representations of sparse graphs
Srinivasa R. Arikati
,
Anil Maheshwari
,
Christos D. Zaroliagis
Discrete Applied Mathematics
78
(1-3), 1997, pp. 1-16
Efficient generation of graphical partitions
Tiffany M. Barnes
,
Carla D. Savage
Discrete Applied Mathematics
78
(1-3), 1997, pp. 17-26
Generalized bicycles
Kenneth A. Berman
,
Yanpei Liu
Discrete Applied Mathematics
78
(1-3), 1997, pp. 27-40
On minimum intersection of two minimum dominating sets of interval graphs
Maw-Shang Chang
,
Chung-Chang Hsu
Discrete Applied Mathematics
78
(1-3), 1997, pp. 41-50
A special case for subset interconnection designs
Ding-Zhu Du
,
Biao Gao
,
Weili Wu
Discrete Applied Mathematics
78
(1-3), 1997, pp. 51-60
Fault-tolerant routings in double fixed-step networks
J. Fàbrega
,
M. Zaragozà
Discrete Applied Mathematics
78
(1-3), 1997, pp. 61-74
On 1-rate wide-sense nonblocking for 3-stage Clos networks
Peter Fishburn
,
F.K. Hwang
,
D.Z. Du
,
B. Gao
Discrete Applied Mathematics
78
(1-3), 1997, pp. 75-87
Paths with minimum range and ratio of arc lenghts
Pierre Hansen
,
Giovanni Storchi
,
Tsevi Vovor
Discrete Applied Mathematics
78
(1-3), 1997, pp. 89-102
Embedding de Bruijn, Kautz and shuffle-exchange networks in books
Toru Hasunuma
,
Yukio Shibata
Discrete Applied Mathematics
78
(1-3), 1997, pp. 103-116
Scheduling imprecise computation tasks with 0/1-constraint
Kevin I-J. Ho
,
Joseph Y-T. Leung
,
W-D. Wei
Discrete Applied Mathematics
78
(1-3), 1997, pp. 117-132
Edge disjoint polyp packing
Gyula Y. Katona
Discrete Applied Mathematics
78
(1-3), 1997, pp. 133-152
Competition numbers of graphs with a small number of triangles
Suh-Ryung Kim
,
Fred S. Roberts
Discrete Applied Mathematics
78
(1-3), 1997, pp. 153-162
Optimal orientations of products of paths and cycles
K.M. Koh
,
E.G. Tay
Discrete Applied Mathematics
78
(1-3), 1997, pp. 163-174
Open shop scheduling with maximal machines
George J. Kyparisis
,
Christos Koulamas
Discrete Applied Mathematics
78
(1-3), 1997, pp. 175-187
Recognizing interval digraphs and interval bigraphs in polynomial time
Haiko Müller
Discrete Applied Mathematics
78
(1-3), 1997, pp. 189-205
The point-to-point connection problem - Analysis and algorithms
Madan Natu
,
Shu-Cherng Fang
Discrete Applied Mathematics
78
(1-3), 1997, pp. 207-226
k
-path partitions in trees
Jing-Ho Yan
,
Gerard J. Chang
,
Sandra M. Hedetniemi
,
Stephen T. Hedetniemi
Discrete Applied Mathematics
78
(1-3), 1997, pp. 227-233
Complexity of searching an immobile hider in a graph
Bernhard von Stengel
,
Ralph Werchner
Discrete Applied Mathematics
78
(1-3), 1997, pp. 235-249
A potential reduction approach to the frequency assignment problem
J.P. Warners
,
T. Terlaky
,
C. Roos
,
B. Jansen
Discrete Applied Mathematics
78
(1-3), 1997, pp. 251-282
Meyniel weakly triangulated graphs II: A theorem of Dirac
Ryan B. Hayward
Discrete Applied Mathematics
78
(1-3), 1997, pp. 283-289
Two-segmented channel routing is strong
NP
-complete
Wing Ning Li
Discrete Applied Mathematics
78
(1-3), 1997, pp. 291-298