Henning Fernau
Orcid: 0000-0002-4444-3220Affiliations:
- University of Trier, Germany
According to our database1,
Henning Fernau
authored at least 320 papers
between 1991 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on uni-trier.de
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
Algorithmica, June, 2024
Algorithmica, March, 2024
Inf. Process. Lett., January, 2024
Theor. Comput. Sci., 2024
Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters.
CoRR, 2024
Proceedings of the Theory and Applications of Models of Computation, 2024
Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024
Proceedings of the Twenty Years of Theoretical and Practical Synergies, 2024
2023
Inf. Comput., December, 2023
Extension of some edge graph problems: Standard, parameterized and approximation complexity.
Discret. Appl. Math., December, 2023
Discret. Comput. Geom., June, 2023
Theory Comput. Syst., April, 2023
J. Autom. Lang. Comb., 2023
Proceedings of the 16th International Conference on Automata and Formal Languages, 2023
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023
Proceedings of the Algorithms and Complexity - 13th International Conference, 2023
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023
2022
Theor. Comput. Sci., 2022
Synchronizing words and monoid factorization, yielding a new parameterized complexity class?
Math. Struct. Comput. Sci., 2022
Inf. Comput., 2022
Discret. Appl. Math., 2022
Proceedings of the 11th International Conference on Fun with Algorithms, 2022
Proceedings of the 30th Annual European Symposium on Algorithms, 2022
Proceedings of the 38th International Symposium on Computational Geometry, 2022
2021
Nat. Comput., 2021
Theory Comput. Syst., 2021
Synchronizing series-parallel deterministic finite automata with loops and related problems.
RAIRO Theor. Informatics Appl., 2021
Fundam. Informaticae, 2021
CoRR, 2021
Algorithms, 2021
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021
Proceedings of the Developments in Language Theory - 25th International Conference, 2021
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021
Abundant Extensions.
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021
2020
ACM Trans. Comput. Theory, 2020
Domination chain: Characterisation, classical complexity, parameterised complexity and approximability.
Discret. Appl. Math., 2020
Regular Intersection Emptiness of Graph Problems: Finding a Needle in a Haystack of Graphs with the Help of Automata.
CoRR, 2020
Comput., 2020
Proceedings of the Theory and Applications of Models of Computation, 2020
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020
Proceedings of the Membrane Computing, 2020
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020
Proceedings of the Descriptional Complexity of Formal Systems, 2020
Proceedings of the Descriptional Complexity of Formal Systems, 2020
2019
Computational completeness of simple semi-conditional insertion-deletion systems of degree (2, 1).
Nat. Comput., 2019
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019
Synchronizing series-parallel automata with loops.
Proceedings of the Eleventh Workshop on Non-Classical Models of Automata and Applications, 2019
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019
Proceedings of the Language and Automata Theory and Applications, 2019
Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019
Proceedings of the Descriptional Complexity of Formal Systems, 2019
Proceedings of the Descriptional Complexity of Formal Systems, 2019
Proceedings of the Algorithms and Complexity - 11th International Conference, 2019
Proceedings of the Algorithmic Aspects in Information and Management, 2019
2018
Theor. Comput. Sci., 2018
Nat. Comput., 2018
J. Comput. Syst. Sci., 2018
J. Autom. Lang. Comb., 2018
On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems.
RAIRO Theor. Informatics Appl., 2018
On the (adjacency) metric dimension of corona and strong product graphs and their local variants: Combinatorial and computational results.
Discret. Appl. Math., 2018
Algorithmic Enumeration: Output-sensitive, Input-Sensitive, Parameterized, Approximative (Dagstuhl Seminar 18421).
Dagstuhl Reports, 2018
Extension of vertex cover and independent set in some classes of graphs and generalizations.
CoRR, 2018
Algorithmica, 2018
Proceedings of the Unconventional Computation and Natural Computation, 2018
Minimizing Rules and Nonterminals in Semi-conditional Grammars: Non-trivial for the Simple Case.
Proceedings of the Machines, Computations, and Universality - 8th International Conference, 2018
Proceedings of the Sailing Routes in the World of Computation, 2018
2017
Theor. Comput. Sci., 2017
On the computational completeness of graph-controlled insertion-deletion systems with binary sizes.
Theor. Comput. Sci., 2017
Contextual array grammars with matrix control, regular control languages, and tissue P systems control.
Theor. Comput. Sci., 2017
On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes.
J. Autom. Lang. Comb., 2017
Non-Isometric Contextual Array Grammars and the Role of Regular Control and Local Selectors.
Fundam. Informaticae, 2017
Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion Systems.
Proceedings of the Implementation and Application of Automata, 2017
Proceedings of the Unconventional Computation and Natural Computation, 2017
Proceedings of the Theory and Applications of Models of Computation, 2017
Regular grammars for array languages.
Proceedings of the Ninth Workshop on Non-Classical Models of Automata and Applications, 2017
Self-verifying pushdown automata.
Proceedings of the Ninth Workshop on Non-Classical Models of Automata and Applications, 2017
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017
Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity.
Proceedings of the Descriptional Complexity of Formal Systems, 2017
2016
Theory Comput. Syst., 2016
J. Comput. Syst. Sci., 2016
Inf. Comput., 2016
Algorithms, 2016
Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion.
Proceedings of the Unconventional Computation and Natural Computation, 2016
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
Proceedings of the Descriptional Complexity of Formal Systems, 2016
Proceedings of the Descriptional Complexity of Formal Systems, 2016
Proceedings of the Computational Modeling of Objects Presented in Images. Fundamentals, Methods, and Applications, 2016
Proceedings of the Computational Modeling of Objects Presented in Images. Fundamentals, Methods, and Applications, 2016
Proceedings of the Algorithms and Discrete Applied Mathematics, 2016
Proceedings of the Algorithmic Aspects in Information and Management, 2016
2015
Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps.
ACM Trans. Comput. Theory, 2015
On the parameterized complexity of vertex cover and edge cover with connectivity constraints.
Theor. Comput. Sci., 2015
Theor. Comput. Sci., 2015
J. Comput. Syst. Sci., 2015
The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems.
Int. J. Found. Comput. Sci., 2015
Inf. Comput., 2015
Proceedings of the Implementation and Application of Automata, 2015
Proceedings of the Theory and Applications of Models of Computation, 2015
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015
Proceedings of the Machines, Computations, and Universality - 7th International Conference, 2015
Proceedings of the Combinatorial Image Analysis - 17th International Workshop, 2015
2014
Electron. J. Graph Theory Appl., 2014
A Parameterized Measure-and-Conquer Analysis for Finding a k-Leaf Spanning Treein an Undirected Graph.
Discret. Math. Theor. Comput. Sci., 2014
Computing the differential of a graph: Hardness, approximability and exact algorithms.
Discret. Appl. Math., 2014
Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014
Latrunculi - on the complexity of Roman chess.
Proceedings of the Sixth Workshop on Non-Classical Models for Automata and Applications, 2014
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014
Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results.
Proceedings of the Computer Science - Theory and Applications, 2014
2013
Theor. Comput. Sci., 2013
Algorithmica, 2013
Proceedings of the Unconventional Computation and Natural Computation, 2013
Two-dimensional pattern languages.
Proceedings of the Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13, 2013
Proceedings of the Language and Automata Theory and Applications, 2013
Proceedings of the Language and Automata Theory and Applications, 2013
2012
On families of categorial grammars of bounded value, their learnability and related complexity questions.
Theor. Comput. Sci., 2012
ACM Trans. Algorithms, 2012
An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem.
J. Discrete Algorithms, 2012
J. Comb. Optim., 2012
Algorithmica, 2012
Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012
2011
Theor. Comput. Sci., 2011
J. Discrete Algorithms, 2011
Discret. Optim., 2011
Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011
Proceedings of the Computation, 2011
2010
Theor. Comput. Sci., 2010
J. Discrete Algorithms, 2010
Discret. Appl. Math., 2010
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010
Proceedings of the Language and Automata Theory and Applications, 2010
Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010
Proceedings of the Grammatical Inference: Theoretical Results and Applications, 2010
Proceedings of the Computer Science, 2010
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010
A Parameterized Route to Exact Puzzles: Breaking the 2<sup><i>n</i></sup>-Barrier for Irredundance.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010
Proceedings of the Theory of Computing 2010, 2010
2009
J. Discrete Algorithms, 2009
Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles
CoRR, 2009
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009
2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
J. Discrete Algorithms, 2008
J. Discrete Algorithms, 2008
Comparison of some descriptional complexities of 0L systems obtained by a unifying approach.
Inf. Comput., 2008
Discret. Appl. Math., 2008
Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008
Local elimination-strategies in automata for shorter regular expressions.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Volume II, 2008
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008
Global <i>r</i>-alliances and total domination.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008
2007
SIAM J. Comput., 2007
Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars.
J. Autom. Lang. Comb., 2007
Alliances in Graphs: a Complexity-Theoretic Study.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007
Proceedings of the Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07., 2007
Dynamic programming for queen domination.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007
2006
Theor. Comput. Sci., 2006
Electron. Notes Discret. Math., 2006
Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs.
Electron. Notes Discret. Math., 2006
Electron. Colloquium Comput. Complex., 2006
Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006
2005
J. Graph Algorithms Appl., 2005
J. Comput. Syst. Sci., 2005
Representations of Recursively Enumerable Array Languages by Contextual Array Grammars.
Fundam. Informaticae, 2005
Refining the Nonterminal Complexity of Graph-controlled Grammars.
Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005
Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005
Asymptotically Faster Algorithms for Parameterized FACE COVER.
Proceedings of the Algorithms and Complexity in Durham 2005, 2005
2004
Electron. Colloquium Comput. Complex., 2004
Electron. Colloquium Comput. Complex., 2004
A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004
The Boisdale Algorithm - An Induction Method for a Subclass of Unification Grammar from Positive Data.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2004
Proceedings of the Grammatical Inference: Algorithms and Applications, 2004
2003
Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes le k and =k.
Theor. Comput. Sci., 2003
A simultaneous reduction of several measures of descriptional complexity in scattered context grammars.
Inf. Process. Lett., 2003
Education(al) matters: teaching P versus NP.
Bull. EATCS, 2003
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003
On Iterated Sequential Transducers.
Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003
2002
Even linear simple matrix languages: formal language properties and grammatical inference.
Theor. Comput. Sci., 2002
J. Autom. Lang. Comb., 2002
Algorithmica, 2002
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002
Proceedings of the Structural, 2002
Proceedings of the Grammatical Inference: Algorithms and Applications, 2002
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002
2001
Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization.
Theor. Comput. Sci., 2001
J. Algorithms, 2001
Electron. Colloquium Comput. Complex., 2001
Acta Informatica, 2001
Proceedings of the SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24, 2001
Proceedings of the Machine Learning and Data Mining in Pattern Recognition, 2001
Proceedings of the KI 2001: Advances in Artificial Intelligence, 2001
Proceedings of the Combinatorics, 2001
Proceedings of the Developments in Language Theory, 5th International Conference, 2001
Valence Grammars with Target Sets.
Proceedings of the Words, Semigroups, and Transductions, 2001
Regularly controlled formal power series.
Proceedings of the Where Mathematics, 2001
2000
Proceedings of the Algorithm Theory, 2000
Proceedings of the 15th International Conference on Pattern Recognition, 2000
Proceedings of the Grammatical Inference: Algorithms and Applications, 2000
External Contextual and Conditional Languages.
Proceedings of the Recent Topics in Mathematical and Computational Linguistics, 2000
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2000
1999
Characterizations of Recursively Enumerable Languages by Programmed Grammars With Unconditional Transfer.
J. Autom. Lang. Comb., 1999
Regulated Array Grammars of Finite Index. Part II: Syntactic Pattern Recognition.
Proceedings of the Grammatical Models of Multi-Agent Systems, 1999
Regulated Array Grammars of Finite Index. Part I: Theoretical Investigations.
Proceedings of the Grammatical Models of Multi-Agent Systems, 1999
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999
1998
Theor. Comput. Sci., 1998
Proceedings of the Advances in Pattern Recognition, 1998
Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998
The Generative Power of <i>d</i>-Dimensional #-Context-Free Array Grammars.
Proceedings of the International Colloquium Universal Machines and Computations, 1998
1997
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997
How Powerful is Unconditional Transfer? - When UT meets AC.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997
Bounding resources in Cooperating Distributed Grammar Systems.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997
Proceedings of the New Trends in Formal Languages, 1997
Proceedings of the New Trends in Formal Languages, 1997
1996
J. Univers. Comput. Sci., 1996
J. Autom. Lang. Comb., 1996
J. Autom. Lang. Comb., 1996
Closure Properties of Ordered Languages.
Bull. EATCS, 1996
Proceedings of the Advances in Structural and Syntactical Pattern Recognition, 1996
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996
1995
Theor. Comput. Sci., 1995
Inf. Process. Lett., 1995
A predicate for separating language classes.
Bull. EATCS, 1995
Appl. Algebra Eng. Commun. Comput., 1995
Accepting Grammars and Systems: An Overview.
Proceedings of the Developments in Language Theory II, 1995
1994
Membership for 1-Limited ET0L Languages Is Not Decidable.
J. Inf. Process. Cybern., 1994
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994
1993
Adult Languages of Propagating Systems with Restricted Parallelism.
J. Inf. Process. Cybern., 1993
Remarks on Adult Languages of Propagating Systems with Restricted Parallelism.
Proceedings of the Developments in Language Theory, 1993
1991
On Function-limited Lindenmayer Systems.
J. Inf. Process. Cybern., 1991