Differences
This shows you the differences between two versions of the page.
staff:kurz [2015-09-11 10:19] |
staff:kurz [2019-03-11 10:48] |
||
---|---|---|---|
Line 1: | Line 1: | ||
{{ :staff:kurz.png?nolink&220|}} | {{ :staff:kurz.png?nolink&220|}} | ||
- | ====== Denis Kurz ====== | + | ====== Dr. Denis Kurz ====== |
Line 10: | Line 10: | ||
===== Publications ===== | ===== Publications ===== | ||
- | * **Parameterized Algorithms for Stochastic Steiner Tree Problems** \\ //Denis Kurz, [[:staff:mutzel|Petra Mutzel]], [[:staff:zey|Bernd Zey]] // \\ in: Mathematical and Engineering Methods in Computer Science (MEMICS 2012) \\ Lecture Notes in Computer Science 7721, Springer-Verlag, 2013, pages 143--154 | + | * //Denis Kurz// \\ **[[http://dx.doi.org/10.17877/DE290R-19814|K-Best Enumeration -- Theory and Application]]** \\ PhD Thesis, TU Dortmund, 2018 |
- | * ** {{:techreports:tr12-01.pdf|TR12-1-001: Parameterized Algorithms for Stochastic Steiner Tree Problems}}** \\ //Denis Kurz//, Diploma Thesis, TU Dortmund, April 2012 | + | * //Denis Kurz, [[:staff::mutzel|Petra Mutzel]]// \\ **[[https://doi.org/10.4230/LIPIcs.ISAAC.2016.49|A Sidetrack-Based Algorithm for Finding the k Shortest Simple Paths in a Directed Graph]]** \\ ISAAC 2016 \\ LIPIcs 64, Schloss Dagstuhl, 2016, pages 49:1--49:13 |
+ | |||
+ | * //Denis Kurz, [[:staff:mutzel|Petra Mutzel]], [[:staff:zey|Bernd Zey]]// \\ **[[https://doi.org/10.1007/978-3-642-36046-6_14|Parameterized Algorithms for Stochastic Steiner Tree Problems]]** \\ MEMICS 2012 \\ LNCS 7721, Springer-Verlag, 2013, pages 143--154 | ||
+ | |||
+ | * //Denis Kurz// \\ **{{:techreports:tr12-01.pdf|TR12-1-001: Parameterized Algorithms for Stochastic Steiner Tree Problems}}** \\ Diploma Thesis, TU Dortmund, 2012 | ||
| | ||
===== Lehre ===== | ===== Lehre ===== | ||
+ | |||
+ | ==== Sommersemester 2019 ==== | ||
+ | |||
+ | * [[http://ls2-www.cs.tu-dortmund.de/lehre/sommer2019/dap2/|Datenstrukturen, Algorithmen und Programmierung 2]] | ||
+ | * Seminar [[:staff:mutzel:prosemgraphalg|Proseminar Graphalgorithmen]] | ||
+ | |||
+ | ==== Wintersemester 2018/19 ==== | ||
+ | |||
+ | * [[:teaching:ep1819sopra|Praktikum]] zur Exportveranstaltung [[/people/rudolph/teaching/lectures/EINI/WS2018-19/lecture.jsp|Einführung in die Programmierung]] | ||
+ | |||
+ | ==== Sommersemester 2018 ==== | ||
+ | |||
+ | * [[http://ls2-www.cs.tu-dortmund.de/lehre/sommer2018/dap2/|Datenstrukturen, Algorithmen und Programmierung 2]] | ||
+ | * Seminar [[:teaching:seminarae-ss2018|Algorithm Engineering]] | ||
+ | |||
+ | ==== Wintersemester 2017/18 ==== | ||
+ | |||
+ | * [[:teaching:ep1718sopra|Praktikum]] zur Exportveranstaltung [[/people/rudolph/teaching/lectures/EINI/WS2017-18/lecture.jsp|Einführung in die Programmierung]] | ||
+ | |||
+ | ==== Sommersemester 2017 ==== | ||
+ | |||
+ | * [[http://ls2-www.cs.tu-dortmund.de/lehre/sommer2017/dap2/|Datenstrukturen, Algorithmen und Programmierung 2]] | ||
+ | * Seminar [[:teaching:seminarae-ss2017|Algorithm Engineering]] | ||
+ | |||
+ | ==== Wintersemester 2016/17 ==== | ||
+ | |||
+ | * [[:teaching:ep1617sopra|Praktikum]] zur Exportveranstaltung [[/people/rudolph/teaching/lectures/EINI/WS2016-17/lecture.jsp|Einführung in die Programmierung]] | ||
+ | * Seminar [[:staff:mutzel:prosemunplugged|Algorithms Unplugged]] | ||
==== Wintersemester 2013/14 ==== | ==== Wintersemester 2013/14 ==== |