Tomáš Kaiser

823 total citations
60 papers, 404 citations indexed

About

Tomáš Kaiser is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Tomáš Kaiser has authored 60 papers receiving a total of 404 indexed citations (citations by other indexed papers that have themselves been cited), including 53 papers in Computational Theory and Mathematics, 36 papers in Discrete Mathematics and Combinatorics and 15 papers in Geometry and Topology. Recurrent topics in Tomáš Kaiser's work include Advanced Graph Theory Research (49 papers), Limits and Structures in Graph Theory (33 papers) and Graph Labeling and Dimension Problems (19 papers). Tomáš Kaiser is often cited by papers focused on Advanced Graph Theory Research (49 papers), Limits and Structures in Graph Theory (33 papers) and Graph Labeling and Dimension Problems (19 papers). Tomáš Kaiser collaborates with scholars based in Czechia, Slovenia and France. Tomáš Kaiser's co-authors include Riste Škrekovski, Zdeněk Ryjáček, Daniel Král͏̌, Martin Klazar, Moshe Rosenfeld, André Raspaud, Hajo Broersma, Evelyne Flandrin, Ladislav Stacho and Andrzej Proskurowski and has published in prestigious journals such as Discrete Applied Mathematics, Discrete Mathematics and Journal of Combinatorial Theory Series B.

In The Last Decade

Tomáš Kaiser

54 papers receiving 383 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Tomáš Kaiser Czechia 12 348 194 109 73 59 60 404
Luis Goddyn Canada 11 286 0.8× 171 0.9× 62 0.6× 113 1.5× 42 0.7× 30 372
Michael Stiebitz Germany 14 504 1.4× 366 1.9× 150 1.4× 79 1.1× 40 0.7× 51 555
André Kündgen United States 10 292 0.8× 199 1.0× 80 0.7× 77 1.1× 16 0.3× 30 329
Bert L. Hartnell Canada 12 491 1.4× 141 0.7× 147 1.3× 74 1.0× 137 2.3× 52 538
Stephen C. Locke United States 10 263 0.8× 174 0.9× 96 0.9× 96 1.3× 60 1.0× 32 314
Jean‐Sébastien Sereni France 14 351 1.0× 155 0.8× 73 0.7× 142 1.9× 97 1.6× 57 478
Florian Pfender United States 12 509 1.5× 231 1.2× 203 1.9× 220 3.0× 25 0.4× 46 586
Peter Che Bor Lam Hong Kong 14 370 1.1× 90 0.5× 179 1.6× 118 1.6× 53 0.9× 42 453
Charles Payan France 10 402 1.2× 116 0.6× 108 1.0× 88 1.2× 118 2.0× 27 481
María Luz Puertas Spain 12 567 1.6× 50 0.3× 188 1.7× 147 2.0× 44 0.7× 48 628

Countries citing papers authored by Tomáš Kaiser

Since Specialization
Citations

This map shows the geographic impact of Tomáš Kaiser'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 Tomáš Kaiser with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tomáš Kaiser more than expected).

Fields of papers citing papers by Tomáš Kaiser

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Tomáš Kaiser. 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 Tomáš Kaiser. The network helps show where Tomáš Kaiser may publish in the future.

Co-authorship network of co-authors of Tomáš Kaiser

This figure shows the co-authorship network connecting the top 25 collaborators of Tomáš Kaiser. A scholar is included among the top collaborators of Tomáš Kaiser 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 Tomáš Kaiser. Tomáš Kaiser 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.
Kaiser, Tomáš, et al.. (2015). 10-Gabriel graphs are Hamiltonian. Information Processing Letters. 115(11). 877–881. 4 indexed citations
2.
Kaiser, Tomáš, et al.. (2014). On 1-Hamilton-connected claw-free graphs. Discrete Mathematics. 321. 1–11. 7 indexed citations
3.
Kaiser, Tomáš, et al.. (2014). Colouring quadrangulations of projective spaces. Journal of Combinatorial Theory Series B. 113. 1–17. 3 indexed citations
4.
Kaiser, Tomáš, et al.. (2014). Replication in critical graphs and the persistence of monomial ideals. Journal of Combinatorial Theory Series A. 123(1). 239–251. 19 indexed citations
5.
Kaiser, Tomáš & Ross J. Kang. (2013). The Distance-t Chromatic Index of Graphs. Combinatorics Probability Computing. 23(1). 90–101. 3 indexed citations
6.
Ferguson, David, Tomáš Kaiser, & Daniel Král͏̌. (2013). The fractional chromatic number of triangle-free subcubic graphs. European Journal of Combinatorics. 35. 184–220. 2 indexed citations
7.
Kaiser, Tomáš. (2012). A short proof of the tree-packing theorem. Discrete Mathematics. 312(10). 1689–1691. 4 indexed citations
8.
Kaiser, Tomáš, et al.. (2012). The rainbow connection number of 2-connected graphs. Discrete Mathematics. 313(19). 1884–1892. 14 indexed citations
9.
Jendrol′, Stanislav, Tomáš Kaiser, Zdeněk Ryjáček, & Ingo Schiermeyer. (2012). A Dirac theorem for trestles. Discrete Mathematics. 312(12-13). 2000–2004.
10.
Kaiser, Tomáš, Andrew D. King, & Daniel Král͏̌. (2011). Fractional total colourings of graphs of high girth. Journal of Combinatorial Theory Series B. 101(6). 383–402. 4 indexed citations
11.
Kaiser, Tomáš, et al.. (2011). Star subdivisions and connected even factors in the square of a graph. Discrete Mathematics. 312(17). 2574–2578. 5 indexed citations
12.
Kaiser, Tomáš, et al.. (2011). Hamilton cycles in 5-connected line graphs. European Journal of Combinatorics. 33(5). 924–947. 26 indexed citations
13.
Kaiser, Tomáš & André Raspaud. (2009). Perfect matchings with restricted intersection in cubic graphs. European Journal of Combinatorics. 31(5). 1307–1315. 11 indexed citations
14.
Broersma, Hajo, et al.. (2008). Contractible subgraphs, Thomassen’s conjecture and the dominating cycle conjecture for snarks. Discrete Mathematics. 308(24). 6064–6077. 12 indexed citations
15.
Flandrin, Evelyne, et al.. (2007). Neighborhood unions and extremal spanning trees. Discrete Mathematics. 308(12). 2343–2350. 18 indexed citations
16.
Dvořák, Zdenĕk, Tomáš Kaiser, & Daniel Král͏̌. (2006). Eulerian colorings and the bipartizing matchings conjecture of Fleischner. European Journal of Combinatorics. 27(7). 1088–1101. 2 indexed citations
17.
Kaiser, Tomáš. (2006). A note on interconnecting matchings in graphs. Discrete Mathematics. 306(18). 2245–2250. 1 indexed citations
18.
Kaiser, Tomáš, et al.. (2004). Hamiltonian decompositions of prisms over cubic graphs. Discrete Mathematics. 286(1-2). 45–56. 9 indexed citations
19.
Kaiser, Tomáš & Yuri Rabinovich. (1999). Intersection Properties of Families of Convex (n,d)-Bodies. Discrete & Computational Geometry. 21(2). 275–287. 1 indexed citations
20.
Kaiser, Tomáš. (1996). A sufficient condition of full normality. Commentationes Mathematicae Universitatis Carolinae. 37(2). 381–389.

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