| 2009 |
| 152 | Guest Editors' Forward. Danny Z. Chen, D. T. Lee. Algorithmica (53): 155-156 (2009). Web SearchBibTeXDownload |
| 151 | Processing an Offline Insertion-Query Sequence with Applications. Danny Z. Chen, Haitao Wang. FAW 2009, 141-152. Web SearchBibTeXDownload |
| 150 | Editors' Foreword. Susanne E. Hambrusch, D. T. Lee. Int. J. Comput. Geometry Appl. (19): 213-214 (2009). Web SearchBibTeXDownload |
| 149 | Geometric Algorithms for the Constrained 1-d k-Means Clustering Problems and IMRT Applications. Danny Z. Chen, Mark A. Healy, Chao Wang, Bin Xu. Int. J. Found. Comput. Sci. (20): 361-377 (2009). Web SearchBibTeXDownload |
| 2008 |
| 148 | New Algorithms for Online Rectangle Filling with k-Lookahead. Haitao Wang, Amitabh Chaudhary, Danny Z. Chen. COCOON 2008, 385-394. Web SearchBibTeXDownload |
| 147 | Sphere Packing Problem. Danny Z. Chen. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload |
| 146 | Coupled Path Planning, Region Optimization, and Applications in Intensity-Modulated Radiation Therapy. Danny Z. Chen, Shuang Luan, Chao Wang. ESA 2008, 271-283. Web SearchBibTeXDownload |
| 145 | Stabbing Convex Polygons with a Segment or a Polygon. Pankaj K. Agarwal, Danny Z. Chen, Shashidhara K. Ganjugunte, Ewa Misiolek, Micha Sharir, Kai Tang. ESA 2008, 52-63. Web SearchBibTeXDownload |
| 144 | Optimal Field Splitting, with Applications in Intensity-Modulated Radiation Therapy. Danny Z. Chen, Chao Wang. FAW 2008, 4-15. Web SearchBibTeXDownload |
| 143 | Optimal Surface Flattening. Danny Z. Chen, Ewa Misiolek. FAW 2008, 233-244. Web SearchBibTeXDownload |
| 142 | Mountain Reduction, Block Matching, and Applications in Intensity-Modulated Radiation Therapy. Danny Z. Chen, Xiaobo Sharon Hu, Chao Wang, Shuang Luan, Xiaodong Wu. Int. J. Comput. Geometry Appl. (18): 63-106 (2008). Web SearchBibTeXDownload |
| 141 | Free-Form Surface Partition in 3-D. Danny Z. Chen, Ewa Misiolek. ISAAC 2008, 520-531. Web SearchBibTeXDownload |
| 2007 |
| 140 | Hardware Acceleration for 3-D Radiation Dose Calculation. Bo Zhou, Xiaobo Sharon Hu, Danny Z. Chen, Cedric X. Yu. ASAP 2007, 290-295. Web SearchBibTeXDownload |
| 139 | Finding Many Optimal Paths Without Growing Any Optimal Path Trees. Danny Z. Chen, Ewa Misiolek. COCOON 2007, 232-242. Web SearchBibTeXDownload |
| 138 | A New Field Splitting Algorithm for Intensity-Modulated Radiation Therapy. Danny Z. Chen, Mark A. Healy, Chao Wang, Xiaodong Wu. COCOON 2007, 4-15. Web SearchBibTeXDownload |
| 137 | Geometric Algorithms for the Constrained 1-D K -Means Clustering Problems and IMRT Applications. Danny Z. Chen, Mark A. Healy, Chao Wang, Bin Xu. FAW 2007, 1-13. Web SearchBibTeXDownload |
| 136 | Predicting Protein-Protein Interactions from Protein Domains Using a Set Cover Approach. Chengbang Huang, Faruck Morcos, Simon P. Kanaan, Stefan Wuchty, Danny Z. Chen, Jesús A. Izaguirre. IEEE/ACM Trans. Comput. Biology Bioinform. (4): 78-87 (2007). Web SearchBibTeXDownload |
| 135 | Fabricatable Interconnect and Molecular QCA Circuits. Amitabh Chaudhary, Danny Z. Chen, Xiaobo Sharon Hu, Michael T. Niemier, Ramprasad Ravichandran, Kevin Whitton. IEEE Trans. on CAD of Integrated Circuits and Systems (26): 1978-1991 (2007). Web SearchBibTeXDownload |
| 134 | The Layered Net Surface Problems in Discrete Geometry and Medical Image Segmentation. Xiaodong Wu, Danny Z. Chen, Kang Li, Milan Sonka. Int. J. Comput. Geometry Appl. (17): 261-296 (2007). Web SearchBibTeXDownload |
| 133 | Density-Based Data Clustering Algorithms for Lower Dimensions Using Space-Filling Curves. Bin Xu, Danny Z. Chen. PAKDD 2007, 997-1005. Web SearchBibTeXDownload |
| 132 | Approximating the Maximum Sharing Problem. Amitabh Chaudhary, Danny Z. Chen, Rudolf Fleischer, Xiaobo Sharon Hu, Jian Li, Michael T. Niemier, Zhiyi Xie, Hong Zhu. WADS 2007, 52-63. Web SearchBibTeXDownload |
| 131 | Online Rectangle Filling. Haitao Wang, Amitabh Chaudhary, Danny Z. Chen. WAOA 2007, 274-287. Web SearchBibTeXDownload |
| 2006 |
| 130 | A Leaf Sequencing Software for Intensity-Modulated Radiation Therapy. Shuang Luan, Chao Wang, Danny Z. Chen, Xiaobo Sharon Hu. CBMS 2006, 3-8. Web SearchBibTeXDownload |
| 129 | Traversing the Machining Graph. Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao Wang, Hong Zhu. ESA 2006, 220-231. Web SearchBibTeXDownload |
| 128 | An FPGA Solution for Radiation Dose Calculation. Kevin Whitton, Xiaobo Sharon Hu, Cedric X. Yu, Danny Z. Chen. FCCM 2006, 227-236. Web SearchBibTeXDownload |
| 127 | Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic Approach. Kang Li, Xiaodong Wu, Danny Z. Chen, Milan Sonka. IEEE Trans. Pattern Anal. Mach. Intell. (28): 119-134 (2006). Web SearchBibTeXDownload |
| 126 | Two flow network simplification algorithms. Ewa Misiolek, Danny Z. Chen. Inf. Process. Lett. (97): 197-202 (2006). Web SearchBibTeXDownload |
| 125 | Generalized Geometric Approaches for Leaf Sequencing Problems in Radiation Therapy. Danny Z. Chen, Xiaobo Sharon Hu, Shuang Luan, Shahid A. Naqvi, Chao Wang, Cedric X. Yu. Int. J. Comput. Geometry Appl. (16): 175-204 (2006). Web SearchBibTeXDownload |
| 124 | Minimum Area Convex Packing of Two Convex Polygons. Kai Tang, Charlie C. L. Wang, Danny Z. Chen. Int. J. Comput. Geometry Appl. (16): 41-74 (2006). Web SearchBibTeXDownload |
| 123 | On Approximating the Maximum Simple Sharing Problem. Danny Z. Chen, Rudolf Fleischer, Jian Li, Zhiyi Xie, Hong Zhu. ISAAC 2006, 547-556. Web SearchBibTeXDownload |
| 122 | Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy. Danny Z. Chen, Xiaobo Sharon Hu, Shuang Luan, Ewa Misiolek, Chao Wang. ISAAC 2006, 701-711. Web SearchBibTeXDownload |
| 121 | Field Splitting Problems in Intensity-Modulated Radiation Therapy. Danny Z. Chen, Chao Wang. ISAAC 2006, 690-700. Web SearchBibTeXDownload |
| 120 | Construction of the nearest neighbor embracing graph of a point set. Mee Yee Chan, Danny Z. Chen, Francis Y. L. Chin, Cao An Wang. J. Comb. Optim. (11): 435-443 (2006). Web SearchBibTeXDownload |
| 2005 |
| 119 | Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation Therapy. Danny Z. Chen, Xiaobo Hu, Shuang Luan, Xiaodong Wu, Cedric X. Yu. Algorithmica (42): 265-288 (2005). Web SearchBibTeXDownload |
| 118 | Efficient Algorithms for Simplifying Flow Networks. Ewa Misiolek, Danny Z. Chen. COCOON 2005, 737-746. Web SearchBibTeXDownload |
| 117 | Polygonal path simplification with angle constraints. Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Ningfang Mi, Jack Snoeyink. Comput. Geom. (32): 173-187 (2005). Web SearchBibTeXDownload |
| 116 | Eliminating wire crossings for molecular quantum-dot cellular automata implementation. Amitabh Chaudhary, Danny Z. Chen, Kevin Whitton, Michael T. Niemier, Ramprasad Ravichandran. ICCAD 2005, 565-571. Web SearchBibTeX |
| 115 | Geometric Algorithms for Density-based Data Clustering. Danny Z. Chen, Michiel H. M. Smid, Bin Xu. Int. J. Comput. Geometry Appl. (15): 239-260 (2005). Web SearchBibTeXDownload |
| 114 | Simultaneous Segmentation of Multiple Closed Surfaces Using Optimal Graph Searching. Kang Li, Steven Millington, Xiaodong Wu, Danny Z. Chen, Milan Sonka. IPMI 2005, 406-417. Web SearchBibTeXDownload |
| 113 | The Layered Net Surface Problems in Discrete Geometry and Medical Image Segmentation. Xiaodong Wu, Danny Z. Chen, Kang Li, Milan Sonka. ISAAC 2005, 17-27. Web SearchBibTeXDownload |
| 112 | Generalized Geometric Approaches for Leaf Sequencing Problems in Radiation Therapy. Danny Z. Chen, Xiaobo Sharon Hu, Shuang Luan, Shahid A. Naqvi, Chao Wang, Cedric X. Yu. ISAAC 2005, 1176-1186. Web SearchBibTeXDownload |
| 111 | Efficient Algorithms and Implementations for Optimizing the Sum of Linear Fractional Functions, with Applications. Danny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu. J. Comb. Optim. (9): 69-90 (2005). Web SearchBibTeXDownload |
| 110 | Mountain reduction, block matching, and applications in intensity-modulated radiation therapy. Danny Z. Chen, Xiaobo Sharon Hu, Chao Wang, Xiaodong Wu. Symposium on Computational Geometry 2005, 35-44. Web SearchBibTeXDownload |
| 2004 |
| 109 | Optimizing The Lazy DFA Approach for XML Stream Processing. Danny Z. Chen, Raymond K. Wong. ADC 2004, 131-140. Web SearchBibTeXDownload |
| 108 | Efficient Algorithms for Approximating a Multi-dimensional Voxel Terrain by a Unimodal Terrain. Danny Z. Chen, Jinhee Chun, Naoki Katoh, Takeshi Tokuyama. COCOON 2004, 238-248. Web SearchBibTeXDownload |
| 107 | Approximation Algorithms for Multicommodity Flow and Normalized Cut Problems: Implementations and Experimental Study. Ying Du, Danny Z. Chen, Xiaodong Wu. COCOON 2004, 112-121. Web SearchBibTeXDownload |
| 106 | Geometric permutations of higher dimensional spheres. Yingping Huang, Jinhui Xu, Danny Z. Chen. Comput. Geom. (29): 47-60 (2004). Web SearchBibTeXDownload |
| 105 | Globally Optimal Segmentation of Interacting Surfaces with Geometric Constraints. Kang Li, Xiaodong Wu, Danny Z. Chen, Milan Sonka. CVPR (1) 2004, 394-399. Web SearchBibTeXDownload |
| 104 | Quantum-Dot Cellular Automata (QCA) circuit partitioning: problem modeling and solutions. Dominic A. Antonelli, Danny Z. Chen, Timothy J. Dysart, Xiaobo Sharon Hu, Andrew B. Kahng, Peter M. Kogge, Richard C. Murphy, Michael T. Niemier. DAC 2004, 363-368. Web SearchBibTeXDownload |
| 103 | Geometric algorithms for static leaf sequencing problems in radiation therapy. Danny Z. Chen, Xiaobo Hu, Shuang Luan, Chao Wang, Xiaodong Wu. Int. J. Comput. Geometry Appl. (14): 311-339 (2004). Web SearchBibTeXDownload |
| 102 | Efficient approximation algorithms for pairwise data clustering and applications. Xiaodong Wu, Danny Z. Chen, James J. Mason, Steven R. Schmid. Int. J. Comput. Geometry Appl. (14): 85-104 (2004). Web SearchBibTeXDownload |
| 101 | Generalized Geometric Approaches for Leaf Sequencing Problems in Radiation Therapy. Danny Z. Chen, Xiaobo Sharon Hu, Shuang Luan, Shahid A. Naqvi, Chao Wang, Cedric X. Yu. ISAAC 2004, 271-281. Web SearchBibTeXDownload |
| 100 | Construction of the Nearest Neighbor Embracing Graph of a Point Set. Mee Yee Chan, Danny Z. Chen, Francis Y. L. Chin, Cao An Wang. SWAT 2004, 150-160. Web SearchBibTeXDownload |
| 2003 |
| 99 | Efficient Algorithms for k-Terminal Cuts on Planar Graphs. Danny Z. Chen, Xiaodong Wu. Algorithmica (38): 299-316 (2003). Web SearchBibTeXDownload |
| 98 | Efficient Parallel Algorithms for Planar st-Graphs. Mikhail J. Atallah, Danny Z. Chen, Ovidiu Daescu. Algorithmica (35): 194-215 (2003). Web SearchBibTeXDownload |
| 97 | Pairwise Data Clustering and Applications. Xiaodong Wu, Danny Z. Chen, James J. Mason, Steven R. Schmid. COCOON 2003, 455-466. Web SearchBibTeXDownload |
| 96 | Geometric Algorithms for Agglomerative Hierarchical Clustering. Danny Z. Chen, Bin Xu. COCOON 2003, 30-39. Web SearchBibTeXDownload |
| 95 | Topological Peeling and Applications. Danny Z. Chen, Shuang Luan, Jinhui Xu. Int. J. Comput. Geometry Appl. (13): 135-172 (2003). Web SearchBibTeXDownload |
| 94 | Space-Efficient Algorithms for Approximating Polygonal Curves in Two-Dimensional Space. Danny Z. Chen, Ovidiu Daescu. Int. J. Comput. Geometry Appl. (13): 95-111 (2003). Web SearchBibTeXDownload |
| 93 | Finding an optimal path without growing the tree. Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu. J. Algorithms (49): 13-41 (2003). Web SearchBibTeXDownload |
| 92 | Computing Optimal Beams in Two and Three Dimensions. Danny Z. Chen, Xiaobo Hu, Jinhui Xu. J. Comb. Optim. (7): 111-136 (2003). Web SearchBibTeXDownload |
| 91 | Geometric algorithms for static leaf sequencing problems in radiation therapy. Danny Z. Chen, Xiaobo Hu, Shuang Luan, Chao Wang, Xiaodong Wu. Symposium on Computational Geometry 2003, 88-97. Web SearchBibTeXDownload |
| 2002 |
| 90 | Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. Gill Barequet, Michael T. Goodrich, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink. Algorithmica (33): 150-167 (2002). Web SearchBibTeXDownload |
| 89 | An Experimental Study and Comparison of Topological Peeling and Topological Walk. Danny Z. Chen, Shuang Luan, Jinhui Xu. COCOON 2002, 456-466. Web SearchBibTeXDownload |
| 88 | Two-variable linear programming in parallel. Danny Z. Chen, Jinhui Xu. Comput. Geom. (21): 155-165 (2002). Web SearchBibTeX |
| 87 | Task scheduling and voltage selection for energy minimization. Yumin Zhang, Xiaobo Hu, Danny Z. Chen. DAC 2002, 183-188. Web SearchBibTeXDownload |
| 86 | Geometric Algorithms for Density-Based Data Clustering. Danny Z. Chen, Michiel H. M. Smid, Bin Xu. ESA 2002, 284-296. Web SearchBibTeXDownload |
| 85 | Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation Therapy. Danny Z. Chen, Xiaobo Hu, Shuang Luan, Xiaodong Wu, Cedric X. Yu. ESA 2002, 270-283. Web SearchBibTeXDownload |
| 84 | Optimal Net Surface Problems with Applications. Xiaodong Wu, Danny Z. Chen. ICALP 2002, 1029-1042. Web SearchBibTeXDownload |
| 83 | Cell selection from technology libraries for minimizing power. Yumin Zhang, Xiaobo Sharon Hu, Danny Z. Chen. Integration (31): 133-158 (2002). Web SearchBibTeXDownload |
| 82 | Optimal Polygon Cover Problems and Applications. Danny Z. Chen, Xiaobo Hu, Xiaodong Wu. Int. J. Comput. Geometry Appl. (12): 309-338 (2002). Web SearchBibTeXDownload |
| 81 | Image Segmentation with Asteroidality/Tubularity and Smoothness Constraints. Danny Z. Chen, Jie Wang, Xiaodong Wu. Int. J. Comput. Geometry Appl. (12): 413-428 (2002). Web SearchBibTeXDownload |
| 80 | Efficient global register allocation for minimizing energy consumption. Yumin Zhang, Xiaobo Hu, Danny Z. Chen. SIGPLAN Notices (37): 42-53 (2002). Web SearchBibTeXDownload |
| 2001 |
| 79 | Efficient list-approximation techniques for floorplan area minimization. Xiaobo Hu, Danny Z. Chen, Rajeshkumar S. Sambandam. ACM Trans. Design Autom. Electr. Syst. (6): 372-400 (2001). Web SearchBibTeXDownload |
| 78 | Cell selection from technology libraries for minimizing power. Yumin Zhang, Xiaobo Sharon Hu, Danny Z. Chen. ASP-DAC 2001, 609-614. Web SearchBibTeXDownload |
| 77 | Maximum Red/Blue Interval Matching with Applications. Danny Z. Chen, Xiaobo Hu, Xiaodong Wu. COCOON 2001, 150-158. Web SearchBibTeXDownload |
| 76 | An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model. Danny Z. Chen, Jinhui Xu. Comput. Geom. (18): 155-166 (2001). Web SearchBibTeX |
| 75 | Lower bounds for computing geometric spanners and approximate shortest paths. Danny Z. Chen, Gautam Das, Michiel H. M. Smid. Discrete Applied Mathematics (110): 151-167 (2001). Web SearchBibTeX |
| 74 | On Connecting Red and Blue Rectilinear Polygonal Obstacles with Nonintersecting Monotone Rectilinear Paths. Mikhail J. Atallah, Danny Z. Chen. Int. J. Comput. Geometry Appl. (11): 373-400 (2001). Web SearchBibTeX |
| 73 | Efficient Algorithms for Optimization-Based Image Segmentation. Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama. Int. J. Comput. Geometry Appl. (11): 145-166 (2001). Web SearchBibTeX |
| 72 | On Geometric Path Query Problems. Danny Z. Chen, Ovidiu Daescu, Kevin S. Klenk. Int. J. Comput. Geometry Appl. (11): 617-645 (2001). Web SearchBibTeX |
| 71 | Image Segmentation with Monotonicity and Smoothness Constraints. Danny Z. Chen, Jie Wang, Xiaodong Wu. ISAAC 2001, 467-479. Web SearchBibTeXDownload |
| 70 | Efficient Algorithms for k-Terminal Cuts on Planar Graphs. Danny Z. Chen, Xiaodong Wu. ISAAC 2001, 332-344. Web SearchBibTeXDownload |
| 69 | Topological Peeling and Implementation. Danny Z. Chen, Shuang Luan, Jinhui Xu. ISAAC 2001, 454-466. Web SearchBibTeXDownload |
| 68 | Determining an Optimal Penetration Among Weighted Regions in Two and Three Dimensions. Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Xiaodong Wu, Jinhui Xu. J. Comb. Optim. (5): 59-79 (2001). Web SearchBibTeX |
| 67 | Geometric permutations of high dimensional spheres. Yingping Huang, Jinhui Xu, Danny Z. Chen. SODA 2001, 244-245. Web SearchBibTeXDownload |
| 66 | Polygonal path approximation with angle constraints. Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Jack Snoeyink. SODA 2001, 342-343. Web SearchBibTeXDownload |
| 65 | Algorithms for congruent sphere packing and applications. Danny Z. Chen, Xiaobo Hu, Yingping Huang, Yifan Li, Jinhui Xu. Symposium on Computational Geometry 2001, 212-221. Web SearchBibTeXDownload |
| 2000 |
| 64 | Determining optimal paths in a weighted and dynamic 2D environment using framed-octrees. Bin Xu, Danny Z. Chen, Robert J. Szczerba. Agents 2000, 29-30. Web SearchBibTeXDownload |
| 63 | Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems. Marilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee. Algorithmica (26): 263-289 (2000). Web SearchBibTeXDownload |
| 62 | Parallel Algorithms for Partitioning Sorted Sets and Related Problems. Danny Z. Chen, Wei Chen, Koichi Wada, Kimio Kawaguchi. Algorithmica (28): 217-241 (2000). Web SearchBibTeXDownload |
| 61 | Optimal Beam Penetrations in Two and Three Dimensions. Danny Z. Chen, Xiaobo Hu, Jinhui Xu. ISAAC 2000, 491-502. Web SearchBibTeXDownload |
| 60 | Optimal Polygon Cover Problems and Applcations. Danny Z. Chen, Xiaobo Hu, Xiaodong Wu. ISAAC 2000, 564-576. Web SearchBibTeXDownload |
| 59 | Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane. Danny Z. Chen, Kevin S. Klenk, Hung-Yi Tu. SIAM J. Comput. (29): 1223-1246 (2000). Web SearchBibTeX |
| 58 | Optimizing the sum of linear fractional functions and applications. Danny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu. SODA 2000, 707-716. Web SearchBibTeXDownload |
| 57 | Shortest path queries in planar graphs. Danny Z. Chen, Jinhui Xu. STOC 2000, 469-478. Web SearchBibTeXDownload |
| 1999 |
| 56 | Skew Voronoi Diagrams. Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Evanthia Papadopoulou. Int. J. Comput. Geometry Appl. (9): 235 (1999). Web SearchBibTeX |
| 55 | Low energy register allocation beyond basic blocks. Yumin Zhang, Xiaobo Hu, Danny Z. Chen. ISCAS (1) 1999, 290-293. Web SearchBibTeXDownload |
| 54 | Global register allocation for minimizing energy consumption. Yumin Zhang, Xiaobo Hu, Danny Z. Chen. ISLPED 1999, 100-102. Web SearchBibTeXDownload |
| 53 | Parallel Algorithms for Longest Increasing Chains in the Plane and Related Problems. Mikhail J. Atallah, Danny Z. Chen, Kevin S. Klenk. Parallel Processing Letters (9): 511-520 (1999). Web SearchBibTeX |
| 52 | Determining an Optimal Penetration Among Weighted Regions in Two and Three Dimensions. Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Xiaodong Wu, Jinhui Xu. Symposium on Computational Geometry 1999, 322-331. Web SearchBibTeXDownload |
| 1998 |
| 51 | An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model. Danny Z. Chen, Jinhui Xu. CCCG 1998. Web SearchBibTeXDownload |
| 50 | Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space. Danny Z. Chen, Ovidiu Daescu. COCOON 1998, 45-54. Web SearchBibTeXDownload |
| 49 | Parallel Geometric Algorithms in Coarse-Grain Network Models. Mikhail J. Atallah, Danny Z. Chen. COCOON 1998, 55-64. Web SearchBibTeXDownload |
| 48 | Finding an Optimal Path without Growing the Tree. Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu. ESA 1998, 356-367. Web SearchBibTeXDownload |
| 47 | Maintaining Visibility of a Polygon with a Moving Point of View. Danny Z. Chen, Ovidiu Daescu. Inf. Process. Lett. (65): 269-275 (1998). Web SearchBibTeXDownload |
| 46 | Determining Weak Visibility of a Polygon from an Edge in Parallel. Danny Z. Chen. Int. J. Comput. Geometry Appl. (8): 277-304 (1998). Web SearchBibTeX |
| 45 | Finding the Convex Hull of Discs in Parallel. Wei Chen, Koichi Wada, Kimio Kawaguchi, Danny Z. Chen. Int. J. Comput. Geometry Appl. (8): 305-320 (1998). Web SearchBibTeX |
| 44 | Solving the all-pair shortest path query problem on interval and circular-arc graphs. Danny Z. Chen, D. T. Lee, R. Sridhar, Chandra N. Sekharan. Networks (31): 249-258 (1998). Web SearchBibTeXDownload |
| 43 | Two-Variable Linear Programming in Parallel. Danny Z. Chen, Jinhui Xu. SWAT 1998, 169-180. Web SearchBibTeXDownload |
| 1997 |
| 42 | Parallel algorithms for longest increasing chains in the plane and related problems. Mikhail J. Atallah, Danny Z. Chen, Kevin S. Klenk. CCCG 1997. Web SearchBibTeX |
| 41 | Scheduling for power reduction in a real-time system. Jason J. Brown, Danny Z. Chen, Garrison W. Greenwood, Xiaobo Hu, Richard W. Taylor. ISLPED 1997, 84-87. Web SearchBibTeXDownload |
| 40 | Voronoi Diagrams for Direction-Sensitive Distances. Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Asish Mukhopadhyay, Evanthia Papadopoulou. Symposium on Computational Geometry 1997, 418-420. Web SearchBibTeXDownload |
| 39 | On Geometric Path Query Problems. Danny Z. Chen, Ovidiu Daescu, Kevin S. Klenk. WADS 1997, 248-257. Web SearchBibTeX |
| 1996 |
| 38 | Developing Algorithms and Software for Geometric Path Planning Problems. Danny Z. Chen. ACM Comput. Surv. (28): 18 (1996). Web SearchBibTeX |
| 37 | Maintaining Visibility of a Polygon with a Moving Point of View. Danny Z. Chen, Ovidiu Daescu. CCCG 1996, 240-245. Web SearchBibTeX |
| 36 | Lower Bounds for Computing Geometric Spanners and Approximate Shortest Paths. Danny Z. Chen, Gautam Das, Michiel H. M. Smid. CCCG 1996, 155-160. Web SearchBibTeX |
| 35 | Efficient Approximation Algorithms for Floorplan Area Minimization. Danny Z. Chen, Xiaobo Hu. DAC 1996, 483-486. Web SearchBibTeXDownload |
| 34 | Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane. Srinivasa Rao Arikati, Danny Z. Chen, L. Paul Chew, Gautam Das, Michiel H. M. Smid, Christos D. Zaroliagis. ESA 1996, 514-528. Web SearchBibTeXDownload |
| 33 | Parallel Algorithms for Partitioning Sorted Sets and Related Problems. Danny Z. Chen, Wei Chen, Koichi Wada, Kimio Kawaguchi. ESA 1996, 234-245. Web SearchBibTeXDownload |
| 32 | Rectilinear Short Path Queries Among Rectangular Obstacles. Danny Z. Chen, Kevin S. Klenk. Inf. Process. Lett. (57): 313-319 (1996). Web SearchBibTeXDownload |
| 31 | Erratum: Rectilinear Short Path Queries Among Rectangular Obstacles. Danny Z. Chen, Kevin S. Klenk. Inf. Process. Lett. (60): 105 (1996). Web SearchBibTeXDownload |
| 30 | Applications of a Numbering Scheme for Polygonal Obstacles in the Plane. Mikhail J. Atallah, Danny Z. Chen. ISAAC 1996, 1-24. Web SearchBibTeXDownload |
| 29 | Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon. Danny Z. Chen. J. Algorithms (20): 459-478 (1996). Web SearchBibTeX |
| 28 | Fast and Efficient Operations on Parallel Priority Queues. Danny Z. Chen, Xiaobo Hu. Parallel Processing Letters (6): 451-467 (1996). Web SearchBibTeXDownload |
| 27 | Polynomial-Time Solutions to Image Segmentation. Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama. SODA 1996, 104-113. Web SearchBibTeX |
| 1995 |
| 26 | An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with Applications. Mikhail J. Atallah, Danny Z. Chen, D. T. Lee. Algorithmica (14): 429-441 (1995). Web SearchBibTeX |
| 25 | Optimal Parallel Hypercube Algorithms for Polygon Problems. Mikhail J. Atallah, Danny Z. Chen. IEEE Trans. Computers (44): 914-922 (1995). Web SearchBibTeX |
| 24 | Efficient Parallel Binary Search on Sorted Arrays, with Applications. Danny Z. Chen. IEEE Trans. Parallel Distrib. Syst. (6): 440-445 (1995). Web SearchBibTeXDownload |
| 23 | Efficient Geometric Algorithms on the EREW PRAM. Danny Z. Chen. IEEE Trans. Parallel Distrib. Syst. (6): 41-47 (1995). Web SearchBibTeXDownload |
| 22 | Computing the all-pairs longest chains in the plane. Mikhail J. Atallah, Danny Z. Chen. Int. J. Comput. Geometry Appl. (5): 257-271 (1995). Web SearchBibTeX |
| 21 | An optimal parallel algorithm for detecting weak visibility of a simple polygon. Danny Z. Chen. Int. J. Comput. Geometry Appl. (5): 93-124 (1995). Web SearchBibTeX |
| 20 | Parallel algorithms for maximum matching in interval graphs. Marilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee. IPPS 1995, 84-92. Web SearchBibTeXDownload |
| 19 | On the All-Pairs Euclidean Short Path Problem. Danny Z. Chen. SODA 1995, 292-301. Web SearchBibTeX |
| 18 | Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane. Danny Z. Chen, Kevin S. Klenk, Hung-Yi Tu. Symposium on Computational Geometry 1995, 370-379. Web SearchBibTeXDownload |
| 1994 |
| 17 | Determining Weak External Visibility of Polygons in Parallel. Danny Z. Chen. CCCG 1994, 375-380. Web SearchBibTeX |
| 16 | Solving the All-Pair Shortest Path Problem on Interval and Circular-Arc Graphs. Danny Z. Chen, D. T. Lee. IPPS 1994, 224-228. Web SearchBibTeX |
| 15 | Fast and Efficient Operations on Parallel Priority Queues. Danny Z. Chen, Xiaobo Hu. ISAAC 1994, 279-287. Web SearchBibTeXDownload |
| 1993 |
| 14 | On Parallel Rectilinear Obstacle-avoiding Paths. Mikhail J. Atallah, Danny Z. Chen. CCCG 1993, 210-215. Web SearchBibTeX |
| 13 | On Parallel Rectilinear Obstacle- Avoiding Paths. Mikhail J. Atallah, Danny Z. Chen. Comput. Geom. (3): 307-313 (1993). Web SearchBibTeX |
| 12 | An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with Applications. Mikhail J. Atallah, Danny Z. Chen, D. T. Lee. ESA 1993, 13-24. Web SearchBibTeXDownload |
| 11 | Testing a Simple Polygon for Monotonicity Optimally in Parallel. Danny Z. Chen, Sumanta Guha. Inf. Process. Lett. (47): 325-331 (1993). Web SearchBibTeX |
| 10 | Testing a Simple Polygon for Monotonicity Optimality in Parallel. Danny Z. Chen, Sumanta Guha. IPPS 1993, 326-330. Web SearchBibTeX |
| 9 | Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon. Danny Z. Chen. ISAAC 1993, 323-332. Web SearchBibTeXDownload |
| 8 | Optimal Parallel Hypercube Algorithms for Polygon Problems. Mikhail J. Atallah, Danny Z. Chen. SPDP 1993, 208-215. Web SearchBibTeX |
| 7 | Computing the All-Pairs Longest Chain in the Plane. Mikhail J. Atallah, Danny Z. Chen. WADS 1993, 1-13. Web SearchBibTeX |
| 1992 |
| 6 | An Optimal Parallel Algorithm for Detecting Weak Visibility of a Simple Polygon. Danny Z. Chen. Symposium on Computational Geometry 1992, 63-72. Web SearchBibTeXDownload |
| 1991 |
| 5 | Parallel Rectilinear Shortest Paths with Rectangular Obstacles. Mikhail J. Atallah, Danny Z. Chen. Comput. Geom. (1): 79-113 (1991). Web SearchBibTeX |
| 4 | An Optimal Parallel Algorithm for the Visibility of a Simple Polygon from a Point. Mikhail J. Atallah, Danny Z. Chen, Hubert Wagener. J. ACM (38): 516-533 (1991). Web SearchBibTeXDownload |
| 1990 |
| 3 | Parallel Rectilinear Shortest Paths with Rectangular Obstacles. Mikhail J. Atallah, Danny Z. Chen. SPAA 1990, 270-279. Web SearchBibTeXDownload |
| 1989 |
| 2 | An Optimal Parallel Algorithm for the Minimum Circle-Cover Problem. Mikhail J. Atallah, Danny Z. Chen. Inf. Process. Lett. (32): 159-165 (1989). Web SearchBibTeX |
| 1 | Optimal Parallel Algorithm for Visibility of a Simple Polygon from a Point. Mikhail J. Atallah, Danny Z. Chen. Symposium on Computational Geometry 1989, 114-123. Web SearchBibTeXDownload |