Publications

Conference: 30th International Symposium on Theoretical Aspects of Computer Science

2013

• Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries, 30th International Symposium on Theoretical Aspects of Computer Science, Kiel, Germany, 27 February 2013 - 2 March 2013. See in PBN
• Andreas Bjorklund, Petteri Kaski, Łukasz Kowalik , Probably Optimal Graph Motifs, 30th International Symposium on Theoretical Aspects of Computer Science, Kiel, Germany, 27 February 2013 - 2 March 2013. See in PBN
• Marcin Pilipczuk , Michał Pilipczuk , Piotr Sankowski , Erik Jan van Leeuwen, Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs, 30th International Symposium on Theoretical Aspects of Computer Science, Kiel, Germany, 27 February 2013 - 2 March 2013. See in PBN
• Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk , Michał Pilipczuk , Yngve Villanger, Tight bounds for Parameterized Complexity of Cluster Editing, 30th International Symposium on Theoretical Aspects of Computer Science, Kiel, Germany, 27 February 2013 - 2 March 2013. See in PBN