Henning Fernau And NotSerial
List of bibliographic references
Number of relevant bibliographic references: 22.| Ident. | Authors (with country if any) | Title |
|---|---|---|
| 000004 | 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 |
| 000005 | Henning Fernau [Allemagne] ; Ralf Stiebe [Allemagne] | On the Expressive Power of Valences in Cooperating Distributed Grammar Systems |
| 000014 | Christophe Costa Florêncio [Belgique] ; Henning Fernau [Allemagne] | Hölder Norms and a Hierarchy Theorem for Parameterized Classes of CCG |
| 000018 | Henning Fernau [Allemagne] ; Fedor V. Fomin [Norvège] ; Geevarghese Philip [Inde] ; Saket Saurabh [Inde] | The Curse of Connectivity: t -Total Vertex (Edge) Cover |
| 000022 | Christophe Costa Florêncio [Belgique] ; Henning Fernau [Allemagne] | Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach |
| 000023 | Henning Fernau [Allemagne] ; Serge Gaspers [France] ; Daniel Raible [Allemagne] | Exact and Parameterized Algorithms for Max Internal Spanning Tree |
| 000024 | Daniel Binkele-Raible [Allemagne] ; Henning Fernau [Allemagne] | Enumerate and Measure: Improving Parameter Budget Management |
| 000025 | Ljiljana Brankovic [Australie] ; Henning Fernau [Allemagne] | Combining Two Worlds: Parameterised Approximation for Vertex Cover |
| 000028 | Daniel Raible [Allemagne] ; Henning Fernau [Allemagne] | An Amortized Search Tree Analysis for k -Leaf Spanning Tree |
| 000029 | 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 |
| 000030 | Daniel Binkele-Raible [Allemagne] ; Henning Fernau [Allemagne] | A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem |
| 000031 | 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 |
| 000034 | Henning Fernau [Allemagne] ; Daniel Raible [Allemagne] | Searching Trees: An Essay |
| 000040 | 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 |
| 000045 | Daniel Raible [Allemagne] ; Henning Fernau [Allemagne] | Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees |
| 000049 | Michael Fellows [Australie] ; Henning Fernau [Australie, Allemagne] | Facility Location Problems: A Parameterized View |
| 000050 | Henning Fernau [Allemagne] ; Daniel Raible [Allemagne] | Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs |
| 000051 | Guoqiang Bai [Allemagne] ; Henning Fernau [Allemagne] | Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations |
| 000054 | Henning Fernau [Allemagne] ; Daniel Raible [Allemagne] | A Parameterized Perspective on Packing Paths of Length Two |
| 000055 | Daniel Raible [Allemagne] ; Henning Fernau [Allemagne] | A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach |
| 000073 | Henning Fernau [Allemagne] | edge dominating set : Efficient Enumeration-Based Exact Algorithms |
| 000074 | Henning Fernau [Allemagne, Royaume-Uni] | Parameterized Algorithms for Hitting Set : The Weighted Case |
| This area was generated with Dilib version V0.6.31. |  |