The Hamiltonian Circuit Problem for Circle Graphs is NP-Complete. - Peter Damaschke (Inf. Process. Lett., 1989)

Induced Subgraph Isomorphism for Cographs in NP-Complete. - Peter Damaschke (WG, 1990)

Domination in Convex and Chordal Bipartite Graphs. - Peter Damaschke; Haiko Müller; Dieter Kratsch (Inf. Process. Lett., 1990)

Induced subgraphs and well-quasi-ordering. - Peter Damaschke (J. Graph Theory, 1990)

Logic Arrays for Interval Indicator Functions. - Peter Damaschke (WG, 1991)

Irredundance number versus domination number. - Peter Damaschke (Discret. Math., 1991)

Distances in cocomparability graphs and their powers. - Peter Damaschke (Discret. Appl. Math., 1992)

Paths in interval graphs and circular arc graphs. - Peter Damaschke (Discret. Math., 1993)

Berechnungskomplexität der Erkennung der semantischen Unabhängigkeit von Relationen. - Peter Damaschke (1994)

The Parallel Solution of Domination Problems on Chordal and Strongly Chordal Graphs. - Elias Dahlhaus; Peter Damaschke (Discret. Appl. Math., 1994)

A Tight Upper Bound for Group Testing in Graphs. - Peter Damaschke (Discret. Appl. Math., 1994)

PLA Folding in Special Graph Classes. - Peter Damaschke (Discret. Appl. Math., 1994)

Dominating cliques in chordal graphs. - Dieter Kratsch; Peter Damaschke; Anna Lubiw (Discret. Math., 1994)

An Optimal Parallel Algorithm for Digital Curve Segmentation Using Hough Polygons and Monotone Function Search. - Peter Damaschke (ESA, 1995)

Searching for a Monotone Function by Independent Threshold Queries. - Peter Damaschke (ISAAC, 1995)

Line Segmentation of Digital Curves in Parallel. - Peter Damaschke (STACS, 1995)

Searching for Faulty Leaves in Binary Trees. - Peter Damaschke (WG, 1995)

A Parallel Algorithm for Nearly Optimal Edge Search. - Peter Damaschke (Inf. Process. Lett., 1995)

The linear time recognition of digital arcs. - Peter Damaschke (Pattern Recognit. Lett., 1995)

Coping with Sparse Inputs on Enhanced Meshes - Semigroup Computation with COMMON CRCW Buses. - Peter Damaschke (IPPS, 1996)

The Algorithmic Complexity of Chemical Threshold Testing. - Peter Damaschke (CIAC, 1997)

Finding a Pair on a Mesh with Multiple Broadcasting is Hard. - Peter Damaschke (Euro-Par, 1997)

An Optimal Parallel Algorithm for Digital Curve Segmentation. - Peter Damaschke (Theor. Comput. Sci., 1997)

Computational Aspects of Parallel Attribute-Efficient Learning. - Peter Damaschke (ALT, 1998)

Delayed Correction - Binary Search with Errors Made Very Simple but Efficient. - Frank Albers; Peter Damaschke (CATS, 1998)

A Chip Search Problem on Binary Numbers. - Peter Damaschke (LATIN, 1998)

Randomized Group Testing for Mutually Obscuring Defectives. - Peter Damaschke (Inf. Process. Lett., 1998)

Parallel Attribute-Efficient Learning of Monotone Boolean Functions. - Peter Damaschke (SWAT, 2000)

Efficient Dispersion Algorithms for Geometric Intersection Graphs. - Peter Damaschke (WG, 2000)

Degree-preserving spanning trees in small-degree graphs. - Peter Damaschke (Discret. Math., 2000)

Adaptive Versus Nonadaptive Attribute-Efficient Learning. - Peter Damaschke (Mach. Learn., 2000)

Worst-case bounds for blind broadcasting in small-degree networks. - Peter Damaschke (SIROCCO, 2001)

Minus domination in small-degree graphs. - Peter Damaschke (Discret. Appl. Math., 2001)

Optimizing a mail-order with discount and shipping costs. - Peter Damaschke (Inf. Process. Lett., 2002)

Online strategies for backups. - Peter Damaschke (Theor. Comput. Sci., 2002)

Two short notes on the on-line travelling salesman: handling times and lookahead. - Peter Damaschke (Theor. Comput. Sci., 2002)

Fast Perfect Phylogeny Haplotype Inference. - Peter Damaschke (FCT, 2003)

Distributed Soft Path Coloring. - Peter Damaschke (STACS, 2003)

Powers of geometric intersection graphs and dispersion algorithms. - Geir Agnarsson; Peter Damaschke; Magnús M. Halldórsson (Discret. Appl. Math., 2003)

Point placement on the line by distance data. - Peter Damaschke (Discret. Appl. Math., 2003)

Linear-time recognition of bipartite graphs plus two edges. - Peter Damaschke (Discret. Math., 2003)

On parallel attribute-efficient learning. - Peter Damaschke (J. Comput. Syst. Sci., 2003)

