Differences

This shows you the differences between two versions of the page.

Link to this comparison view

staff:boekler [2017-12-22 13:36] (current)
Line 1: Line 1:
 +{{ :​staff:​boekler.png?​nolink&​120|Fritz Bökler}}
 +====== Fritz Bökler ======
  
 +**<color #​ed1c24>​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</​color>​**
 +
 +===== Research Interests =====
 +
 +  * (Multi-objective) combinatorial optimization,​ especially graph problems
 +  * Multi-objective linear programming
 +  * Fixed-parameter tractability
 +  * Integer programming methods
 +  * Graph theory, graph algorithms
 +  * Computational complexity
 +
 +===== Publicly Available Instances =====
 +  * [[staff/​boekler/​moco-instances|Instances in Multiobjective Combinatorial Optimization]]
 +
 +===== Research Projects =====
 +
 +  * [[http://​www.stromnetzplanung.de/​projekt/​aktuelles.html| 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.
 +
 +===== Publications =====
 +
 +==== Refereed Conference Articles ====
 +
 +  * **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
 +
 +==== Refereed Journal Articles ====
 +
 +  * **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.
 +
 +==== Journal Articles ====
 +
 +  * **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
 +
 +==== Thesis ====
 +
 +  * **[[https://​ls11-www.cs.tu-dortmund.de/​_media/​techreports/​tr12-02.pdf| TR12-02: Algorithmen für das Stochastische Steinerbaumproblem auf Serien-Parallelen Graphen]]** \\ //Fritz Bökler//,​\\ Diplomarbeit (Master'​s thesis), TU Dortmund, April 2012
 +
 +===== Teaching/​Lehre =====
 +
 +==== Supervised Bachelor/​Master/​Diploma-Theses ====
 +  * 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**
 +
 +==== Sommersemester 2017 ====
 +  * [[teaching:​seminarae-ss2017 | Seminar Algorithm Engineering]]
 +
 +==== Wintersemester 2016/17 ====
 +  * [[staff:​mutzel:​prosemunplugged | Proseminar "​Algorithms Unplugged"​]]
 +
 +==== Sommersemester 2016 ====
 +  * [[teaching:​seminarae-ss2016 | Seminar Algorithm Engineering]]
 +
 +==== Wintersemester 2015/16 ====
 +
 +  * [[teaching:​seminarae-ws2015 | Seminar Algorithm Engineering]]
 +
 +==== Sommersemester 2015 ====
 +
 +  * [[teaching:​seminarae-ss2015 | Seminar Algorithm Engineering]]
 +
 +==== Wintersemester 2014/15 ====
 +
 +  * [[teaching:​seminarae-ws2014 | Seminar Algorithm Engineering]]
 +
 +==== Wintersemester 2013/14 ====
 +
 +  * [[de:​teaching:​lectures:​monet | Projektgruppe MONET: Multi-Objective Network Design]]
 +  * [[teaching:​seminarae-ws2013 | Seminar Algorithm Engineering]]
 +
 +==== Sommersemester 2013 ====
 +
 +  * [[https://​ls10-wiki.cs.tu-dortmund.de/​dap1/​| Übung zu Datenstrukturen,​ Algorithmen und Programmierung I]]
 +  * [[de:​teaching:​lectures:​monet | Projektgruppe MONET: Multi-Objective Network Design]]
 +  * [[teaching:​seminarae-ss2013 | Seminar Algorithm Engineering]]
 +
 +==== Wintersemester 2012/13 ====
 +
 +  * [[http://​ls1-www.cs.tu-dortmund.de/​cms/​index.php?​option=com_content&​view=article&​id=908:​eini-lw-ws-201213&​catid=180| Praktikum zu Einführung in die Informatik für Logistiker und Wirtschaftsingenieure]]
 +  * [[http://​ls1-www.cs.tu-dortmund.de/​cms/​index.php?​option=com_content&​view=article&​id=909:​eini-wima&​catid=180| Praktikum zu Einführung in die Informatik für Wirtschaftsmathematiker]]
 +  * [[teaching:​seminarae-ws2012 | Seminar Algorithm Engineering]]
 +
 +==== Sommersemester 2012 ====
 +
 +  * [[staff:​rudolph:​poks-u-2012| Übung zu Praktische Optimierung]]
 
Last modified: 2017-12-22 13:36 (external edit)
DokuWikiRSS-Feed