Optimal reduction of two-terminal directed acyclic graphs WW Bein, J Kamburowski, MFM Stallmann SIAM Journal on Computing 21 (6), 1112-1129, 1992 | 186 | 1992 |
Minimum cost flow algorithms for series-parallel networks WW Bein, P Brucker, A Tamir Discrete Applied Mathematics 10 (2), 117-124, 1985 | 83 | 1985 |
A Monge property for the d-dimensional transportation problem WW Bein, P Brucker, JK Park, PK Pathak Discrete Applied Mathematics 58 (2), 97-109, 1995 | 77 | 1995 |
Optimizing border patrol operations using unmanned aerial vehicles D Bein, W Bein, A Karki, BB Madan 2015 12th International Conference on Information Technology-New Generations …, 2015 | 52 | 2015 |
Cloud storage and online bin packing D Bein, W Bein, S Venigella Intelligent Distributed Computing V: Proceedings of the 5th International …, 2012 | 46 | 2012 |
The 3-server problem in the plane WW Bein, M Chrobak, LL Larmore Theoretical Computer Science 289 (1), 335-354, 2002 | 30 | 2002 |
The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity W Bein, MJ Golin, LL Larmore, Y Zhang ACM Transactions on Algorithms (TALG) 6 (1), 1-22, 2009 | 28 | 2009 |
Prediction of crop cultivation N Rale, R Solanki, D Bein, J Andro-Vasko, W Bein 2019 IEEE 9th Annual Computing and Communication Workshop and Conference …, 2019 | 27 | 2019 |
Block sorting is hard WW Bein, LL Larmore, S Latifi, IH Sudborough International Journal of Foundations of Computer Science 14 (03), 425-437, 2003 | 26 | 2003 |
Clustering and the biclique partition problem D Bein, L Morales, W Bein, CO Shields Jr, Z Meng, IH Sudborough Proceedings of the 41st Annual Hawaii International Conference on System …, 2008 | 23 | 2008 |
Reliability and fault tolerance of coverage models for sensor networks WW Bein, D Bein, S Malladi International Journal of Sensor Networks 5 (4), 199-209, 2009 | 22 | 2009 |
A fast asymptotic approximation scheme for bin packing with rejection W Bein, JR Correa, X Han Theoretical Computer Science 393 (1-3), 14-22, 2008 | 21 | 2008 |
Trackless online algorithms for the server problem WW Bein, LL Larmore Information Processing Letters 74 (1-2), 73-79, 2000 | 19 | 2000 |
Surface intersection using parallelism LC Chang, WW Bein, E Angel Computer aided geometric design 11 (1), 39-69, 1994 | 19 | 1994 |
Efficient data centers, cloud computing in the future of distributed computing D Bein, W Bein, S Phoha 2010 Seventh International Conference on Information Technology: New …, 2010 | 16 | 2010 |
A faster and simpler 2-approximation algorithm for block sorting WW Bein, LL Larmore, L Morales, IH Sudborough International Symposium on Fundamentals of Computation Theory, 115-124, 2005 | 15 | 2005 |
Limited bookmark randomized online algorithms for the paging problem WW Bein, R Fleischer, LL Larmore Information Processing Letters 76 (4-6), 155-162, 2000 | 15 | 2000 |
Optimal embedding of honeycomb networks into hypercubes D Bein, WW Bein, N Brajkovska, S Latifi Parallel processing letters 14 (03n04), 367-375, 2004 | 14 | 2004 |
Series parallel composition of greedy linear programming problems WW Bein, P Brucker, AJ Hoffman Mathematical programming 62, 1-14, 1993 | 14 | 1993 |
Equitable revisited W Bein, LL Larmore, J Noga Algorithms–ESA 2007: 15th Annual European Symposium, Eilat, Israel, October …, 2007 | 13 | 2007 |