Algorithms for learning regular expressions from positive dataFERNAU, Henning.Information and computation (Print). 2009, Vol 207, Num 4, pp 521-541, issn 0890-5401, 21 p.Article

Identification of function distinguishable languagesFERNAU, Henning.Theoretical computer science. 2003, Vol 290, Num 3, pp 1679-1711, issn 0304-3975, 33 p.Article

Parallel communicating grammar systems with terminal transmissionFERNAU, Henning.Acta informatica. 2001, Vol 37, Num 7, pp 511-540, issn 0001-5903Article

A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-HITTING SETFERNAU, Henning.Algorithmica. 2010, Vol 57, Num 1, pp 97-118, issn 0178-4617, 22 p.Article

Parameterized algorithms for d-HITTING SET: The weighted caseFERNAU, Henning.Theoretical computer science. 2010, Vol 411, Num 16-18, pp 1698-1713, issn 0304-3975, 16 p.Article

ROMAN DOMINATION : A parameterized perspectiveFERNAU, Henning.Lecture notes in computer science. 2006, pp 262-271, issn 0302-9743, isbn 3-540-31198-X, 1Vol, 10 p.Conference Paper

LEARNING TREE LANGUAGES FROM TEXTFERNAU, Henning.Informatique théorique et applications (Imprimé). 2007, Vol 41, Num 4, pp 351-374, issn 0988-3754, 24 p.Article

Fragmentation: Enhancing identifiabilityFERNAU, Henning.Lecture notes in computer science. 2002, pp 92-105, issn 0302-9743, isbn 3-540-44239-1, 14 p.Conference Paper

Sequential grammars and automata with valencesFERNAU, Henning; STIEBE, Ralf.Theoretical computer science. 2002, Vol 276, Num 1-2, pp 377-405, issn 0304-3975Article

An Exact Exponential Time Algorithm for POWER DOMINATING SETBINKELE-RAIBLE, Daniel; FERNAU, Henning.Algorithmica. 2012, Vol 63, Num 1-2, pp 323-346, issn 0178-4617, 24 p.Article

Graph separator algorithms: A refined analysisFERNAU, Henning.Lecture notes in computer science. 2002, pp 186-197, issn 0302-9743, isbn 3-540-00331-2, 12 p.Conference Paper

On the degree of scattered context-sensitivityFERNAU, Henning; MEDUNA, Alexander.Theoretical computer science. 2003, Vol 290, Num 3, pp 2121-2124, issn 0304-3975, 4 p.Article

Learning XML grammarsFERNAU, Henning.Lecture notes in computer science. 2001, pp 73-87, issn 0302-9743, isbn 3-540-42359-1Conference Paper

Facility location problems: A parameterized viewFELLOWS, Michael R; FERNAU, Henning.Discrete applied mathematics. 2011, Vol 159, Num 11, pp 1118-1130, issn 0166-218X, 13 p.Article

An efficient exact algorithm for constraint bipartite vertex coverFERNAU, Henning; NIEDERMEIER, Rolf.Journal of algorithms (Print). 2001, Vol 38, Num 2, pp 374-410, issn 0196-6774Article

Grammatical inference : algorithms and applications (Amsterdam, 23-25 September 2002)Adriaans, Pieter; Fernau, Henning; van Zaanen, Menno et al.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-44239-1, IX, 314 p, isbn 3-540-44239-1Conference Proceedings

Parameterized algorithmics for linear arrangement problemsFERNAU, Henning.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3166-3177, issn 0166-218X, 12 p.Conference Paper

Edge dominating set : Efficient enumeration-based exact algorithmsFERNAU, Henning.Lecture notes in computer science. 2006, pp 142-153, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

Comparing trees via crossing minimizationFERNAU, Henning; KAUFMANN, Michael; POTHS, Mathias et al.Lecture notes in computer science. 2005, pp 457-469, issn 0302-9743, isbn 3-540-30495-9, 1Vol, 13 p.Conference Paper

Approximative learning of regular languagesFERNAU, Henning.Lecture notes in computer science. 2001, pp 223-232, issn 0302-9743, isbn 3-540-42912-3Conference Paper

Fixed parameter algorithms for one-sided crossing minimization revisitedDUJMOVIC, Vida; FERNAU, Henning; KAUFMANN, Michael et al.Lecture notes in computer science. 2003, pp 332-344, issn 0302-9743, isbn 3-540-20831-3, 13 p.Conference Paper

Learning tree languages from textFERNAU, Henning.Lecture notes in computer science. 2002, pp 153-168, issn 0302-9743, isbn 3-540-43836-X, 16 p.Conference Paper

Identification of function distinguishable languagesFERNAU, Henning.Lecture notes in computer science. 2000, pp 116-130, issn 0302-9743, isbn 3-540-41237-9Conference Paper

Constraint bipartite vertex cover: simpler exact algorithms and implementationsBAI, Guoqiang; FERNAU, Henning.Journal of combinatorial optimization. 2012, Vol 23, Num 3, pp 331-355, issn 1382-6905, 25 p.Article

Offensive r-alliances in graphsFERNAU, Henning; RODRIGUEZ, Juan A; SIGARRETA, José M et al.Discrete applied mathematics. 2009, Vol 157, Num 1, pp 177-182, issn 0166-218X, 6 p.Article