Differences

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

Link to this comparison view

staff:kurz [2019-03-11 10:48]
staff:kurz [2019-03-11 11:05]
Line 12: Line 12:
   * //Denis Kurz// \\ **[[http://​dx.doi.org/​10.17877/​DE290R-19814|K-Best Enumeration -- Theory and Application]]** \\ PhD Thesis, TU Dortmund, 2018   * //Denis Kurz// \\ **[[http://​dx.doi.org/​10.17877/​DE290R-19814|K-Best Enumeration -- Theory and Application]]** \\ PhD Thesis, TU Dortmund, 2018
  
-  * //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+  * //David Eppstein, ​Denis Kurz// \\ **[[https://​doi.org/​10.4230/​LIPIcs.IPEC.2017.16|K-Best Solutions of MSO Problems on Tree-Decomposable Graphs]]** \\ IPEC 2017, LIPIcs ​89, Schloss Dagstuhl, ​2018, pages 16:1--16: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, [[:​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 2012LNCS 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   * //Denis Kurz// \\ **{{:​techreports:​tr12-01.pdf|TR12-1-001:​ Parameterized Algorithms for Stochastic Steiner Tree Problems}}** \\ Diploma Thesis, TU Dortmund, 2012
 
Last modified: 2019-08-12 12:02 (external edit)
DokuWikiRSS-Feed