Tractable but Hard to Approximate. The Bi‐Objective Minimum s‐t‐Cut Problem With Binary Capacities. Jan Boeckmann, Stephan Helfrich, Oliver Bachtler, Stefan Ruzika and Clemens Thielen Networks, (2026-01) DOI: 10.1002/net.70023
The Parallel Epsilon Algorithm for Triobjective Integer Optimization Problems. Kathrin Prinz and Stefan Ruzika INFORMS Journal on Computing, (2025-11) DOI: 10.1287/ijoc.2024.0798
Pareto‐Optimal Treatment of Uncertainties in Model‐Based Process Design and Operation. Jan Schwientek, Katrin Teichert, Jan Schröder, Johannes Höller, Norbert Asprion, Pascal Schäfer, Martin Wlotzka and Michael Bortz Chemie Ingenieur Technik, Vol. 97, Nr. 11–12, S. 1057 - 1064. (2025-07) DOI: 10.1002/cite.70012
A Mathematical Model for XOR-Based Application Specific DRAM Address Mapping Schemes. Andrei Rotaru, Oliver Bachtler, Lukas Steiner, Matthias Jung, Sven Krumke and Norbert Wehn Proceedings of the 11th International Symposium on Memory Systems (MEMSYS), Vol. 11, (2025)
Axiomatic Foundations and Polyhedral Characterizations for Ordinal Optimization. Herrmann, Philipp The International Conference on Operations Research 2025, (2026) DOI: 10.5281/zenodo.18266693
Challenges in Multi-Objective Online Optimization. Manzke, Maren 28th Workshop on Future Research in Combinatorial Optimization, (2026) DOI: 10.5281/zenodo.18174227
Challenges in Multi-Objective Online Optimization. Manzke, Maren Recent Advances in Multi-Objective Optimization, (2026) DOI: 10.5281/zenodo.18174450
An Adjacency-Based Algorithm for Computing Extreme-Supported Efficient Spanning Trees. Bachtler, Oliver International Conference on Operations Research 2025, (2025) DOI: 10.5281/zenodo.17660455
Multi-objective Selfish Routing. Borgmann, Hannah 15th Day on Computational Game Theory, (2025) DOI: 10.5281/zenodo.18411590
On a Generalization of the Maximum Weighted Independent Set Problem. Borgmann, Hannah The International Conference on Operations Research 2025, (2025) DOI: 10.5281/zenodo.18411875
A Dual View of Roman Domination. The Two Neighbour Packing Problem. Oliver Bachtler, Sven Krumke and Helena Weiß arXiv, (2026) DOI: 10.48550/arXiv.2601.19615
An adjacency-based algorithm for computing all extreme-supported non-dominated points of a bi-objective combinatorial optimisation problem. Oliver Bachtler, Felix Fritz and Stefan Ruzika arXiv, (2026) DOI: 10.48550/arXiv.2601.19615