Henning Fernau
Henning Fernau
Professor für Informatik, Universität Trier
Подтвержден адрес электронной почты в домене uni-trier.de
Название
Процитировано
Процитировано
Год
Fixed parameter algorithms for dominating set and related problems on planar graphs
J Alber, HL Bodlaender, H Fernau, T Kloks, R Niedermeier
Algorithmica 33 (4), 461-493, 2002
346*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
1752007
Parameterized complexity: exponential speed-up for planar graph problems
J Alber, H Fernau, R Niedermeier
Journal of Algorithms 52 (1), 26-56, 2004
1452004
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
134*2012
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
109*2005
Algorithms for learning regular expressions from positive data
H Fernau
Information and Computation 207 (4), 521-541, 2009
93*2009
Parameterized algorithmics: A graph-theoretic approach
H Fernau
Germany: Habilitationsschrift, Universität Tübingen, 2005
842005
Vertex and edge covers with clustering properties: Complexity and algorithms
H Fernau, DF Manlove
Journal of Discrete Algorithms 7 (2), 149-167, 2009
672009
Identification of function distinguishable languages
H Fernau
Theoretical Computer Science 290 (3), 1679-1711, 2003
64*2003
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
622011
edge dominating set: Efficient Enumeration-Based Exact Algorithms
H Fernau
International Workshop on Parameterized and Exact Computation, 142-153, 2006
622006
An efficient exact algorithm for constraint bipartite vertex cover
H Fernau, R Niedermeier
Journal of Algorithms 38 (2), 374-410, 2001
612001
A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set
H Fernau
Algorithmica 57 (1), 97-118, 2010
57*2010
Exact and parameterized algorithms for max internal spanning tree
D Binkele-Raible, H Fernau, S Gaspers, M Liedloff
Algorithmica 65 (1), 95-128, 2013
55*2013
Comparing trees via crossing minimization
H Fernau, M Kaufmann, M Poths
Journal of Computer and System Sciences 76 (7), 593-608, 2010
55*2010
Graph separators: a parameterized view
J Alber, H Fernau, R Niedermeier
Journal of Computer and System Sciences 67 (4), 808-832, 2003
552003
On parameterized enumeration
H Fernau
International Computing and Combinatorics Conference, 564-573, 2002
552002
Facility location problems: A parameterized view
MR Fellows, H Fernau
Discrete Applied Mathematics 159 (11), 1118-1130, 2011
54*2011
The complexity of probabilistic lobbying
D Binkele-Raible, G Erdélyi, H Fernau, J Goldsmith, N Mattei, J Rothe
Discrete Optimization 11, 1-21, 2014
50*2014
Fixed parameter algorithms for one-sided crossing minimization revisited
V Dujmović, H Fernau, M Kaufmann
International Symposium on Graph Drawing, 332-344, 2003
50*2003
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20