Hennie Wijnen < Henning Fernau < Henning Tiemeier

Facettes :

List of bibliographic references

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

Ident.	Authors (with country if any)	Title
000772 (2010)	Christophe Costa Florêncio [Belgique] ; Henning Fernau [Allemagne]	Hölder Norms and a Hierarchy Theorem for Parameterized Classes of CCG
000E39 (2006)	Faisal N. Abu-Khzam [Liban] ; Henning Fernau [Allemagne]	Kernels: Annotated, Proper and Induced
000E52 (2006)	Henning Fernau [Allemagne]	edge dominating set : Efficient Enumeration-Based Exact Algorithms
000E72 (2006)	Henning Fernau [Allemagne, Royaume-Uni]	Parameterized Algorithms for Hitting Set : The Weighted Case
000F73 (2010)	Ljiljana Brankovic [Australie] ; Henning Fernau [Allemagne]	Combining Two Worlds: Parameterised Approximation for Vertex Cover
000F94 (2010)	Henning Fernau [Allemagne] ; Fedor V. Fomin [Norvège] ; Geevarghese Philip [Inde] ; Saket Saurabh [Inde]	The Curse of Connectivity: t -Total Vertex (Edge) Cover
001429 (2009)	Henning Fernau [Allemagne] ; Daniel Raible [Allemagne]	Searching Trees: An Essay
001581 (2008)	Guoqiang Bai [Allemagne] ; Henning Fernau [Allemagne]	Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
001582 (2011)	Henning Fernau [Allemagne] ; Ralf Stiebe [Allemagne]	On the Expressive Power of Valences in Cooperating Distributed Grammar Systems
001596 (2008)	Henning Fernau [Allemagne] ; Daniel Raible [Allemagne]	Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
001605 (2010)	Daniel Binkele-Raible [Allemagne] ; Henning Fernau [Allemagne]	A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem
001673 (2008)	Michael Fellows [Australie] ; Henning Fernau [Australie, Allemagne]	Facility Location Problems: A Parameterized View
001692 (2008)	Henning Fernau [Allemagne] ; Daniel Raible [Allemagne]	A Parameterized Perspective on Packing Paths of Length Two
001726 (2008)	Daniel Raible [Allemagne] ; Henning Fernau [Allemagne]	A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach
001732 (2010)	Daniel Raible [Allemagne] ; Henning Fernau [Allemagne]	An Amortized Search Tree Analysis for k -Leaf Spanning Tree
001930 (2009)	Gábor Erdélyi [Allemagne] ; Henning Fernau [Allemagne] ; Judy Goldsmith [États-Unis] ; Nicholas Mattei [États-Unis] ; Daniel Raible [Allemagne] ; Jörg Rothe [Allemagne]	The Complexity of Probabilistic Lobbying
001937 (2008)	Daniel Raible [Allemagne] ; Henning Fernau [Allemagne]	Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees
001945 (2010)	Daniel Binkele-Raible [Allemagne] ; Henning Fernau [Allemagne]	Enumerate and Measure: Improving Parameter Budget Management
001953 (2010)	Henning Fernau [Allemagne] ; Serge Gaspers [France] ; Daniel Raible [Allemagne]	Exact and Parameterized Algorithms for Max Internal Spanning Tree
001975 (2010)	Christophe Costa Florêncio [Belgique] ; Henning Fernau [Allemagne]	Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach
001A12 (2009)	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

---

Pour manipuler ce document sous Unix (Dilib)

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

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

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

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

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    Istex
   |é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