Imrich Vrt’o

1.2k total citations
60 papers, 437 citations indexed

About

Imrich Vrt’o is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Computer Graphics and Computer-Aided Design. According to data from OpenAlex, Imrich Vrt’o has authored 60 papers receiving a total of 437 indexed citations (citations by other indexed papers that have themselves been cited), including 36 papers in Computational Theory and Mathematics, 22 papers in Electrical and Electronic Engineering and 22 papers in Computer Graphics and Computer-Aided Design. Recurrent topics in Imrich Vrt’o's work include Advanced Graph Theory Research (31 papers), Computational Geometry and Mesh Generation (22 papers) and Interconnection Networks and Systems (17 papers). Imrich Vrt’o is often cited by papers focused on Advanced Graph Theory Research (31 papers), Computational Geometry and Mesh Generation (22 papers) and Interconnection Networks and Systems (17 papers). Imrich Vrt’o collaborates with scholars based in Slovakia, Czechia and United States. Imrich Vrt’o's co-authors include Ondřej Sýkora, Łászló A. Székely, Farhad Shahrokhi, Heiko Schröder, André Raspaud, Hristo Djidjev, Stefan Dobrev, Ladislav Stacho, Annalisa Massini and Tiziana Calamoneri and has published in prestigious journals such as Information Sciences, SIAM Journal on Computing and Advances in Mathematics.

In The Last Decade

Imrich Vrt’o

57 papers receiving 394 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Imrich Vrt’o Slovakia 12 270 177 149 142 89 60 437
Ondřej Sýkora Slovakia 11 175 0.6× 135 0.8× 89 0.6× 104 0.7× 68 0.8× 47 328
Tommy R. Jensen Germany 7 481 1.8× 89 0.5× 143 1.0× 148 1.0× 53 0.6× 20 627
Joan P. Hutchinson United States 13 426 1.6× 182 1.0× 99 0.7× 60 0.4× 13 0.1× 45 572
Shakhar Smorodinsky Israel 15 374 1.4× 447 2.5× 105 0.7× 151 1.1× 58 0.7× 53 626
Pierre Rosenstiehl France 10 155 0.6× 206 1.2× 44 0.3× 40 0.3× 18 0.2× 24 356
Stéphane Pérennès France 12 239 0.9× 42 0.2× 409 2.7× 159 1.1× 10 0.1× 70 573
Toshinobu Kashiwabara Japan 7 115 0.4× 48 0.3× 86 0.6× 145 1.0× 39 0.4× 23 256
János Pach Hungary 6 180 0.7× 197 1.1× 22 0.1× 38 0.3× 21 0.2× 15 365
Torsten Ueckerdt Germany 8 129 0.5× 70 0.4× 42 0.3× 50 0.4× 16 0.2× 32 237
Patrick Dymond Canada 11 233 0.9× 39 0.2× 118 0.8× 32 0.2× 16 0.2× 41 396

Countries citing papers authored by Imrich Vrt’o

Since Specialization
Citations

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

Fields of papers citing papers by Imrich Vrt’o

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Imrich Vrt’o. 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 Imrich Vrt’o. The network helps show where Imrich Vrt’o may publish in the future.

Co-authorship network of co-authors of Imrich Vrt’o

This figure shows the co-authorship network connecting the top 25 collaborators of Imrich Vrt’o. A scholar is included among the top collaborators of Imrich Vrt’o 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 Imrich Vrt’o. Imrich Vrt’o 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.
Dobrev, Stefan, et al.. (2013). Antibandwidth and cyclic antibandwidth of Hamming graphs. Discrete Applied Mathematics. 161(10-11). 1402–1408. 5 indexed citations
2.
Vrt’o, Imrich, et al.. (2009). Antibandwidth of three-dimensional meshes. Discrete Mathematics. 310(3). 505–510. 5 indexed citations
3.
Kaufmann, Michael, et al.. (2008). Two trees which are self-intersecting when drawn simultaneously. Discrete Mathematics. 309(7). 1909–1916. 13 indexed citations
4.
Calamoneri, Tiziana, et al.. (2008). Antibandwidth of complete k -ary trees. Discrete Mathematics. 309(22). 6408–6414. 4 indexed citations
5.
Raspaud, André, et al.. (2008). Antibandwidth and cyclic antibandwidth of meshes and hypercubes. Discrete Mathematics. 309(11). 3541–3552. 32 indexed citations
6.
Shahrokhi, Farhad, Ondřej Sýkora, Łászló A. Székely, & Imrich Vrt’o. (2006). On k-planar crossing numbers. Discrete Applied Mathematics. 155(9). 1106–1115. 7 indexed citations
7.
Schröder, Heiko, Ondřej Sýkora, & Imrich Vrt’o. (2004). Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes. Discrete Applied Mathematics. 143(1-3). 123–129. 6 indexed citations
8.
Monien, Burkhard & Imrich Vrt’o. (2004). IMPROVED BOUNDS ON CUTWIDTHS OF SHUFFLE-EXCHANGE AND DE BRUIJN GRAPHS. Parallel Processing Letters. 14(03n04). 361–366. 1 indexed citations
9.
Raspaud, André, Ondřej Sýkora, & Imrich Vrt’o. (2000). Congestion and dilation, similarities and differences: A survey.. 269–280. 5 indexed citations
10.
Vrt’o, Imrich. (2000). Cutwidth of ther-dimensional Mesh ofd-ary Trees. RAIRO - Theoretical Informatics and Applications. 34(6). 515–519. 7 indexed citations
11.
Stacho, Ladislav & Imrich Vrt’o. (2000). Virtual Path Layouts in ATM Networks. SIAM Journal on Computing. 29(5). 1621–1629. 1 indexed citations
12.
Paterson, Mike, Heiko Schröder, Ondřej Sýkora, & Imrich Vrt’o. (1998). On permutation communications in all-optical rings.. 1–9. 2 indexed citations
13.
Roli, Andrea, et al.. (1998). Bisecting de Bruijn and Kautz graphs. Discrete Applied Mathematics. 85(1). 87–97. 1 indexed citations
14.
Stacho, Ladislav & Imrich Vrt’o. (1998). Bisection width of transposition graphs. Discrete Applied Mathematics. 84(1-3). 221–235. 9 indexed citations
15.
Schröder, Heiko, Ondřej Sýkora, & Imrich Vrt’o. (1997). Optical All-to-All Communication for Some Product Graphs. 555–562. 11 indexed citations
16.
Hromkovič, Juraj, Veronika Müller, Ondřej Sýkora, & Imrich Vrt’o. (1995). On Embeddings in Cycles. Information and Computation. 118(2). 302–305. 7 indexed citations
17.
Vrt’o, Imrich. (1995). Two remarks on “Expanding and Forwarding” by P. Solé. Discrete Applied Mathematics. 58(1). 85–89. 3 indexed citations
18.
Sýkora, Ondřej & Imrich Vrt’o. (1993). Edge separators for graphs of bounded genus with applications. Theoretical Computer Science. 112(2). 419–429. 15 indexed citations
19.
Djidjev, Hristo, et al.. (1993). Edge Separators of Planar and Outerplanar Graphs With Applications. Journal of Algorithms. 14(2). 258–279. 27 indexed citations
20.
Ďuriš, Pavol, Clark D. Thompson, Ondřej Sýkora, & Imrich Vrt’o. (1985). Tight chip area bounds for sorting. Computing and Informatics / Computers and Artificial Intelligence. 4(6). 535–544. 3 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

Rankless by CCL
2026