Damaschke, Peter; Egecioglu, Ömer; Molokov, Leonid: Fixed-parameter tractability of error correction in graphical linear systems. 7th International Workshop on Algorithms and Computation WALCOM 2013, Lecture Notes in Computer Science, 7748 pp. 245-256. ISBN/ISSN: 978-3-642-36064-0

Böcker, Sebastian; Damaschke, Peter: A note on the parameterized complexity of unordered maximum tree orientation. Discrete Applied Mathematics, 160 (10-11) pp. 1634-1638.

Damaschke, Peter; Molokov, Leonid: Error propagation in sparse linear systems with peptide-protein incidence matrices. 8th International Symposium on Bioinformatics Research and Applications ISBRA 2012, Lecture Notes in Bioinformatics, 7292 pp. 72-83. ISBN/ISSN: 978-3-642-30190-2

Damaschke, Peter; Molokov, Leonid: Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover. Theoretical Computer Science, 452 pp. 39-46.

Damaschke, Peter; Sheikh Muhammad, Azam: Randomized group testing both query-optimal and minimal adaptive. Lecture Notes in Computer Science. SOFSEM 2012: Theory and practice of Computer Science. 38th Conference on Current Trends in Theory and Practice of Computer Science. Spindleruv Mlyn, Czech Republic, 21 - 27 January 2012, 7147 pp. 214-225. ISBN/ISSN: 978-3-642-27659-0

Böcker, Sebastian; Damaschke, Peter: Even faster parameterized cluster deletion and cluster editing. Information Processing Letters, 111 (14) pp. 717-721.

Damaschke, Peter: Sparse solutions of sparse linear systems: Fixed-parameter tractability and an application of complex group testing. Lecture Notes in Computer Science. 6th International Symposium on Parameterized and Exact Computation, Saarbrucken, 6-8 September 2011, 7112 pp. 94-105. ISBN/ISSN: 978-364228049-8

Damaschke, Peter; Sheikh Muhammad, Azam: Bounds for nonadaptive group tests to estimate the amount of defectives. Discrete Mathematics, Algorithms and Applications, 3 (4) pp. 517-536.

Damaschke, Peter: Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries. Networks, 57 (4) pp. 344-350.

Damaschke, Peter: Optimal randomized group testing: A canonical form and the one-defective case. ICALP 2011 Workshop on Algorithms and Data Structures for Selection, Identification and Encoding ICALP2011GT, pp. 55-67.

Damaschke, Peter: Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover. Discrete Optimization, 8 (1) pp. 18-24.

Damaschke, Peter; Molokov, Leonid: Parameterized reductions and algorithms for another vertex cover generalization. 12th Algorithms and Data Structures Symposium WADS 2011, Lecture Notes in Computer Science, 6844 pp. 279-289. ISBN/ISSN: 978-3-642-22299-3

Damaschke, Peter; Sheikh Muhammad, Azam: Bounds for nonadaptive group tests to estimate the amount of defectives. Lecture Notes in Computer Science. 4th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2010, Kailua-Kona, 18-20 December 2010, 6509 pp. 117-130. ISBN/ISSN: 978-3-642-17460-5

Damaschke, Peter; Sheikh Muhammad, Azam: Competitive group testing and learning hidden vertex covers with minimum adaptivity. Discrete Mathematics, Algorithms and Applications, 2 (3) pp. 291-311.

Damaschke, Peter: Fixed-parameter enumerability of cluster editing and related problems. Theory of Computing Systems, 46 (2) pp. 261-283.

Damaschke, Peter: Homogeneous string segmentation using trees and weighted independent sets. Algorithmica, 57 (4) pp. 621-640.

Damaschke, Peter: Bounded-degree techniques accelerate some parameterized graph algorithms. 4th International Workshop on Parameterized and Exact Computation IWPEC 2009, Lecture Notes in Computer Science, 5917 pp. 98-109. ISBN/ISSN: 978-3-642-11268-3

Damaschke, Peter; Sheikh Muhammad, Azam: Competitive group testing and learning hidden vertex covers with minimum adaptivity. 17th International Symposium on Fundamentals of Computation Theory FCT 2009, Lecture Notes in Computer Science, 5699 pp. 84-95.

Damaschke, Peter: Multiple hypernode hitting sets and smallest two-cores with targets. Journal of Combinatorial Optimization (special issue COCOA 2008), 18 (3) pp. 294-306.

Damaschke, Peter; Tsigas, Philippas; Ha, Phuong: Online search with time-varying price bounds. Algorithmica, 55 (4) pp. 619-642.

Damaschke, Peter: Pareto complexity of two-parameter FPT problems: A case study for partial vertex cover. 4th International Workshop on Parameterized and Exact Computation IWPEC 2009, Lecture Notes in Computer Science, 5917 pp. 110-121. ISBN/ISSN: 978-3-642-11268-3

