Publications from the year of 2012

Books

H. Fernau.Approximate learning vs. inductive learning.Encyclopedia of the Sciences of Learning
H. Fernau. Cooperating distributed tree automata. Dassow Festschrift 2012

D. Meister and J. A. Telle. Chordal digraphs. Theoretical Computer Science 463
J. Heinz, A. Kasprzik, T. Kötzing. Learning in the limit with lattice-structured hypothesis spaces. Theoretical Computer Science 457
S. Bermudo and H. Fernau. Lower bounds on the differential of a graph. Discrete Mathematics 312
C. Costa Florencio and H. Fernau. On families of categorial grammars of bounded value, their learnability and related complexity questions. Theoretical Computer Science 452
D. Binkele-Raible, H. Fernau, F. V. Fomin, D. Lokshtanov, S. Saurabh, Y. Villanger. Kernel(s) for problems with no kernel: on out-trees with many leaves. ACM Transactions on Algorithms 8
D. Binkele-Raible and H. Fernau. An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem. Journal of Discrete Algorithms15
D. Binkele-Raible and H. Fernau. Parameterized Measure & Conquer for Problems with No Small Kernels. Algorithmica 64
D. Binkele-Raible and H. Fernau. An Exact Exponential Time Algorithm for Power Dominating Set. Algorithmica 63
G. Bai and H. Fernau. Constraint bipartite vertex cover: simpler exact algorithms and implementations. Journal of Combinatorial Optimization 23
Markus L. Schmid. Inside the Class of REGEX Languages. International Journal of Foundations of Computer Science 24

H. Fernau. Saving on Phases: Parameterized Approximation for Total Vertex Cover. IWOCA 2012
J. Chen, H. Fernau, P. Shaw, J. Wang, Z. Yang. Kernels for packing and covering problems. FAW-AAIM 2012
T. Ekim, A. Erey, P. Heggernes, P. van 't Hof, D. Meister. Computing minimum geodetic sets in proper interval graphs. LATIN 2012