Domination in convex and chordal bipartite graphs P Damaschke, H Müller, D Kratsch Information Processing Letters 36 (5), 231-236, 1990 | 108 | 1990 |

Parameterized enumeration, transversals, and imperfect phylogeny reconstruction P Damaschke Theoretical Computer Science 351 (3), 337-350, 2006 | 93 | 2006 |

Induced subgraphs and well‐quasi‐ordering P Damaschke Journal of Graph Theory 14 (4), 427-435, 1990 | 91 | 1990 |

Threshold group testing P Damaschke Lecture Notes in Computer Science 4123, 707, 2006 | 90 | 2006 |

Adaptive versus nonadaptive attribute-efficient learning P Damaschke Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998 | 71 | 1998 |

Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm P Damaschke, JS Deogun, D Kratsch, G Steiner Order 8, 383-391, 1991 | 68 | 1991 |

The Hamiltonian circuit problem for circle graphs is NP-complete P Damaschke Information Processing Letters 32 (1), 1-2, 1989 | 66 | 1989 |

Even faster parameterized cluster deletion and cluster editing S Böcker, P Damaschke Information Processing Letters 111 (14), 717-721, 2011 | 64 | 2011 |

Paths in interval graphs and circular arc graphs P Damaschke Discrete Mathematics 112 (1-3), 49-64, 1993 | 56 | 1993 |

Online search with time-varying price bounds P Damaschke, PH Ha, P Tsigas Algorithmica 55 (4), 619-642, 2009 | 45 | 2009 |

The linear time recognition of digital arcs P Damaschke Pattern Recognition Letters 16 (5), 543-548, 1995 | 41 | 1995 |

Minimum common string partition parameterized P Damaschke Algorithms in Bioinformatics: 8th International Workshop, WABI 2008 …, 2008 | 40 | 2008 |

Fixed-parameter enumerability of cluster editing and related problems P Damaschke Theory of Computing Systems 46, 261-283, 2010 | 39 | 2010 |

Nearly optimal strategies for special cases of on-line capital investment P Damaschke Theoretical Computer Science 302 (1-3), 35-44, 2003 | 39 | 2003 |

Forbidden ordered subgraphs P Damaschke Topics in Combinatorics and Graph Theory: Essays in Honour of Gerhard Ringel …, 1990 | 38 | 1990 |

Competitive group testing and learning hidden vertex covers with minimum adaptivity P Damaschke, AS Muhammad Discrete Mathematics, Algorithms and Applications 2 (03), 291-311, 2010 | 37 | 2010 |

Distances in cocomparability graphs and their powers P Damaschke Discrete Applied Mathematics 35 (1), 67-72, 1992 | 36 | 1992 |

Branch-and-bound for the precedence constrained generalized traveling salesman problem R Salman, F Ekstedt, P Damaschke Operations Research Letters 48 (2), 163-166, 2020 | 31 | 2020 |

Induced subraph isomorphism for cographs is NP-complete P Damaschke Graph-Theoretic Concepts in Computer Science: 16th International Workshop WG …, 1991 | 31 | 1991 |

Randomized group testing for mutually obscuring defectives P Damaschke Information Processing Letters 67 (3), 131-135, 1998 | 30 | 1998 |