Differences
This shows you the differences between two versions of the page.
staff:boekler [2017-04-21 16:04] |
staff:boekler [2017-12-22 13:36] |
||
---|---|---|---|
Line 1: | Line 1: | ||
{{ :staff:boekler.png?nolink&120|Fritz Bökler}} | {{ :staff:boekler.png?nolink&120|Fritz Bökler}} | ||
====== Fritz Bökler ====== | ====== Fritz Bökler ====== | ||
- | | Room: | 233 | | + | |
- | | Phone: | +49 231 755-7704 | | + | **<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>** |
- | | Fax: | +49 231 755-7740 | | + | |
- | | E-Mail: | fritz.boekler{{:staff:at.gif|}}tu-dortmund.de| | + | |
===== Research Interests ===== | ===== Research Interests ===== | ||
Line 26: | Line 24: | ||
==== Refereed Conference Articles ==== | ==== Refereed Conference Articles ==== | ||
- | * **Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem** \\ //Fritz Bökler and Petra Mutzel//, \\ WALCOM 2017 | + | * **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 | + | * **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 | + | * **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 | * **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 ==== | ==== Refereed Journal Articles ==== | ||
- | * **Output-sensitive Complexity of Multiobjective Combinatorial Optimization** \\ //Fritz Bökler, Matthias Ehrgott, Christopher Morris, Petra Mutzel//, \\ Journal of Multicriteria Decision Analysis, February 2017 | + | * **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 ==== | ==== Journal Articles ==== | ||
Line 48: | Line 46: | ||
==== Supervised Bachelor/Master/Diploma-Theses ==== | ==== 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** | * Oliver Zietek (BT, 2016): **Vergleich von Algorithmen zum Bestimmen von minimalen Vektoren** | ||
* Christopher Morris (MT, 2015): **Enumeration Complexity of Multicriteria Linear Optimization** | * 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** | * Stephan Schlagkamp (MT, 2013): **Algorithms for Multicriteria Network Design Problems on Graphs of Bounded Treewidth** | ||
- | ==== Wintersemester 2014/15 ==== | + | ==== 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]] | * [[teaching:seminarae-ws2015 | Seminar Algorithm Engineering]] |