Publications from before the year of 2009

  • Henning Fernau, J. A. Rodríguez, and J. M. Sigarreta. Offensive r-alliances in graphs. Discrete Applied Mathematics, 157:177-182
  • A. Kasprzik. Making Finite-State Methods Applicable to Languages Beyond Context-Freeness via Multi-dimensional Trees. In: J. Piskorski, B. Watson, A. Yli-Jyrä (eds.) Post-proceedings of the 7th International Workshop on Finite-State Methods and Natural Language Processing, pp. 98-109. IOS Press, 2009.
  • A. Kasprzik. Two Equivalent Regularizations for Tree Adjoining Grammars. In: A. H. Dediu, A. M. Ionescu, C. Martin-Vide (eds.) LATA 2009, LNCS 5457, pp. 469-480. Springer Berlin Heidelberg
  • Henning Fernau. Algorithms for learning regular expressions from positive data. Information and Computation, 207:521–541
  • Henning Fernau, F. V. Fomin, D. Lokshtanov, D. Raible, S. Saurabh and Y. Villanger. Kernel(s) for problems with no kernel: on out-trees with many leaves. In S. Albers and J.-Y. Marion, editors, Symposium on Theoretical Aspects of Computer Science STACS, pages 421–432. Schloss Dagstuhl — Leibniz-Zentrum für Informatik, Germany
  • Henning Fernau and D. Raible. Searching trees: an essay. In J. Chen and S. B. Cooper, editors, Theory and Applications of Models of Computation TAMC, volume 5532 of LNCS, pages 59–70. Springer Berlin Heidelberg
  • Henning Fernau and D. F. Manlove. Vertex and edge covers with clustering properties: Complexity and algorithms. Journal of Discrete Algorithms, 7:149–167
  • J. M. Sigarreta, S. Bermudo, and Henning Fernau. On the complement graph and defensive k-alliances. Discrete Applied Mathematics, 157:1687–1695
  • Henning Fernau and D. Raible. Packing paths: Recycling saves time. In S. Cafieri, A. Mucherino, G. Nannicini, F. Tarissan, and L. Liberti, editors, Cologne-Twente Workshop on Graphs and Combinatorial Optimization CTW, pages 79–83
  • Henning Fernau, S. Gaspers, D. Kratsch, M. Liedloff, and D. Raible. Exact exponential-time algorithms for finding bicliques in a graph. In S. Cafieri, A. Mucherino, G. Nannicini, F. Tarissan, and L. Liberti, editors, Cologne-Twente Workshop on Graphs and Combinatorial Optimization CTW, pages 205–209
  • G. Erdélyi, Henning Fernau, J. Goldsmith, N. Mattei, D. Raible, and J. Rothe. The complexity of probabilistic lobbying. Technical Report abs/0906.4431, Arxiv, 2009. Conference version In F. Rossi und A. Tsouki`as (eds): International Conference on Algorithmic Decision Theory ADT, volume 5783 of LNCS, pages 86-97. Springer Berlin Heidelberg
  • Henning Fernau, S. Gaspers and D. Raible. Exact and parameterized algorithms for Max Internal Spanning Tree. In C. Paul and M. Habib, editors, Workshop on Graph-Theoretic Concepts in Computer Science WG, volume 5911 of LNCS, pages 100–111. Springer Berlin Heidelberg, 2009.
  • Henning Fernau, J. Kneis, D. Kratsch, A. Langer, M. Liedloff, D. Raible and P. Rossmanith. An exact algorithm for the Maximum Leaf Spanning Tree problem. In J. Chen and F. V. Fomin, editors, International Workshop on Parameterized and Exact Computations IWPEC, volume 5917 of LNCS, pages 161–172. Springer Berlin Heidelberg
  • Henning Fernau and D. Raible. A parameterized perspective on packing paths of length two. Journal of Combinatorial Optimization, 18:319–341