Peter Damaschke
Impact in
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
Papers in
-
- Advanced Graph Theory Research 25
- Complexity and Algorithms in Graphs 16
-
- Machine Learning and Algorithms 15
- Algorithms and Data Compression 10
- Co-authors
- Dieter Kratsch (3 shared papers)Azam Sheikh Muhammad (4 shared papers)Haiko Müller (1 shared paper)Sebastian Böcker (2 shared papers)Jitender S. Deogun (1 shared paper)George Steiner (1 shared paper)Philippas Tsigas (2 shared papers)Phuong Hoai Ha (2 shared papers)
- Journals
- Discrete Applied Mathematics (10 papers)Theoretical Computer Science (7 papers)Discrete Mathematics (5 papers)Algorithmica (3 papers)Journal of Combinatorial Optimization (3 papers)
- Partner nations
- SwedenGermanyUnited States
In The Last Decade
Peter Damaschke
57 papers receiving 521 citations
Peers
Comparison fields: 5 of 49
- Computational Theory and Mathematics 305
- Discrete Mathematics and Combinatorics 51
- Computer Graphics and Computer-Aided Design 33
- Computer Networks and Communications 170
- Infectious Diseases 75
Countries citing papers authored by Peter Damaschke
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
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-authors
The 17 scholars most cited alongside Peter Damaschke, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 64 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1990 | 38 | |
| 2 | 2005 | 38 | |
| 3 | 1990 | 34 | |
| 4 | 1992 | 34 | |
| 5 | 1989 | 27 | |
| 6 | 2007 | 25 | |
| 7 | 2020 | 25 | |
| 8 | 1993 | 24 | |
| 9 | 2000 | 23 | |
| 10 | 2010 | 21 | |
| 11 | 1998 | 19 | |
| 12 | 2011 | 18 | |
| 13 | 1995 | 16 | |
| 14 | 1992 | 16 | |
| 15 | 2003 | 15 | |
| 16 | 1994 | 13 | |
| 17 | Induced subgraph isomorphism for cographs is NP-complete | 1991 | 12 |
| 18 | 2014 | 10 | |
| 19 | 1991 | 10 | |
| 20 | 1994 | 9 |
About Peter Damaschke
Peter Damaschke is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Molecular Biology, Computer Networks and Communications and Infectious Diseases, having authored 64 papers that have together received 557 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (25 papers), Advanced biosensing and bioanalysis techniques (17 papers), Complexity and Algorithms in Graphs (16 papers), Machine Learning and Algorithms (15 papers), Optimization and Search Problems (12 papers), SARS-CoV-2 detection and testing (12 papers), Algorithms and Data Compression (10 papers) and Computational Geometry and Mesh Generation (7 papers). The work is most often cited by research in Computational Theory and Mathematics (305 citations), Discrete Mathematics and Combinatorics (51 citations), Computer Graphics and Computer-Aided Design (33 citations), Computer Networks and Communications (170 citations) and Infectious Diseases (75 citations). Peter Damaschke has collaborated with scholars based in Sweden, Germany and United States. Frequent co-authors include Dieter Kratsch, Azam Sheikh Muhammad, Haiko Müller, Sebastian Böcker, Jitender S. Deogun, George Steiner, Philippas Tsigas, Phuong Hoai Ha, Ferdinando Cicalese and Anna Lubiw. Their work appears in journals such as Discrete Applied Mathematics, Theoretical Computer Science, Discrete Mathematics, Algorithmica and Journal of Combinatorial Optimization.
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.