Eléments de l'association
|  |
List of bibliographic references
Number of relevant bibliographic references: 43.| Ident. | Authors (with country if any) | Title |
|---|---|---|
| 000653 | Daniel Binkele-Raible [Allemagne] ; Henning Fernau [Allemagne] ; Serge Gaspers [Autriche] ; Mathieu Liedloff [France] | Exact and Parameterized Algorithms for MAX INTERNAL SPANNING TREE |
| 000846 | Daniel Binkele-Raible [Allemagne] ; Henning Fernau [Allemagne] | Parameterized Measure & Conquer for Problems with No Small Kernels |
| 000864 | Guoqiang Bai [Allemagne] ; Henning Fernau [Allemagne] | Constraint bipartite vertex cover: simpler exact algorithms and implementations |
| 000867 | Daniel Binkele-Raible [Allemagne] ; Henning Fernau [Allemagne] | An Exact Exponential Time Algorithm for POWER DOMINATING SET |
| 000949 | Henning Fernau [Allemagne] ; Fedor V. Fomin [Norvège] ; Daniel Lokshtanov [Norvège] ; Matthias Mnich [Pays-Bas] ; Geevarghese Philip [Inde] ; Saket Saurabh [Inde] | Ranking and Drawing in Subexponential Time |
| 000962 | Henning Fernau [Allemagne] ; Ralf Stiebe [Allemagne] | On the Expressive Power of Valences in Cooperating Distributed Grammar Systems |
| 000A87 | Michael R. Fellows [Australie] ; Henning Fernau [Allemagne] | Facility location problems: A parameterized view |
| 000B16 | 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 |
| 000B77 | Christophe Costa Florêncio [Belgique] ; Henning Fernau [Allemagne] | Hölder Norms and a Hierarchy Theorem for Parameterized Classes of CCG |
| 000B96 | Henning Fernau [Allemagne] ; Fedor V. Fomin [Norvège] ; Geevarghese Philip [Inde] ; Saket Saurabh [Inde] | The Curse of Connectivity: t -Total Vertex (Edge) Cover |
| 000C34 | Christophe Costa Florêncio [Belgique] ; Henning Fernau [Allemagne] | Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach |
| 000C36 | Henning Fernau [Allemagne] ; Serge Gaspers [France] ; Daniel Raible [Allemagne] | Exact and Parameterized Algorithms for Max Internal Spanning Tree |
| 000C40 | Daniel Binkele-Raible [Allemagne] ; Henning Fernau [Allemagne] | Enumerate and Measure: Improving Parameter Budget Management |
| 000C56 | Ljiljana Brankovic [Australie] ; Henning Fernau [Allemagne] | Combining Two Worlds: Parameterised Approximation for Vertex Cover |
| 000C66 | Daniel Raible [Allemagne] ; Henning Fernau [Allemagne] | An Amortized Search Tree Analysis for k -Leaf Spanning Tree |
| 000C69 | Daniel Binkele-Raible [Allemagne] ; Ljiljana Brankovic [Australie] ; Henning Fernau [Allemagne] ; Joachim Kneis [Allemagne] ; Dieter Kratsch [France] ; Alexander Langer [Allemagne] ; Mathieu Liedloff [France] ; Peter Rossmanith [Allemagne] | A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance |
| 000C70 | Daniel Binkele-Raible [Allemagne] ; Henning Fernau [Allemagne] | A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem |
| 000D07 | Henning Fernau [Allemagne] | Parameterized algorithms for d-HITTING SET: The weighted case |
| 000D34 | Daniel Binkele-Raible [Allemagne] ; Henning Fernau [Allemagne] ; Serge Gaspers [Autriche] ; Mathieu Liedloff [France] | Exact exponential-time algorithms for finding bicliques |
| 000D64 | Henning Fernau [Allemagne] | A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-HITTING SET |
| 000E18 | 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 |
| 000E52 | Henning Fernau [Allemagne] ; Daniel Raible [Allemagne] | Searching Trees: An Essay |
| 000F12 | 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 |
| 000F70 | J. M. Sigarreta [Mexique] ; S. Bermudo [Espagne] ; Henning Fernau [Allemagne] | On the complement graph and defensive k-alliances |
| 000F71 | Henning Fernau [Allemagne] ; Juan A. Rodriguez [Espagne] ; José M. Sigarreta [Mexique] | Offensive r-alliances in graphs |
| 001021 | Henning Fernau [Allemagne] | Algorithms for learning regular expressions from positive data |
| 001023 | Henning Fernau [Allemagne] ; Daniel Raible [Allemagne] | A parameterized perspective on packing paths of length two |
| 001122 | Daniel Raible [Allemagne] ; Henning Fernau [Allemagne] | Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees |
| 001148 | Michael Fellows [Australie] ; Henning Fernau [Australie, Allemagne] | Facility Location Problems: A Parameterized View |
| 001149 | Henning Fernau [Allemagne] ; Daniel Raible [Allemagne] | Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs |
| 001163 | Guoqiang Bai [Allemagne] ; Henning Fernau [Allemagne] | Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations |
| 001174 | Henning Fernau [Allemagne] ; Daniel Raible [Allemagne] | A Parameterized Perspective on Packing Paths of Length Two |
| 001175 | Daniel Raible [Allemagne] ; Henning Fernau [Allemagne] | A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach |
| 001209 | Henning Fernau [Allemagne] | Parameterized algorithmics for linear arrangement problems |
| 001210 | 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 |
| 001250 | Jürgen Dassow [Allemagne] ; Henning Fernau [Allemagne] | Comparison of some descriptional complexities of 0L systems obtained by a unifying approach |
| 001261 | Henning Fernau [Allemagne] ; Joe F. Ryan [Australie] ; Kiki A. Sugeng [Australie] | A sum labelling for the generalised friendship graph |
| 001395 | Henning Fernau [Allemagne] | LEARNING TREE LANGUAGES FROM TEXT |
| 001402 | Henning Fernau [Allemagne] ; Klaus Reinhardt [Allemagne] ; Ludwig Staiger [Allemagne] | Decidability of code properties |
| 001457 | Henning Fernau [Allemagne] | edge dominating set : Efficient Enumeration-Based Exact Algorithms |
| 001477 | Henning Fernau [Allemagne, Royaume-Uni] | Parameterized Algorithms for Hitting Set : The Weighted Case |
| 001486 | Faisal N. Abu-Khzam [Liban] ; Henning Fernau [Allemagne] | Kernels: Annotated, Proper and Induced |
| 001569 | Henning Bordihn [Allemagne] ; Henning Fernau [Allemagne] ; Markus Holzer [Allemagne] ; Vincenzo Manca [Italie] ; Carlos Martin-Vide [Espagne] | Iterated sequential transducers as language generating devices |
| This area was generated with Dilib version V0.6.31. |  |