Fritz Bökler

I moved to the theoretical computer science group at Osnabrück University. You can find my new website at http://tcs.uos.de/staff/boekler

• (Multi-objective) combinatorial optimization, especially graph problems
• Multi-objective linear programming
• Fixed-parameter tractability
• Integer programming methods
• Graph theory, graph algorithms
• Computational complexity

• Instances in Multiobjective Combinatorial Optimization

• BMWI Projekt: Stromnetzplanung
  This interdisciplinary research and development project has the aim to investigate sustainable methods of evaluating and analyzing network topologies and power grid lines. A special focus will be made on multi-objective tools and optimization.

• Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem
  Fritz Bökler and Petra Mutzel,
  WALCOM 2017, Springer, Lecture Notes in Computer Science 10167, pp. 190–203, 2017.
• The Multiobjective Shortest Path Problem Is NP-Hard, or Is It?
  Fritz Bökler,
  EMO 2017, Springer, Lecture Notes in Computer Science 10173, pp. 77–87, 2017.
• Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems
  Fritz Bökler and Petra Mutzel,
  Algorithms – ESA 2015, Springer, Lecture Notes in Computer Science 9294, pp. 288–299, 2015.
• The Stochastic Steiner Tree Problem on Partial k-Trees
  Fritz Bökler, Petra Mutzel and Bernd Zey,
  Proceedings of the Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS) 2012, NOVPRESS Brno, October 2012

• Output-sensitive Complexity of Multiobjective Combinatorial Optimization
  Fritz Bökler, Matthias Ehrgott, Christopher Morris, Petra Mutzel,
  Journal of Multicriteria Decision Analysis 24(1–2), pp. 25–36, 2017.

• Konfliktarme Trassenverläufe
  Frank Weichert, Daniel Bachmann, Fritz Bökler, Jakob Kopec, Kira Popp, Björn Schwarze,
  arcAktuell 4/2015, 2015

• Transparente Identifizierung und Bewertung von Höchstspannungstrassen mittels mehrkriterieller Optimierung
  Daniel Bachmann, Fritz Bökler, Mike Dokter, Jakob Kopec, Björn Schwarze and Frank Weichert,
  Energiewirtschaftliche Tagesfragen, September 2015

• TR12-02: Algorithmen für das Stochastische Steinerbaumproblem auf Serien-Parallelen Graphen
  Fritz Bökler,
  Diplomarbeit (Master's thesis), TU Dortmund, April 2012

• Maximilian Trögel (BT, 2017): Methoden zur Lösung des Mehrkriteriellen Kürzeste-Wege-Problems im Überblick
• Rosa Pink (BT, 2016): Optimale Schrittweiten für einen bikriteriellen Evolutionären Algorithmus mit S-Metrik-Selektion
• Oliver Zietek (BT, 2016): Vergleich von Algorithmen zum Bestimmen von minimalen Vektoren
• Christopher Morris (MT, 2015): Enumeration Complexity of Multicriteria Linear Optimization
• Stephan Schlagkamp (MT, 2013): Algorithms for Multicriteria Network Design Problems on Graphs of Bounded Treewidth

• Seminar Algorithm Engineering

• Proseminar "Algorithms Unplugged"

• Seminar Algorithm Engineering

• Seminar Algorithm Engineering

• Seminar Algorithm Engineering

• Seminar Algorithm Engineering

• Projektgruppe MONET: Multi-Objective Network Design
• Seminar Algorithm Engineering

• Übung zu Datenstrukturen, Algorithmen und Programmierung I
• Projektgruppe MONET: Multi-Objective Network Design
• Seminar Algorithm Engineering

• Praktikum zu Einführung in die Informatik für Logistiker und Wirtschaftsingenieure
• Praktikum zu Einführung in die Informatik für Wirtschaftsmathematiker
• Seminar Algorithm Engineering

• Übung zu Praktische Optimierung