Publications from the year of 2010


  • H. Fernau. A top-down approach to search-trees: improved algorithmics for 3-Hitting Set. Algorithmica 57
  • H. Fernau. Minimum Queens Dominating Set: a trivial programming exercise? Discrete Applied Mathematics 158
  • H. Fernau. Parameterized Algorithms for d-Hitting Set: the Weighted Case. Theoretical Computer Science 411
  • H. Fernau, M. Kaufmann, M. Poths. Comparing trees via crossing minimization. Journal of Computer and System Sciences 76
  • D. Binkele-Raible and H. Fernau. A new upper bound for Max-2-SAT: A graph-theoretic approach. Journal of Discrete Algorithms 8
  • H. Fernau. Parameterized algorithmics for d-hitting set. International Journal of Computer Mathematics 87
  • D. Binkele-Raible, H. Fernau, S. Gaspers, M. Liedloff. Exact exponential-time algorithms for finding bicliques. Information Processing Letters 111


  • L. Brankovic and H. Fernau. Combining two worlds: Parameterised approximation for vertex cover. ISAAC 2010
  • D. Raible and H. Fernau. An Amortized Search Tree Analysis for k-Leaf Spanning Tree. SOFSEM 2010
  • H. Fernau, F. V. Fomin, D. Lokshtanov, M. Mnich, G. Philip, S. Saurabh. Ranking and Drawing in Subexponential Time. IWOCA 2010
  • F. N. Abu-Khzam, H. Fernau, M. A. Langston, S. Lee-Cultura, U. Stege. A Fixed-Parameter Algorithm for String-to-String Correction. CATS 2010
  • C. Costa Florêncio and H. Fernau. Finding consistent categorial grammars of bounded value: a parameterized approach. LATA 2010
  • H. Gruber and S. Gulan. Simplifying regular expressions: a quantitative perspective. LATA 2010
  • A. Kasprzik and T. Kötzing. String extension learning using lattices. LATA 2010
  • D. Binkele-Raible and H. Fernau. A faster exact algorithm for the directed maximum leaf spanning tree problem. CSR 2010
  • D. Binkele-Raible, L. Brankovic, H. Fernau, J. Kneis, D. Kratsch, A. Langer, M. Liedloff, P. Rossmanith. A parameterized route to exact puzzles: Breaking the 2n-barrier for irredundance. CIAC 2010
  • H. Fernau, F. V. Fomin, G. Philip, S. Saurabh. The curse of connectivity: t-total vertex (edge) cover. COCOON 2010
  • A. Kasprzik. Generalizing over several learning settings. ICGI 2010
  • C. Costa Florêncio and H. Fernau. Hölder norms and a hierarchy theorem for parameterized classes of CCG. ICGI 2010