PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Fernau, Henning"

Author of the publication

copydeleteadd this publication to your clipboard
Exact exponential-time algorithms for finding bicliques.

, , , and . Inf. Process. Lett., 111 (2): 64-67 (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Maximilian Henning University of Stuttgart

Henning Schlüter University of Stuttgart

Johanna Henning University of Stuttgart

Dr. Henning Baars University of Stuttgart

Jörn Henning Matthies University of Stuttgart

 

Other publications of authors with the same name

k-gram Extensions of Terminal Distinguishable Languages.. ICPR, page 2125-2128. IEEE Computer Society, (2000)A novel parameterised approximation algorithm for minimum vertex cover., and . Theor. Comput. Sci., (2013)Global r-alliances and total domination., , and . CTW, page 98-101. University of Milan, (2008)Dynamic programming for queen domination.. CTW, page 43-48. University of Twente, (2007)Membership for 1-Limited ET0L Languages Is Not Decidable.. Elektronische Informationsverarbeitung und Kybernetik, 30 (4): 191-211 (1994)Building Clusters with Lower-Bounded Sizes., , , and . ISAAC, volume 64 of LIPIcs, page 4:1-4:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Offensive r-alliances in graphs., , and . Discrete Applied Mathematics, 157 (1): 177-182 (2009)On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems., , and . RAIRO - Theor. Inf. and Applic., 52 (1): 1-21 (2018)Scanning Pictures the Boustrophedon Way., , , and . IWCIA, volume 9448 of Lecture Notes in Computer Science, page 202-216. Springer, (2015)Identification of Function Distinguishable Languages.. ALT, volume 1968 of Lecture Notes in Computer Science, page 116-130. Springer, (2000)