Starten Sie Ihre Suche...


Durch die Nutzung unserer Webseite erklären Sie sich damit einverstanden, dass wir Cookies verwenden. Weitere Informationen

Univ.-Prof. Dr. Henning Fernau

Informatikwissenschaften, Universität Trier

Publikationen
Ergebnisse pro Seite:  10

Fernau, Henning; Paramasivan, Meenakshi; Gnanaraj Thomas, D.

Regular grammars for array languages.

NCMA. 2017 S. 119 - 134


Fernau, Henning; Kutrib, Martin; Wendlandt, Matthias

Self-verifying pushdown automata.

NCMA. 2017 S. 103 - 117


Fernau, Henning; Kuppusamy, Lakshmanan; Verlan, Sergey

Universal Matrix Insertion Grammars with Small Size.

UCNC. 2017 S. 182 - 193


Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin et al.

Algorithmic Aspects of Upper Domination: A Parameterised Perspective.

AAIM. 2016 S. 113 - 124


Fernau, Henning

An Essay on General Grammars.

Journal of Automata, Languages and Combinatorics. Bd. 21. H. 1-2. 2016 S. 69 - 92


N. Abu-Khzam, Faisal; Bazgan, Cristina; Casel, Katrin et al.

Building Clusters with Lower-Bounded Sizes.

ISAAC. 2016 S. 4:1 - 4:13


Fernau, Henning; Freund, Rudolf; Siromoney, Rani et al.

Contextual Array Grammars with Matrix and Regular Control.

DCFS. 2016 S. 98 - 110


N. Abu-Khzam, Faisal; Bazgan, Cristina; Chopin, Morgan et al.

Data reductions and combinatorial bounds for improved approximation algorithms.

J. Comput. Syst. Sci. Bd. 82. H. 3. 2016 S. 503 - 520


Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi

Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems.

DCFS. 2016 S. 111 - 125


Fernau, Henning; Fluschnik, Till; Hermelin, Danny et al.

Diminishable Parameterized Problems and Strict Polynomial Kernelization.

CoRR. Bd. abs/1611.03739. 2016