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