Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
  
 

Publications at STACS

Below you find the list of all publications of the Algorithm Engineering group presented at the Symposium on Theoretical Aspects of Computer Science (STACS).

You can view all publications of the current members of the Algorithm Engineering group. For other listings, please see:

[ 2019 ] [ 2018 ] [ 2016 ] [ 2014 ] [ 2011 ]

2019 [ to top ]

  • From Graph Theory to Netw... - Download
    Friedrich, Tobias From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity. Symposium Theoretical Aspects of Computer Science (STACS) 2019: 5:1–5:9
     

2018 [ to top ]

  • On the Tree Conjecture fo... - Download
    Bilò, Davide; Lenzner, Pascal On the Tree Conjecture for the Network Creation Game. Symposium on the Theoretical Aspects of Computer Science (STACS) 2018: 14:1--14:15
     

2016 [ to top ]

  • Towards an Atlas of Compu... - Download
    Kötzing, Timo; Schirneck, Martin Towards an Atlas of Computational Learning Theory. Symposium on Theoretical Aspects of Computer Science (STACS) 2016: 47:1-47:13
     

2014 [ to top ]

  • Counting Homomorphisms to... - Download
    Göbel, Andreas; Goldberg, Leslie Ann; Richerby, David Counting Homomorphisms to Cactus Graphs Modulo 2. Symposium on Theoretical Aspects of Computer Science (STACS) 2014: 350-361
     
  • A Solution to Wiehagen's ... - Download
    Kötzing, Timo A Solution to Wiehagen's Thesis. Symposium on Theoretical Aspects of Computer Science (STACS) 2014: 494-505
     

2011 [ to top ]

  • Balanced Interval Colorin... - Download
    Antoniadis, Antonios; Hüffner, Falk; Lenzner, Pascal; Moldenhauer, Carsten; Souza, Alexander Balanced Interval Coloring. Symposium on Theoretical Aspects of Computer Science (STACS) 2011: 531-542
     
  • Measuring Learning Comple... - Download
    Case, John; Kötzing, Timo Measuring Learning Complexity with Criteria Epitomizers. Symposium on Theoretical Aspects of Computer Science (STACS) 2011: 320-331