Pavol Hell

8.0k total citations
176 papers, 4.0k citations indexed

About

Pavol Hell is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Electrical and Electronic Engineering. According to data from OpenAlex, Pavol Hell has authored 176 papers receiving a total of 4.0k indexed citations (citations by other indexed papers that have themselves been cited), including 149 papers in Computational Theory and Mathematics, 49 papers in Discrete Mathematics and Combinatorics and 48 papers in Electrical and Electronic Engineering. Recurrent topics in Pavol Hell's work include Advanced Graph Theory Research (144 papers), Graph Labeling and Dimension Problems (55 papers) and Limits and Structures in Graph Theory (43 papers). Pavol Hell is often cited by papers focused on Advanced Graph Theory Research (144 papers), Graph Labeling and Dimension Problems (55 papers) and Limits and Structures in Graph Theory (43 papers). Pavol Hell collaborates with scholars based in Canada, United States and France. Pavol Hell's co-authors include Jaroslav Nešetřil, Ronald Graham, Tomás Feder, David Kirkpatrick, Jing Huang, Xuding Zhu, Sulamita Klein, Roland Häggkvist, Jørgen Bang‐Jensen and J. A. Bondy and has published in prestigious journals such as Annals of the New York Academy of Sciences, Mathematical Programming and Transactions of the American Mathematical Society.

In The Last Decade

Pavol Hell

165 papers receiving 3.6k citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Pavol Hell Canada	31	3.1k	1.1k	1.0k	778	641	176	4.0k
Jaroslav Nešetřil Czechia	32	3.2k 1.0×	1.8k 1.6×	625 0.6×	326 0.4×	1.4k 2.1×	257	4.1k
Gregory Gutin United Kingdom	26	2.1k 0.7×	549 0.5×	1.1k 1.0×	678 0.9×	355 0.6×	199	4.4k
Jørgen Bang‐Jensen Denmark	20	1.9k 0.6×	589 0.5×	810 0.8×	696 0.9×	385 0.6×	139	2.8k
Hans L. Bodlaender Netherlands	38	4.5k 1.5×	648 0.6×	1.8k 1.7×	417 0.5×	413 0.6×	225	5.5k
Fedor V. Fomin Norway	32	3.7k 1.2×	555 0.5×	1.7k 1.6×	317 0.4×	213 0.3×	262	4.6k
J. Fields United States	5	1.3k 0.4×	437 0.4×	901 0.9×	743 1.0×	554 0.9×	8	3.0k
Lowell W. Beineke United States	25	1.4k 0.5×	487 0.4×	428 0.4×	400 0.5×	564 0.9×	81	2.1k
Jonathan L. Gross United States	19	892 0.3×	570 0.5×	344 0.3×	448 0.6×	473 0.7×	86	2.1k
Patric R. J. Östergård Finland	22	695 0.2×	468 0.4×	597 0.6×	1.2k 1.5×	132 0.2×	164	2.3k
George S. Lueker United States	18	1.4k 0.5×	171 0.2×	863 0.8×	255 0.3×	163 0.3×	41	2.6k

Countries citing papers authored by Pavol Hell

Since Specialization

Citations

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

Fields of papers citing papers by Pavol Hell

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Pavol Hell

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

Feder, Tomás, et al.. (2020). Distance-two colourings of Barnette graphs. European Journal of Combinatorics. 91. 103210–103210. 3 indexed citations

Feder, Tomás, et al.. (2018). Distance-Two Coloring of Barnette Graphs.. Canadian Conference on Computational Geometry. 304–310. 1 indexed citations

Hell, Pavol, et al.. (2018). Minimal obstructions to 2-polar cographs. Discrete Applied Mathematics. 261. 219–228. 2 indexed citations

Foucaud, Florent, et al.. (2016). The complexity of signed graph and edge-coloured graph homomorphisms. Discrete Mathematics. 340(2). 223–235. 17 indexed citations

Feder, Tomás, et al.. (2016). Colourings, homomorphisms, and partitions of transitive digraphs. European Journal of Combinatorics. 60. 55–65.

Hell, Pavol, et al.. (2016). Strict chordal and strict split digraphs. Discrete Applied Mathematics. 216. 609–617. 1 indexed citations

Hell, Pavol & Shenwei Huang. (2015). Complexity of coloring graphs without paths and cycles. Discrete Applied Mathematics. 216. 211–232. 19 indexed citations

Gargano, Luisa, Pavol Hell, Joseph G. Peters, & Ugo Vaccaro. (2015). Influence diffusion in social networks under time window constraints. Theoretical Computer Science. 584. 53–66. 14 indexed citations

Hell, Pavol, et al.. (2013). Semilattice polymorphisms and chordal graphs. European Journal of Combinatorics. 36. 694–706.

10.

Imrich, Wilfried, Pavol Hell, & Jaroslav Nešetřil. (2012). Algebraic graph theory - a volume dedicated to Gert Sabidussi on the occasion of his 80th birthday. Discrete Mathematics. 312. 5–6. 1 indexed citations

11.

Hell, Pavol & Arash Rafiey. (2011). The dichotomy of list homomorphisms for digraphs. arXiv (Cornell University). 1703–1713. 11 indexed citations

12.

Feder, Tomás, et al.. (2005). List matrix partitions of chordal graphs. Theoretical Computer Science. 349(1). 52–66. 28 indexed citations

13.

Hell, Pavol, et al.. (1998). Broadcasting in planar graphs.. Australas. J Comb.. 17. 309. 1 indexed citations

14.

Hell, Pavol, et al.. (1997). The complexity of restricted graph homomorphisms. Discrete Mathematics. 167-168. 145–154. 2 indexed citations

15.

Fellows, Michael R., et al.. (1995). Large planar graphs with given diameter and maximum degree. Discrete Applied Mathematics. 61(2). 133–153. 18 indexed citations

16.

Hell, Pavol, et al.. (1994). Multiplicativity of Oriented Cycles. Journal of Combinatorial Theory Series B. 60(2). 239–253. 7 indexed citations

17.

Hell, Pavol, et al.. (1994). Independence ratios of graph powers. Discrete Mathematics. 127(1-3). 213–220. 19 indexed citations

18.

Hell, Pavol, Yannis Manoussakis, & Zs. Tuza. (1994). Packing problems in edge-colored graphs. Discrete Applied Mathematics. 52(3). 295–306. 7 indexed citations

19.

Dilworth, R. P., P. C. Fishburn, Fred Galvin, et al.. (1983). Announcement. Periodica Mathematica Hungarica. 14(2). 195–195. 1 indexed citations

20.

Hell, Pavol & Donald J. Miller. (1976). Graph with given achromatic number. Discrete Mathematics. 16(3). 195–207. 22 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