Vít Jelínek

632 total citations
30 papers, 187 citations indexed

About

Vít Jelínek is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Artificial Intelligence. According to data from OpenAlex, Vít Jelínek has authored 30 papers receiving a total of 187 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Computational Theory and Mathematics, 18 papers in Discrete Mathematics and Combinatorics and 6 papers in Artificial Intelligence. Recurrent topics in Vít Jelínek's work include Advanced Combinatorial Mathematics (14 papers), semigroups and automata theory (13 papers) and Advanced Graph Theory Research (12 papers). Vít Jelínek is often cited by papers focused on Advanced Combinatorial Mathematics (14 papers), semigroups and automata theory (13 papers) and Advanced Graph Theory Research (12 papers). Vít Jelínek collaborates with scholars based in Czechia, Israel and Austria. Vít Jelínek's co-authors include Toufik Mansour, Einar Steingrı́msson, Anders Claesson, Jan Kratochvı́l, Eva Jelínková, Mark Dukes, Ignaz Rutter, Alexander Burstein, George E. Andrews and Zdenĕk Dvořák and has published in prestigious journals such as Discrete Applied Mathematics, Journal of Combinatorial Theory Series A and COMBINATORICA.

In The Last Decade

Vít Jelínek

28 papers receiving 171 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Vít Jelínek Czechia	9	120	104	47	41	36	30	187
Raul Cordovil Portugal	9	105 0.9×	130 1.3×	14 0.3×	40 1.0×	62 1.7×	30	222
Alexander Soifer United States	6	176 1.5×	151 1.5×	16 0.3×	15 0.4×	48 1.3×	30	273
Alex Fink United States	7	91 0.8×	71 0.7×	15 0.3×	47 1.1×	14 0.4×	36	156
Hunter S. Snevily United States	11	159 1.3×	162 1.6×	39 0.8×	25 0.6×	99 2.8×	23	232
Madhu Raka India	10	81 0.7×	104 1.0×	223 4.7×	36 0.9×	122 3.4×	39	284
Glenn Hurlbert United States	11	161 1.3×	233 2.2×	78 1.7×	7 0.2×	87 2.4×	45	322
Yufei Zhao United States	9	161 1.3×	126 1.2×	19 0.4×	49 1.2×	26 0.7×	47	235
Shubhangi Saraf United States	10	58 0.5×	197 1.9×	194 4.1×	23 0.6×	57 1.6×	42	295
Lenny Fukshansky United States	8	36 0.3×	31 0.3×	31 0.7×	60 1.5×	23 0.6×	34	140
János Barát Hungary	9	127 1.1×	215 2.1×	35 0.7×	5 0.1×	71 2.0×	42	270

Countries citing papers authored by Vít Jelínek

Since Specialization

Citations

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

Fields of papers citing papers by Vít Jelínek

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Vít Jelínek. 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 Vít Jelínek. The network helps show where Vít Jelínek may publish in the future.

Co-authorship network of co-authors of Vít Jelínek

This figure shows the co-authorship network connecting the top 25 collaborators of Vít Jelínek. A scholar is included among the top collaborators of Vít Jelínek 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 Vít Jelínek. Vít Jelínek 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

Hartman, David E., et al.. (2023). On the structure and values of betweenness centrality in dense betweenness-uniform graphs. 478–484. 1 indexed citations

Callan, David, Vít Jelínek, & Toufik Mansour. (2023). Inversion Sequences Avoiding a Triple of Patterns of 3 Letters. The Electronic Journal of Combinatorics. 30(3). 1 indexed citations

Jelínek, Vít, et al.. (2019). On the growth of the Möbius function of permutations. Journal of Combinatorial Theory Series A. 169. 105121–105121.

Gavenčiak, Tomáš, et al.. (2018). Cops and Robbers on intersection graphs. European Journal of Combinatorics. 72. 45–69. 4 indexed citations

Jelínek, Vít, et al.. (2018). Generalized Coloring of Permutations. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 14. 1 indexed citations

Angelini, Patrizio, Giuseppe Di Battista, Fabrizio Frati, et al.. (2015). Testing Planarity of Partially Embedded Graphs. ACM Transactions on Algorithms. 11(4). 1–42. 8 indexed citations

Andrews, George E. & Vít Jelínek. (2014). Onq-series identities related to interval orders. European Journal of Combinatorics. 39. 178–187. 6 indexed citations

Jelínek, Vít, Toufik Mansour, & Mark Shattuck. (2012). On multiple pattern avoiding set partitions. Advances in Applied Mathematics. 50(2). 292–326. 6 indexed citations

Jelínek, Vít, Jan Kratochvı́l, & Ignaz Rutter. (2012). A Kuratowski-type theorem for planarity of partially embedded graphs. Computational Geometry. 46(4). 466–492. 6 indexed citations

10.

Claesson, Anders, Vít Jelínek, & Einar Steingrı́msson. (2012). Upper bounds for the Stanley–Wilf limit of 1324 and other layered patterns. Journal of Combinatorial Theory Series A. 119(8). 1680–1691. 14 indexed citations

11.

Jelínek, Vít. (2011). Counting general and self-dual interval orders. Journal of Combinatorial Theory Series A. 119(3). 599–614. 12 indexed citations

12.

Jelínek, Vít & Martin Klazar. (2011). Embedding dualities for set partitions and for relational structures. European Journal of Combinatorics. 32(7). 1084–1096. 1 indexed citations

13.

Burstein, Alexander, Vít Jelínek, Eva Jelínková, & Einar Steingrı́msson. (2011). The Möbius function of separable and decomposable permutations. Journal of Combinatorial Theory Series A. 118(8). 2346–2364. 10 indexed citations

14.

Dukes, Mark, et al.. (2011). Composition Matrices, (2+2)-Free Posets and their Specializations. The Electronic Journal of Combinatorics. 18(1). 11 indexed citations

15.

Jelínek, Vít, Jan Kratochvı́l, & Ignaz Rutter. (2011). A kuratowski-type theorem for planarity of partially embedded graphs. 107–116. 1 indexed citations

16.

Jelínek, Vít & Toufik Mansour. (2010). Matchings and Partial Patterns. The Electronic Journal of Combinatorics. 17(1). 6 indexed citations

17.

Jelínek, Vít. (2008). Wilf-Type Classifications, Extremal and Enumerative Theory of Ordered Structures. Digital Repository (National Repository of Grey Literature).

18.

Černý, Jakub, Zdenĕk Dvořák, Vít Jelínek, & Jan Kára. (2007). Noncrossing Hamiltonian paths in geometric graphs. Discrete Applied Mathematics. 155(9). 1096–1105. 7 indexed citations

19.

Jelínek, Vít & Martin Klazar. (2007). Generalizations of Khovanskiĭ's theorems on the growth of sumsets in Abelian semigroups. Advances in Applied Mathematics. 41(1). 115–132. 2 indexed citations

20.

Jelínek, Vít. (2005). Dyck paths and pattern-avoiding matchings. European Journal of Combinatorics. 28(1). 202–213. 14 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