Serveur d'exploration sur l'Université de Trèves - Merge (PascalFrancis)

Index « FA11s1.i » - entrée « FERNAU (Henning) »
Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.
FERNAU (H.) < FERNAU (Henning) < FERNÁNDEZ-GÁLVEZ (J.)  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 ; Henning Fernau ; Markus Holzer ; Vincenzo Manca ; Carlos Martin-VideIterated sequential transducers as language generating devices
000539 (2006) Henning FernauEdge dominating set : Efficient enumeration-based exact algorithms
000540 (2006) Faisal N. Abu-Khzam ; Henning FernauKernels : Annotated, proper and induced
000595 (2007) Henning Fernau ; Klaus Reinhardt ; Ludwig StaigerDecidability of code properties
000596 (2008) Henning Fernau ; Joe F. Ryan ; Kiki A. SugengA sum labelling for the generalised friendship graph
000597 (2007) Henning FernauLEARNING TREE LANGUAGES FROM TEXT
000630 (2008) JIANER CHEN ; Henning Fernau ; Iyad A. Kanj ; GE XIAPARAMETRIC DUALITY AND KERNELIZATION : LOWER BOUNDS AND UPPER BOUNDS ON KERNEL SIZE
000653 (2008) Jürgen Dassow ; Henning FernauComparison of some descriptional complexities of 0L systems obtained by a unifying approach
000663 (2008) Henning FernauParameterized algorithmics for linear arrangement problems
000667 (2009) Henning Fernau ; Juan A. Rodriguez ; José M. SigarretaOffensive r-alliances in graphs
000709 (2009) Henning FernauAlgorithms for learning regular expressions from positive data
000808 (2009) Henning Fernau ; Daniel RaibleA parameterized perspective on packing paths of length two
000816 (2010) Henning FernauParameterized algorithms for d-HITTING SET: The weighted case
000817 (2010) Henning FernauA Top-Down Approach to Search-Trees: Improved Algorithmics for 3-HITTING SET
000886 (2010) Daniel Binkele-Raible ; Henning Fernau ; Serge Gaspers ; Mathieu LiedloffExact exponential-time algorithms for finding bicliques
000928 (2011) Michael R. Fellows ; Henning FernauFacility location problems: A parameterized view
000975 (2011) Henning Fernau ; Joachim Kneis ; Dieter Kratsch ; Alexander Langer ; Mathieu Liedloff ; Daniel Raible ; Peter RossmanithAn exact algorithm for the Maximum Leaf Spanning Tree problem
000A19 (2012) Daniel Binkele-Raible ; Henning FernauAn Exact Exponential Time Algorithm for POWER DOMINATING SET
000A52 (2012) Guoqiang Bai ; Henning FernauConstraint bipartite vertex cover: simpler exact algorithms and implementations
000A72 (2012) Daniel Binkele-Raible ; Henning FernauParameterized Measure & Conquer for Problems with No Small Kernels
000A90 (2013) Daniel Binkele-Raible ; Henning Fernau ; Serge Gaspers ; Mathieu LiedloffExact 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/Merge
HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Merge/FA11s1.i -k "FERNAU (Henning)" 
HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Merge/FA11s1.i  \
                -Sk "FERNAU (Henning)" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/PascalFrancis/Merge/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=   Merge
   |type=    indexItem
   |index=    FA11s1.i
   |clé=    FERNAU (Henning)
}}

Wicri

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