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

Bermudo, Sergio; Fernau, Henning

Computing the differential of a graph.

CTW. 2011 S. 68 - 71


R. Fellows, Michael; Fernau, Henning

Facility location problems: A parameterized view.

Discrete Applied Mathematics. Bd. 159. H. 11. 2011 S. 1118 - 1130


Fernau, Henning; Stiebe, Ralf

On the Expressive Power of Valences in Cooperating Distributed Grammar Systems.

Computation, Cooperation, and Life. 2011 S. 90 - 106


Brankovic, Ljiljana; Fernau, Henning

Parameterized Approximation Algorithms for Hitting Set.

WAOA. 2011 S. 63 - 76


Binkele-Raible, Daniel; Fernau, Henning

A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem.

CSR. 2010 S. 328 - 339


N. Abu-Khzam, Faisal; Fernau, Henning; A. Langston, Michael et al.

A Fixed-Parameter Algorithm for String-to-String Correction.

CATS. 2010 S. 31 - 38


Binkele-Raible, Daniel; Fernau, Henning

A new upper bound for Max-2-SAT: A graph-theoretic approach.

J. Discrete Algorithms. Bd. 8. H. 4. 2010 S. 388 - 401


Binkele-Raible, Daniel; Brankovic, Ljiljana; Fernau, Henning et al.

A Parameterized Route to Exact Puzzles: Breaking the 2-Barrier for Irredundance.

CIAC. 2010 S. 311 - 322


Fernau, Henning

A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set.

Algorithmica. Bd. 57. H. 1. 2010 S. 97 - 118


Raible, Daniel; Fernau, Henning

An Amortized Search Tree Analysis for -Leaf Spanning Tree.

SOFSEM. 2010 S. 672 - 684