Henning Buddenbaum < Henning Fernau < Henning Kelbaek

Facettes :

List of bibliographic references

Number of relevant bibliographic references: 21.
[0-20] [0 - 20][0 - 21][20-20][20-40]

Ident.	Authors (with country if any)	Title
000525 (2006)	Henning Bordihn [Allemagne] ; Henning Fernau [Allemagne] ; Markus Holzer [Allemagne] ; Vincenzo Manca [Italie] ; Carlos Martin-Vide [Espagne]	Iterated sequential transducers as language generating devices
000539 (2006)	Henning Fernau [Allemagne]	Edge dominating set : Efficient enumeration-based exact algorithms
000540 (2006)	Faisal N. Abu-Khzam [Liban] ; Henning Fernau [Allemagne]	Kernels : Annotated, proper and induced
000595 (2007)	Henning Fernau [Allemagne] ; Klaus Reinhardt [Allemagne] ; Ludwig Staiger [Allemagne]	Decidability of code properties
000596 (2008)	Henning Fernau [Allemagne] ; Joe F. Ryan [Australie] ; Kiki A. Sugeng [Australie]	A sum labelling for the generalised friendship graph
000597 (2007)	Henning Fernau [Allemagne]	LEARNING TREE LANGUAGES FROM TEXT
000630 (2008)	JIANER CHEN [États-Unis] ; Henning Fernau [Allemagne] ; Iyad A. Kanj [États-Unis] ; GE XIA [États-Unis]	PARAMETRIC DUALITY AND KERNELIZATION : LOWER BOUNDS AND UPPER BOUNDS ON KERNEL SIZE
000653 (2008)	Jürgen Dassow [Allemagne] ; Henning Fernau [Allemagne]	Comparison of some descriptional complexities of 0L systems obtained by a unifying approach
000663 (2008)	Henning Fernau [Allemagne]	Parameterized algorithmics for linear arrangement problems
000667 (2009)	Henning Fernau [Allemagne] ; Juan A. Rodriguez [Espagne] ; José M. Sigarreta [Mexique]	Offensive r-alliances in graphs
000709 (2009)	Henning Fernau [Allemagne]	Algorithms for learning regular expressions from positive data
000808 (2009)	Henning Fernau [Allemagne] ; Daniel Raible [Allemagne]	A parameterized perspective on packing paths of length two
000816 (2010)	Henning Fernau [Allemagne]	Parameterized algorithms for d-HITTING SET: The weighted case
000817 (2010)	Henning Fernau [Allemagne]	A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-HITTING SET
000886 (2010)	Daniel Binkele-Raible [Allemagne] ; Henning Fernau [Allemagne] ; Serge Gaspers [Autriche] ; Mathieu Liedloff [France]	Exact exponential-time algorithms for finding bicliques
000928 (2011)	Michael R. Fellows [Australie] ; Henning Fernau [Allemagne]	Facility location problems: A parameterized view
000975 (2011)	Henning Fernau [Allemagne] ; Joachim Kneis [Allemagne] ; Dieter Kratsch [France] ; Alexander Langer [Allemagne] ; Mathieu Liedloff [France] ; Daniel Raible [Allemagne] ; Peter Rossmanith [Allemagne]	An exact algorithm for the Maximum Leaf Spanning Tree problem
000A19 (2012)	Daniel Binkele-Raible [Allemagne] ; Henning Fernau [Allemagne]	An Exact Exponential Time Algorithm for POWER DOMINATING SET
000A52 (2012)	Guoqiang Bai [Allemagne] ; Henning Fernau [Allemagne]	Constraint bipartite vertex cover: simpler exact algorithms and implementations
000A72 (2012)	Daniel Binkele-Raible [Allemagne] ; Henning Fernau [Allemagne]	Parameterized Measure & Conquer for Problems with No Small Kernels
000A90 (2013)	Daniel Binkele-Raible [Allemagne] ; Henning Fernau [Allemagne] ; Serge Gaspers [Autriche] ; Mathieu Liedloff [France]	Exact and Parameterized Algorithms for MAX INTERNAL SPANNING TREE

---

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/PascalFrancis/Curation

HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/Author.i -k "Henning Fernau" 

HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/Author.i  \
                -Sk "Henning Fernau" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd 

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    PascalFrancis
   |étape=   Curation
   |type=    indexItem
   |index=    Author.i
   |clé=    Henning Fernau
}}

---

This area was generated with Dilib version V0.6.31. Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024