Ding-Zhu Du

Ding-Zhu Du
Born (1948-05-21) May 21, 1948
Scientific career
Fields Computer algorithms
Institutions University of Texas at Dallas
Website Ding-Zhu Du

Ding-Zhu Du (born May 21, 1948) is a Professor in the Department of Computer Science at The University of Texas at Dallas.[1] He has received public recognition when he solved two long-standing open problems on the Euclidean minimum Steiner trees,[2] the proof of Gilbert-Pollak's conjecture on the Steiner ratio, and the existence of a polynomial-time heuristic with a performance ratio bigger than the Steiner ratio.[3]

Education

Ding-Zhu Du received his M.Sc in Operations Research from the Chinese Academy of Sciences in 1985. He received his Ph.D. in Mathematics with research area in Theoretical Computer Science from the University of California, Santa Barbara in 1984.[1]

Career

Early in his career he solved two long-standing open problems on the Euclidean minimum Steiner trees, the proof of Gilbert-Pollak's conjecture on the Steiner ratio, and the existence of a polynomial-time heuristic with a performance ratio bigger than the Steiner ratio.[2]

He was Program Director for CISE/CCF, National Science Foundation, USA, 2002-2005,[4] Professor, Department of Computer Science, University of Minnesota, 1991-2005.[5] and Assistant Professor, Department of Mathematics, Massachusetts Institute of Technology, 1986-1987.

He has been active in research on Design and Analysis of Approximation Algorithm for 30 years. And over these years he has published 177 Journal articles, 60 conference and workshop papers, 22 editorship, 9 reference works and 11 informal publications.[6]

Books published

  • Theory of Computational Complexity.[7]
  • Problem Solving in Automata, Languages, and Complexity.[8]
  • Pooling Designs and Nonadaptive Group Testing.[9]
  • Mathematical Theory of Optimization.[10]
  • Combinatorial Group Testing and Its Applications (2nd Edition).[11]
  • Connected Dominating Set: Theory and Applications.[12]
  • Design and Analysis of Approximation Algorithms.[13]
  • Steiner Tree Problems In Computer Communication Networks.[14]

Awards and honors

  • 2003 Received the Best Paper Award from the 22nd IEEE International Performance, Computing, and Communication Conference at Phoenix, Arizona, USA, April 9–11.[15]
  • 1998 Received CSTS Prize from INFORMS (a merge of American Operations Research Society and Institute of Management Science) for research excellence in the interface between Operations Research and Computer Science
  • 1990-1991 The proof of Gilbet-Pollak conjecture was reported in The New York Times.[2]

References

  1. 1 2 "Du, Ding-Zhu - Department of Computer Science - The University of Texas at Dallas – Erik Jonsson School of Engineering and Computer Science". cs.utdallas.edu. Retrieved 2018-02-16.
  2. 1 2 3 Kolata, Gina (1990-10-30). "Solution to Old Puzzle: How Short a Shortcut?". The New York Times. ISSN 0362-4331. Retrieved 2018-02-16.
  3. ↑ "PROOF OF GILBERT-POLLAK CONJECTURE" (PDF).
  4. ↑ "National Science Foundation" (PDF). National Science foundation.
  5. ↑ "Ding-Zhu Du - The Mathematics Genealogy Project". www.genealogy.math.ndsu.nodak.edu. Retrieved 2018-02-16.
  6. ↑ "dblp: Ding-Zhu Du". dblp.org. Retrieved 2018-02-16.
  7. ↑ Du,, Dingzhu. Theory of computational complexity. Ko, Ker-I, (Second ed.). Hoboken, New Jersey. ISBN 0471345067. OCLC 864753086.
  8. ↑ Du,, Dingzhu (2001). Problem solving in automata, languages, and complexity. Ko, Ker-I. New York: Wiley. ISBN 0471439606. OCLC 53229117.
  9. ↑ Du,, Dingzhu (2006). Pooling designs and nonadaptive group testing : important tools for DNA sequencing. Hwang, Frank. New Jersey: World Scientific. ISBN 9812568220. OCLC 285162303.
  10. ↑ Mathematical theory of optimization. Du, Dingzhu., Pardalos, P. M. (Panos M.), 1954-, Wu, Weili. Dordrecht: Kluwer Academic. 2001. ISBN 1402000154. OCLC 47716389.
  11. ↑ Du,, Dingzhu (2000). Combinatorial group testing and its applications. Hwang, Frank. (2nd ed.). Singapore: World Scientific. ISBN 9810241070. OCLC 42421028.
  12. ↑ Du,, Dingzhu. (2013). Connected dominating set : theory and applications. Wan, Peng-Jun, 1970-. New York: Springer Science+Business Media. ISBN 9781461452423. OCLC 819816599.
  13. ↑ Du, Dingzhu (2012). Design and analysis of approximation algorithms. Ko, Ker-I., Hu, Xiaodong, 1962-. New York, NY: Springer. ISBN 1461417015. OCLC 765365870.
  14. ↑ Du,, Dingzhu (2008). Steiner tree problems in computer communication networks. Hu, Xiaodong. Hackensack, NJ: World Scientific. ISBN 9812791442. OCLC 263426948.
  15. ↑ "Conference Proceedings of the 2003 IEEE International Performance, Computing, and Communications Conference (Cat. No.03CH37463)". Conference Proceedings of the 2003 IEEE International Performance, Computing, and Communications Conference, 2003. April 2003. doi:10.1109/PCCC.2003.1201985.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.