Follow
Peter Damaschke
Peter Damaschke
Verified email at chalmers.se
Title
Cited by
Cited by
Year
Domination in convex and chordal bipartite graphs
P Damaschke, H Müller, D Kratsch
Information Processing Letters 36 (5), 231-236, 1990
1231990
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
P Damaschke
Theoretical Computer Science 351 (3), 337-350, 2006
1012006
Threshold group testing
P Damaschke
General theory of information transfer and combinatorics, 707-718, 2006
992006
Induced subgraphs and well‐quasi‐ordering
P Damaschke
Journal of Graph Theory 14 (4), 427-435, 1990
931990
Adaptive versus nonadaptive attribute-efficient learning
P Damaschke
Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998
771998
Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
P Damaschke, JS Deogun, D Kratsch, G Steiner
Order 8, 383-391, 1991
721991
The Hamiltonian circuit problem for circle graphs is NP-complete
P Damaschke
Information Processing Letters 32 (1), 1-2, 1989
701989
Even faster parameterized cluster deletion and cluster editing
S Böcker, P Damaschke
Information Processing Letters 111 (14), 717-721, 2011
632011
Paths in interval graphs and circular arc graphs
P Damaschke
Discrete Mathematics 112 (1-3), 49-64, 1993
581993
Online search with time-varying price bounds
P Damaschke, PH Ha, P Tsigas
Algorithmica 55 (4), 619-642, 2009
482009
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
452010
The linear time recognition of digital arcs
P Damaschke
Pattern Recognition Letters 16 (5), 543-548, 1995
421995
Forbidden ordered subgraphs
P Damaschke
Topics in Combinatorics and Graph Theory: Essays in Honour of Gerhard Ringel …, 1990
421990
Minimum common string partition parameterized
P Damaschke
International Workshop on Algorithms in Bioinformatics, 87-98, 2008
412008
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
402020
Fixed-parameter enumerability of cluster editing and related problems
P Damaschke
Theory of Computing Systems 46, 261-283, 2010
392010
Nearly optimal strategies for special cases of on-line capital investment
P Damaschke
Theoretical Computer Science 302 (1-3), 35-44, 2003
382003
Distances in cocomparability graphs and their powers
P Damaschke
Discrete Applied Mathematics 35 (1), 67-72, 1992
361992
Induced subraph isomorphism for cographs is NP-complete
P Damaschke
Graph-Theoretic Concepts in Computer Science: 16th International Workshop WG …, 1991
311991
Randomized group testing for mutually obscuring defectives
P Damaschke
Information Processing Letters 67 (3), 131-135, 1998
291998
The system can't perform the operation now. Try again later.
Articles 1–20