Research @ Chair of Theoretical Computer Science

Our research covers many aspects of Theoretical Computer Science, focussing on: efficient graph algorithms, parameterized algorithms, formal languages and grammar induction.

In the following, you can find a list of papers of members of our research group of this year. Regarding previous years, we refer to the menu to the right. For complete lists of publications, we refer to the homepages of each of the group members.


Accepted for publication in journals:

  • Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid. Revisiting Shinohara's Algorithm for Computing Descriptive Patterns. Theoretical Computer Science
  • Henning Fernau, Laksmanan Kuppusamy, Indhumathi Raman. Investigations on the Power of Matrix Insertion-Deletion Systems with Small Sizes. Natural Computing
  • Cristina Bazgan, Ljiljana Brankovic, Katrin Casel,  Henning Fernau, Klaus Jansen, K.-M. Klein, Michael Lampis, Mathieu Liedloff, Jerome Monnot, Vangelis Th. Paschos. The Many Facets of Upper Domination. Theoretical Computer Science
  • Henning Fernau,  Meenakshi Paramasivan, Markus L. Schmid, D. G. Thomas. Simple Formal Picture Processing. Journal of Computer and System Sciences
  • Faisal Abu-Khzam, Cristina Bazgan, Katrin Casel, Henning Fernau. Clustering with Lower-Bounded Sizes; A General Graph-Theoretic Framework. Algorithmica