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
[1]
Hilfe
Suche: Author="Chen, D.Z."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Efficiently approximating polygonal paths in three and higher dimensions
G. Barequet
,
D.Z. Chen
,
O. Daescu
,
M.T. Goodrich
,
J. Snoeyink
Algorithmica
33
(2), 2002, pp. 150-167
Parallel algorithms for maximum matching in complements of interval graphs and related problems
M.G. Andrews
,
M.J. Atallah
,
D.Z. Chen
,
D.T. Lee
Algorithmica
26
(2), 2000, pp. 263-289
Parallel algorithms for partitioning sorted sets and related problems
D.Z. Chen
,
W. Chen
,
K. Wada
,
K. Kawaguchi
Algorithmica
28
, 2000, pp. 217-241
An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
M.J. Atallah
,
D.Z. Chen
,
D.T. Lee
Algorithmica
14
, 1995, pp. 429-441
An optimal parallel algorithm for the visibility of a simple polygon from a point
M.J. Atallah
,
D.Z. Chen
,
H. Wagener
Journal of the ACM
38
(3), 1991, July, pp. 516-533