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=68
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bus interconnection networks
Jean-Claude Bermond
,
Fahir Ö. Ergincan
Discrete Applied Mathematics
68
(1-2), 1996, pp. 1-15
A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
Igor Averbakh
,
Oded Berman
Discrete Applied Mathematics
68
(1-2), 1996, pp. 17-32
Inclusion relations between some congruences related to the dot-depth hierarchy
F. Blanchet-Sadri
Discrete Applied Mathematics
68
(1-2), 1996, pp. 33-71
The algorithmic complexity of minus domination in graphs
Jean Dunbar
,
Wayne Goddard
,
Stephen Hedetniemi
,
Alice McRae
,
Michael A. Henning
Discrete Applied Mathematics
68
(1-2), 1996, pp. 73-84
An algorithm to find two distance domination parameters in a graph
Gerd H. Fricke
,
Michael A. Henning
,
Ortrud R. Oellermann
,
Henda C. Swart
Discrete Applied Mathematics
68
(1-2), 1996, pp. 85-91
Algebraic approach to fasciagraphs and rotagraphs
Sandi Klavz̑ar
,
Janez Z̑erovnik
Discrete Applied Mathematics
68
(1-2), 1996, pp. 93-100
On the fixed interval due-date scheduling problem
Chung-Yee Lee
,
Chung-Lun Li
Discrete Applied Mathematics
68
(1-2), 1996, pp. 101-117
Degree-constrained spanners for multidimensional grids
Arthur L. Liestman
,
Thomas C. Shermer
,
Christopher R. Stolte
Discrete Applied Mathematics
68
(1-2), 1996, pp. 119-144
Negative cycles in complete signed graphs
Dragos Radu Popescu
,
Ioan Tomescu
Discrete Applied Mathematics
68
(1-2), 1996, pp. 145-152
Tighter representations for set partitioning problems
Hanif D. Sherali
,
Youngho Lee
Discrete Applied Mathematics
68
(1-2), 1996, pp. 153-167
Restrictions and preassignments in preemptive open shop scheduling
D. de Werra
,
A.J. Hoffman
,
N.V.R. Mahadev
,
U.N. Peled
Discrete Applied Mathematics
68
(1-2), 1996, pp. 169-188
Augmentations of consistent partial orders for the one-machine total tardiness problem
Wenci Yu
Discrete Applied Mathematics
68
(1-2), 1996, pp. 189-202
Stable matchings with couples
Brian Aldershof
,
Olivia M. Carducci
Discrete Applied Mathematics
68
(1-2), 1996, pp. 203-207
Decision theory and discrete mathematics
Peter C. Fishburn
Discrete Applied Mathematics
68
(3), 1996, pp. 209-221
Finding regular subgraphs in both arbitrary and planar graphs
Iain A. Stewart
Discrete Applied Mathematics
68
(3), 1996, pp. 223-235
Decomposition of a bidirected graph into strongly connected components and its signed poset structure
Kazutoshi Ando
,
Satoru Fujishige
,
Toshio Nemoto
Discrete Applied Mathematics
68
(3), 1996, pp. 237-248
On the Steiner median of a tree
Lowell W. Beineke
,
Ortrud R. Oellermann
,
Raymond E. Pippert
Discrete Applied Mathematics
68
(3), 1996, pp. 249-258
Incidence graphs of biacyclic hypergraphs
Feodor F. Dragan
,
Vitaly I. Voloshin
Discrete Applied Mathematics
68
(3), 1996, pp. 259-266
Maximal irredundant functions
G.H. Fricke
,
S.T. Hedetniemi
,
D.P. Jacobs
Discrete Applied Mathematics
68
(3), 1996, pp. 267-277
The forwarding index of directed networks
Yannnis Manoussakis
,
Zsolt Tuza
Discrete Applied Mathematics
68
(3), 1996, pp. 279-291
The parity path problem on some subclasses of perfect graphs
C.R. Satyan
,
C. Pandu Rangan
Discrete Applied Mathematics
68
(3), 1996, pp. 293-302