Jan Boeckmann

According to our database, Jan Boeckmann authored at least 5 papers between 2023 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

Tractable but Hard to Approximate: The Bi-Objective Minimum s-t-Cut Problem With Binary Capacities.

Jan Boeckmann, Stephan Helfrich, Oliver Bachtler, Stefan Ruzika, Clemens Thielen

Networks, 2026

2024

A (B+1)-approximation for network flow interdiction with unit costs.

Jan Boeckmann, Clemens Thielen

Discret. Appl. Math., 2024

2023

New Ways in Municipal Flood Mitigation: a Mixed-Integer Programming Approach and its Practical Application.

Jan Boeckmann, Clemens Thielen

Oper. Res. Forum, December, 2023

Approximating single- and multi-objective nonlinear sum and product knapsack problems.

Jan Boeckmann, Clemens Thielen, Ulrich Pferschy

Discret. Optim., May, 2023

Complexity of the Temporal Shortest Path Interdiction Problem.

Jan Boeckmann, Clemens Thielen, Alina Wittmann

Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023