Approximating Infeasible 2VPI-Systems. - Neele Leithäuser; Sven Oliver Krumke; Maximilian Merkert (WG, 2012)

Solving network design problems via iterative aggregation. - Andreas Bärmann; Frauke Liers; Alexander Martin 001; Maximilian Merkert; Christoph Thurner; Dieter Weninger (Math. Program. Comput., 2015)

Structural Investigation of Piecewise Linearized Network Flow Problems. - Frauke Liers; Maximilian Merkert (SIAM J. Optim., 2016)

Staircase compatibility and its applications in scheduling and piecewise linearization. - Andreas Bärmann; Thorsten Gellermann; Maximilian Merkert; Oskar Schneider (Discret. Optim., 2018)

The clique problem with multiple-choice constraints under a cycle-free dependency graph. - Andreas Bärmann; Patrick Gemander; Maximilian Merkert (Discret. Appl. Math., 2020)

Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks. - Frauke Liers; Alexander Martin 001; Maximilian Merkert; Nick Mertens; Dennis Michaels (J. Glob. Optim., 2021)

An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities. - Maximilian Merkert; Galina Orlinskaya; Dieter Weninger (J. Glob. Optim., 2022)

On Recognizing Staircase Compatibility. - Andreas Bärmann; Patrick Gemander; Alexander Martin 001; Maximilian Merkert (J. Optim. Theory Appl., 2022)

Autonomous traffic at intersections: An optimization-based analysis of possible time, energy, and CO savings. - Do Duc Le; Maximilian Merkert; Stephan Sorgatz; Mirko Hahn; Sebastian Sager (Networks, 2022)

Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph. - Andreas Bärmann; Patrick Gemander; Maximilian Merkert; Ann-Kathrin Wiertz; Francisco Javier Zaragoza Martínez (Discret. Appl. Math., 2023)

On the Expressiveness of Rational ReLU Neural Networks With Bounded Depth. - Gennadiy Averkov; Christopher Hojny; Maximilian Merkert (ICLR, 2025)