Our research covers many aspects of Theoretical Computer Science, focussing on: efficient graph algorithms, parameterized algorithms and complexity, approximation algorithms and complexity, 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, Lakshmanan Kuppusamy, Rufus Oladele, Indhumathi Raman. Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars. Fundamenta Informaticae.
- Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman. On the computational completeness of matrix simple semi-conditional grammars. Information and Computation.
Henning Fernau, Lakshmanan Kuppusamy, Rufus Oladele, Indhumathi Raman. Improved Descriptional Complexity Results on Generalized Forbidding Grammars. Discrete Applied Mathematics.