Petr Vojtěchovský
Impact in
- Theoretical Computer Science top 1%
- History and Theory of Mathematics
- Geometry and Topology top 2%
- Mathematics and Applications
Papers in
-
- Mathematics and Applications 43
-
- History and Theory of Mathematics 29
- Co-authors
- J. D. Phillips (7 shared papers)Michael Kinyon (15 shared papers)Gábor P. Nagy (4 shared papers)Douglas S. Stones (1 shared paper)Ian M. Wanless (1 shared paper)Robert Veroff (1 shared paper)Aleš Drápal (5 shared papers)Richard N. Ball (1 shared paper)
- Journals
- Journal of Algebra (10 papers)Journal of Combinatorial Designs (4 papers)Results in Mathematics (3 papers)Transactions of the American Mathematical Society (3 papers)European Journal of Combinatorics (2 papers)
- Partner nations
- United StatesCzechiaUnited Arab Emirates
In The Last Decade
Petr Vojtěchovský
56 papers receiving 348 citations
Peers
Comparison fields: 5 of 44
- Theoretical Computer Science 131
- Geometry and Topology 252
- Discrete Mathematics and Combinatorics 50
- Computer Graphics and Computer-Aided Design 29
- Algebra and Number Theory 36
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 22 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 58 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 | 36 |
| 2 | 2012 | 22 | |
| 3 | 2005 | 21 | |
| 4 | 2013 | 19 | |
| 5 | 2007 | 18 | |
| 6 | 2013 | 18 | |
| 7 | 2005 | 15 | |
| 8 | 2007 | 15 | |
| 9 | 2010 | 14 | |
| 10 | 2010 | 13 | |
| 11 | 2007 | 12 | |
| 12 | 2007 | 11 | |
| 13 | 2016 | 10 | |
| 14 | 2006 | 10 | |
| 15 | 2014 | 8 | |
| 16 | 2020 | 8 | |
| 17 | 2011 | 8 | |
| 18 | 2007 | 6 | |
| 19 | 2001 | 6 | |
| 20 | 2003 | 6 |
About Petr Vojtěchovský
Petr Vojtěchovský is a scholar working on Geometry and Topology, Theoretical Computer Science, Electrical and Electronic Engineering, Discrete Mathematics and Combinatorics and Signal Processing, having authored 58 papers that have together received 368 indexed citations. Recurring topics across this work include Mathematics and Applications (43 papers), graph theory and CDMA systems (40 papers), History and Theory of Mathematics (29 papers), Data Management and Algorithms (6 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 (131 citations), Geometry and Topology (252 citations), Discrete Mathematics and Combinatorics (50 citations), Computer Graphics and Computer-Aided Design (29 citations) and Algebra and Number Theory (36 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, Douglas S. Stones, Ian M. Wanless, Robert Veroff, Aleš Drápal, Richard N. Ball, Aleš Pultr and Kenneth Kunen. Their work appears in journals such as Journal of Algebra, Journal of Combinatorial Designs, Results in Mathematics, Transactions of the American Mathematical Society and European Journal of Combinatorics.
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.