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=64
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A multifacility location problem on median spaces
Victor Chepoi
Discrete Applied Mathematics
64
, 1996, pp. 1-29
Robust universal complete coded for transmission and compression
Aviezri S. Fraenkel
,
Shmuel T. Klein
Discrete Applied Mathematics
64
, 1996, pp. 31-55
On 4-connected claw-free well-covered graphs
Bert Hartnell
,
Michael D. Plummer
Discrete Applied Mathematics
64
, 1996, pp. 57-65
No-hole
k
-tuple
(r+1)
-distant colorings
Denise Sakai Troxell
Discrete Applied Mathematics
64
, 1996, pp. 67-85
No-hole
k
-tuple
(r+1)
-distant colorings of odd cycles
David R. Guichard
Discrete Applied Mathematics
64
, 1996, pp. 87-92
Strongly polynomial simplex algorithm for bipartite vertex packing
Ronald D. Armstrong
,
Zhiying Jin
Discrete Applied Mathematics
64
, 1996, pp. 97-103
Gossiping with multiple sends and receives
A. Bagchi
,
E.F. Schmeichel
,
S.L. Hakimi
Discrete Applied Mathematics
64
, 1996, pp. 105-116
Coronoid systems with perfect matchings
Rong-si Chen
Discrete Applied Mathematics
64
, 1996, pp. 117-133
Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs
M.V. Marathe
,
H.B. Hunt III
,
S.S. Ravi
Discrete Applied Mathematics
64
, 1996, pp. 135-149
On edge-colored interior planar graphs on a circle and the expected number of RNA secondary structures
Alon Orlitsky
,
Santosh S. Venkatesh
Discrete Applied Mathematics
64
, 1996, pp. 151-178
On a partition into convex polygons
Masatsugu Urabe
Discrete Applied Mathematics
64
, 1996, pp. 179-191
Short disjoint cycles in graphs with degree constraints
Andreas Brandstädt
,
Heinz-Jürgen Voss
Discrete Applied Mathematics
64
, 1996, pp. 197-205
Finding Hamiltonian cycles in Delaunay triangulations is
NP
-complete
Michael B. Dillencourt
Discrete Applied Mathematics
64
, 1996, pp. 207-217
The basic cyclic scheduling problem with linear precedence constraints
A. Munier
Discrete Applied Mathematics
64
, 1996, pp. 239-248
Diameter-vulnerability of large bipartite digraphs
C. Padró
,
P. Morillo
,
E. Llobet
Discrete Applied Mathematics
64
, 1996, pp. 239-248
Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM
G. Sajith
,
Sanjeev Saxena
Discrete Applied Mathematics
64
, 1996, pp. 249-265
Design of a
d
-connected digraph with a minimum number of edges and a quasiminimal diameter: II
Terunao Soneoka
,
Makoto Imase
,
Yoshifumi Manabe
Discrete Applied Mathematics
64
, 1996, pp. 267-279
Triangulating graphs without asteroidal triples
Rolf H. Möhring
Discrete Applied Mathematics
64
, 1996, pp. 281-287