Peter Horák

48 papers receiving 408 citations

Peers

Peter Horák
Comparison fields: 5 of 49
  • Electrical and Electronic Engineering 223
  • Computational Theory and Mathematics 216
  • Discrete Mathematics and Combinatorics 149
  • Artificial Intelligence 144
  • Computer Networks and Communications 85
Replace Dirk Oliver Theis with:
Dirk Oliver Theis Germany
C Suffel United States
Jaroslav Opatrný Canada
Richard Borie United States
Qingying Deng China
Ashok T. Amin United States
James F. Gimpel United States
M. C. Paull United States
Jinfeng Liu China
Toshimasa Watanabe Japan
Peter Horák relative to Dirk Oliver Theis Germany Dirk Oliver Theis's profile →
Citations per field
00.5×10×14.9×
Dirk Oliver Theis · 1×
Citations per year

Countries citing papers authored by Peter Horák

Since Specialization
Citations

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

Fields of papers citing papers by Peter Horák

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Peter Horák

This figure shows the co-authorship network connecting the top 25 collaborators of Peter Horák. A scholar is included among the top collaborators of Peter Horá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 Peter Horák. Peter Horák 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
#WorkIndexed citations
1 1
2 1
3 13
4
Towards a Solution of the Golomb-Welch Conjecture ?
0
5 15
6 0
7 7
8 24
9
Premature partial Latin squares
7
10 4
11 1
12 65
13 8
14 9
15
Maximal Orthogonal Latin Rectangles.
2
16 10
17 11
18 1
19 1
20
A note on removing a point of a strong digraph
0

About Peter Horák

Peter Horák is a scholar working on Discrete Mathematics and Combinatorics, Theoretical Computer Science and Computational Theory and Mathematics, having authored 56 papers that have together received 456 indexed citations. Recurring topics across this work include graph theory and CDMA systems (37 papers), Coding theory and cryptography (21 papers) and Limits and Structures in Graph Theory (15 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (149 citations), Computational Theory and Mathematics (216 citations) and Geometry and Topology (57 citations). Peter Horák has collaborated with scholars based in United States, Slovakia and Kuwait. Frequent co-authors include William T. Trotter, Qing He, Mirka Miller, Elias Dahlhaus, Joseph F. Ryan, Alexander Rosa, A. Rosa, W. D. Wallis, Roman Nedela and Ljiljana Branković. Their work appears in journals such as IEEE Transactions on Information Theory, Sensors and American Mathematical Monthly.

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