Veröffentlichungen im Jahr 2016

Zeitschriften

  • Johanna Björklund, Henning Fernau, Anna Kasprzik. Polynomial inference of universal automata from membership and equivalence queries. Information and Computation 246
  • Katrin Casel, Alejandro Estrada-Moreno, Henning Fernau, Juan Alberto Rodriguez-Velazquez. Weak total resolvability in graphs. Discussiones Mathematicae Graph Theory 36
  • Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau. Data Reductions and Combinatorial Bounds for Improved Approximation Algorithms. Journal of Computer and System Sciences 82
  • Robert Ganian, Peter Hlineny, Joachim Kneis,  Daniel Meister,  Jan Obdrzlek, Peter Rossmanith, Somnath Sikdar. Are there any good digraph width measures? Journal of Combinatorial Theory, Series B, 116
  • Markus L. Schmid. Computing equality-free and repetitive string factorisations. Theoretical Computer Science 618
  • Henning Fernau, Markus L. Schmid, Yngve Villanger. On the parameterised complexity of string morphism problems. Theory of Computing Systems 59

Konferenzen

  • Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau. On the Complexity Landscape of the Domination Chain. CALDAM
  • Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jerome Monnot,  Vangelis Th. Paschos. Algorithmic Aspects of Upper Domination: A Parameterised Perspective. AAIM
  • Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman. Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems. DCFS
  • Henning Fernau, Rudolf Freund, Rani Siromoney, K.G. Subramanian. Contextual Array Grammars with Matrix and Regular Control. DCFS
  • Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, Markus L. Schmid. On the Complexity of Grammar-Based Compression over Fixed Alphabets. ICALP
  • Henning Fernau, Andreas Krebs. Problems on Finite Automata and the Exponential Time Hypothesis. CIAA
  • Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman. Generative Power of Matrix Insertion-deletion Systems with Context-free Insertion or Deletion. UCNC
  • Henning Fernau, Lakshmanan Kuppusamy. Parikh Images of Matrix Ins-del Systems. TAMC
  • Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jerome Monnot, Vangelis Paschos. Upper Domination:  Complexity and Approximation. IWOCA
  • Henning Fernau, Meenakshi Paramasivan, D.G. Thomas. Regular Array Grammars and Boustrophedon Finite Automata. NCMA
  • Henning Fernau, Meenakshi Paramasivan, D.G. Thomas. Picture Scanning Automata. CompImage
  • S. James Immanuel, D.G. Thomas, Henning Fernau, Atulya Nagar,
    Robinson Thamburaj. Two-Dimensional Input-Revolving Automata. CompImage
  • Faisal Abu-Khzam, Cristina Bazgan,  Katrin Casel, Henning Fernau. Building Clusters with Lower-bounded Sizes. ISAAC

Buchbeiträge

  • Johanna Björklund, Henning Fernau. Learning Tree Languages. IN: Jeffrey Heinz, José M. Sempere, Topics in Grammatical Inference. Springer, 2016; 173-213