Travelled to:1 × Spain
1 × United Kingdom
4 × USA
Collaborated with:X.Hu H.Wang X.Wu J.Xu Y.Zhang D.A.Antonelli T.J.Dysart X.S.Hu A.B.Kahng P.M.Kogge R.C.Murphy M.T.Niemier
Talks about:problem (2) polygon (2) minim (2) floorplan (1) algorithm (1) shortest (1) cellular (1) automata (1) approxim (1) schedul (1)
Person: Danny Z. Chen
DBLP: Chen:Danny_Z=
Contributed to:
2012
200420022002
20001996Wrote 6 papers:
- ICALP-v1-2012-ChenW
- Computing the Visibility Polygon of an Island in a Polygonal Domain (DZC, HW), pp. 218–229.
- DAC-2004-AntonelliCDHKKMN #automaton #clustering #modelling #problem
- Quantum-Dot Cellular Automata (QCA) circuit partitioning: problem modeling and solutions (DAA, DZC, TJD, XSH, ABK, PMK, RCM, MTN), pp. 363–368.
- DAC-2002-ZhangHC #energy #scheduling
- Task scheduling and voltage selection for energy minimization (YZ, XH, DZC), pp. 183–188.
- ICALP-2002-WuC #problem
- Optimal Net Surface Problems with Applications (XW, DZC), pp. 1029–1042.
- STOC-2000-ChenX #graph #query
- Shortest path queries in planar graphs (DZC, JX), pp. 469–478.
- DAC-1996-ChenH #algorithm #approximate #performance
- Efficient Approximation Algorithms for Floorplan Area Minimization (DZC, XH), pp. 483–486.