| Scalable on-demand network management module for software defined telecommunication networks J Mueller, A Wierz, T Magedanz 2013 IEEE SDN for Future Networks and Services (SDN4FNS), 1-6, 2013 | 16 | 2013 |
| Robust flows over time: models and complexity results C Gottschalk, AMCA Koster, F Liers, B Peis, D Schmand, A Wierz Mathematical Programming 171 (1), 55-85, 2018 | 15* | 2018 |
| Primal–dual algorithms for precedence constrained covering problems ST McCormick, B Peis, J Verschae, A Wierz Algorithmica 78, 771-787, 2017 | 15 | 2017 |
| Additive stabilizers for unstable graphs K Chandrasekaran, C Gottschalk, J Könemann, B Peis, D Schmand, ... Discrete Optimization 31, 56-78, 2019 | 10 | 2019 |
| Elastic network design and adaptive flow placement in software defined networks J Mueller, A Wierz, D Vingarzan, T Magedanz 2013 22nd International Conference on Computer Communication and Networks …, 2013 | 4 | 2013 |
| The Primal-Dual Greedy Algorithm for Weighted Covering Problems B Peis, J Verschae, A Wierz arXiv preprint arXiv:1704.08522, 2017 | 2 | 2017 |
| Optimization problems with color-induced budget constraints C Gottschalk, H Lüthen, B Peis, A Wierz Combinatorial Optimization: 4th International Symposium, ISCO 2016, Vietri …, 2016 | 2 | 2016 |
| Optimization problems with color-induced budget constraints C Gottschalk, H Lüthen, B Peis, A Wierz Journal of Combinatorial Optimization 36, 861-870, 2018 | 1 | 2018 |
| Computational Methods for Path-based Robust Flows F Mies, B Peis, A Wierz arXiv preprint arXiv:1705.08161, 2017 | 1 | 2017 |
| Algorithms and complexity results for packing and covering problems and robust dynamic network flows under primal-dual aspects A Wierz Dissertation, RWTH Aachen University, 2018, 2018 | | 2018 |
| A Primal-Dual and Primal-Greedy Approximation Framework for Weighted Covering Problems B Peis, N Rieken, J Verschae, A Wierz for Planning and Scheduling Problems, MAPSP 2022, 77, 0 | | |
