| New results about multi-band uncertainty in robust optimization C Büsing, F D’andreagiovanni International Symposium on Experimental Algorithms, 63-74, 2012 | 83 | 2012 |
| Network planning under demand uncertainty with robust optimization T Bauschert, C Büsing, F D'Andreagiovanni, AMCA Koster, M Kutschka, ... IEEE Communications Magazine 52 (2), 178-185, 2014 | 63 | 2014 |
| Recoverable robust shortest path problems C Büsing Networks 59 (1), 181-189, 2012 | 49* | 2012 |
| Recoverable robust knapsacks: the discrete scenario case C Büsing, AMCA Koster, M Kutschka Optimization Letters 5 (3), 379-392, 2011 | 46 | 2011 |
| Recoverable robustness in combinatorial optimization C Büsing Cuvillier Verlag, 2011 | 28 | 2011 |
| Graphen-und Netzwerkoptimierung C Büsing Springer-Verlag, 2010 | 27 | 2010 |
| Robust optimization under multi-band uncertainty-part i: Theory C Büsing, F D'Andreagiovanni arXiv preprint arXiv:1301.2734, 2013 | 25 | 2013 |
| Recoverable robust knapsacks: Γ-scenarios C Büsing, AMCA Koster, M Kutschka International Conference on Network Optimization, 583-588, 2011 | 25 | 2011 |
| Robust and sustainable supply chains under market uncertainties and different risk attitudes–A case study of the German biodiesel market LE Hombach, C Büsing, G Walther European Journal of Operational Research 269 (1), 302-312, 2018 | 22 | 2018 |
| Robust algorithms for sorting railway cars C Büsing, J Maue European Symposium on Algorithms, 350-361, 2010 | 17 | 2010 |
| A new theoretical framework for Robust Optimization under multi-band uncertainty C Büsing, F D’andreagiovanni Operations Research Proceedings 2012, 115-121, 2014 | 16 | 2014 |
| Reference points and approximation algorithms in multicriteria discrete optimization C Büsing, KS Goetzmann, J Matuschke, S Stiller European Journal of Operational Research 260 (3), 829-840, 2017 | 13* | 2017 |
| The exact subgraph recoverable robust shortest path problem C Büsing Robust and Online Large-Scale Optimization, 231-248, 2009 | 13 | 2009 |
| Line planning, path constrained network flow and inapproximability C Büsing, S Stiller Networks 57 (1), 106-113, 2011 | 12* | 2011 |
| Improved handling of uncertainty and robustness in set covering problems P Lutter, D Degel, C Büsing, AMCA Koster, B Werners European journal of operational research 263 (1), 35-49, 2017 | 8 | 2017 |
| 0–1 multiband robust optimization C Büsing, F D’andreagiovanni, A Raymond Operations Research Proceedings 2013, 89-95, 2014 | 7 | 2014 |
| The budgeted minimum cost flow problem with unit upgrading cost C Büsing, A Koster, S Kirchner, A Thome Networks 69 (1), 67-82, 2017 | 5 | 2017 |
| Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation C Büsing, S Knust, XT Le EURO Journal on Computational Optimization 6 (4), 339-365, 2018 | 4 | 2018 |
| Optimization of robust aiming strategies in solar tower power plants P Richter, F Kepp, C Büsing, S Kuhnke AIP Conference Proceedings 2126 (1), 030045, 2019 | 3 | 2019 |
| Capacity Uncertainty in Airline Revenue Management: Models, Algorithms, and Computations C Büsing, D Kadatz, C Cleophas Transportation Science 53 (2), 383-400, 2019 | 3 | 2019 |
