Starten Sie Ihre Suche...


Wir weisen darauf hin, dass wir technisch notwendige Cookies verwenden. Weitere Informationen

Univ.-Prof. Dr. Henning Fernau

Informatikwissenschaften, Universität Trier

Publikationen
Ergebnisse pro Seite:  10

Fernau, Henning; Raible, Daniel

Alliances in Graphs: a Complexity-Theoretic Study.

SOFSEM (2). 2007 S. 61 - 70



Fernau, Henning; Reinhardt, Klaus; Staiger, Ludwig

Decidability of code properties.

RAIRO Theor. Informatics Appl. Bd. 41. H. 3. 2007 S. 243 - 259


Fernau, Henning

Dynamic programming for queen domination.

CTW. 2007 S. 43 - 48


Raible, Daniel; Fernau, Henning

Exact Elimination of Cycles in Graphs.

Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. 2007


Fernau, Henning

Learning tree languages from text.

RAIRO Theor. Informatics Appl. Bd. 41. H. 4. 2007 S. 351 - 374


Chen, Jianer; Fernau, Henning; A. Kanj, Iyad et al.

Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size.

SIAM J. Comput. Bd. 37. H. 4. 2007 S. 1077 - 1106


Fernau, Henning

Programmed Grammars with Rule Queues.

Int. J. Found. Comput. Sci. Bd. 18. H. 6. 2007 S. 1209 - 1213


Fernau, Henning; Freund, Rudolf; Oswald, Marion et al.

Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars.

J. Autom. Lang. Comb. Bd. 12. H. 1-2. 2007 S. 117 - 138


Bordihn, Henning; Fernau, Henning

The Degree of Parallelism.

J. Autom. Lang. Comb. Bd. 12. H. 1-2. 2007 S. 25 - 47