Folgen
Henning Fernau
Henning Fernau
Professor für Informatik, Universität Trier
Bestätigte E-Mail-Adresse bei uni-trier.de
Titel
Zitiert von
Zitiert von
Jahr
Fixed parameter algorithms for dominating set and related problems on planar graphs
Alber, Bodlaender, Fernau, Kloks, Niedermeier
Algorithmica 33, 461-493, 2002
387*2002
Parametric duality and kernelization: Lower bounds and upper bounds on kernel size
J Chen, H Fernau, IA Kanj, G Xia
SIAM Journal on Computing 37 (4), 1077-1106, 2007
1832007
Parameterized complexity: exponential speed-up for planar graph problems
J Alber, H Fernau, R Niedermeier
Journal of Algorithms 52 (1), 26-56, 2004
1562004
Kernel(s) for problems with no kernel: On out-trees with many leaves
D Binkele-Raible, H Fernau, FV Fomin, D Lokshtanov, S Saurabh, ...
ACM Transactions on Algorithms (TALG) 8 (4), 1-19, 2012
153*2012
Algorithms for learning regular expressions from positive data
H Fernau
Information and Computation 207 (4), 521-541, 2009
132*2009
A refined search tree technique for dominating set on planar graphs
J Alber, H Fan, MR Fellows, H Fernau, R Niedermeier, F Rosamond, ...
Journal of Computer and System Sciences 71 (4), 385-405, 2005
115*2005
Parameterized algorithmics: A graph-theoretic approach
H Fernau
Habilitationsschrift, Universität Tübingen, Germany, 2005
1032005
The differential and the Roman domination number of a graph
S Bermudo, H Fernau, JM Sigarreta
Applicable Analysis and Discrete Mathematics, 155-171, 2014
832014
Vertex and edge covers with clustering properties: Complexity and algorithms
H Fernau, DF Manlove
Journal of Discrete Algorithms 7 (2), 149-167, 2009
832009
Infinite iterated function systems
H Fernau
Mathematische Nachrichten 170 (1), 79-91, 1994
791994
On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results
H Fernau, JA Rodríguez-Velázquez
Discrete Applied Mathematics 236, 183-202, 2018
78*2018
On parameterized enumeration
H Fernau
International Computing and Combinatorics Conference, 564-573, 2002
772002
edge dominating set: Efficient Enumeration-Based Exact Algorithms
H Fernau
International Workshop on Parameterized and Exact Computation, 142-153, 2006
732006
Comparing trees via crossing minimization
H Fernau, M Kaufmann, M Poths
Journal of Computer and System Sciences 76 (7), 593-608, 2010
72*2010
An exact algorithm for the maximum leaf spanning tree problem
H Fernau, J Kneis, D Kratsch, A Langer, M Liedloff, D Raible, ...
Theoretical Computer Science 412 (45), 6290-6302, 2011
712011
Fixed parameter algorithms for one-sided crossing minimization revisited
V Dujmović, H Fernau, M Kaufmann
Journal of Discrete Algorithms 6 (2), 313-323, 2008
67*2008
Identification of function distinguishable languages
H Fernau
Theoretical Computer Science 290 (3), 1679-1711, 2003
65*2003
Exact and parameterized algorithms for max internal spanning tree
D Binkele-Raible, H Fernau, S Gaspers, M Liedloff
Algorithmica 65 (1), 95-128, 2013
63*2013
Facility location problems: A parameterized view
MR Fellows, H Fernau
Discrete Applied Mathematics 159 (11), 1118-1130, 2011
63*2011
A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set
H Fernau
Algorithmica 57, 97-118, 2010
63*2010
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20