Fritz Bökler

Orcid: 0000-0002-7950-6965

Affiliations:
  • Osnabrück University, Germany


According to our database1, Fritz Bökler authored at least 16 papers between 2015 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
General Multiplicative Spanners in Practice.
Proceedings of the 24th International Symposium on Experimental Algorithms, 2026

2025
Simple Approximations for General Spanner Problems.
Proceedings of the Approximation and Online Algorithms - 23rd International Workshop, 2025

2024
An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems.
Math. Methods Oper. Res., August, 2024

Complexity of the multiobjective minimum weight minimum stretch spanner problem.
Math. Methods Oper. Res., August, 2024

Exact Minimum Weight Spanners via Column Generation.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2022
On the rectangular knapsack problem.
Math. Methods Oper. Res., 2022

Complexity of the Multiobjective Spanner Problem.
CoRR, 2022

PaMILO: A Solver for Multi-objective Mixed Integer Linear Optimization and Beyond.
Proceedings of the Operations Research Proceedings 2022: Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), 2022

2020
An Experimental Study of ILP Formulations for the Longest Induced Path Problem.
Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

Approximating Multiobjective Shortest Path in Practice.
Proceedings of the 22nd Symposium on Algorithm Engineering and Experiments, 2020

2018
Output-sensitive complexity of multiobjective combinatorial optimization with an application to the multiobjective shortest path problem
PhD thesis, 2018

Multi-Objective Optimisation Based Planning of Power-Line Grid Expansions.
ISPRS Int. J. Geo Inf., 2018

2017
Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem.
Proceedings of the WALCOM: Algorithms and Computation, 2017

The Multiobjective Shortest Path Problem Is NP-Hard, or Is It?
Proceedings of the Evolutionary Multi-Criterion Optimization, 2017

2016
Output-sensitive Complexity of Multiobjective Combinatorial Optimization.
CoRR, 2016

2015
Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems.
Proceedings of the Algorithms - ESA 2015, 2015


  Loading...