| A practical algorithm for constructing oblivious routing schemes M Bienkowski, M Korzeniowski, H Räcke Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and …, 2003 | 144 | 2003 |
| Dynamic load balancing in distributed hash tables M Bienkowski, M Korzeniowski, FM der Heide International Workshop on Peer-to-Peer Systems, 217-225, 2005 | 91 | 2005 |
| Better approximation bounds for the joint replenishment problem M Bienkowski, J Byrka, M Chrobak, Ł Jeż, D Nogneng, J Sgall Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete …, 2014 | 64 | 2014 |
| Competitive analysis for service migration in vnets M Bienkowski, A Feldmann, D Jurca, W Kellerer, G Schaffrath, S Schmid, ... Proceedings of the second ACM SIGCOMM workshop on Virtualized infrastructure …, 2010 | 59 | 2010 |
| Online strategies for intra and inter provider service migration in virtual networks D Arora, M Bienkowski, A Feldmann, G Schaffrath, S Schmid Proceedings of the 5th International Conference on Principles, Systems and …, 2011 | 44 | 2011 |
| Approximation algorithms for the joint replenishment problem with deadlines M Bienkowski, J Byrka, M Chrobak, N Dobbs, T Nowicki, M Sviridenko, ... Journal of Scheduling 18 (6), 545-560, 2015 | 42 | 2015 |
| Online algorithms for multi-level aggregation M Bienkowski, M Böhm, J Byrka, M Chrobak, C Dürr, L Folwarczný, Ł Jeż, ... arXiv preprint arXiv:1507.02378, 2015 | 40 | 2015 |
| The wide-area virtual service migration problem: A competitive analysis approach M Bienkowski, A Feldmann, J Grassler, G Schaffrath, S Schmid IEEE/ACM Transactions on Networking 22 (1), 165-178, 2013 | 38 | 2013 |
| A match in time saves nine: Deterministic online matching with delays M Bienkowski, A Kraska, P Schmidt International Workshop on Approximation and Online Algorithms, 132-146, 2017 | 32 | 2017 |
| A primal-dual online deterministic algorithm for matching with delays M Bienkowski, A Kraska, HH Liu, P Schmidt International Workshop on Approximation and Online Algorithms, 51-68, 2018 | 31 | 2018 |
| Dynamic balanced graph partitioning C Avin, M Bienkowski, A Loukas, M Pacut, S Schmid SIAM Journal on Discrete Mathematics 34 (3), 1791-1812, 2020 | 30 | 2020 |
| Traveling repairperson, unrelated machines, and other stories about average completion times M Bienkowski, A Kraska, HH Liu arXiv preprint arXiv:2102.06904, 2021 | 27 | 2021 |
| Dynamic sharing of a multiple access channel M Bienkowski, M Klonowski, M Korzeniowski, DR Kowalski arXiv preprint arXiv:1001.3044, 2010 | 27 | 2010 |
| Price fluctuations: To buy or to rent M Bienkowski International Workshop on Approximation and Online Algorithms, 25-36, 2009 | 25* | 2009 |
| Online service with delay on a line M Bienkowski, A Kraska, P Schmidt International Colloquium on Structural Information and Communication …, 2018 | 24 | 2018 |
| Online control message aggregation in chain networks M Bienkowski, J Byrka, M Chrobak, Ł Jeż, J Sgall, G Stachowiak Workshop on Algorithms and Data Structures, 133-145, 2013 | 23 | 2013 |
| Online dynamic b-matching: With applications to reconfigurable datacenter networks M Bienkowski, D Fuchssteiner, J Marcinkowski, S Schmid ACM SIGMETRICS Performance Evaluation Review 48 (3), 99-108, 2021 | 22 | 2021 |
| Collecting weighted items from a dynamic queue M Bienkowski, M Chrobak, C Dürr, M Hurand, A Jeż, Ł Jeż, G Stachowiak Algorithmica 65 (1), 60-94, 2013 | 22 | 2013 |
| Migrating and replicating data in networks M Bienkowski Computer Science-Research and Development 27 (3), 169-179, 2012 | 20 | 2012 |
| Randomized competitive algorithms for online buffer management in the adaptive adversary model M Bienkowski, M Chrobak, Ł Jeż Theoretical Computer Science 412 (39), 5121-5131, 2011 | 19 | 2011 |
Stefan SchmidProfessor, Computer Science, TU Berlin & Weizenbaum Institute & Fraunhofer SITVerified email at tu-berlin.de
