Ingo Schiermeyer
Impact in
-
- Limits and Structures in Graph Theory
- Computational Theory and Mathematics top 0.2%
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
Papers in
-
- Advanced Graph Theory Research 143
- Graph Labeling and Dimension Problems 87
- Complexity and Algorithms in Graphs 24
-
- Limits and Structures in Graph Theory 104
- Co-authors
- Bert Randerath (17 shared papers)Zdeněk Ryjáček (17 shared papers)Jochen Harant (10 shared papers)Ralph J. Faudree (8 shared papers)Arnfried Kemnitz (6 shared papers)Stanislav Jendrol′ (13 shared papers)Ján Katrenič (2 shared papers)František Kardoš (1 shared paper)
In The Last Decade
Ingo Schiermeyer
150 papers receiving 1.6k citations
Peers
Comparison fields: 5 of 44
- Discrete Mathematics and Combinatorics 952
- Computational Theory and Mathematics 1.6k
- Geometry and Topology 443
- Computer Graphics and Computer-Aided Design 77
- Computer Networks and Communications 249
Countries citing papers authored by Ingo Schiermeyer
This map shows the geographic impact of Ingo Schiermeyer'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 Ingo Schiermeyer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ingo Schiermeyer more than expected).
Fields of papers citing papers by Ingo Schiermeyer
This network shows the impact of papers produced by Ingo Schiermeyer. 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 Ingo Schiermeyer. The network helps show where Ingo Schiermeyer may publish in the future.
Co-authors
The 25 scholars most cited alongside Ingo Schiermeyer, 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 158 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2004 | 109 | |
| 2 | 2003 | 68 | |
| 3 | 1994 | 66 | |
| 4 | 2004 | 65 | |
| 5 | 2011 | 62 | |
| 6 | 2009 | 52 | |
| 7 | 2003 | 51 | |
| 8 | 2019 | 44 | |
| 9 | 1993 | 41 | |
| 10 | 2002 | 41 | |
| 11 | 2011 | 38 | |
| 12 | 2001 | 33 | |
| 13 | 2009 | 28 | |
| 14 | 2014 | 27 | |
| 15 | 2014 | 27 | |
| 16 | 2007 | 27 | |
| 17 | 2011 | 26 | |
| 18 | 2002 | 24 | |
| 19 | 2019 | 23 | |
| 20 | 2018 | 23 |
About Ingo Schiermeyer
Ingo Schiermeyer is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Electrical and Electronic Engineering and Computer Networks and Communications, having authored 158 papers that have together received 1.7k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (143 papers), Limits and Structures in Graph Theory (104 papers), Graph Labeling and Dimension Problems (87 papers), Graph theory and applications (32 papers), Complexity and Algorithms in Graphs (24 papers), graph theory and CDMA systems (18 papers), Advanced Topology and Set Theory (14 papers) and Interconnection Networks and Systems (9 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (952 citations), Computational Theory and Mathematics (1.6k citations), Geometry and Topology (443 citations), Computer Graphics and Computer-Aided Design (77 citations) and Computer Networks and Communications (249 citations). Ingo Schiermeyer has collaborated with scholars based in Germany, Slovakia and Vietnam. Frequent co-authors include Bert Randerath, Zdeněk Ryjáček, Jochen Harant, Ralph J. Faudree, Arnfried Kemnitz, Stanislav Jendrol′, Ján Katrenič, František Kardoš, Hajo Broersma and Dieter Rautenbach. Their work appears in journals such as Discrete Mathematics, Graphs and Combinatorics, Discrete Applied Mathematics, Journal of Graph Theory and The Electronic Journal of Combinatorics.
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.