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=91
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms
Nesrine Abbas
,
Lorna Stewart
Discrete Applied Mathematics
91
(1-3), 1999, pp. 1-23
Minimal connected enclosures on an embedded planar graph
Christos Alexopoulos
,
J. Scott Provan
,
H. Donald Ratliff
,
Bryan R. Stutzman
Discrete Applied Mathematics
91
(1-3), 1999, pp. 25-38
Separable partitions
Noga Alon
,
Shmuel Onn
Discrete Applied Mathematics
91
(1-3), 1999, pp. 39-51
Matrices with maximum exponents in the class of doubly stochastic primitive matrices
Zhou Bo
,
Bolian Liu
Discrete Applied Mathematics
91
(1-3), 1999, pp. 53-66
Stabbing information of a simple polygon
Hazel Everett
,
Ferran Hurtado
,
Marc Noy
Discrete Applied Mathematics
91
(1-3), 1999, pp. 67-82
On the cut-off point for combinatorial group testing
Paul Fischer
,
Norbert Klasner
,
Ingo Wegener
Discrete Applied Mathematics
91
(1-3), 1999, pp. 83-92
Minimizing broadcast costs under edge reductions in tree networks
Susanne E. Hambrusch
,
Hyeong-Seok Lim
Discrete Applied Mathematics
91
(1-3), 1999, pp. 93-117
A combinatorial problem in database security
Peter Horak
,
Ljiljana Branković
,
Mirka Miller
Discrete Applied Mathematics
91
(1-3), 1999, pp. 119-126
The
b
-chromatic number of a graph
Robert W. Irving
,
David F. Manlove
Discrete Applied Mathematics
91
(1-3), 1999, pp. 127-141
Generalized partitions of graphs
Gary MacGillivray
,
Min-Li Yu
Discrete Applied Mathematics
91
(1-3), 1999, pp. 143-153
On the algorithmic complexity of twelve covering and independence parameters of graphs
David F. Manlove
Discrete Applied Mathematics
91
(1-3), 1999, pp. 155-175
Inducing an order on cellular automata by a grouping operation
Jacques Mazoyer
,
Ivan Rapaport
Discrete Applied Mathematics
91
(1-3), 1999, pp. 177-196
Underdiagonal lattice paths with unrestricted steps
Donatella Merlini
,
D.G. Rogers
,
Renzo Sprugnoli
,
M. Cecilia Verri
Discrete Applied Mathematics
91
(1-3), 1999, pp. 197-213
Retractions of finite distance functions onto tree metrics
Vincent Moulton
,
Mike Steel
Discrete Applied Mathematics
91
(1-3), 1999, pp. 215-233
Data-dependent bounds for the general and the asymmetric Stacker-Crane problems
Giovanni Righini
,
Marco Trubian
Discrete Applied Mathematics
91
(1-3), 1999, pp. 235-242
Induced permutation automata and coverings of strongly connected automata
Kenji Uemura
,
Takeo Yaku
,
Kimio Sugita
Discrete Applied Mathematics
91
(1-3), 1999, pp. 243-249
On the complexity of postoptimality analysis of 0/1 programs
Stan van Hoesel
,
Albert Wagelmans
Discrete Applied Mathematics
91
(1-3), 1999, pp. 251-263
Compatible Hamilton decompositions of directed wrapped butterfly graphs
H. Verrall
Discrete Applied Mathematics
91
(1-3), 1999, pp. 265-275
On the nonexistence of extremal self-dual codes
Shengyuan Zhang
Discrete Applied Mathematics
91
(1-3), 1999, pp. 277-286
Construction of a simple elimination scheme for a chordal comparability graph in linear time
Richard B. Borie
,
Jeremy P. Spinrad
Discrete Applied Mathematics
91
(1-3), 1999, pp. 287-292
Even and odd pairs in comparability and in
P_4
-comparability graphs
Celina M.H. de Figueiredo
,
John Gimbel
,
Célia P. Mello
,
Jayme L. Szwarcfiter
Discrete Applied Mathematics
91
(1-3), 1999, pp. 293-297
A note on graphs with large girth and small minus domination number
Jaeun Lee
,
Moo Young Sohn
,
Hye Kyung Kim
Discrete Applied Mathematics
91
(1-3), 1999, pp. 299-303
Optimal binary trees with order constraints
András Sebŏ
,
Zeev Waksman
Discrete Applied Mathematics
91
(1-3), 1999, pp. 305-311