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=87
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the dimension of projected polyhedra
Egon Balas
,
Maarten Oosten
Discrete Applied Mathematics
87
(1-3), 1998, pp. 1-9
Properties of some ILP formulations of a class of partitioning problems
Alberto Caprara
Discrete Applied Mathematics
87
(1-3), 1998, pp. 11-23
The cyclic cutwidth of trees
J.D. Chavez
,
R. Trapp
Discrete Applied Mathematics
87
(1-3), 1998, pp. 25-32
Perfect broadcasting in unlabeled networks
Krzysztof Diks
,
Evangelos Kranakis
,
Andrzej Pelc
Discrete Applied Mathematics
87
(1-3), 1998, pp. 33-47
Inversions in
k
-sorted permutations
Ronald D. Dutton
Discrete Applied Mathematics
87
(1-3), 1998, pp. 49-56
Pyramidal tours with step-backs and the asymmetric traveling salesman problem
Hikoe Enomoto
,
Yoshiaki Oda
,
Katsuhiro Ota
Discrete Applied Mathematics
87
(1-3), 1998, pp. 57-65
Minimum multiway cuts in trees
Péter L. Erdŏs
,
András Frank
,
László Székely
Discrete Applied Mathematics
87
(1-3), 1998, pp. 67-75
The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs
M.A. Fiol
,
E. Garriga
Discrete Applied Mathematics
87
(1-3), 1998, pp. 77-97
Symmetries and sense of direction in labeled graphs
Paola Flocchini
,
Alessandro Roncato
,
Nicola Santoro
Discrete Applied Mathematics
87
(1-3), 1998, pp. 99-115
Approximation algorithms for minimum tree partition
Nili Guttmann-Beck
,
Refael Hassin
Discrete Applied Mathematics
87
(1-3), 1998, pp. 117-137
Splicing representations of strictly locally testable languages
Tom Head
Discrete Applied Mathematics
87
(1-3), 1998, pp. 139-147
A parametric critical path problem and an application for cyclic scheduling
Eugene Levner
,
Vladimir Kats
Discrete Applied Mathematics
87
(1-3), 1998, pp. 149-158
Stability aspects of the Traveling Salesman problem based on
k
-best solutions
Marek Libura
,
Edo S. van der Poort
,
Gerard Sierksma
,
Jack A.A. van der Veen
Discrete Applied Mathematics
87
(1-3), 1998, pp. 159-185
An optimal parallel algorithm for node ranking of cographs
Chuan-Ming Liu
,
Ming-Shing Yu
Discrete Applied Mathematics
87
(1-3), 1998, pp. 187-201
Solving the weighted efficient edge domination problem on bipartite permutation graphs
Chin Lung Lu
,
Chuan Yi Tang
Discrete Applied Mathematics
87
(1-3), 1998, pp. 203-211
Phylogeny numbers
Fred S. Roberts
,
Li Sheng
Discrete Applied Mathematics
87
(1-3), 1998, pp. 213-228
Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem
Arie Tamir
Discrete Applied Mathematics
87
(1-3), 1998, pp. 229-243
Weighted connected domination and Steiner trees in distance-hereditary graphs
Hong-Gwa Yeh
,
Gerard J. Chang
Discrete Applied Mathematics
87
(1-3), 1998, pp. 245-253
A relation between the knapsack and group knapsack problems
Nan Zhu
Discrete Applied Mathematics
87
(1-3), 1998, pp. 255-268
Adjacency on the constrained assignment problem
Abdo Y. Alfakih
,
Katta G. Murty
Discrete Applied Mathematics
87
(1-3), 1998, pp. 269-274
The cyclic wirelength of trees
S.L. Bezrukov
,
U.-P. Schroeder
Discrete Applied Mathematics
87
(1-3), 1998, pp. 275-277
On the relations between arboricity and independent number or covering number
Zhongfu Zhang
,
Linzhong Liu
,
Jianxun Zhang
,
Jianfang Wang
Discrete Applied Mathematics
87
(1-3), 1998, pp. 279-283