All Stories

  1. Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars

    Article • Fundamenta Informaticae, August 2021, IOS Press

    Henning Fernau, Lakshmanan Kuppusamy

  2. Self-Verifying Pushdown and Queue Automata

    Article • Fundamenta Informaticae, May 2021, IOS Press

    Henning Fernau

  3. Diminishable parameterized problems and strict polynomial kernelization

    Article • Computability, February 2020, IOS Press

    Henning Fernau

  4. Pattern Matching with Variables

    Article • ACM Transactions on Computation Theory, February 2020, ACM (Association for Computing Machinery)

    Henning Fernau

  5. On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems

    Article • RAIRO - Theoretical Informatics and Applications, January 2018, EDP Sciences

    Henning Fernau

  6. Non-Isometric Contextual Array Grammars and the Role of Regular Control and Local Selectors

    Article • Fundamenta Informaticae, September 2017, IOS Press

    Henning Fernau

  7. Weak total resolvability in graphs

    Article • Discussiones Mathematicae Graph Theory, January 2016, Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Gora

    Henning Fernau

  8. Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps

    Article • ACM Transactions on Computation Theory, July 2015, ACM (Association for Computing Machinery)

    Henning Fernau