| 2024 | LATIN | Bi-arc Digraphs: Recognition Algorithm and Applications. | Pavol Hell, Akbar Rafiey, Arash Rafiey |
| 2022 | LATIN | Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs. | Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlickov, Arash Rafiey |
| 2021 | ISAAC | On the Kernel and Related Problems in Interval Digraphs. | Mathew C. Francis, Pavol Hell, Dalu Jacob |
| 2020 | MFCS | List Homomorphism Problems for Signed Graphs. | Jan Bok, Richard C. Brewster, Toms Feder, Pavol Hell, Nikola Jedlickov |
| 2018 | MFCS | Interval-Like Graphs and Digraphs. | Pavol Hell, Jing Huang, Ross M. McConnell, Arash Rafiey |
| 2017 | COCOA | Hamiltonian Cycles in Covering Graphs of Trees. | Pavol Hell, Hiroshi Nishiyama, Ladislav Stacho |
| 2016 | COCOON | Minimum Cost Homomorphisms with Constrained Costs. | Pavol Hell, Mayssam Mohammadi Nevisi |
| 2015 | LICS | Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy. | Vctor Dalmau, Lszl Egri, Pavol Hell, Benot Larose, Arash Rafiey |
| 2015 | SODA | Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm. | Mathew C. Francis, Pavol Hell, Juraj Stacho |
| 2014 | ESA | Ordering without Forbidden Patterns. | Pavol Hell, Bojan Mohar, Arash Rafiey |
| 2014 | LATIN | Complexity of Coloring Graphs without Paths and Cycles. | Pavol Hell, Shenwei Huang |
| 2014 | SODA | Space complexity of list | Lszl Egri, Pavol Hell, Benot Larose, Arash Rafiey |
| 2014 | TAMC | Intersection Dimension of Bipartite Graphs. | Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara |
| 2013 | COCOON | Small | Pavol Hell, Aurosish Mishra |
| 2013 | SIROCCO | Influence Diffusion in Social Networks under Time Window Constraints. | Luisa Gargano, Pavol Hell, Joseph G. Peters, Ugo Vaccaro |
| 2012 | ESA | Approximation of Minimum Cost Homomorphisms. | Pavol Hell, Monaldo Mastrolilli, Mayssam Mohammadi Nevisi, Arash Rafiey |
| 2012 | ISAAC | Counting Partitions of Graphs. | Pavol Hell, Miki Hermann, Mayssam Mohammadi Nevisi |
| 2011 | SODA | The Dichotomy of List Homomorphisms for Digraphs. | Pavol Hell, Arash Rafiey |
| 2010 | LATIN | Faithful Representations of Graphs by Islands in the Extended Grid. | Michael D. Coury, Pavol Hell, Jan Kratochvl, Toms Vyskocil |
| 2008 | LATIN | Minimum Cost Homomorphisms to Reflexive Digraphs. | Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey |
| 2008 | LATIN | On Injective Colourings of Chordal Graphs. | Pavol Hell, Andr Raspaud, Juraj Stacho |
| 2005 | SODA | Two algorithms for general list matrix partitions. | Toms Feder, Pavol Hell, Daniel Krl, Jir Sgall |
| 2004 | LATIN | List Partitions of Chordal Graphs. | Toms Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fbio Protti |
| 2002 | ICALP | Spanning Trees with Bounded Number of Branch Vertices. | Luisa Gargano, Pavol Hell, Ladislav Stacho, Ugo Vaccaro |
| 1999 | ESA | A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs. | Pavol Hell, Ron Shamir, Roded Sharan |
| 1999 | STOC | Complexity of Graph Partition Problems. | Toms Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani |
| 1997 | ICALP | Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing. | Luisa Gargano, Pavol Hell, Stephane Perennes |
| 1992 | IPCO | Recognition and Representation of Proper Circular Arc Graphs. | Xiaotie Deng, Pavol Hell, Jing Huang |
| 1978 | STOC | On the Completeness of a Generalized Matching Problem | David G. Kirkpatrick, Pavol Hell |