Approximate Pure Nash Equilibria in Weighted Congestion Games. - Christoph Hansknecht; Max Klimm; Alexander Skopalik (APPROX-RANDOM, 2014)

Fast Robust Shortest Path Computations. - Christoph Hansknecht; Alexander T. Richter; Sebastian Stiller (ATMOS, 2018)

A switching cost aware rounding method for relaxations of mixed-integer optimal control problems. - Felix Bestehorn; Christoph Hansknecht; Christian Kirches; Paul Manns (CDC, 2019)

Mathematical Programming Models for Mean Computation in Dynamic Time Warping Spaces. - Vincent Froese; Christoph Hansknecht (CoRR, 2019)

Dynamic Shortest Paths Methods for the Time-Dependent TSP. - Christoph Hansknecht; Imke Joormann; Sebastian Stiller (Algorithms, 2021)

Mixed-integer optimal control problems with switching costs: a shortest path approach. - Felix Bestehorn; Christoph Hansknecht; Christian Kirches; Paul Manns (Math. Program., 2021)

Tight Bounds for Online TSP on the Line. - Antje Bjelde; Jan Hackfeld; Yann Disser; Christoph Hansknecht; Maarten Lipmann; Julie Meißner; Miriam Schlöter; Kevin Schewior; Leen Stougie (ACM Trans. Algorithms, 2021)

Switching Cost Aware Rounding for Relaxations of Mixed-Integer Optimal Control Problems: The 2-D Case. - Felix Bestehorn; Christoph Hansknecht; Christian Kirches; Paul Manns (IEEE Control. Syst. Lett., 2022)

Dynamic flow problems arising from traffic planning (Dynamische Flussprobleme in der Verkehrsplanung) - Christoph Hansknecht (2022)

Feeder routing for air-to-air refueling operations. - Christoph Hansknecht; Imke Joormann; Bernd Korn; Fabian Morscheck; Sebastian Stiller (Eur. J. Oper. Res., 2023)

A Framework for the Solution of Tree-Coupled Saddle-Point Systems. - Christoph Hansknecht; Bernhard Heinzelreiter; John W. Pearson; Andreas Potschka (CoRR, 2024)

Convergence of successive linear programming algorithms for noisy functions. - Christoph Hansknecht; Christian Kirches; Paul Manns (Comput. Optim. Appl., 2024)