| Parameterized computational complexity of control problems in voting systems H Liu, H Feng, D Zhu, J Luan Theoretical Computer Science 410 (27-29), 2746-2753, 2009 | 58 | 2009 |
| Faster algorithms for sorting by transpositions and sorting by block interchanges J Feng, D Zhu ACM Transactions on Algorithms (TALG) 3 (3), 25-es, 2007 | 55 | 2007 |
| Protein-protein binding site identification by enumerating the configurations F Guo, SC Li, L Wang, D Zhu BMC bioinformatics 13, 1-25, 2012 | 53 | 2012 |
| An O (n2) algorithm for signed translocation L Wang, D Zhu, X Liu, S Ma Journal of Computer and System Sciences 70 (3), 284-299, 2005 | 47 | 2005 |
| On the complexity of unsigned translocation distance D Zhu, L Wang Theoretical computer science 352 (1-3), 322-328, 2006 | 42 | 2006 |
| Parameterized complexity of control problems in maximin election H Liu, D Zhu Information Processing Letters 110 (10), 383-388, 2010 | 39 | 2010 |
| Minimum common string partition revisited H Jiang, B Zhu, D Zhu, H Zhu Journal of Combinatorial Optimization 23, 519-527, 2012 | 37 | 2012 |
| On editing graphs into 2-club clusters H Liu, P Zhang, D Zhu Frontiers in Algorithmics and Algorithmic Aspects in Information and …, 2012 | 32 | 2012 |
| An improved approximation algorithm for scaffold filling to maximize the common adjacencies N Liu, H Jiang, D Zhu, B Zhu IEEE/ACM Transactions on Computational Biology and Bioinformatics 10 (4 …, 2013 | 28 | 2013 |
| A predicting algorithm of RNA secondary structure based on stems Z Liu, H Li, D Zhu Kybernetes 39 (6), 1050-1057, 2010 | 28 | 2010 |
| A (1.5+ ε)-approximation algorithm for unsigned translocation distance Y Cui, L Wang, D Zhu, X Liu IEEE/ACM Transactions on Computational Biology and Bioinformatics 5 (1), 56-66, 2008 | 21 | 2008 |
| Approximation algorithm for bottleneck Steiner tree problem in the Euclidean plane ZM Li, DM Zhu, SH Ma Journal of Computer Science and Technology 19 (6), 791-794, 2004 | 21 | 2004 |
| A new DNA encoding method for traveling salesman problem A Han, D Zhu International Conference on Intelligent Computing, 328-335, 2006 | 18 | 2006 |
| A 1.5-approximation algorithm for two-sided scaffold filling N Liu, D Zhu, H Jiang, B Zhu Algorithmica 74 (1), 91-116, 2016 | 16 | 2016 |
| Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems H Liu, D Zhu Theoretical Computer Science 498, 115-123, 2013 | 16 | 2013 |
| A (1+ ε)-approximation algorithm for sorting by short block-moves H Jiang, D Zhu, B Zhu Theoretical Computer Science 439, 1-8, 2012 | 16* | 2012 |
| Algorithms for sorting unsigned linear genomes by the DCJ operations H Jiang, B Zhu, D Zhu Bioinformatics 27 (3), 311-316, 2011 | 16 | 2011 |
| An 5/4-approximation algorithm for sorting permutations by short block moves H Jiang, H Feng, D Zhu International Symposium on Algorithms and Computation, 491-503, 2014 | 15 | 2014 |
| An approximation algorithm for the generalized k-multicut problem P Zhang, D Zhu, J Luan Discrete Applied Mathematics 160 (7-8), 1240-1247, 2012 | 15 | 2012 |
| A new DNA-based approach to solve the maximum weight clique problem A Han, D Zhu International Conference on Intelligent Computing, 320-327, 2006 | 14 | 2006 |
