Petr Gregor

407 total citations
34 papers, 276 citations indexed

About

Petr Gregor is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, Petr Gregor has authored 34 papers receiving a total of 276 indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Computational Theory and Mathematics, 22 papers in Computer Networks and Communications and 19 papers in Electrical and Electronic Engineering. Recurrent topics in Petr Gregor's work include Interconnection Networks and Systems (22 papers), Advanced Graph Theory Research (15 papers) and graph theory and CDMA systems (14 papers). Petr Gregor is often cited by papers focused on Interconnection Networks and Systems (22 papers), Advanced Graph Theory Research (15 papers) and graph theory and CDMA systems (14 papers). Petr Gregor collaborates with scholars based in Czechia, Slovenia and Germany. Petr Gregor's co-authors include Tomáš Dvořák, Riste Škrekovski, Roman Soták, Vácłav Koubek, Darko Dimitrov, Borut Lužar and Torsten Mütze and has published in prestigious journals such as Information Sciences, Applied Mathematics and Computation and Theoretical Computer Science.

In The Last Decade

Petr Gregor

31 papers receiving 272 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Petr Gregor Czechia	8	200	194	138	38	33	34	276
Hyeong-Seok Lim South Korea	8	368 1.8×	221 1.1×	235 1.7×	40 1.1×	25 0.8×	31	431
Toru Hasunuma Japan	8	151 0.8×	160 0.8×	91 0.7×	10 0.3×	9 0.3×	27	241
S.A. Choudum India	10	208 1.0×	235 1.2×	145 1.1×	35 0.9×	10 0.3×	37	392
S. Pérennes France	11	228 1.1×	85 0.4×	149 1.1×	33 0.9×	36 1.1×	21	309
Xie-Bin Chen China	11	283 1.4×	198 1.0×	176 1.3×	48 1.3×	4 0.1×	29	339
Claudine Peyrat France	9	227 1.1×	154 0.8×	102 0.7×	13 0.3×	31 0.9×	15	317
J.-C. Bermond France	8	171 0.9×	264 1.4×	246 1.8×	17 0.4×	53 1.6×	13	430
Marie-Claude Heydemann France	9	213 1.1×	181 0.9×	132 1.0×	17 0.4×	25 0.8×	28	316
Dan Pritikin United States	8	79 0.4×	168 0.9×	73 0.5×	13 0.3×	16 0.5×	24	263
Adele A. Rescigno Italy	10	235 1.2×	97 0.5×	139 1.0×	18 0.5×	20 0.6×	44	318

Countries citing papers authored by Petr Gregor

Since Specialization

Citations

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

Fields of papers citing papers by Petr Gregor

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Petr Gregor

This figure shows the co-authorship network connecting the top 25 collaborators of Petr Gregor. A scholar is included among the top collaborators of Petr Gregor 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 Petr Gregor. Petr Gregor 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

Gregor, Petr, et al.. (2024). Packing coloring of hypercubes with extended Hamming codes. Discrete Applied Mathematics. 359. 269–277.

Gregor, Petr, et al.. (2024). Combinatorial generation via permutation languages. VI. Binary trees. European Journal of Combinatorics. 122. 104020–104020.

Gregor, Petr, et al.. (2023). The Hamilton Compression of Highly Symmetric Graphs. Annals of Combinatorics. 28(2). 379–437. 2 indexed citations

Gregor, Petr, et al.. (2023). Star transposition Gray codes for multiset permutations. Journal of Graph Theory. 103(2). 212–270. 1 indexed citations

Gregor, Petr, et al.. (2018). Quest for Good Spanners of Hypercubes. 24. 1–8.

Gregor, Petr, et al.. (2018). Broadcasting multiple messages in the 1-in port model in optimal time. Journal of Combinatorial Optimization. 36(4). 1333–1355. 2 indexed citations

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

Gregor, Petr & Torsten Mütze. (2017). Trimming and gluing Gray codes. Theoretical Computer Science. 714. 74–95. 3 indexed citations

Gregor, Petr, Borut Lužar, & Roman Soták. (2016). On incidence coloring conjecture in Cartesian products of graphs. Discrete Applied Mathematics. 213. 93–100. 7 indexed citations

10.

Gregor, Petr, Borut Lužar, & Roman Soták. (2016). Note on incidence chromatic number of subquartic graphs. Journal of Combinatorial Optimization. 34(1). 174–181. 4 indexed citations

11.

Gregor, Petr, et al.. (2015). Rooted level-disjoint partitions of Cartesian products. Applied Mathematics and Computation. 266. 244–258. 3 indexed citations

12.

Gregor, Petr, et al.. (2013). On the mutually independent Hamiltonian cycles in faulty hypercubes. Information Sciences. 236. 224–235. 6 indexed citations

13.

Gregor, Petr, et al.. (2013). Distance magic labelings of hypercubes. Electronic Notes in Discrete Mathematics. 40. 145–149. 5 indexed citations

14.

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

15.

Gregor, Petr & Riste Škrekovski. (2012). Parity vertex colorings of binomial trees. Discussiones Mathematicae Graph Theory. 32(1). 177–177. 4 indexed citations

16.

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

17.

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

18.

Gregor, Petr. (2008). Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes. Discrete Mathematics. 309(6). 1711–1713. 16 indexed citations

19.

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

20.

Gregor, Petr. (2006). Recursive fault-tolerance of Fibonacci cube in hypercubes. Discrete Mathematics. 306(13). 1327–1341. 18 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