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).

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

2020 [ to top ]

  • Solving Vertex Cover in P... - Download
    Bläsius, Thomas; Fischbeck, Philipp; Friedrich, Tobias; Katzmann, MaximilianSolving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. Symposium on the Theoretical Aspects of Computer Science (STACS) 2020: 25:1-25:14
     

2019 [ to top ]

  • Cseh, Ágnes; Juhos, AttilaPairwise Preferences in the Stable Marriage Problem. Symposium Theoretical Aspects of Computer Science (STACS) 2019: 21:1-21:16
     
  • From Graph Theory to Netw... - Download
    Friedrich, TobiasFrom 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, PascalOn 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, MartinTowards 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, DavidCounting 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, TimoA 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, AlexanderBalanced Interval Coloring. Symposium on Theoretical Aspects of Computer Science (STACS) 2011: 531-542
     
  • Measuring Learning Comple... - Download
    Case, John; Kötzing, TimoMeasuring Learning Complexity with Criteria Epitomizers. Symposium on Theoretical Aspects of Computer Science (STACS) 2011: 320-331