The Exact Subgraph Recoverable Robust Shortest Path Problem. - Christina Büsing (Robust and Online Large-Scale Optimization, 2009)

Robust Algorithms for Sorting Railway Cars. - Christina Büsing; Jens Maue (ESA (1), 2010)

Recoverable Robust Knapsacks: Γ-Scenarios. - Christina Büsing; Arie M. C. A. Koster; Manuel Kutschka (INOC, 2011)

Line planning, path constrained network flow and inapproximability. - Christina Büsing; Sebastian Stiller (Networks, 2011)

Recoverable robust knapsacks: the discrete scenario case. - Christina Büsing; Arie M. C. A. Koster; Manuel Kutschka (Optim. Lett., 2011)

A New Theoretical Framework for Robust Optimization Under Multi-Band Uncertainty. - Christina Büsing; Fabio D'Andreagiovanni (OR, 2012)

New Results about Multi-band Uncertainty in Robust Optimization. - Christina Büsing; Fabio D'Andreagiovanni (SEA, 2012)

The Power of Compromise - Christina Büsing; Kai-Simon Goetzmann; Jannik Matuschke; Sebastian Stiller (CoRR, 2012)

Recoverable robust shortest path problems. - Christina Büsing (Networks, 2012)

Robust optimization under multiband uncertainty. - Christina Büsing; Fabio D'Andreagiovanni; Annie Raymond (CTW, 2013)

A Generic Multi-layer Network Optimization Model with Demand Uncertainty. - Uwe Steglich; Thomas Bauschert; Christina Büsing; Manuel Kutschka (EUNICE, 2013)

0-1 Multiband Robust Optimization. - Christina Büsing; Fabio D'Andreagiovanni; Annie Raymond (OR, 2013)

Robust Optimization under Multi-band Uncertainty - Part I: Theory - Christina Büsing; Fabio D'Andreagiovanni (CoRR, 2013)

Network planning under demand uncertainty with robust optimization. - Thomas Bauschert; Christina Büsing; Fabio D'Andreagiovanni; Arie M. C. A. Koster; Manuel Kutschka; Uwe Steglich (IEEE Commun. Mag., 2014)

Robust plans for spectrum allocation in elastic flexgrid optical networks. - Christina Büsing; Arie M. C. A. Koster; Martin Tieves (RNDM, 2016)

The Capacitated Budgeted Minimum Cost Flow Problem with Unit Upgrading Costs. - Christina Büsing; Sarah Kirchner; Annika Thome (Electron. Notes Discret. Math., 2016)

Reference points and approximation algorithms in multicriteria discrete optimization. - Christina Büsing; Kai-Simon Goetzmann; Jannik Matuschke; Sebastian Stiller (Eur. J. Oper. Res., 2017)

Improved handling of uncertainty and robustness in set covering problems. - Pascal Lutter; Dirk Degel; Christina Büsing; Arie M. C. A. Koster; Brigitte Werners (Eur. J. Oper. Res., 2017)

Robust spectrum allocation in elastic flexgrid optical networks: Complexity and formulations. - Christina Büsing; Alexandra Grub; Arie M. C. A. Koster; Waldemar Laube; Martin Tieves (Networks, 2017)

The budgeted minimum cost flow problem with unit upgrading cost. - Christina Büsing; Arie Koster; Sarah Kirchner; Annika Thome (Networks, 2017)

Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation. - Christina Büsing; Sigrid Knust; Xuan Thanh Le (EURO J. Comput. Optim., 2018)

Budgeted Colored Matching Problems. - Christina Büsing; Martin Comis (Electron. Notes Discret. Math., 2018)

Robust and sustainable supply chains under market uncertainties and different risk attitudes - A case study of the German biodiesel market. - Laura Elisabeth Hombach; Christina Büsing; Grit Walther (Eur. J. Oper. Res., 2018)

Multi-budgeted matching problems. - Christina Büsing; Martin Comis (Networks, 2018)

A Holistic System for Pre-clinical Diagnosis of Sleep Disorders in the Home Environment. - Marc Haßler; Andreas Burgdorf; André Pomp; Christian Kohlschein; Christina Büsing; Stephan M. Jonas (HealthCom, 2019)

Patients, Primary Care, and Policy: Simulation Modeling for Health Care Decision Support. - Christina Büsing; Catherine Cleophas; Martin Comis (CoRR, 2019)

Formulations and algorithms for the recoverable Γ-robust knapsack problem. - Christina Büsing; Sebastian Goderbauer; Arie M. C. A. Koster; Manuel Kutschka (EURO J. Comput. Optim., 2019)

Capacity Uncertainty in Airline Revenue Management: Models, Algorithms, and Computations. - Christina Büsing; Daniel Kadatz; Catherine Cleophas (Transp. Sci., 2019)

Agent-Based Simulation of Medical Care Processes in Rural Areas with the Aid of Current Data on ICT Usage Readiness Among Elderly Patients. - Christina Büsing; Sabrina Schmitz; Mariia Anapolska; Sabine Theis; Matthias Wille; Christopher Brandl; Verena Nitsch; Alexander Mertens (HCI (28), 2020)

