Publications 2020

Journals

  • Katrin Casel, Jan Dreier, Henning Fernau, Moritz Gobbert, Phillipp Kuinke, Fernando Sánchez Villaamil, Markus L. Schmid, Erik Jan van Leeuwen: Complexity of independency and cliquy trees. Discrete Applied Mathematics 272
  • Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier. Diminishable parameterized problems and strict polynomial kernelization.  Computability 9
  • Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid. Pattern Matching with Variables: Efficient Algorithms and Complexity Results. ACM Transactions on Computation Theory 12
  • Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau. Domination Chain: Characterisation, Classical Complexity, Parameterised Complexity  and Approximability. Discrete Applied Mathematics 280
  • Serghei Verlan, Henning Fernau, Lakshmanan Kuppusamy. Universal insertion grammars of size two.Theoretical Computer Science 843

Conferences

  • Faisal N. Abu-Khzam, Cristina Bazgan, Henning Fernau. Parameterized Dynamic Variants of Red-Blue Dominating Set. SOFSEM 2020
  • Jens Bruchertseifer, Henning Fernau.  Synchronizing Words and Monoid Factorization: A Parameterized Perspective. TAMC 2020
  • Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora. On the complexity of Broadcast Domination and Multipacking in Digraphs. IWOCA 2020
  • T. Kalyani, K. Sasikala, D. G. Thomas, Thamburaj Robinson, Atulya K. Nagar, Meenakshi Paramasivan. 3D-Array Token Petri Nets Generating Tetrahedral Picture Languages. IWCIA 2020
  • S. Jayasankar, D. G. Thomas, S. J. Immanuel, Meenakshi Paramasivan, T. Robinson, A. K. Nagar. Parallel Contextual Array Insertion Deletion Grammar and (Context-Free : Context-Free) Matrix Grammar. IWCIA 2020
  • Martin VuHenning Fernau. Insertion-Deletion Systems with Substitutions I. CiE 2020
  • Stefan Hoffmann. Computational Complexity of Synchronization under Regular Commutative Constraints. COCOON 2020
  • Stefan Hoffmann. On A Class of Constrained Synchronization Problems in NP. ICTCS 2020
  • Petra Wolf. From Decidability to Undecidability by Considering Regular Sets of Instances. ICTCS 2020
  • Henning Fernau, Petra Wolf, Tomoyuki Yamakami. Synchronizing Deterministic Push-Down Automata Can Be Really Hard. MFCS 2020
  • Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman. Generalized Forbidding Matrix Grammars. ICMC 2020
  • Jayasankar Sivaraman, S. James Immanuel, D.G. Thomas, Meenakshi Paramasivan. Parallel Contextual Array Insertion Deletion P System and Tabled Matrix Grammar. ICMC 2020
  • Martin VuHenning Fernau. Insertion-Deletion Systems with Substitutions II. DCFS 2020
  • Stefan Hoffmann. State Complexity Bounds for the Commutative Closure of Group Languages. DCFS 2020
  • Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman. On the Power of Generalized Forbidding Insertion-Deletion Systems. DCFS 2020
  • Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf. Width Notions for Ordering-Related Problems. FSTTCS 2020
  • Petra Wolf. Synchronization under Dynamic Constraints. FSTTCS 2020
  • Henning Fernau, Petra Wolf. Synchronization of Deterministic Visibly Push-Down Automata. FSTTCS 2020

Books

  • Henning Fernau (Herausgeber LNCS-Band). Computer Science in Russia CSR 2020