( en | de | ru )

 

Disambiguation of "Chen, Danny Z."

Author of the publication

copydeleteadd this publication to your clipboard
Locating an obnoxious Line among Planar Objects.

, and . Int. J. Comput. Geom. Appl., 22 (5): 391-406 (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Danny Bachfeld

Analyse des Hygienestatus im Zentrum für Zahn-, Mund- und Kieferheilkunde der Universität Greifswald, ergänzt durch eine experimentelle Studie zur Wirkung von Guanidinthiocyanat auf Nickel-Titan-Instrumente. Uni Greifswald, (2009)

Z Taufig

Danny Schulze

Danny Bot

Danny Fritzsch

 

Other publications of authors with the same name

Computing L1 Shortest Paths among Polygonal Obstacles in the Plane, and . CoRR, (2012)Representing a Functional Curve by Curves with Fewer Peaks., , and . Discret. Comput. Geom., 46 (2): 334-360 (2011)Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain., , , and . SWAT, volume 7357 of Lecture Notes in Computer Science, page 177-188. Springer, (2012)Representing a Functional Curve by Curves with Fewer Peaks., , and . SWAT, volume 6139 of Lecture Notes in Computer Science, page 200-211. Springer, (2010)Computing Maximum Non-crossing Matching in Convex Bipartite Graphs., , and . FAW-AAIM, volume 7285 of Lecture Notes in Computer Science, page 105-116. Springer, (2012)Algorithms for Interval Structures with Applications., and . FAW-AAIM, volume 6681 of Lecture Notes in Computer Science, page 196-207. Springer, (2011)On Approximating the Maximum Simple Sharing Problem., , , , and . ISAAC, volume 4288 of Lecture Notes in Computer Science, page 547-556. Springer, (2006)Parallel Algorithms for Longest Increasing Chains in the Plane and Related Problems., , and . Parallel Process. Lett., 9 (4): 511-520 (1999)Locating an obnoxious Line among Planar Objects., and . Int. J. Comput. Geom. Appl., 22 (5): 391-406 (2012)On Geometric Path Query Problems., , and . Int. J. Comput. Geom. Appl., 11 (6): 617-645 (2001)