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: Author="Dyer, M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A random polynomial time algorithm for approximating the volume of convex bodies
M. Dyer
,
A. Frieze
,
R. Kannan
Journal of the ACM
38
(1), 1991, January, pp. 1-17
On an optimization problem with nested constraints
M.E. Dyer
,
A.M. Frieze
Discrete Applied Mathematics
26
, 1990, pp. 159-173
The solution of some random
NP
-hard problems in polynomial expected time
M.E. Dyer
,
A.M. Frieze
Journal of Algorithms
10
, 1989, pp. 451-489
On the complexity of computing the volume of a polyhedron
M.E. Dyer
,
A.M. Frieze
SIAM Journal on Computing
17
, 1988, pp. 967-974
Fast solution of some random
NP
-hard problems
M.E. Dyer
,
A.M. Frieze
Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, FOCS'86 (Toronto, Canada, October 27-29, 1986)
, 1986, pp. 331-336
Planar 3DM is
NP
-complete
M.E. Dyer
,
A.M. Frieze
Journal of Algorithms
7
(2), 1986, June, pp. 174-184
On a multidimensional search technique and its application to the Euclidean one-centre problem
M.E. Dyer
SIAM Journal on Computing
15
(3), 1986, August, pp. 725-738
On the complexity of partitioning graphs into connected subgraphs
M.E. Dyer
,
A.M. Frieze
Discrete Applied Mathematics
10
, 1985, pp. 139-153
A partitioning algorithm for minimum weighted Euclidean matching
M.E. Dyer
,
A.M. Frieze
Information Processing Letters
18
(2), 1984, February, pp. 59-62
Linear time algorithms for two- and three-variable linear programs
M.E. Dyer
SIAM Journal on Computing
13
(1), 1984, February, pp. 31-45