World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
53
Citations
11084
World Ranking
4832
National Ranking
193

Mathematics

D-Index
53
Citations
11097
World Ranking
903
National Ranking
30

Research.com Recognitions

  • 2012 - SIAM Fellow For contributions to graph theory.

Overview

Pavol Hell is affiliated with Simon Fraser University in Canada and is active in research within the fields of Computer Science and Mathematics. Their work spans several subfields, particularly Computational Theory and Mathematics, Geometry and Topology, Discrete Mathematics and Combinatorics, Computer Networks and Communications, and Electrical and Electronic Engineering.

The scientist's research focuses primarily on graph theory and its applications. Key topics they have contributed to include Advanced Graph Theory Research, Complexity and Algorithms in Graphs, Graph Theory and Applications, Graph Labeling and Dimension Problems, Limits and Structures in Graph Theory, graph theory and CDMA systems, and Interconnection Networks and Systems.

Pavol Hell has published extensively, with a significant number of articles appearing in venues such as arXiv (Cornell University), SIAM Journal on Discrete Mathematics, Discrete Applied Mathematics, Algorithmica, and the European Journal of Combinatorics. Notable recent papers include:

  • Bi-Arc Digraphs and Conservative Polymorphisms, 2020, arXiv (Cornell University)
  • Distance-two colourings of Barnette graphs, 2020, European Journal of Combinatorics
  • Min-Orderable Digraphs, 2020, SIAM Journal on Discrete Mathematics
  • Describing hereditary properties by forbidden circular orderings, 2022, Applied Mathematics and Computation
  • Hamiltonian cycles in covering graphs of trees, 2020, Discrete Applied Mathematics

Frequent collaborators in their research include Jan Bok, Nikola Jedličková, Arash Rafiey, Tomás Feder, and César Hernández-Cruz.

The scientist's work has been recognized with the award of SIAM Fellow in 2012 for contributions to graph theory.

Best Publications

  • Graphs and homomorphisms

    Pavol Hell;Jaroslav Nešetřil

  • On the History of the Minimum Spanning Tree Problem

    R.L. Graham;Pavol Hell

  • On the complexity of H -coloring

    Pavol Hell;Jaroslav Nešetřil

  • The core of a graph

    Pavol Hell;Jaroslav Nešetřil

  • A note on the star chromatic number

    J. A. Bondy;P. Hell

  • List Homomorphisms and Circular Arc Graphs

    Tomas Feder;Pavol Hell;Jing Huang

  • Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs

    Xiaotie Deng;Pavol Hell;Jing Huang

  • Graph Problems Arising from Wavelength-Routing in All-Optical Networks

    Bruno Beauquier;Jean-Claude Bermond;Luisa Gargano;Pavol Hell

  • On the Complexity of General Graph Factor Problems

    David G. Kirkpatrick;P Hell

  • On the completeness of a generalized matching problem

    David G. Kirkpatrick;Pavol Hell

  • List Homomorphisms to Reflexive Graphs

    Tomas Feder;Pavol Hell

  • Bi-arc graphs and the complexity of list homomorphisms

    Tomas Feder;Pavol Hell;Jing Huang

  • List Partitions

    Unknown

  • Complexity of graph partition problems

    Tomas Feder;Pavol Hell;Sulamita Klein;Rajeev Motwani

  • Interval bigraphs and circular arc graphs

    Pavol Hell;Jing Huang

  • Duality and Polynomial Testing of Tree Homomorphisms

    P. Hell;J. Nesetril;X. Zhu

  • Survey: Colouring, constraint satisfaction, and complexity

    Pavol Hell;Jaroslav Nešetřil

  • On multiplicative graphs and the product conjecture

    R. Häggkvist;P. Hell;D. J. Miller;V. Neumann Lara

  • The complexity of colouring by semicomplete digraphs

    rgen Bang-Jensen;Pavol Hell;Gary MacGillivray

  • A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs

    Pavol Hell;Ron Shamir;Roded Sharan

  • Partitioning chordal graphs into independent sets and cliques

    Pavol Hell;Sulamita Klein;Loana Tito Nogueira;Fáibio Protti

Frequent Co-Authors

Tomás Feder
Tomás Feder Stanford University
Jaroslav Nešetřil
Jaroslav Nešetřil Charles University
Xuding Zhu
Xuding Zhu Zhejiang Normal University
David G. Kirkpatrick
David G. Kirkpatrick University of British Columbia
Ugo Vaccaro
Ugo Vaccaro University of Salerno
Jean-Claude Bermond
Jean-Claude Bermond French Institute for Research in Computer Science and Automation - INRIA
Anders Yeo
Anders Yeo University of Southern Denmark
André Raspaud
André Raspaud University of Bordeaux
Peter Winkler
Peter Winkler Dartmouth College
Roded Sharan
Roded Sharan Tel Aviv University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students of Mathematics looking to expand their career options, pursuing related online degrees can be a strategic move. Programs like a 1 year dba program online offer a fast track to advanced business expertise alongside quantitative skills, making graduates attractive in leadership roles.

Finance professionals with strong math backgrounds often benefit from enrolling in online masters in finance programs. These degrees build on analytical foundations and enable careers in investment, risk management, and financial modeling, where mathematical proficiency is essential.

For those interested in management, a fastest online mba can combine mathematical and managerial skills quickly. This pathway is ideal for mathematicians aiming to accelerate into business leadership or entrepreneurship roles.

Alternatively, a master's degree in marketing leverages quantitative data analysis and statistical approaches to optimize marketing strategies, offering a unique blend of creativity and analytical rigor.

Exploring these diverse online degrees enriches mathematical knowledge with practical business applications, opening doors to versatile and rewarding career pathways.

Best Scientists Citing Pavol Hell

Trending Scientists

Recently Published Articles