Towards Solving Very Large Scale Train Timetabling Problems by Lagrangian Relaxation. - Frank Fischer 002; Christoph Helmberg; Jürgen Janßen; Boris Krostitz (ATMOS, 2008)

Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling. - Frank Fischer 002; Christoph Helmberg (ATMOS, 2010)

Complete description for the spanning tree problem with one linearised quadratic term. - Anja Fischer; Frank Fischer 002 (Oper. Res. Lett., 2013)

Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics. - Anja Fischer; Frank Fischer 002; Gerold Jäger; Jens Keilwagen; Paul Molitor; Ivo Grosse (Discret. Appl. Math., 2014)

Dynamic graph generation for the shortest path problem in time expanded networks. - Frank Fischer 002; Christoph Helmberg (Math. Program., 2014)

A Parallel Bundle Framework for Asynchronous Subspace Optimization of Nonsmooth Convex Functions. - Frank Fischer 002; Christoph Helmberg (SIAM J. Optim., 2014)

Ordering Constraints in Time Expanded Networks for Train Timetabling Problems. - Frank Fischer 002 (ATMOS, 2015)

A New Exact Approach to the Space-Free Double Row Layout Problem. - Anja Fischer; Frank Fischer 002; Philipp Hungerländer (OR, 2015)

Computational Recognition of RNA Splice Sites by Exact Algorithms for the Quadratic Traveling Salesman Problem. - Anja Fischer; Frank Fischer 002; Gerold Jäger; Jens Keilwagen; Paul Molitor; Ivo Grosse (Comput., 2015)

An extended approach for lifting clique tree inequalities. - Anja Fischer; Frank Fischer 002 (J. Comb. Optim., 2015)

A Re-optimization Approach for Train Dispatching. - Frank Fischer 002; Boris Grimm; Torsten Klug; Thomas Schlechte (OR, 2016)

Strong Relaxations for the Train Timetabling Problem Using Connected Configurations. - Frank Fischer 002; Thomas Schlechte (ATMOS, 2017)

Matroid optimisation problems with nested non-linear monomials in the objective function. - Anja Fischer; Frank Fischer 002; S. Thomas McCormick (Math. Program., 2018)

A Lagrangian Decomposition Approach to Solve Large Scale Multi-Sector Energy System Optimization Problems. - Andreas Bley; Angela Pape; Frank Fischer 002 (OR, 2019)

Counting degree sequences of spanning trees in bipartite graphs: A graph-theoretic proof. - Anja Fischer; Frank Fischer 002 (J. Graph Theory, 2019)

New exact approaches to row layout problems. - Anja Fischer; Frank Fischer 002; Philipp Hungerländer (Math. Program. Comput., 2019)

A Constructive Arboricity Approximation Scheme. - Markus Blumenstock; Frank Fischer 002 (SOFSEM, 2020)

Decorous combinatorial lower bounds for row layout problems. - Mirko Dahlbeck; Anja Fischer; Frank Fischer 002 (Eur. J. Oper. Res., 2020)

Matroid optimization problems with monotone monomials in the objective. - Anja Fischer; Frank Fischer 002; S. Thomas McCormick (Discret. Appl. Math., 2022)

Exact approaches for the combined cell layout problem. - Mirko Dahlbeck; Anja Fischer; Frank Fischer 002; Philipp Hungerländer; Kerstin Maier (Eur. J. Oper. Res., 2023)

An asynchronous proximal bundle method. - Frank Fischer 002 (Math. Program., 2025)