Jan Kynčl

528 total citations
44 papers, 143 citations indexed

About

Jan Kynčl is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Jan Kynčl has authored 44 papers receiving a total of 143 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Computational Theory and Mathematics, 15 papers in Computer Graphics and Computer-Aided Design and 11 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Jan Kynčl's work include Computational Geometry and Mesh Generation (15 papers), Advanced Graph Theory Research (12 papers) and graph theory and CDMA systems (9 papers). Jan Kynčl is often cited by papers focused on Computational Geometry and Mesh Generation (15 papers), Advanced Graph Theory Research (12 papers) and graph theory and CDMA systems (9 papers). Jan Kynčl collaborates with scholars based in Czechia, Hungary and Russia. Jan Kynčl's co-authors include Pável Valtr, Radoslav Fulek, János Pach, Bernard Lidický, František Cvachovec, Evžen Novák, Martin Tancer, Gézá Tóth, Bohumil Jánský and Vít Jelínek and has published in prestigious journals such as Nuclear Instruments and Methods in Physics Research Section A Accelerators Spectrometers Detectors and Associated Equipment, Theoretical Computer Science and Discrete Mathematics.

In The Last Decade

Jan Kynčl

37 papers receiving 135 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Jan Kynčl Czechia 7 75 70 43 29 26 44 143
Mirosław Kowaluk Poland 7 60 0.8× 65 0.9× 48 1.1× 11 0.4× 10 0.4× 24 138
Radoslav Fulek Switzerland 7 57 0.8× 79 1.1× 42 1.0× 20 0.7× 10 0.4× 29 108
Balázs Keszegh Hungary 8 108 1.4× 75 1.1× 31 0.7× 35 1.2× 69 2.7× 38 176
Vladimir P. Korzhik Ukraine 8 191 2.5× 83 1.2× 25 0.6× 120 4.1× 102 3.9× 33 250
Attila Pór United States 8 118 1.6× 76 1.1× 32 0.7× 45 1.6× 59 2.3× 36 185
J. Chris Fisher Canada 9 56 0.7× 25 0.4× 18 0.4× 100 3.4× 109 4.2× 25 231
Bernardo M. Ábrego United States 9 54 0.7× 142 2.0× 67 1.6× 49 1.7× 5 0.2× 27 157
Marek Lassak Poland 11 46 0.6× 94 1.3× 24 0.6× 20 0.7× 18 0.7× 41 266
Soroosh Yazdani Canada 6 29 0.4× 58 0.8× 60 1.4× 3 0.1× 8 0.3× 14 186
Gyula Károlyi Hungary 9 133 1.8× 74 1.1× 23 0.5× 45 1.6× 118 4.5× 33 220

Countries citing papers authored by Jan Kynčl

Since Specialization
Citations

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

Fields of papers citing papers by Jan Kynčl

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jan Kynčl. 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 Jan Kynčl. The network helps show where Jan Kynčl may publish in the future.

Co-authorship network of co-authors of Jan Kynčl

This figure shows the co-authorship network connecting the top 25 collaborators of Jan Kynčl. A scholar is included among the top collaborators of Jan Kynčl 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 Jan Kynčl. Jan Kynčl 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.
Fulek, Radoslav & Jan Kynčl. (2022). The $$\mathbb {Z}_2$$-Genus of Kuratowski Minors. Discrete & Computational Geometry. 68(2). 425–447. 2 indexed citations
2.
Aichholzer, Oswin, Jan Kynčl, Manfred Scheucher, Birgit Vogtenhuber, & Pável Valtr. (2022). On crossing-families in planar point sets. Computational Geometry. 107. 101899–101899. 1 indexed citations
3.
Aichholzer, Oswin, Thomas Hackl, Jan Kynčl, et al.. (2020). A superlinear lower bound on the number of 5-holes. Journal of Combinatorial Theory Series A. 173. 105236–105236. 2 indexed citations
4.
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.
5.
Fulek, Radoslav, et al.. (2017). Monotone crossing number of complete graphs. idUS (Universidad de Sevilla).
6.
Kynčl, Jan, et al.. (2017). Irreversible 2-conversion set in graphs of bounded degree. Discrete Mathematics & Theoretical Computer Science. Vol. 19 no. 3(Graph Theory). 4 indexed citations
7.
Kynčl, Jan, et al.. (2016). The correction of the influence of wind on thermographic measurement. ASEP. 49. 1–4. 1 indexed citations
8.
Kynčl, Jan, et al.. (2013). Graph sharing games: Complexity and connectivity. Theoretical Computer Science. 494. 49–62. 3 indexed citations
9.
Kynčl, Jan. (2013). Improved Enumeration of Simple Topological Graphs. Discrete & Computational Geometry. 50(3). 727–770. 5 indexed citations
10.
Kynčl, Jan, et al.. (2012). Tight bounds on the maximum size of a set of permutations with bounded VC-dimension. Journal of Combinatorial Theory Series A. 119(7). 1461–1478. 8 indexed citations
11.
Kynčl, Jan, et al.. (2012). Tight bounds on the maximum size of a set of permutations with bounded VC-dimension. 1113–1122. 2 indexed citations
12.
Kynčl, Jan. (2011). Ramsey-type constructions for arrangements of segments. European Journal of Combinatorics. 33(3). 336–339. 4 indexed citations
13.
Kynčl, Jan. (2009). Enumeration of simple complete topological graphs. European Journal of Combinatorics. 30(7). 1676–1685. 12 indexed citations
14.
Kynčl, Jan. (2008). Ramsey-type constructions for arrangements of segments. Electronic Notes in Discrete Mathematics. 31. 265–269. 2 indexed citations
15.
Kynčl, Jan & Martin Tancer. (2008). The Maximum Piercing Number for some Classes of Convex Sets with the $(4,3)$-property. The Electronic Journal of Combinatorics. 15(1). 6 indexed citations
16.
Kynčl, Jan, János Pach, & Gézá Tóth. (2007). Long alternating paths in bicolored point sets. Discrete Mathematics. 308(19). 4315–4321. 8 indexed citations
17.
18.
Kynčl, Jan. (1981). The initial value problem for nonlinear Boltzmann equation. Applications of Mathematics. 26(1). 59–67. 1 indexed citations
19.
Kynčl, Jan & Ivo Marek. (1977). Relaxation lengths and non-negative solutions in neutron transport. Applications of Mathematics. 22(1). 1–13. 1 indexed citations
20.
Kynčl, Jan. (1972). Initial condition in the theory of neutron transport. Applications of Mathematics. 17(4). 245–253.

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