Peter Damaschke

1.6k total citations
64 papers, 554 citations indexed

About

Peter Damaschke is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Molecular Biology. According to data from OpenAlex, Peter Damaschke has authored 64 papers receiving a total of 554 indexed citations (citations by other indexed papers that have themselves been cited), including 29 papers in Computational Theory and Mathematics, 23 papers in Artificial Intelligence and 19 papers in Molecular Biology. Recurrent topics in Peter Damaschke's work include Advanced Graph Theory Research (25 papers), Advanced biosensing and bioanalysis techniques (17 papers) and Complexity and Algorithms in Graphs (16 papers). Peter Damaschke is often cited by papers focused on Advanced Graph Theory Research (25 papers), Advanced biosensing and bioanalysis techniques (17 papers) and Complexity and Algorithms in Graphs (16 papers). Peter Damaschke collaborates with scholars based in Sweden, Germany and United States. Peter Damaschke's co-authors include Dieter Kratsch, Azam Sheikh Muhammad, Haiko Müller, Sebastian Böcker, Phuong Hoai Ha, George Steiner, Jitender S. Deogun, Philippas Tsigas, Ferdinando Cicalese and Olof Mogren and has published in prestigious journals such as Pattern Recognition, Machine Learning and Journal of Machine Learning Research.

In The Last Decade

Peter Damaschke

56 papers receiving 517 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Peter Damaschke Sweden 15 304 170 133 97 74 64 554
Hung‐Lin Fu Taiwan 17 335 1.1× 155 0.9× 269 2.0× 109 1.1× 67 0.9× 118 774
Leszek Gąsieniec United Kingdom 20 256 0.8× 847 5.0× 404 3.0× 224 2.3× 40 0.5× 108 1.3k
Raphaël Clifford United Kingdom 10 109 0.4× 59 0.3× 281 2.1× 89 0.9× 17 0.2× 40 437
Maw‐Shang Chang Taiwan 15 377 1.2× 154 0.9× 50 0.4× 53 0.5× 3 0.0× 54 524
Ruizhong Wei Canada 18 186 0.6× 185 1.1× 653 4.9× 125 1.3× 27 0.4× 72 1.0k
Annalisa De Bonis Italy 11 71 0.2× 64 0.4× 148 1.1× 107 1.1× 103 1.4× 23 416
Christopher Jefferson United Kingdom 14 96 0.3× 329 1.9× 278 2.1× 21 0.2× 4 0.1× 40 555
Chung-Shou Liao Taiwan 14 289 1.0× 127 0.7× 80 0.6× 344 3.5× 2 0.0× 43 783
Falk Hüffner Germany 17 407 1.3× 174 1.0× 113 0.8× 145 1.5× 33 618
Ryuhei Uehara Japan 12 350 1.2× 141 0.8× 105 0.8× 62 0.6× 112 564

Countries citing papers authored by Peter Damaschke

Since Specialization
Citations

This map shows the geographic impact of Peter Damaschke's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Peter Damaschke with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Peter Damaschke more than expected).

Fields of papers citing papers by Peter Damaschke

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Peter Damaschke. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Peter Damaschke. The network helps show where Peter Damaschke may publish in the future.

Co-authorship network of co-authors of Peter Damaschke

This figure shows the co-authorship network connecting the top 25 collaborators of Peter Damaschke. A scholar is included among the top collaborators of Peter Damaschke based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Peter Damaschke. Peter Damaschke is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Damaschke, Peter, et al.. (2025). Branch and bound for the fixed-shape unequal area facility layout problem. Computers & Industrial Engineering. 203. 110987–110987.
2.
Damaschke, Peter. (2016). Adaptive group testing with a constrained number of positive responses improved. Discrete Applied Mathematics. 205. 208–212. 5 indexed citations
3.
Damaschke, Peter, et al.. (2014). Strict group testing and the set basis problem. Journal of Combinatorial Theory Series A. 126. 70–91. 3 indexed citations
4.
Damaschke, Peter, et al.. (2012). Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover. Theoretical Computer Science. 452. 39–46. 1 indexed citations
5.
Böcker, Sebastian & Peter Damaschke. (2012). A note on the parameterized complexity of unordered maximum tree orientation. Discrete Applied Mathematics. 160(10-11). 1634–1638. 1 indexed citations
6.
Damaschke, Peter. (2012). Sparse solutions of sparse linear systems: Fixed-parameter tractability and an application of complex group testing. Theoretical Computer Science. 511. 137–146. 1 indexed citations
7.
Damaschke, Peter. (2010). Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover. Discrete Optimization. 8(1). 18–24. 5 indexed citations
8.
Damaschke, Peter, et al.. (2009). The union of minimal hitting sets: Parameterized combinatorial bounds and counting. Journal of Discrete Algorithms. 7(4). 391–401. 6 indexed citations
9.
Damaschke, Peter, et al.. (2006). Linear Programs for Hypotheses Selection in Probabilistic Inference Models. Journal of Machine Learning Research. 7(49). 1339–1355. 1 indexed citations
10.
Damaschke, Peter. (2005). Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. Theoretical Computer Science. 351(3). 337–350. 38 indexed citations
11.
Damaschke, Peter. (2004). Incremental haplotype inference, phylogeny, and almost bipartite graphs. Chalmers Publication Library (Chalmers University of Technology). 1–11. 2 indexed citations
12.
Damaschke, Peter. (2003). Point placement on the line by distance data. Discrete Applied Mathematics. 127(1). 53–62. 6 indexed citations
13.
Damaschke, Peter. (2003). Nearly optimal strategies for special cases of on-line capital investment. Theoretical Computer Science. 302(1-3). 35–44. 15 indexed citations
14.
Damaschke, Peter. (2003). Linear-time recognition of bipartite graphs plus two edges. Discrete Mathematics. 262(1-3). 99–112. 1 indexed citations
15.
Damaschke, Peter. (2002). Online strategies for backups. Theoretical Computer Science. 285(1). 43–53. 1 indexed citations
16.
Damaschke, Peter. (1995). The linear time recognition of digital arcs. Pattern Recognition Letters. 16(5). 543–548. 16 indexed citations
17.
Damaschke, Peter. (1994). A tight upper bound for group testing in graphs. Discrete Applied Mathematics. 48(2). 101–109. 13 indexed citations
18.
Dahlhaus, Elias & Peter Damaschke. (1994). The parallel solution of domination problems on chordal and strongly chordal graphs. Discrete Applied Mathematics. 52(3). 261–273. 3 indexed citations
19.
Damaschke, Peter. (1993). Paths in interval graphs and circular arc graphs. Discrete Mathematics. 112(1-3). 49–64. 24 indexed citations
20.
Damaschke, Peter. (1991). Induced subgraph isomorphism for cographs is NP-complete. 72–78. 12 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026