A Branch & Bound Algorithm for Medical Image Registration. - Michael Stiglmayr; Frank Pfeuffer; Kathrin Klamroth (IWCIA, 2008)

Registration of PE segment contour deformations in digital high-speed videos. - Michael Stiglmayr; Raphael Schwarz; Kathrin Klamroth; Günter Leugering; Jörg Lohscheller (Medical Image Anal., 2008)

On the Application of the Monge–Kantorovich Problem to Image Registration. - O. Museyko; Michael Stiglmayr; Kathrin Klamroth; Günter Leugering (SIAM J. Imaging Sci., 2009)

Discrete and geometric Branch and Bound algorithms for medical image registration. - Frank Pfeuffer; Michael Stiglmayr; Kathrin Klamroth (Ann. Oper. Res., 2012)

On the multicriteria allocation problem. - Michael Stiglmayr; José Rui Figueira; Kathrin Klamroth (Ann. Oper. Res., 2014)

Representation of the non-dominated set in biobjective discrete optimization. - Daniel Vaz 001; Luís Paquete; Carlos M. Fonseca; Kathrin Klamroth; Michael Stiglmayr (Comput. Oper. Res., 2015)

Assigning Students to Schools for an Internship. - Michael Stiglmayr; Simon Görtz; Kathrin Klamroth (OR, 2018)

Layout Problems with Reachability Constraint. - Michael Stiglmayr (OR, 2019)

Exact algorithms for handling outliers in center location problems on networks using k-max functions. - Teresa Schnepper; Kathrin Klamroth; Michael Stiglmayr; Justo Puerto (Eur. J. Oper. Res., 2019)

Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions. - Britta Schulze; Kathrin Klamroth; Michael Stiglmayr (J. Glob. Optim., 2019)

GivEn - Shape Optimization for Gas Turbines in Volatile Energy Networks. - Jan Backhaus; Matthias Bolten; Onur Tanil Doganay; Matthias Ehrhardt 001; Benedikt Engel; Christian Frey; Hanno Gottschalk; Michael Günther 005; Camilla Hahn; Jens Jäschke; Peter Jaksch; Kathrin Klamroth; et al. (CoRR, 2020)

Efficient and Sparse Neural Networks by Pruning Weights in a Multiobjective Learning Approach. - Malena Reiners; Kathrin Klamroth; Michael Stiglmayr (CoRR, 2020)

Introducing multiobjective complex systems. - Tobias Dietz; Kathrin Klamroth; Konstantin Kraus; Stefan Ruzika; Luca E. Schäfer; Britta Schulze; Michael Stiglmayr; Margaret M. Wiecek (Eur. J. Oper. Res., 2020)

On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem. - Britta Schulze; Michael Stiglmayr; Luís Paquete; Carlos M. Fonseca; David Willems; Stefan Ruzika (Math. Methods Oper. Res., 2020)

Solving the Dynamic Dial-a-Ride Problem Using a Rolling-Horizon Event-Based Graph. - Daniela Gaul; Kathrin Klamroth; Michael Stiglmayr (ATMOS, 2021)

A local analysis to determine all optimal solutions of p-k-max location problems on networks. - Teresa Schnepper; Kathrin Klamroth; Justo Puerto; Michael Stiglmayr (Discret. Appl. Math., 2021)

Decision space robustness for multi-objective integer linear programming. - Michael Stiglmayr; José Rui Figueira; Kathrin Klamroth; Luís Paquete; Britta Schulze (Ann. Oper. Res., 2022)

Computing representations using hypervolume scalarizations. - Luís Paquete; Britta Schulze; Michael Stiglmayr; Ana C. Lourenço (Comput. Oper. Res., 2022)

Efficient and sparse neural networks by pruning weights in a multiobjective learning approach. - Malena Reiners; Kathrin Klamroth; Fabian Heldmann; Michael Stiglmayr (Comput. Oper. Res., 2022)

Event-based MILP models for ridepooling applications. - Daniela Gaul; Kathrin Klamroth; Michael Stiglmayr (Eur. J. Oper. Res., 2022)

Ridepooling and public bus services: A comparative case-study. - Hayk Asatryan; Daniela Gaul; Hanno Gottschalk; Kathrin Klamroth; Michael Stiglmayr (CoRR, 2023)

Optimal control for port-Hamiltonian systems and a new perspective on dynamic network flow problems. - Onur Tanil Doganay; Kathrin Klamroth; Bruno Lang; Michael Stiglmayr; Claudia Totzeck (CoRR, 2023)

On the online path extension problem - Location and routing problems in board games. - Konstantin Kraus; Kathrin Klamroth; Michael Stiglmayr (CoRR, 2023)

Output-sensitive Complexity of Multi-Objective Integer Network Flow Problems. - David Könen; Michael Stiglmayr (CoRR, 2023)

Adaptive Improvements of Multi-Objective Branch and Bound. - Julius Bauß; Sophie N. Parragh; Michael Stiglmayr (CoRR, 2023)

Multiobjective Optimization on a Budget (Dagstuhl Seminar 23361). - Richard Allmendinger 001; Carlos M. Fonseca; Serpil Sayin; Margaret M. Wiecek; Michael Stiglmayr (Dagstuhl Reports, 2023)

Multi-objective matroid optimization with ordinal weights. - Kathrin Klamroth; Michael Stiglmayr; Julia Sudhoff Santos (Discret. Appl. Math., 2023)

Ordinal optimization through multi-objective reformulation. - Kathrin Klamroth; Michael Stiglmayr; Julia Sudhoff Santos (Eur. J. Oper. Res., 2023)

The Line-Based Dial-a-Ride Problem. - Kendra Reiter; Marie Schmidt; Michael Stiglmayr (ATMOS, 2024)

On the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization. - José Rui Figueira; Kathrin Klamroth; Michael Stiglmayr; Julia Sudhoff Santos (CoRR, 2024)

On improvements of multi-objective branch and bound. - Julius Bauß; Sophie N. Parragh; Michael Stiglmayr (EURO J. Comput. Optim., 2024)

Efficient dominance filtering for unions and Minkowski sums of non-dominated sets. - Kathrin Klamroth; Bruno Lang; Michael Stiglmayr (Comput. Oper. Res., 2024)

Consensus-based optimization for multi-objective problems: a multi-swarm approach. - Kathrin Klamroth; Michael Stiglmayr; Claudia Totzeck (J. Glob. Optim., 2024)

Special issue on exact and approximation methods for mixed-integer multi-objective optimization. - Carlos Henggeler Antunes; Carlos M. Fonseca; Luís Paquete; Michael Stiglmayr (Math. Methods Oper. Res., 2024)

Augmenting bi-objective branch and bound by scalarization-based information. - Julius Bauß; Michael Stiglmayr (Math. Methods Oper. Res., 2024)

An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems. - David Könen; Michael Stiglmayr (Discret. Appl. Math., 2025)

A tight formulation for the dial-a-ride problem. - Daniela Gaul; Kathrin Klamroth; Christian Pfeiffer; Michael Stiglmayr; Arne Schulz (Eur. J. Oper. Res., 2025)

On the computational complexity of ordinal multi-objective unconstrained combinatorial optimization. - José Rui Figueira; Kathrin Klamroth; Michael Stiglmayr; Julia Sudhoff Santos (Oper. Res. Lett., 2025)

On Supportedness in Multi-Objective Combinatorial Optimization. - David Könen; Michael Stiglmayr (CoRR, 2025)

A multi-objective perspective on the cable-trench problem. - Lara Löhken; Michael Stiglmayr (J. Comb. Optim., 2025)