The following pages link to Henning Fernau (Q198229):
Displaying 50 items.
- On the parameterised complexity of string morphism problems (Q315525) (← links)
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
- Constraint bipartite vertex cover: simpler exact algorithms and implementations (Q431922) (← links)
- An exact exponential-time algorithm for the directed maximum leaf spanning tree problem (Q450578) (← links)
- Charge and reduce: A fixed-parameter algorithm for string-to-string correction (Q456695) (← links)
- Combinatorics for smaller kernels: the differential of a graph (Q476877) (← links)
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)
- Contextual array grammars and array P systems (Q499706) (← links)
- A new upper bound for Max-2-SAT: A graph-theoretic approach (Q616992) (← links)
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
- An exact algorithm for the maximum leaf spanning tree problem (Q653320) (← links)
- A note on uniformly limited ET0L systems with unique interpretation (Q673667) (← links)
- Valuations of languages, with applications to fractal geometry (Q674334) (← links)
- (Q713136) (redirect page) (← links)
- Lower bounds on the differential of a graph (Q713137) (← links)
- On families of categorial grammars of bounded value, their learnability and related complexity questions (Q714784) (← links)
- Clustering with lower-bounded sizes. A general graph-theoretic framework (Q722539) (← links)
- Adding matrix control: insertion-deletion systems with substitutions. III (Q831848) (← links)
- Parsimonious computational completeness (Q832917) (← links)
- A top-down approach to search-trees: Improved algorithmics for 3-hitting set (Q848640) (← links)
- A parameterized perspective on packing paths of length two (Q849135) (← links)
- Iterated sequential transducers as language generating devices (Q861252) (← links)
- Polynomial inference of universal automata from membership and equivalence queries (Q899316) (← links)
- Data reductions and combinatorial bounds for improved approximation algorithms (Q899583) (← links)
- Weak total resolvability in graphs (Q907841) (← links)
- Fixed parameter algorithms for one-sided crossing minimization revisited (Q935846) (← links)
- Comparison of some descriptional complexities of 0L systems obtained by a unifying approach (Q948077) (← links)
- Parameterized algorithms for \(d\)-hitting set: the weighted case (Q964386) (← links)
- Minimum dominating set of queens: a trivial programming exercise? (Q968146) (← links)
- Comparing trees via crossing minimization (Q988574) (← links)
- A bounded search tree algorithm for parameterized face cover (Q1002098) (← links)
- Parameterized algorithmics for linear arrangement problems (Q1003461) (← links)
- Offensive \(r\)-alliances in graphs (Q1003773) (← links)
- A simultaneous reduction of several measures of descriptional complexity in scattered context grammars (Q1007611) (← links)
- Algorithms for learning regular expressions from positive data (Q1013092) (← links)
- On the complement graph and defensive \(k\)-alliances (Q1026126) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- Remarks on regulated limited ET0L systems and regulated context-free grammars (Q1127540) (← links)
- Unconditional transfer in regulated rewriting (Q1374783) (← links)
- Identification of function distinguishable languages. (Q1401186) (← links)
- On the degree of scattered context-sensitivity. (Q1401221) (← links)
- Nonterminal complexity of programmed grammars. (Q1401269) (← links)
- Parallel grammars: A phenomenology (Q1405586) (← links)
- Identifying terminal distinguishable languages (Q1430288) (← links)
- Sequential grammars and automata with valences (Q1605318) (← links)
- Extremal kernelization: a commemorative paper (Q1642680) (← links)
- Minimizing rules and nonterminals in semi-conditional grammars: non-trivial for the simple case (Q1647317) (← links)
- The complexity of probabilistic lobbying (Q1662102) (← links)
- Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
- Diminishable parameterized problems and strict polynomial kernelization (Q1670737) (← links)