Nearly optimal strategies for special cases of on-line capital investment. - Peter Damaschke (Theor. Comput. Sci., 2003)

Approximate location of relevant variables under the crossover distribution. - Peter Damaschke (Discret. Appl. Math., 2004)

Scheduling Search Procedures. - Peter Damaschke (J. Sched., 2004)

Optimal Group Testing Strategies with Interval Queries and Their Application to Splice Site Detection. - Ferdinando Cicalese; Peter Damaschke; Ugo Vaccaro (International Conference on Computational Science (2), 2005)

On the Fixed-Parameter Enumerability of Cluster Editing. - Peter Damaschke (WG, 2005)

Threshold Group Testing. - Peter Damaschke (Electron. Notes Discret. Math., 2005)

Optimal group testing algorithms with interval queries and their application to splice site detection. - Ferdinando Cicalese; Peter Damaschke; Ugo Vaccaro (Int. J. Bioinform. Res. Appl., 2005)

On queuing lengths in on-line switching. - Peter Damaschke; Zhen Zhou (Theor. Comput. Sci., 2005)

Fixed-Parameter Tractable Generalizations of Cluster Editing. - Peter Damaschke (CIAC, 2006)

Competitive Freshness Algorithms for Wait-Free Data Objects. - Peter Damaschke; Phuong Hoai Ha; Philippas Tsigas (Euro-Par, 2006)

Multiple Spin-Block Decisions. - Peter Damaschke (Algorithmica, 2006)

Randomized vs. deterministic distance query strategies for point location on the line. - Peter Damaschke (Discret. Appl. Math., 2006)

A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs. - Peter Damaschke (Inf. Process. Lett., 2006)

Linear Programs for Hypotheses Selection in Probabilistic Inference Models. - Anders Bergkvist; Peter Damaschke; Marcel Lüthi (J. Mach. Learn. Res., 2006)

Fast algorithms for finding disjoint subsequences with extremal densities. - Anders Bergkvist; Peter Damaschke (Pattern Recognit., 2006)

Scheduling search procedures: The wheel of fortune. - Peter Damaschke (J. Sched., 2006)

Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. - Peter Damaschke (Theor. Comput. Sci., 2006)

The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting. - Peter Damaschke (STACS, 2007)

Segmenting Strings Homogeneously Via Trees. - Peter Damaschke (WG, 2007)

Overlaps help: Improved bounds for group testing with interval queries. - Ferdinando Cicalese; Peter Damaschke; Libertad Tansini; Sören Werth (Discret. Appl. Math., 2007)

Competitive Search for Longest Empty Intervals. - Peter Damaschke (CCCG, 2008)

Minimum Common String Partition Parameterized. - Peter Damaschke (WABI, 2008)

Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms. - Peter Damaschke (IWPEC, 2009)

Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover. - Peter Damaschke (IWPEC, 2009)

Online Search with Time-Varying Price Bounds. - Peter Damaschke; Phuong Hoai Ha; Philippas Tsigas (Algorithmica, 2009)

Ranking hypotheses to minimize the search cost in probabilistic inference models. - Peter Damaschke (Discret. Appl. Math., 2009)

Multiple hypernode hitting sets and smallest two-cores with targets. - Peter Damaschke (J. Comb. Optim., 2009)

The union of minimal hitting sets: Parameterized combinatorial bounds and counting. - Peter Damaschke; Leonid Molokov (J. Discrete Algorithms, 2009)

Homogeneous String Segmentation using Trees and Weighted Independent Sets. - Peter Damaschke (Algorithmica, 2010)

Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity. - Peter Damaschke; Azam Sheikh Muhammad (Discret. Math. Algorithms Appl., 2010)

Fixed-Parameter Enumerability of Cluster Editing and Related Problems. - Peter Damaschke (Theory Comput. Syst., 2010)

Parameterized Reductions and Algorithms for Another Vertex Cover Generalization. - Peter Damaschke; Leonid Molokov (WADS, 2011)

Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover. - Peter Damaschke (Discret. Optim., 2011)

Bounds for Nonadaptive Group Tests to estimate the Amount of Defectives. - Peter Damaschke; Azam Sheikh Muhammad (Discret. Math. Algorithms Appl., 2011)

Even faster parameterized cluster deletion and cluster editing. - Sebastian Böcker; Peter Damaschke (Inf. Process. Lett., 2011)

Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries. - Peter Damaschke (Networks, 2011)

Error Propagation in Sparse Linear Systems with Peptide-Protein Incidence Matrices. - Peter Damaschke; Leonid Molokov (ISBRA, 2012)

Randomized Group Testing Both Query-Optimal and Minimal Adaptive. - Peter Damaschke; Azam Sheikh Muhammad (SOFSEM, 2012)

A note on the parameterized complexity of unordered maximum tree orientation. - Sebastian Böcker; Peter Damaschke (Discret. Appl. Math., 2012)

Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover. - Peter Damaschke; Leonid Molokov (Theor. Comput. Sci., 2012)