Robust strategic planning for mobile medical units with steerable and unsteerable demands. - Christina Büsing; Martin Comis; Eva Schmidt; Manuel Streicher (Eur. J. Oper. Res., 2021)

Minimum color-degree perfect b-matchings. - Mariia Anapolska; Christina Büsing; Martin Comis; Tabea Krabs (Networks, 2021)

Preface: Special issue on network analytics and optimization. - Bernard Fortz; Luis Gouveia 001; Christina Büsing; Markus Leitner (Networks, 2021)

Coworking Scheduling with Network Flows. - Mariia Anapolska; Christina Büsing; Tabea Krabs; Tobias Mömke (INOC, 2022)

Analysing the Complexity of Facility Location Problems with Capacities, Revenues, and Closest Assignments. - Christina Büsing; Timo Gersing; Sophia Wrede (INOC, 2022)

Foreword. - Christina Büsing; Arie M. C. A. Koster (INOC, 2022)

On the complexity of robust transshipment under consistent flow constraints. - Christina Büsing; Arie Koster; Sabrina Schmitz (INOC, 2022)

One Transfer per Patient Suffices: Structural Insights About Patient-to-Room Assignment. - Tabea Brandt; Christina Büsing; Sigrid Knust (ISCO, 2022)

Robust minimum cost flow problem under consistent flow constraints. - Christina Büsing; Arie M. C. A. Koster; Sabrina Schmitz (Ann. Oper. Res., 2022)

Decision-support systems for ambulatory care, including pandemic requirements: using mathematically optimized solutions. - Neele Leithäuser; Dennis Adelhütte; Kristin Braun; Christina Büsing; Martin Comis; Timo Gersing; Sebastian S. Johann; Arie M. C. A. Koster; Sven O. Krumke; Frauke Liers; Eva Schmidt; Johanna Schneider; et al. (BMC Medical Informatics Decis. Mak., 2022)

Recycling Inequalities for Robust Combinatorial Optimization with Budget Uncertainty. - Christina Büsing; Timo Gersing; Arie M. C. A. Koster (IPCO, 2023)

A branch and bound algorithm for robust binary optimization with budget uncertainty. - Christina Büsing; Timo Gersing; Arie M. C. A. Koster (Math. Program. Comput., 2023)

Multithread interval scheduling with flexible machine availabilities: Complexity and efficient algorithms. - Mariia Anapolska; Tabea Brandt; Christina Büsing; Tobias Mömke (Discret. Appl. Math., 2024)

Structural insights about avoiding transfers in the patient-to-room assignment problem. - Tabea Brandt; Christina Büsing; Sigrid Knust (Discret. Appl. Math., 2024)

Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints. - Christina Büsing; Sabrina Schmitz (Discret. Appl. Math., 2024)

Robust transshipment problem under consistent flow constraints. - Christina Büsing; Arie M. C. A. Koster; Sabrina Schmitz (Networks, 2024)

The complexity of the timetable-based railway network design problem. - Nadine Friesen; Tim Sander; Christina Büsing; Karl Nachtigall; Nils Nießen (Networks, 2024)

Cover-based inequalities for the single-source capacitated facility location problem with customer preferences. - Christina Büsing; Markus Leitner; Sophia Wrede (Comput. Oper. Res., 2025)

Patient-to-room assignment with single-rooms entitlements: Combinatorial insights and integer programming formulations. - Tabea Brandt; Christina Büsing; Felix Engelhardt (Eur. J. Oper. Res., 2025)

Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty. - Christina Büsing; Timo Gersing; Arie M. C. A. Koster (Math. Program., 2025)

Robust Capacity Expansion Modelling for Renewable Energy Systems under Weather and Demand Uncertainty. - Sebastian Kebrich; Felix Engelhardt; David Franzmann; Christina Büsing; Jochen Linßen; Heidi Heinrichs (CoRR, 2025)

A Faster Parametric Search for the Integral Quickest Transshipment Problem. - Mariia Anapolska; Dario van den Boom; Christina Büsing; Timo Gersing (CoRR, 2025)

Generating realistic patient data. - Tabea Brandt; Christina Büsing; Johanna Leweke; Finn Seesemann; Sina Weber (CoRR, 2025)

Minimum-Peak-Cost Flows Over Time. - Mariia Anapolska; Emma Ahrens; Christina Büsing; Felix Engelhardt; Timo Gersing; Corinna Mathwieser; Sabrian Schmitz; Sophia Wrede (CoRR, 2025)

Why do women pursue a PhD in Computer Science? - Erika Ábrahám; Miguel Goulão; Milena Vujosevic-Janicic; Sarah Jane Delany; Amal Mersni; Oleksandra Yeremenko; Ozge Buyukdagli; Karima Boudaoud; Caroline Oehlhorn; Ute Schmid; Christina Büsing; Helen Bolke-Hermanns; et al. (CoRR, 2025)

Why do women pursue a Ph.D. in Computer Science? - Erika Ábrahám; Miguel Goulão; Milena Vujosevic-Janicic; Sarah Jane Delany; Amal Mersni; Oleksandra Yeremenko; Ozge Buyukdagli; Karima Boudaoud; Caroline Oehlhorn; Ute Schmid; Christina Büsing; Helen Bolke-Hermanns; et al. (J. Syst. Softw., 2026)