Damaschke, Peter: Ranking hypotheses to minimize the search cost in probabilistic inference models. Discrete Applied Mathematics, 157 pp. 1218-1228.

Damaschke, Peter; Molokov, Leonid: The union of minimal hitting sets: parameterized combinatorial bounds and counting. Journal of Discrete Algorithms, 7 (4) pp. 391-401.

Damaschke, Peter: Competitive search for longest empty intervals (short version). 20th Canadian Conference on Computational Geometry CCCG 2008, pp. 219-222.

Damaschke, Peter: Minimum common string partition parameterized. 8th Workshop on Algorithms in Bioinformatics WABI 2008, Lecture Notes in Bioinformatics, 5251 pp. 87-98. ISBN/ISSN: 978-3-540-87360-0

Damaschke, Peter: Multiple hypernode hitting sets and smallest two-cores with targets. 2nd International Conference on Combinatorial Optimization and Applications COCOA 2008, Lecture Notes in Computer Science, 5165 pp. 32-42. ISBN/ISSN: 978-3-540-85096-0

Damaschke, Peter; Cicalese, Ferdinando; Tansini, Libertad; Werth, Sören: Overlaps help: Improved bounds for group testing with interval queries. Discrete Applied Mathematics, 155 (3) pp. 288-299.

Damaschke, Peter: Segmenting strings homogeneously via trees. 33rd International Workshop on Graph-Theoretic Concepts in Computer Science WG 2007, Lecture Notes in Computer Science, 4769 pp. 214-225. ISBN/ISSN: 978-3-540-74838-0

Damaschke, Peter: The union of minimal hitting sets: Parameterized combinatorial bounds and counting. 24th Symposium on Theoretical Aspects of Computer Science STACS 2007, Lecture Notes in Computer Science, 4393 pp. 332-343.

Bergkvist, Anders; Damaschke, Peter; Lüthi, Marcel: Linear programs for hypotheses selection in probabilistic inference models. Journal of Machine Learning Research, 7 pp. 1339-1355.

Damaschke, Peter: A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs . Information Processing Letters, 100 (2) pp. 64-68.

