Petr Vojtěchovský
Impact in
- Theoretical Computer Science top 1%
- History and Theory of Mathematics
- Geometry and Topology top 5%
- Mathematics and Applications
- Algebraic structures and combinatorial models
Papers in
-
- Mathematics and Applications 39
-
- graph theory and CDMA systems 37
- Co-authors
- J. D. Phillips (6 shared papers)Michael Kinyon (14 shared papers)Gábor P. Nagy (5 shared papers)Ian M. Wanless (1 shared paper)Douglas S. Stones (1 shared paper)Aleš Drápal (5 shared papers)Richard N. Ball (1 shared paper)Aleš Pultr (1 shared paper)
- Journals
- Journal of Algebra (9 papers)Journal of Combinatorial Designs (4 papers)Transactions of the American Mathematical Society (3 papers)Results in Mathematics (3 papers)Journal of Group Theory (2 papers)
- Partner nations
- United StatesCzechiaUnited Arab Emirates
In The Last Decade
Petr Vojtěchovský
51 papers receiving 249 citations
Peers
Comparison fields: 5 of 42
- Theoretical Computer Science 105
- Geometry and Topology 204
- Discrete Mathematics and Combinatorics 43
- Algebra and Number Theory 27
- Computer Graphics and Computer-Aided Design 15
Countries citing papers authored by Petr Vojtěchovský
This map shows the geographic impact of Petr Vojtěchovský'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 Petr Vojtěchovský with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Petr Vojtěchovský more than expected).
Fields of papers citing papers by Petr Vojtěchovský
This network shows the impact of papers produced by Petr Vojtěchovský. 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 Petr Vojtěchovský. The network helps show where Petr Vojtěchovský may publish in the future.
Co-authors
The 18 scholars most cited alongside Petr Vojtěchovský, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 52 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | An Improved Approximation Factor For The Unit Disk Covering Problem | 2006 | 19 |
| 2 | 2012 | 19 | |
| 3 | 2007 | 18 | |
| 4 | 2005 | 18 | |
| 5 | 2010 | 13 | |
| 6 | 2010 | 13 | |
| 7 | 2013 | 12 | |
| 8 | 2007 | 12 | |
| 9 | 2005 | 11 | |
| 10 | 2007 | 10 | |
| 11 | 2007 | 10 | |
| 12 | 2016 | 8 | |
| 13 | 2011 | 8 | |
| 14 | Octonions, simple Moufang loops and triality | 2003 | 6 |
| 15 | 2001 | 6 | |
| 16 | 2007 | 6 | |
| 17 | 2009 | 5 | |
| 18 | 2020 | 5 | |
| 19 | 2014 | 5 | |
| 20 | 2003 | 4 |
About Petr Vojtěchovský
Petr Vojtěchovský is a scholar working on Geometry and Topology, Electrical and Electronic Engineering, Theoretical Computer Science, Discrete Mathematics and Combinatorics and Signal Processing, having authored 52 papers that have together received 272 indexed citations. Recurring topics across this work include Mathematics and Applications (39 papers), graph theory and CDMA systems (37 papers), History and Theory of Mathematics (26 papers), Data Management and Algorithms (5 papers), Finite Group Theory Research (5 papers), Advanced Topics in Algebra (4 papers), Computational Geometry and Mesh Generation (3 papers) and Coding theory and cryptography (3 papers). The work is most often cited by research in Theoretical Computer Science (105 citations), Geometry and Topology (204 citations), Discrete Mathematics and Combinatorics (43 citations), Algebra and Number Theory (27 citations) and Computer Graphics and Computer-Aided Design (15 citations). Petr Vojtěchovský has collaborated with scholars based in United States, Czechia and United Arab Emirates. Frequent co-authors include J. D. Phillips, Michael Kinyon, Gábor P. Nagy, Ian M. Wanless, Douglas S. Stones, Aleš Drápal, Richard N. Ball, Aleš Pultr, Kenneth Kunen and Jonathan D. H. Smith. Their work appears in journals such as Journal of Algebra, Journal of Combinatorial Designs, Transactions of the American Mathematical Society, Results in Mathematics and Journal of Group Theory.
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.