Fernau, Henning; Freund, Rudolf; Siromoney, Rani et al.
Non-isometric Contextual Array Grammars with Regular Control and Local Selectors.MCU. 2015 S. 61 - 78
Fernau, Henning; V. Fomin, Fedor; Philip, Geevarghese et al.
On the parameterized complexity of vertex cover and edge cover with connectivity constraints.Theor. Comput. Sci. Bd. 565. 2015 S. 1 - 15
Fernau, Henning; L. Schmid, Markus
Pattern matching with variables: A multivariate complexity analysis.Inf. Comput. Bd. 242. 2015 S. 287 - 305
Fernau, Henning; Manea, Florin; Mercas, Robert et al.
Pattern Matching with Variables: Fast Algorithms and New Hardness Results.STACS. 2015 S. 302 - 315
Fernau, Henning; Paramasivan, Meenakshi; L. Schmid, Markus et al.
Scanning Pictures the Boustrophedon Way.IWCIA. 2015 S. 202 - 216
Fernau, Henning; Freund, Rudolf; Holzer, Markus
The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems.Int. J. Found. Comput. Sci. Bd. 26. H. 8. 2015 S. 1167 - 1188
Fernau, Henning; López-Ortiz, Alejandro; Romero, Jazmín
Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps.TOCT. Bd. 7. H. 3. 2015 S. 13:1 - 13:29
Binkele-Raible, Daniel; Fernau, Henning
An Amortized Search Tree Analysis for Finding a k-Leaf Spanning Tree in an Undirected Graph.Discrete Mathematics & Theoretical Computer Science. Bd. 16. H. 1. 2014 S. 179 - 200
N. Abu-Khzam, Faisal; Bazgan, Cristina; Chopin, Morgan et al.
Approximation Algorithms Inspired by Kernelization Methods.ISAAC. 2014 S. 479 - 490
Bermudo, Sergio; Fernau, Henning
Computing the differential of a graph: Hardness, approximability and exact algorithms.Discrete Applied Mathematics. Bd. 165. 2014 S. 69 - 82