Tomáš Dvořák

476 total citations
26 papers, 352 citations indexed

About

Tomáš Dvořák is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, Tomáš Dvořák has authored 26 papers receiving a total of 352 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Computer Networks and Communications, 13 papers in Computational Theory and Mathematics and 10 papers in Electrical and Electronic Engineering. Recurrent topics in Tomáš Dvořák's work include Interconnection Networks and Systems (14 papers), Advanced Graph Theory Research (10 papers) and graph theory and CDMA systems (7 papers). Tomáš Dvořák is often cited by papers focused on Interconnection Networks and Systems (14 papers), Advanced Graph Theory Research (10 papers) and graph theory and CDMA systems (7 papers). Tomáš Dvořák collaborates with scholars based in Czechia, Germany and Spain. Tomáš Dvořák's co-authors include Petr Gregor, Vácłav Koubek, Berthold Langguth, Philipp Sand, Martin Anders, Mei-Mei Gu, Riste Škrekovski, Darko Dimitrov, Olav Thulesius and Ivan M. Havel and has published in prestigious journals such as SHILAP Revista de lepidopterología, Information Sciences and Applied Mathematics and Computation.

In The Last Decade

Tomáš Dvořák

24 papers receiving 341 citations

Peers

Tomáš Dvořák

CNC

CTM

EEE

SS

CN

Young-Ho Lim South Korea

Saeed Haghiri Iran

Antoni Morro Spain

F. Jiménez-Garrido Spain

C. Rekeczky Hungary

Gurmohan Singh India

Po-Tsang Huang Taiwan

J.V. Woods United Kingdom

Raphael Y. de Camargo Brazil

Ali Jahanian Iran

Young-Ho Lim South Korea

Tomáš Dvořák

394 ×1.6

CNC

135 ×0.7

CTM

368 ×2.3

EEE

0 ×0.0

SS

5 ×0.1

CN

Citations per year, relative to Tomáš Dvořák Tomáš Dvořák (= 1×) peers Young-Ho Lim

Countries citing papers authored by Tomáš Dvořák

Since Specialization

Citations

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

Fields of papers citing papers by Tomáš Dvořák

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Tomáš Dvořák

This figure shows the co-authorship network connecting the top 25 collaborators of Tomáš Dvořák. A scholar is included among the top collaborators of Tomáš Dvořák 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áš Dvořák. Tomáš Dvořák 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

1.

Dvořák, Tomáš & Mei-Mei Gu. (2020). Neighbor connectivity of k-ary n-cubes. Applied Mathematics and Computation. 379. 125237–125237. 10 indexed citations

2.

Dvořák, Tomáš, Petr Gregor, & Vácłav Koubek. (2017). Generalized Gray codes with prescribed ends. Theoretical Computer Science. 668. 70–94. 5 indexed citations

3.

Dvořák, Tomáš. (2013). Philosophical Toys Today. SHILAP Revista de lepidopterología. 35(2). 173–196. 1 indexed citations

4.

Anders, Martin, et al.. (2013). The influence of psychological factors on tinnitus severity. General Hospital Psychiatry. 35(4). 412–416. 57 indexed citations

5.

Dvořák, Tomáš, et al.. (2012). On-line suffix tree construction with reduced branching. Journal of Discrete Algorithms. 12. 48–60. 1 indexed citations

6.

Dimitrov, Darko, Tomáš Dvořák, Petr Gregor, & Riste Škrekovski. (2012). Linear time construction of a compressed Gray code. European Journal of Combinatorics. 34(1). 69–81. 2 indexed citations

7.

Dvořák, Tomáš, et al.. (2011). Gray codes with bounded weights. Discrete Mathematics. 312(17). 2599–2611. 1 indexed citations

8.

Dvořák, Tomáš. (2010). Wolfgang Iser, Jak se dělá teorie. SHILAP Revista de lepidopterología. 32(1). 134–140.

9.

Dvořák, Tomáš. (2009). Sociologická technoimaginace. SHILAP Revista de lepidopterología. 30(3–4). 85–116. 1 indexed citations

10.

Dvořák, Tomáš, et al.. (2009). Long paths and cycles in faulty hypercubes: existence, optimality, complexity. Electronic Notes in Discrete Mathematics. 34. 35–39. 3 indexed citations

11.

Dvořák, Tomáš & Vácłav Koubek. (2009). Long paths in hypercubes with a quadratic number of faults. Information Sciences. 179(21). 3763–3771. 13 indexed citations

12.

Dimitrov, Darko, Tomáš Dvořák, Petr Gregor, & Riste Škrekovski. (2009). Gray codes avoiding matchings. Discrete Mathematics & Theoretical Computer Science. Vol. 11 no. 2(Graph and Algorithms). 15 indexed citations

13.

Dvořák, Tomáš & Petr Gregor. (2007). Hamiltonian fault-tolerance of hypercubes. Electronic Notes in Discrete Mathematics. 29. 471–477. 6 indexed citations

14.

Dvořák, Tomáš & Petr Gregor. (2006). Hamiltonian paths with prescribed edges in hypercubes. Discrete Mathematics. 307(16). 1982–1998. 34 indexed citations

15.

Dvořák, Tomáš. (2006). Dense sets and embedding binary trees into hypercubes. Discrete Applied Mathematics. 155(4). 506–514. 23 indexed citations

16.

Dvořák, Tomáš. (2005). Hamiltonian Cycles with Prescribed Edges in Hypercubes. SIAM Journal on Discrete Mathematics. 19(1). 135–144. 68 indexed citations

17.

Dvořák, Tomáš, Ivan M. Havel, & Michel Mollard. (2003). On paths and cycles dominating hypercubes. Discrete Mathematics. 262(1-3). 121–129. 4 indexed citations

18.

Dvořák, Tomáš. (2000). Chromatic Index of Hypergraphs and Shannon’s Theorem. European Journal of Combinatorics. 21(5). 585–591. 2 indexed citations

19.

Dvořák, Tomáš, et al.. (1997). Euler cycles in the complete graph K2+1. Discrete Mathematics. 171(1-3). 89–102. 2 indexed citations

20.

Thulesius, Olav, Fritz E. Borgnis, & Tomáš Dvořák. (1973). Analysis of photoplethysmographic pulse curves with electronic derivation.. PubMed. 128. 159–62. 5 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