Publications from the year of 2011


  • H. Fernau and R. Stiebe. On the expressive power of valences in cooperating distributed grammar systems. Computation, Cooperation, and Life


  • H. Fernau, J. Kneis, D. Kratsch, A. Langer, M. Liedloff, D. Raible, P. Rossmanith. An exact algorithm for the Maximum Leaf Spanning Tree problem. Theoretical Computer Science 412
  • F. N. Abu-Khzam, H. Fernau, M. A. Langston, S. Lee-Cultura, U. Stege. Charge and reduce: A fixed-parameter algorithm for string-to-string correction. Discrete Optimization 8
  • D. Binkele-Raible, L. Brankovic, M. Cygan, H. Fernau, J. Kneis, D. Kratsch, A. Langer, M. Liedloff, M. Pilipczuk, P. Rossmanith, J. O. Wojtaszczyk. Breaking the 2n -barrier for Irredundance: Two lines of attack. Journal of Discrete Algorithms 9
  • M. R. Fellows und H. Fernau. Facility location problems: A parameterized view. Discrete Applied Mathematics 159


  • R. Yoshinaka and A. Kasprzik. Distributional Learning of Simple Context-Free Tree Grammars. ALT 2011
  • L. Brankovic and H. Fernau. Parameterized Approximation Algorithms for Hitting Set. WAOA 2011
  • B.-M. Bui-Xuan, P. Heggernes, D. Meister, A. Proskurowski. A generic approach to decomposition algorithms, with an application to digraph decomposition. COCOON 2011
  • P. Heggernes, D. Meister, U. Rotics. Computing the clique-width of large path powers in linear time via a new characterisation of clique-width. CSR 2011
  • S. Gulan. Series-Parallel Graphs with Loops: Graphs Encoded by Regular Expressions. STACS 2011