Ingo Schiermeyer

2.5k total citations
149 papers, 1.3k citations indexed

About

Ingo Schiermeyer is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Ingo Schiermeyer has authored 149 papers receiving a total of 1.3k indexed citations (citations by other indexed papers that have themselves been cited), including 141 papers in Computational Theory and Mathematics, 100 papers in Discrete Mathematics and Combinatorics and 45 papers in Geometry and Topology. Recurrent topics in Ingo Schiermeyer's work include Advanced Graph Theory Research (138 papers), Limits and Structures in Graph Theory (99 papers) and Graph Labeling and Dimension Problems (85 papers). Ingo Schiermeyer is often cited by papers focused on Advanced Graph Theory Research (138 papers), Limits and Structures in Graph Theory (99 papers) and Graph Labeling and Dimension Problems (85 papers). Ingo Schiermeyer collaborates with scholars based in Germany, Slovakia and Czechia. Ingo Schiermeyer's 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 and has published in prestigious journals such as SHILAP Revista de lepidopterología, Applied Mathematics and Computation and Theoretical Computer Science.

In The Last Decade

Ingo Schiermeyer

140 papers receiving 1.3k citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Ingo Schiermeyer Germany	19	1.3k	826	408	194	162	149	1.3k
Penny Haxell Canada	17	701 0.5×	617 0.7×	319 0.8×	132 0.7×	59 0.4×	62	803
Genghua Fan China	17	667 0.5×	450 0.5×	273 0.7×	193 1.0×	159 1.0×	63	781
Chı́nh T. Hoàng Canada	18	895 0.7×	389 0.5×	150 0.4×	144 0.7×	148 0.9×	78	957
Jenő Lehel Hungary	15	746 0.6×	361 0.4×	276 0.7×	180 0.9×	163 1.0×	83	853
Jacques Verstraëte United States	16	574 0.4×	597 0.7×	322 0.8×	174 0.9×	32 0.2×	69	716
V. Neumann‐Lara Mexico	15	562 0.4×	311 0.4×	291 0.7×	91 0.5×	45 0.3×	40	654
Éric Sopena France	15	823 0.6×	467 0.6×	88 0.2×	165 0.9×	62 0.4×	58	882
Zdeněk Ryjáček Czechia	15	934 0.7×	500 0.6×	328 0.8×	165 0.9×	285 1.8×	86	970
Michael Stiebitz Germany	14	504 0.4×	366 0.4×	150 0.4×	79 0.4×	40 0.2×	51	555
Geoffrey Exoo United States	12	424 0.3×	267 0.3×	238 0.6×	191 1.0×	171 1.1×	61	609

Countries citing papers authored by Ingo Schiermeyer

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Ingo Schiermeyer

This figure shows the co-authorship network connecting the top 25 collaborators of Ingo Schiermeyer. A scholar is included among the top collaborators of Ingo Schiermeyer 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 Ingo Schiermeyer. Ingo Schiermeyer is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Schiermeyer, Ingo, et al.. (2024). Graphs with large (1,2)-rainbow connection numbers. Applied Mathematics and Computation. 479. 128886–128886.

Li, Ping, et al.. (2024). Gallai–Ramsey Numbers for Paths. Graphs and Combinatorics. 40(6).

Ryjáček, Zdeněk, et al.. (2022). Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4. Discrete Mathematics. 345(6). 112837–112837.

Magnant, Colton & Ingo Schiermeyer. (2022). Gallai–Ramsey number for K5 ${K}_{5}$. Journal of Graph Theory. 101(3). 455–492. 6 indexed citations

Mao, Yaping, Zhao Wang, Colton Magnant, & Ingo Schiermeyer. (2022). Ramsey and Gallai-Ramsey Number for Wheels. Graphs and Combinatorics. 38(2). 5 indexed citations

Schiermeyer, Ingo, et al.. (2021). Proper Rainbow Connection Number of Graphs. SHILAP Revista de lepidopterología. 2 indexed citations

Mao, Yaping, et al.. (2020). Ramsey and Gallai–Ramsey numbers for stars with extra independent edges. Discrete Applied Mathematics. 285. 153–172. 3 indexed citations

Liu, Henry X., Colton Magnant, Akira Saito, Ingo Schiermeyer, & Yongtang Shi. (2019). Gallai‐Ramsey number for K4. Journal of Graph Theory. 94(2). 192–205. 22 indexed citations

Horňák, Mirko, Stanislav Jendrol′, & Ingo Schiermeyer. (2015). On the maximum weight of a dense connected graph of given order and size. Discrete Mathematics. 339(7). 1978–1984. 1 indexed citations

10.

Schiermeyer, Ingo. (2010). Progress on rainbow connection. 153–156. 1 indexed citations

11.

Schiermeyer, Ingo, et al.. (2007). [r,s,t]-colourings of paths. SHILAP Revista de lepidopterología. 27(1). 131–149. 4 indexed citations

12.

Czumaj, Artur, Klaus Jansen, Friedhelm Meyer auf der Heide, & Ingo Schiermeyer. (2006). Algorithmic Graph Theory. Oberwolfach Reports. 3(1). 379–460. 7 indexed citations

13.

Schiermeyer, Ingo. (2005). The Cycle-Complete Graph Ramsey Number r(C ₅ , K ₇ ). Discussiones Mathematicae Graph Theory. 25(1-2). 129–129. 2 indexed citations

14.

Faudree, Ralph J., et al.. (2003). The Ramsey number r(C ₇ ,C ₇ ,C ₇ ). Discussiones Mathematicae Graph Theory. 23(1). 141–141. 47 indexed citations

15.

Schiermeyer, Ingo. (2003). All cycle-complete graph Ramsey numbers r(C m , K 6 ). Journal of Graph Theory. 44(4). 251–260. 7 indexed citations

16.

Randerath, Bert & Ingo Schiermeyer. (2002). A note on Brooks' theorem for triangle-free graphs. Australas. J Comb.. 26. 3–10. 10 indexed citations

17.

Harant, Jochen, Zdeněk Ryjáček, & Ingo Schiermeyer. (2002). Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set. Discrete Mathematics. 256(1-2). 193–201. 6 indexed citations

18.

Schiermeyer, Ingo & Bert Randerath. (1999). Colouring graphs with prescribed induced cycle lengths. Symposium on Discrete Algorithms. 965–966. 5 indexed citations

19.

Faudree, Ralph J., Zdeněk Ryjáček, & Ingo Schiermeyer. (1997). Local connectivity and cycle xtension in claw-free graphs.. Ars Combinatoria. 47. 4 indexed citations

20.

Broersma, Hajo, Zdeněk Ryjáček, & Ingo Schiermeyer. (1996). Unifying results on Hamiltonian Claw-Free graphs. Tatra Mountains Mathematical Publications. 9. 31–39. 2 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