A Toolbox for Provably Optimal Multistage Strict Group Testing Strategies. - Peter Damaschke; Azam Sheikh Muhammad (COCOON, 2013)

Cluster Editing with Locally Bounded Modifications Revisited. - Peter Damaschke (IWOCA, 2013)

Fixed-Parameter Tractability of Error Correction in Graphical Linear Systems. - Peter Damaschke; Ömer Egecioglu; Leonid Molokov (WALCOM, 2013)

Two New Perspectives on Multi-Stage Group Testing. - Peter Damaschke; Azam Sheikh Muhammad; Eberhard Triesch (Algorithmica, 2013)

Sparse solutions of sparse linear systems: Fixed-parameter tractability and an application of complex group testing. - Peter Damaschke (Theor. Comput. Sci., 2013)

Editing the Simplest Graphs. - Peter Damaschke; Olof Mogren (WALCOM, 2014)

Enumerating maximal bicliques in bipartite graphs with favorable degree sequences. - Peter Damaschke (Inf. Process. Lett., 2014)

Strict group testing and the set basis problem. - Peter Damaschke; Azam Sheikh Muhammad; Gábor Wiener (J. Comb. Theory A, 2014)

Editing Simple Graphs. - Peter Damaschke; Olof Mogren (J. Graph Algorithms Appl., 2014)

Randomized Adaptive Test Cover. - Peter Damaschke (CIAC, 2015)

Pairs Covered by a Sequence of Sets. - Peter Damaschke (FCT, 2015)

Parameterizations of hitting set of bundles and inverse scope. - Peter Damaschke (J. Comb. Optim., 2015)

Finding and enumerating large intersections. - Peter Damaschke (Theor. Comput. Sci., 2015)

Computing Giant Graph Diameters. - Peter Damaschke (IWOCA, 2016)

Summarizing Online User Reviews Using Bicliques. - Azam Sheikh Muhammad; Peter Damaschke; Olof Mogren (SOFSEM, 2016)

Adaptive group testing with a constrained number of positive responses improved. - Peter Damaschke (Discret. Appl. Math., 2016)

Sufficient conditions for edit-optimal clusters. - Peter Damaschke (Inf. Process. Lett., 2016)

Deterministic versus randomized adaptive test cover. - Peter Damaschke (Theor. Comput. Sci., 2016)

Finding defectives on a line by random docking and interval group tests. - Peter Damaschke (Discret. Math. Algorithms Appl., 2017)

Refined algorithms for hitting many intervals. - Peter Damaschke (Inf. Process. Lett., 2017)

Calculating approximation guarantees for partial set cover of pairs. - Peter Damaschke (Optim. Lett., 2017)

An Optimization Problem Related to Bloom Filters with Bit Patterns. - Peter Damaschke; Alexander Schliep (SOFSEM, 2018)

Saving Probe Bits by Cube Domination. - Peter Damaschke (WG, 2018)

The Solution Space of Sorting with Recurring Comparison Faults. - Peter Damaschke (Theory Comput. Syst., 2018)

Parameterized Mixed Graph Coloring. - Peter Damaschke (J. Comb. Optim., 2019)

Optimal partial clique edge covering guided by potential energy minimization. - Peter Damaschke (Optim. Lett., 2019)

Combinatorial search in two and more rounds. - Peter Damaschke (Theor. Comput. Sci., 2019)

Two Robots Patrolling on a Line: Integer Version and Approximability. - Peter Damaschke (IWOCA, 2020)

Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges. - Peter Damaschke (IWOCA, 2020)

Equitable induced decompositions of twin graphs. - Peter Damaschke (Australas. J Comb., 2020)

Dividing Splittable Goods Evenly and With Limited Fragmentation. - Peter Damaschke (Algorithmica, 2020)

Enumerating Grid Layouts of Graphs. - Peter Damaschke (J. Graph Algorithms Appl., 2020)

Branch-and-bound for the Precedence Constrained Generalized Traveling Salesman Problem. - Raad Salman; Fredrik Ekstedt; Peter Damaschke (Oper. Res. Lett., 2020)

Distance-Based Solution of Patrolling Problems with Individual Waiting Times. - Peter Damaschke (ATMOS, 2021)

On an Ordering Problem in Weighted Hypergraphs. - Peter Damaschke (IWOCA, 2021)

Tandem Duplication Parameterized by the Length Difference. - Peter Damaschke (PSC, 2023)

A Linear-Time Optimal Broadcasting Algorithm in Stars of Cliques. - Peter Damaschke (J. Graph Algorithms Appl., 2024)

Branch and bound for the fixed-shape unequal area facility layout problem. - Fredrik Ekstedt; Raad Salman; Peter Damaschke (Comput. Ind. Eng., 2025)

On central placements of new vertices in a planar point set. - Peter Damaschke; Fredrik Ekstedt; Raad Salman (Theor. Comput. Sci., 2025)