| An approximation algorithm for scheduling malleable tasks under general precedence constraints K Jansen, H Zhang ACM Transactions on Algorithms (TALG) 2 (3), 416-434, 2006 | 69 | 2006 |
| Scheduling malleable tasks with precedence constraints K Jansen, H Zhang Proceedings of the seventeenth annual ACM symposium on Parallelism in …, 2005 | 43 | 2005 |
| Scheduling malleable tasks with precedence constraints K Jansen, H Zhang Journal of Computer and System Sciences 78 (1), 245-259, 2012 | 42 | 2012 |
| Approximation algorithms for general packing problems with modified logarithmic potential function K Jansen, H Zhang Proceedings of the IFIP 17th World Computer Congress-TC1 Stream/2nd IFIP …, 2002 | 42 | 2002 |
| An approximation algorithm for the multicast congestion problem via minimum Steiner trees K Jansen, H Zhang Proceedings of the 3rd International Workshop on Approximation and …, 2002 | 29 | 2002 |
| Approximation algorithms for general packing problems and their application to the multicast congestion problem K Jansen, H Zhang Mathematical Programming 114 (1), 183-206, 2008 | 24 | 2008 |
| The range assignment problem in static ad-hoc networks on metric spaces D Ye, H Zhang Structural Information and Communication Complexity, 291-302, 2004 | 22 | 2004 |
| On routing in VLSI design and communication networks T Terlaky, A Vannelli, H Zhang Discrete Applied Mathematics 156 (11), 2178-2194, 2008 | 16 | 2008 |
| Approximation algorithms for min-max resource sharing and malleable tasks scheduling H Zhang PhD thesis, University of Kiel, Germany, 2004 | 15 | 2004 |
| On routing in VLSI design and communication networks T Terlaky, A Vannelli, H Zhang Algorithms and Computation, 1051-1060, 2005 | 12 | 2005 |
| Transition Probability Matrix Methodology for Incremental Risk Charge T Yavin, H Zhang, E Wang, M Clayton Journal of Financial Engineering 1 (1), 2014 | 11 | 2014 |
| Global routing in VLSI design: algorithms, theory, and computational practice A Deza, C Dickson, T Terlaky, A Vanelli, H Zhang Journal of Combinatorial Mathematics and Combinatorial Computing 80, 71-93, 2008 | 11* | 2008 |
| Implementation of approximation algorithms for the multicast congestion problem Q Lu, H Zhang Experimental and Efficient Algorithms, 285-294, 2005 | 11 | 2005 |
| Packing trees in communication networks M Saad, T Terlaky, A Vannelli, H Zhang Journal of combinatorial optimization 16 (4), 402-423, 2008 | 9 | 2008 |
| A Note on Discounting and Funding Value Adjustments for Derivatives HZ M Han, Y He Journal of Financial Engineering 1 (1), 34, 2014 | 6* | 2014 |
| An approximation algorithm for scheduling malleable tasks under general precedence constraints K Jansen, H Zhang International Symposium on Algorithms and Computation, 236-245, 2005 | 6 | 2005 |
| Assign ranges in general ad-hoc networks J Chlebíková, D Ye, H Zhang Algorithmic Applications in Management, 769-772, 2005 | 6 | 2005 |
| Packing: scheduling, embedding, and approximating metrics H Zhang International Conference on Computational Science and Its Applications, 764-775, 2004 | 6 | 2004 |
| Assign ranges in general ad-hoc networks J Chlebíková, D Ye, H Zhang Journal of Parallel and Distributed Computing 66 (4), 489-498, 2006 | 5 | 2006 |
| A provably good global routing algorithm in multilayer IC and MCM layout designs M Saad, T Terlaky, A Vannelli, H Zhang Operations Research and Cyber-Infrastructure, 443-454, 2009 | 3* | 2009 |
Klaus JansenProfessor, Computer Science, University of KielVerificeret mail på informatik.uni-kiel.de
