Eléments de l'association
|
List of bibliographic references
Number of relevant bibliographic references: 22.Ident. | Authors (with country if any) | Title |
---|---|---|
000134 | Daniel Binkele-Raible [Allemagne] ; Henning Fernau [Allemagne] ; Serge Gaspers [Autriche] ; Mathieu Liedloff [France] | Exact and Parameterized Algorithms for MAX INTERNAL SPANNING TREE |
000198 | Daniel Binkele-Raible [Allemagne] ; Henning Fernau [Allemagne] | Parameterized Measure & Conquer for Problems with No Small Kernels |
000219 | Guoqiang Bai [Allemagne] ; Henning Fernau [Allemagne] | Constraint bipartite vertex cover: simpler exact algorithms and implementations |
000223 | Daniel Binkele-Raible [Allemagne] ; Henning Fernau [Allemagne] | An Exact Exponential Time Algorithm for POWER DOMINATING SET |
000299 | Michael R. Fellows [Australie] ; Henning Fernau [Allemagne] | Facility location problems: A parameterized view |
000333 | 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 |
000375 | Henning Fernau [Allemagne] | Parameterized algorithms for d-HITTING SET: The weighted case |
000406 | Daniel Binkele-Raible [Allemagne] ; Henning Fernau [Allemagne] ; Serge Gaspers [Autriche] ; Mathieu Liedloff [France] | Exact exponential-time algorithms for finding bicliques |
000442 | Henning Fernau [Allemagne] | A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-HITTING SET |
000496 | J. M. Sigarreta [Mexique] ; S. Bermudo [Espagne] ; Henning Fernau [Allemagne] | On the complement graph and defensive k-alliances |
000497 | Henning Fernau [Allemagne] ; Juan A. Rodriguez [Espagne] ; José M. Sigarreta [Mexique] | Offensive r-alliances in graphs |
000555 | Henning Fernau [Allemagne] | Algorithms for learning regular expressions from positive data |
000558 | Henning Fernau [Allemagne] ; Daniel Raible [Allemagne] | A parameterized perspective on packing paths of length two |
000601 | Henning Fernau [Allemagne] | Parameterized algorithmics for linear arrangement problems |
000602 | 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 |
000649 | Jürgen Dassow [Allemagne] ; Henning Fernau [Allemagne] | Comparison of some descriptional complexities of 0L systems obtained by a unifying approach |
000661 | Henning Fernau [Allemagne] ; Joe F. Ryan [Australie] ; Kiki A. Sugeng [Australie] | A sum labelling for the generalised friendship graph |
000692 | Henning Fernau [Allemagne] | LEARNING TREE LANGUAGES FROM TEXT |
000700 | Henning Fernau [Allemagne] ; Klaus Reinhardt [Allemagne] ; Ludwig Staiger [Allemagne] | Decidability of code properties |
000755 | Faisal N. Abu-Khzam [Liban] ; Henning Fernau [Allemagne] | Kernels : Annotated, proper and induced |
000756 | Henning Bordihn [Allemagne] ; Henning Fernau [Allemagne] ; Markus Holzer [Allemagne] ; Vincenzo Manca [Italie] ; Carlos Martin-Vide [Espagne] | Iterated sequential transducers as language generating devices |
000769 | Henning Fernau [Allemagne] | Edge dominating set : Efficient enumeration-based exact algorithms |
This area was generated with Dilib version V0.6.31. |