| 2021 | ATMOS | Distance-Based Solution of Patrolling Problems with Individual Waiting Times. | Peter Damaschke |
| 2021 | IWOCA | On an Ordering Problem in Weighted Hypergraphs. | Peter Damaschke |
| 2020 | IWOCA | Two Robots Patrolling on a Line: Integer Version and Approximability. | Peter Damaschke |
| 2020 | IWOCA | Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges. | Peter Damaschke |
| 2020 | SoCS | Branch-and-Bound for the Precedence Constrained Generalized Traveling Salesman Problem. | Raad Salman, Fredrik Ekstedt, Peter Damaschke |
| 2018 | SOFSEM | An Optimization Problem Related to Bloom Filters with Bit Patterns. | Peter Damaschke, Alexander Schliep |
| 2018 | WG | Saving Probe Bits by Cube Domination. | Peter Damaschke |
| 2017 | MFCS | Dividing Splittable Goods Evenly and With Limited Fragmentation. | Peter Damaschke |
| 2016 | IWOCA | Computing Giant Graph Diameters. | Peter Damaschke |
| 2016 | IWOCA | The Solution Space of Sorting with Recurring Comparison Faults. | Peter Damaschke |
| 2016 | SOFSEM | Summarizing Online User Reviews Using Bicliques. | Azam Sheikh Muhammad, Peter Damaschke, Olof Mogren |
| 2015 | CIAC | Randomized Adaptive Test Cover. | Peter Damaschke |
| 2015 | FCT | Pairs Covered by a Sequence of Sets. | Peter Damaschke |
| 2014 | WALCOM | Editing the Simplest Graphs. | Peter Damaschke, Olof Mogren |
| 2013 | COCOON | A Toolbox for Provably Optimal Multistage Strict Group Testing Strategies. | Peter Damaschke, Azam Sheikh Muhammad |
| 2013 | IWOCA | Cluster Editing with Locally Bounded Modifications Revisited. | Peter Damaschke |
| 2013 | WALCOM | Fixed-Parameter Tractability of Error Correction in Graphical Linear Systems. | Peter Damaschke, mer Egecioglu, Leonid Molokov |
| 2012 | SOFSEM | Randomized Group Testing Both Query-Optimal and Minimal Adaptive. | Peter Damaschke, Azam Sheikh Muhammad |
| 2011 | WADS | Parameterized Reductions and Algorithms for Another Vertex Cover Generalization. | Peter Damaschke, Leonid Molokov |
| 2010 | COCOA | Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives. | Peter Damaschke, Azam Sheikh Muhammad |
| 2009 | FCT | Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity. | Peter Damaschke, Azam Sheikh Muhammad |
| 2008 | COCOA | Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets. | Peter Damaschke |
| 2008 | WABI | Minimum Common String Partition Parameterized. | Peter Damaschke |
| 2007 | STACS | The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting. | Peter Damaschke |
| 2007 | WG | Segmenting Strings Homogeneously Via Trees. | Peter Damaschke |
| 2006 | CIAC | Fixed-Parameter Tractable Generalizations of Cluster Editing. | Peter Damaschke |
| 2006 | EuroPar | Competitive Freshness Algorithms for Wait-Free Data Objects. | Peter Damaschke, Phuong Hoai Ha, Philippas Tsigas |
| 2005 | COCOON | Overlaps Help: Improved Bounds for Group Testing with Interval Queries. | Ferdinando Cicalese, Peter Damaschke, Libertad Tansini, Sren Werth |
| 2005 | ICCS | Optimal Group Testing Strategies with Interval Queries and Their Application to Splice Site Detection. | Ferdinando Cicalese, Peter Damaschke, Ugo Vaccaro |
| 2005 | ISAAC | Fast Algorithms for Finding Disjoint Subsequences with Extremal Densities. | Anders Bergkvist, Peter Damaschke |
| 2005 | WG | On the Fixed-Parameter Enumerability of Cluster Editing. | Peter Damaschke |
| 2003 | FCT | Fast Perfect Phylogeny Haplotype Inference. | Peter Damaschke |
| 2003 | STACS | Distributed Soft Path Coloring. | Peter Damaschke |
| 2002 | ICALP | Scheduling Search Procedures. | Peter Damaschke |
| 2001 | SIROCCO | Worst-case bounds for blind broadcasting in small-degree networks. | Peter Damaschke |
| 2000 | CIAC | Online Strategies for Backups. | Peter Damaschke |
| 2000 | WG | Efficient Dispersion Algorithms for Geometric Intersection Graphs. | Peter Damaschke |
| 1999 | ISAAC | Multiple Spin-Block Decisions. | Peter Damaschke |
| 1998 | ALT | Computational Aspects of Parallel Attribute-Efficient Learning. | Peter Damaschke |
| 1998 | LATIN | A Chip Search Problem on Binary Numbers. | Peter Damaschke |
| 1998 | STOC | Adaptive versus Nonadaptive Attribute-Efficient Learning. | Peter Damaschke |
| 1998 | WG | Minus Domination in Small-Degree Graphs. | Peter Damaschke |
| 1997 | CIAC | The Algorithmic Complexity of Chemical Threshold Testing. | Peter Damaschke |
| 1997 | EuroPar | Finding a Pair on a Mesh with Multiple Broadcasting is Hard. | Peter Damaschke |
| 1995 | ESA | An Optimal Parallel Algorithm for Digital Curve Segmentation Using Hough Polygons and Monotone Function Search. | Peter Damaschke |
| 1995 | ISAAC | Searching for a Monotone Function by Independent Threshold Queries. | Peter Damaschke |
| 1995 | STACS | Line Segmentation of Digital Curves in Parallel. | Peter Damaschke |
| 1995 | WG | Searching for Faulty Leaves in Binary Trees. | Peter Damaschke |
| 1991 | WG | Logic Arrays for Interval Indicator Functions. | Peter Damaschke |
| 1990 | WG | Induced Subgraph Isomorphism for Cographs in NP-Complete. | Peter Damaschke |