Damaschke, Peter; Ha, Phuong; Tsigas, Philippas: Competitive Freshness Algorithms for Wait-free Data Objects. Proceedings of the 12th European Conference on Parallel Computing (EURO-PAR '06), LNCS, Springer Verlag, , 4128 pp. 811-820. ISBN/ISSN: 3-540-37783-2

Damaschke, Peter; Bergkvist, Anders: Fast algorithms for finding disjoint subsequences with extremal densities. Pattern Recognition, 39 (12) pp. 2281-2292.

Damaschke, Peter: Fixed-parameter tractable generalizations of cluster editing. 6th International Conference on Algorithms and Complexity CIAC 2006, Lecture Notes in Computer Science, 3998 pp. 344-355. ISBN/ISSN: 3-540-34375-X

Damaschke, Peter; Bergkvist, Anders; Lüthi, Marcel: Linear programs for hypotheses selection in probabilistic inference models. Journal of Machine Learning Research, 7 pp. 1339-1355.

Damaschke, Peter: Multiple spin-block decisions. Algorithmica, 44 (1) pp. 33-48.

Damaschke, Peter: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. Theoretical Computer Science , 351 (3) pp. 337-350.

Damaschke, Peter: Randomized vs. deterministic distance query strategies for point location on the line. Discrete Applied Mathematics, 154 (3) pp. 478-484.

Damaschke, Peter: Scheduling search procedures: The wheel of fortune. Journal of Scheduling, 9 (6) pp. 545-557.

Damaschke, Peter: Threshold group testing. General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, 4123 pp. 707-718. ISBN/ISSN: 978-3-540-46244-6

Cicalese, Ferdinando; Damaschke, Peter; Vaccaro, Ugo: Optimal group testing strategies with interval queries and their application to splice site detection. International Workshop on Bioinformatics Research and Applications IWBRA 2005 (part of ICCS 2005), Lecture Notes in Computer Science, 3515 pp. 1029-1037.

Cicalese, Ferdinando; Damaschke, Peter; Tansini, Libertad; Werth, Sören: Overlaps help: Improved bounds for group testing with interval queries. 11th International Computing and Combinatorics Conference COCOON 2005, Lecture Notes in Computer Science, 3595 pp. 935-944. ISBN/ISSN: 3-540-28061-8

Damaschke, Peter; Ha, Phuong; Tsigas, Philippas: Competitive Freshness Algorithms for Wait-free Data Objects. Göteborg : Chalmers University of Technology.

Damaschke, Peter; Bergkvist, Anders: Fast algorithms for finding disjoint subsequences with extremal densities. 16th International Symposium on Algorithms and Computation ISAAC 2005, Lecture Notes in Computer Science , 3827 pp. 714-723. ISBN/ISSN: 3-540-30935-7

Damaschke, Peter; Zhou, Zhen: On queuing lengths in on-line switching. Theoretical Computer Science, 339 (2-3) pp. 333-343.

Damaschke, Peter: On the fixed-parameter enumerability of cluster editing. 31st International Workshop on Graph-Theoretic Concepts in Computer Science WG 2005, Lecture Notes in Computer Science, 3787 pp. 283-294. ISBN/ISSN: 3-540-31000-2

Damaschke, Peter; Ha, Phuong; Tsigas, Philippas: One-Way Trading with Time-Varying Exchange Rate Bounds. Göteborg : Chalmers University of Technology.

Damaschke, Peter; Cicalese, Ferdinando; Vaccaro, Ugo: Optimal group testing algorithms with interval queries and their application to splice site detection. International Journal of Bioinformatics Research and Applications, 1 (4) pp. 363-388.

Damaschke, Peter: Threshold group testing (extended abstract). Electronic Notes in Discrete Mathematics, 21 pp. 265-271.

Damaschke, Peter: Approximate location of relevant variables under the crossover distribution. Discrete Applied Mathematics, 137 (1) pp. 47-67.

Damaschke, Peter: Incremental haplotype inference, phylogeny, and almost bipartite graphs. 2nd RECOMB Satellite Workshop on Computational Methods for SNPs and Haplotypes, Proceedings (Prepint), Carnegie Mellon University, Pittsburgh 2004 , pp. 1-11.

Damaschke, Peter: Paremeterized enumeration, transversals, and imperfect phylogeny reconstruction. 1st International Workshop on Parameterized and Exact Computation IWPEC'2004, Lecture Notes in Computer Science, 3162 pp. 1-12. ISBN/ISSN: 3-540-23071-8

Damaschke, Peter: Scheduling search procedures. Journal of Scheduling, 7 (5) pp. 349-364.

Agnarsson, Geir; Damaschke, Peter; Halldorsson, Magnus: Powers of geometric intersection graphs and dispersion algorithms. Discrete Applied Mathematics, 132 (1-3) pp. 3-16.

Damaschke, Peter: Distributed soft path coloring. Lecture Notes in Computer Science, 20th Symposium on Theoretical Aspects of Computer Science STACS'2003, Berlin 27 February-1 March 2003, 2607 pp. 523-534. ISBN/ISSN: 3-540-00623-0

Damaschke, Peter: Fast perfect phylogeny haplotype inference. Lecture Notes in Computer Science. 14th International Symposium on Fundamentals of Computation Theory FCT'2003, Malmö, 12-15 August 2003, 2751 pp. 183-194. ISBN/ISSN: 3-540-40543-7

Damaschke, Peter: Linear-time recognition of bipartite graphs plus two edges. Discrete Mathematics, 262 (1-3) pp. 99-112.

Damaschke, Peter: Nearly optimal strategies for special cases of on-line capital investment. Theoretical Computer Science, 302 (1) pp. 35-44.

Damaschke, Peter: On parallel attribute-efficient learning. Journal of computer and system sciences, 67 (1) pp. 46-62.

Damaschke, Peter: Point placement on the line by distance data. Discrete Applied Mathematics, 127 (1) pp. 53-62.

Agnarsson, G.; Damaschke, Peter; Halldórsson, M.: Powers of geometric intersection graphs and dispersion algorithms. Lecture Notes in Computer Science. 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3–5, 2002, 2368 pp. 140-149. ISBN/ISSN: 978-3-540-43866-3

Damaschke, Peter: Online strategies for backups. Theoretical Computer Science, 285 (1) pp. 43-53.

Damaschke, Peter: Optimizing a mail-order with discount and shipping costs. Information Processing Letters, 82 (2) pp. 93-97.

Damaschke, Peter: Scheduling Search Procedures. Lecture Notes in Computer Science. 29th International Colloquium, ICALP 2002 Málaga, Spain, July 8–13, 2002, 2380 pp. 281-292. ISBN/ISSN: 978-3-540-43864-9

Damaschke, Peter: Two short notes on the on-line traveling salesman: handling times and lookahead. Theoretical Computer Science, 289 (1) pp. 845-852.

Damaschke, Peter: Worst-case bounds for blind broadcasting in small-degree networks. 8th International Colloquium on Structural Information and Communication Complexity SIROCCO'2001 (Proceedings in Informatics, Carleton Scientific), 11 pp. 105-115. ISBN/ISSN: 1-894145-10-0