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

Casel, Katrin; Fernau, Henning; Khosravian Ghadikolaei, Mehdi et al.

Abundant Extensions.

CIAC. 2021 S. 3 - 17


Vu, Martin; Fernau, Henning

Adding Matrix Control: Insertion-Deletion Systems with Substitutions III.

SOFSEM. 2021 S. 577 - 592


Vu, Martin; Fernau, Henning

Adding Matrix Control: Insertion-Deletion Systems with Substitutions III.

Algorithms. Bd. 14. H. 5. 2021 S. 131


Monnot, Jérôme; Fernau, Henning; F. Manlove, David

Algorithmic aspects of upper edge domination.

Theor. Comput. Sci. Bd. 877. 2021 S. 46 - 57


Arrighi, Emmanuel; Fernau, Henning; Lokshtanov, Daniel et al.

Diversity in Kemeny Rank Aggregation: A Parameterized Approach.

IJCAI. 2021 S. 10 - 16


Fernau, Henning; Kuppusamy, Lakshmanan; O. Oladele, Rufus et al.

Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars.

Fundam. Informaticae. Bd. 181. H. 2-3. 2021 S. 189 - 211


Fernau, Henning; T. Huber, Katharina; (Seffi) Naor, Joseph

Invited Talks.

CIAC. 2021 S. 3 - 19


Arrighi, Emmanuel; Fernau, Henning; Hoffmann, Stefan et al.

On the Complexity of Intersection Non-emptiness for Star-Free Language Classes.

FSTTCS. 2021 S. 34:1 - 34:15


Casel, Katrin; Fernau, Henning; Gaspers, Serge et al.

On the Complexity of the Smallest Grammar Problem over Fixed Alphabets.

Theory Comput. Syst. Bd. 65. H. 2. 2021 S. 344 - 409


Fernau, Henning; Kuppusamy, Lakshmanan; Raman, Indhumathi

On the generative capacity of matrix insertion-deletion systems of small sum-norm.

Nat. Comput. Bd. 20. H. 4. 2021 S. 671 - 689