Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
  
 

Publications at STACS

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

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

2018 [ to top ]

  • 1710.01782.pdf
    Bilò, Davide; Lenzner, Pascal On the Tree Conjecture for the Network Creation Game. Symposium on the Theoretical Aspects of Computer Science (STACS) 2018: to appear
     

2016 [ to top ]

  • Kötzing_Schirneck_Towards_an_Atlas_of_Computational_Learning.pdf
    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+Cactus+Graphs+Modulo+2.pdf
    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
     
  • ASolutionToWiehagensThesis.pdf
    Kötzing, Timo A Solution to Wiehagen's Thesis. Symposium on Theoretical Aspects of Computer Science (STACS) 2014: 494-505
     

2011 [ to top ]

  • BalancedIntervalColoring.pdf
    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
     
  • MeasuringLearningComplexityWithCriteriaEpitomizers.pdf
    Case, John; Kötzing, Timo Measuring Learning Complexity with Criteria Epitomizers. Symposium on Theoretical Aspects of Computer Science (STACS) 2011: 320-331