Graph decompositions, handcuffed prisoners and balanced P-designs. - Pavol Hell; Alexander Rosa (Discret. Math., 1972)

Graph with given achromatic number. - Pavol Hell; Donald J. Miller (Discret. Math., 1976)

On the Completeness of a Generalized Matching Problem - David G. Kirkpatrick; Pavol Hell (STOC, 1978)

An intermediate value theorem for graphs with given automorphism group. - Pavol Hell; Louis V. Quintas (J. Graph Theory, 1979)

On Generalized Matching Problems. - Pavol Hell; David G. Kirkpatrick (Inf. Process. Lett., 1981)

Parallel Sorting with Constant Time for Comparisons. - Roland Häggkvist; Pavol Hell (SIAM J. Comput., 1981)

Counterexamples to theorems of Menger type for the diameter. - J. Adrian Bondy; Pavol Hell (Discret. Math., 1983)

The Complexity of Finding Generalized Paths in Tournaments. - Pavol Hell; Moshe Rosenfeld 001 (J. Algorithms, 1983)

On the Complexity of General Graph Factor Problems. - David G. Kirkpatrick; Pavol Hell (SIAM J. Comput., 1983)

Packings by cliques and by finite families of graphs. - Pavol Hell; David G. Kirkpatrick (Discret. Math., 1984)

On the History of the Minimum Spanning Tree Problem. - Ronald L. Graham; Pavol Hell (IEEE Ann. Hist. Comput., 1985)

A note onf-factors in directed and undirected multigraphs. - Pierre Fraisse; Pavol Hell; David G. Kirkpatrick (Graphs Comb., 1986)

Concerning the achromatic number of graphs. - Martin Farber; Gena Hahn; Pavol Hell; Donald J. Miller (J. Comb. Theory B, 1986)

On the problem of bandsize. - Katherine Heinrich; Pavol Hell (Graphs Comb., 1987)

On multiplicative graphs and the product conjecture. - Roland Häggkvist; Pavol Hell; Donald J. Miller; Victor Neumann-Lara (Comb., 1988)

Broadcasting in one dimension. - Pavol Hell; Arthur L. Liestman (Discret. Appl. Math., 1988)

The Complexity of Colouring by Semicomplete Digraphs. - Jørgen Bang-Jensen; Pavol Hell; Gary MacGillivray (SIAM J. Discret. Math., 1988)

On Restricted Two-Factors. - Pavol Hell; David G. Kirkpatrick; Jan Kratochvíl; Igor Kríz (SIAM J. Discret. Math., 1988)

Local Tournaments and Proper Circular Arc Gaphs. - Pavol Hell; Jørgen Bang-Jensen; Jing Huang 007 (SIGAL International Symposium on Algorithms, 1990)

The effect of two cycles on the complexity of colourings by directed graphs. - Jørgen Bang-Jensen; Pavol Hell (Discret. Appl. Math., 1990)

Preface. - Pavol Hell (Discret. Appl. Math., 1990)

A simple existence criterion for (g<f)- factors. - Katherine Heinrich; Pavol Hell; David G. Kirkpatrick; Guizhen Liu (Discret. Math., 1990)

On the complexity of H-coloring. - Pavol Hell; Jaroslav Nesetril (J. Comb. Theory B, 1990)

A note on the star chromatic number. - J. Adrian Bondy; Pavol Hell (J. Graph Theory, 1990)

Images of Rigid Digraphs. - Pavol Hell; Jaroslav Nesetril (Eur. J. Comb., 1991)

Recognition and Representation of Proper Circular Arc Graphs. - Xiaotie Deng; Pavol Hell; Jing Huang 007 (IPCO, 1992)

Sparse broadcast graphs. - Jean-Claude Bermond; Pavol Hell; Arthur L. Liestman; Joseph G. Peters (Discret. Appl. Math., 1992)

On the complexity of colouring by superdigraphs of bipartite graphs. - Jørgen Bang-Jensen; Pavol Hell; Gary MacGillivray (Discret. Math., 1992)

Achromatic numbers and graph operations. - Pavol Hell; Donald J. Miller (Discret. Math., 1992)

The core of a graph. - Pavol Hell; Jaroslav Nesetril (Discret. Math., 1992)

Construction of Large Packet Radio Networks. - Jean-Claude Bermond; Pavol Hell; Jean-Jacques Quisquater (Parallel Process. Lett., 1992)

Broadcasting in Bounded Degree Graphs. - Jean-Claude Bermond; Pavol Hell; Arthur L. Liestman; Joseph G. Peters (SIAM J. Discret. Math., 1992)

Homomorphisms to oriented cycles. - Pavol Hell; Huishan Zhou; Xuding Zhu (Comb., 1993)

Absolute Reflexive Retracts and Absolute Bipartite Retracts. - Hans-Jürgen Bandelt; Martin Farber; Pavol Hell (Discret. Appl. Math., 1993)

Fast Algorithms for Finding Hamiltonian Paths and Cycles in In-Tournament Digraphs. - Jørgen Bang-Jensen; Pavol Hell (Discret. Appl. Math., 1993)

Biography of Martin Farber, 1951-1989. - Pavol Hell (Discret. Appl. Math., 1993)

Largest planar graphs of diameter two and fixed maximum degree. - Pavol Hell; Karen Seyffarth (Discret. Math., 1993)

Universality of A-mote Graphs. - Roland Häggkvist; Pavol Hell (Eur. J. Comb., 1993)

Algorithms for Degree Constrained Graph Factors of Minimum Deficiency. - Pavol Hell; David G. Kirkpatrick (J. Algorithms, 1993)

On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs. - Jean-Claude Bermond; Pavol Hell (J. Graph Theory, 1993)

Graph endpoint coloring and distributed processing. - Dominique de Werra; Pavol Hell; Tiko Kameda; Naoki Katoh; Ph. Solot; Masafumi Yamashita (Networks, 1993)

Packing Problems in Edge-colored Graphs. - Pavol Hell; Yannis Manoussakis; Zsolt Tuza (Discret. Appl. Math., 1994)

On chordal proper circular arc graphs. - Jørgen Bang-Jensen; Pavol Hell (Discret. Math., 1994)

Independence ratios of graph powers. - Pavol Hell; Xingxing Yu; Huishan Zhou (Discret. Math., 1994)

Homomorphisms to oriented paths. - Pavol Hell; Xuding Zhu (Discret. Math., 1994)

Multiplicativity of Oriented Cycles. - Pavol Hell; Huishan Zhou; Xuding Zhu (J. Comb. Theory B, 1994)

Finding an Antidirected Hamiltonian Path Starting with a Forward Arc from a Given Vertex of a Tournament. - Evripidis Bampis; Pavol Hell; Yannis Manoussakis; Moshe Rosenfeld 001 (Combinatorics and Computer Science, 1995)

Large Planar Graphs with Given Diameter and Maximum Degree. - Michael R. Fellows; Pavol Hell; Karen Seyffarth (Discret. Appl. Math., 1995)

Hereditarily hard H-colouring problems. - Jørgen Bang-Jensen; Pavol Hell; Gary MacGillivray (Discret. Math., 1995)

Equicovering matroids by distinct bases. - Pierre Fraisse; Pavol Hell (Eur. J. Comb., 1995)

On the ultimate independence ratio of a graph. - Gena Hahn; Pavol Hell; Svatopluk Poljak (Eur. J. Comb., 1995)

Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs. - Pavol Hell; Jing Huang 007 (J. Graph Theory, 1995)

On homomorphisms to acyclic local tournaments. - Pavol Hell; Huishan Zhou; Xuding Zhu (J. Graph Theory, 1995)

The Existence of Homomorphisms to Oriented Cycles. - Pavol Hell; Xuding Zhu (SIAM J. Discret. Math., 1995)

Rounding in Symmetric Matrices and Undirected Graphs. - Pavol Hell; David G. Kirkpatrick; Brenda Li (Discret. Appl. Math., 1996)

Complexity of Tree Homomorphisms. - Pavol Hell; Jaroslav Nesetril; Xuding Zhu (Discret. Appl. Math., 1996)

Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs. - Xiaotie Deng; Pavol Hell; Jing Huang 007 (SIAM J. Comput., 1996)

A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs. - Binay K. Bhattacharya; Pavol Hell; Jing Huang 007 (SIAM J. Discret. Math., 1996)

Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing. - Luisa Gargano; Pavol Hell; Stephane Perennes (ICALP, 1997)

The complexity of restricted graph homomorphisms. - Richard C. Brewster; Pavol Hell; Gary MacGillivray (Discret. Math., 1997)

Two remarks on circular arc graphs. - Pavol Hell; Jing Huang 007 (Graphs Comb., 1997)

Broadcasting in planar graphs. - Pavol Hell; Karen Seyffarth (Australas. J Comb., 1998)

On the complexity of coloring areflexive h-ary relations with given permutation group. - L. Haddad; Pavol Hell; Eric Mendelsohn (Ars Comb., 1998)

Optimal Wavelength-routed Multicasting. - Bruno Beauquier; Pavol Hell; Stephane Perennes (Discret. Appl. Math., 1998)

List Homomorphisms to Reflexive Graphs. - Tomás Feder; Pavol Hell (J. Comb. Theory B, 1998)

Constructions of large planar networks with given degree and diameter. - Michael R. Fellows; Pavol Hell; Karen Seyffarth (Networks, 1998)

Complexity of Graph Partition Problems. - Tomás Feder; Pavol Hell; Sulamita Klein; Rajeev Motwani 001 (STOC, 1999)

List Homomorphisms and Circular Arc Graphs. - Tomás Feder; Pavol Hell; Jing Huang 007 (Comb., 1999)

The complexity of H-colouring of bounded degree graphs. - Anna Galluccio; Pavol Hell; Jaroslav Nesetril (Discret. Math., 2000)

On homomorphisms to edge-coloured cycles. - Richard C. Brewster; Pavol Hell (Electron. Notes Discret. Math., 2000)

Graph Packings. - Pavol Hell (Electron. Notes Discret. Math., 2000)

The circular chromatic number of series-parallel graphs. - Pavol Hell; Xuding Zhu (J. Graph Theory, 2000)

Counting List Homomorphisms and Graphs with Bounded Degrees. - Pavol Hell; Jaroslav Nesetril (Graphs, Morphisms and Statistical Physics, 2001)

On nice graphs. - Pavol Hell; Alexandr V. Kostochka; André Raspaud; Éric Sopena (Discret. Math., 2001)

On generalized split graphs. - Pavol Hell; Sulamita Klein; Fábio Protti; Loana Tito Nogueira (Electron. Notes Discret. Math., 2001)

High-Girth Graphs Avoiding a Minor are Nearly Bipartite. - Anna Galluccio; Luis A. Goddyn; Pavol Hell (J. Comb. Theory B, 2001)

Coloring all directed paths in a symmetric tree, with an application to optical networks. - Luisa Gargano; Pavol Hell; Stephane Perennes (J. Graph Theory, 2001)

A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs. - Pavol Hell; Ron Shamir; Roded Sharan (SIAM J. Comput., 2001)

Spanning Trees with Bounded Number of Branch Vertices. - Luisa Gargano; Pavol Hell; Ladislav Stacho; Ugo Vaccaro (ICALP, 2002)

Antidirected hamiltonian paths between specified vertices of a tournament. - Pavol Hell; Moshe Rosenfeld 001 (Discret. Appl. Math., 2002)

Homomorphisms to powers of digraphs. - Richard C. Brewster; Pavol Hell (Discret. Math., 2002)

Packing paths in digraphs. - Richard C. Brewster; Pavol Hell; Sarah H. Pantel; Romeo Rizzi; Anders Yeo (J. Graph Theory, 2003)

Bi-arc graphs and the complexity of list homomorphisms. - Tomás Feder; Pavol Hell; Jing Huang 007 (J. Graph Theory, 2003)

Broadcasting in generalized chordal rings. - Francesc Comellas; Pavol Hell (Networks, 2003)

List Partitions. - Tomás Feder; Pavol Hell; Sulamita Klein; Rajeev Motwani 001 (SIAM J. Discret. Math., 2003)

Acyclic Homomorphisms and Circular Colorings of Digraphs. - Tomás Feder; Pavol Hell; Bojan Mohar (SIAM J. Discret. Math., 2003)

Graphs and homomorphisms. - Pavol Hell; Jaroslav Nesetril (Oxford University Press, 2004)

List Partitions of Chordal Graphs. - Tomás Feder; Pavol Hell; Sulamita Klein; Loana Tito Nogueira; Fábio Protti (LATIN, 2004)

Partitioning chordal graphs into independent sets and cliques. - Pavol Hell; Sulamita Klein; Loana Tito Nogueira; Fábio Protti (Discret. Appl. Math., 2004)

Spanning spiders and light-splitting switches. - Luisa Gargano; Mikael Hammar; Pavol Hell; Ladislav Stacho; Ugo Vaccaro (Discret. Math., 2004)

Polychromatic cliques. - Pavol Hell; Juan José Montellano-Ballesteros (Discret. Math., 2004)

Interval bigraphs and circular arc graphs. - Pavol Hell; Jing Huang 007 (J. Graph Theory, 2004)

Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs. - Pavol Hell; Jing Huang 007 (SIAM J. Discret. Math., 2004)

Two algorithms for general list matrix partitions. - Tomás Feder; Pavol Hell; Daniel Král; Jirí Sgall (SODA, 2005)

Packing r-Cliques in Weighted Chordal Graphs. - Pavol Hell; Sulamita Klein; Loana Tito Nogueira; Fábio Protti (Ann. Oper. Res., 2005)

A generalization of the theorem of Lekkerkerker and Boland. - Pavol Hell; Jing Huang 007 (Discret. Math., 2005)

List matrix partitions of chordal graphs. - Tomás Feder; Pavol Hell; Sulamita Klein; Loana Tito Nogueira; Fábio Protti (Theor. Comput. Sci., 2005)

Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs - Gregory Z. Gutin; Pavol Hell; Arash Rafiey; Anders Yeo (CoRR, 2006)

Digraph matrix partitions and trigraph homomorphisms. - Tomás Feder; Pavol Hell; Kim Tucker-Nally (Discret. Appl. Math., 2006)

Matrix partitions of perfect graphs. - Tomás Feder; Pavol Hell (Discret. Math., 2006)

The k-piece packing problem. - David Hartvigsen; Pavol Hell; Jácint Szabó (J. Graph Theory, 2006)

Independent packings in structured graphs. - Kathie Cameron; Pavol Hell (Math. Program., 2006)

Full Constraint Satisfaction Problems. - Tomás Feder; Pavol Hell (SIAM J. Comput., 2006)

List homomorphisms of graphs with bounded degrees. - Tomás Feder; Pavol Hell; Jing Huang 007 (Discret. Math., 2007)

The structure of bi-arc trees. - Tomás Feder; Pavol Hell; Jing Huang 007 (Discret. Math., 2007)

Matrix Partitions with Finitely Many Obstructions. - Tomás Feder; Pavol Hell; Wing Xie (Electron. Notes Discret. Math., 2007)

On the Density of Trigraph Homomorphisms. - Pavol Hell; Jarik Nesetril (Graphs Comb., 2007)

Minimum Cost Homomorphisms to Reflexive Digraphs. - Arvind Gupta; Pavol Hell; Mehdi Karimi 001; Arash Rafiey (LATIN, 2008)

On Injective Colourings of Chordal Graphs. - Pavol Hell; André Raspaud; Juraj Stacho (LATIN, 2008)

Colouring, constraint satisfaction, and complexity. - Pavol Hell; Jaroslav Nesetril (Comput. Sci. Rev., 2008)

Polarity of chordal graphs. - Tínaz Ekim; Pavol Hell; Juraj Stacho; Dominique de Werra (Discret. Appl. Math., 2008)

On realizations of point determining graphs, and obstructions to full homomorphisms. - Tomás Feder; Pavol Hell (Discret. Math., 2008)

A dichotomy for minimum cost graph homomorphisms. - Gregory Z. Gutin; Pavol Hell; Arash Rafiey; Anders Yeo (Eur. J. Comb., 2008)

On the adaptable chromatic number of graphs. - Pavol Hell; Xuding Zhu (Eur. J. Comb., 2008)

Oriented star packings. - Richard C. Brewster; Pavol Hell; Romeo Rizzi (J. Comb. Theory B, 2008)

Near-Unanimity Functions and Varieties of Reflexive Graphs. - Richard C. Brewster; Tomás Feder; Pavol Hell; Jing Huang 007; Gary MacGillivray (SIAM J. Discret. Math., 2008)

Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms. - Tomás Feder; Pavol Hell; Jing Huang 007 (SIAM J. Discret. Math., 2008)

Generalizations of Interval Graphs. - Pavol Hell (CCCG, 2009)

Duality for Min-Max Orderings and Dichotomy for Min Cost Homomorphisms - Arash Rafiey; Pavol Hell (CoRR, 2009)

Extension problems with degree bounds. - Tomás Feder; Pavol Hell; Jing Huang 007 (Discret. Appl. Math., 2009)

Linear-time certifying algorithms for near-graphical sequences. - Pavol Hell; David G. Kirkpatrick (Discret. Math., 2009)

Adaptable chromatic number of graph products. - Pavol Hell; Zhishi Pan; Tsai-Lien Wong; Xuding Zhu (Discret. Math., 2009)

Adjusted Interval Digraphs. - Tomás Feder; Pavol Hell; Jing Huang 007; Arash Rafiey (Electron. Notes Discret. Math., 2009)

Cycle transversals in bounded degree graphs. - Marina Groshaus; Pavol Hell; Sulamita Klein; Loana Tito Nogueira; Fábio Protti (Electron. Notes Discret. Math., 2009)

Faithful Representations of Graphs by Islands in the Extended Grid. - Michael D. Coury; Pavol Hell; Jan Kratochvíl; Tomás Vyskocil (LATIN, 2010)

Retractions to Pseudoforests. - Tomás Feder; Pavol Hell; Peter Jonsson; Andrei A. Krokhin; Gustav Nordh (SIAM J. Discret. Math., 2010)

The Dichotomy of List Homomorphisms for Digraphs. - Pavol Hell; Arash Rafiey (SODA, 2011)

Dichotomy for tree-structured trigraph list homomorphism problems. - Tomás Feder; Pavol Hell; David G. Schell; Juraj Stacho (Discret. Appl. Math., 2011)

Messy broadcasting - Decentralized broadcast schemes with limited knowledge. - Hovhannes A. Harutyunyan; Pavol Hell; Arthur L. Liestman (Discret. Appl. Math., 2011)

Partitioning Chordal Graphs. - Tomás Feder; Pavol Hell; Shekoofeh Nekooei Rizi (Electron. Notes Discret. Math., 2011)

Approximation of Minimum Cost Homomorphisms. - Pavol Hell; Monaldo Mastrolilli; Mayssam Mohammadi Nevisi; Arash Rafiey (ESA, 2012)

Counting Partitions of Graphs. - Pavol Hell; Miki Hermann; Mayssam Mohammadi Nevisi (ISAAC, 2012)

Small H-coloring problems for bounded degree digraphs - Aurosish Mishra; Pavol Hell (CoRR, 2012)

Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms. - Tomás Feder; Pavol Hell; Jing Huang 007; Arash Rafiey (Discret. Appl. Math., 2012)

On edge-sets of bicliques in graphs. - Marina Groshaus; Pavol Hell; Juraj Stacho (Discret. Appl. Math., 2012)

Preface. - Pavol Hell; Wilfried Imrich; Jaroslav Nesetril (Discret. Math., 2012)

Monotone Proper Interval Digraphs and Min-Max Orderings. - Pavol Hell; Arash Rafiey (SIAM J. Discret. Math., 2012)

The Dichotomy of Minimum Cost Homomorphism Problems for Digraphs. - Pavol Hell; Arash Rafiey (SIAM J. Discret. Math., 2012)

Small H-Coloring Problems for Bounded Degree Digraphs. - Pavol Hell; Aurosish Mishra (COCOON, 2013)

Recognition and Characterization of Chronological Interval Digraphs. - Sandip Das 001; Mathew C. Francis; Pavol Hell; Jing Huang 007 (Electron. J. Comb., 2013)

Space complexity of list H-colouring: a dichotomy. - László Egri; Pavol Hell; Benoît Larose; Arash Rafiey (CoRR, 2013)

Obstructions to partitions of chordal graphs. - Tomás Feder; Pavol Hell; Shekoofeh Nekooei Rizi (Discret. Math., 2013)

Obstructions to chordal circular-arc graphs of small independence number. - Mathew C. Francis; Pavol Hell; Juraj Stacho (Electron. Notes Discret. Math., 2013)

Graphs Admitting k-NU Operations. Part 1: The Reflexive Case. - Tomás Feder; Pavol Hell; Benoît Larose; Cynthia Loten; Mark H. Siggers; Claude Tardif (SIAM J. Discret. Math., 2013)

Ordering without Forbidden Patterns. - Pavol Hell; Bojan Mohar; Arash Rafiey (ESA, 2014)

Space complexity of list H-colouring: a dichotomy. - László Egri; Pavol Hell; Benoît Larose; Arash Rafiey (SODA, 2014)

Intersection Dimension of Bipartite Graphs. - Steven Chaplick; Pavol Hell; Yota Otachi; Toshiki Saitoh; Ryuhei Uehara (TAMC, 2014)

Matrix partitions of split graphs. - Tomás Feder; Pavol Hell; Oren Shklarsky (Discret. Appl. Math., 2014)

A simple combinatorial interpretation of certain generalized Bell and Stirling numbers. - Pietro Codara; Ottavio M. D'Antona; Pavol Hell (Discret. Math., 2014)

On the complexity of the 3-kernel problem in some classes of digraphs. - Pavol Hell; César Hernández-Cruz (Discuss. Math. Graph Theory, 2014)

Graph partitions with prescribed patterns. - Pavol Hell (Eur. J. Comb., 2014)

Connected obstructions to full graph homomorphisms. - Pavol Hell; Ales Pultr (Eur. J. Comb., 2014)

Semilattice polymorphisms and chordal graphs. - Pavol Hell; Mark H. Siggers (Eur. J. Comb., 2014)

Graphs Admitting k-NU Operations. Part 2: The Irreflexive Case. - Tomás Feder; Pavol Hell; Benoît Larose; Mark H. Siggers; Claude Tardif (SIAM J. Discret. Math., 2014)

Blocking Quadruple: A New Obstruction to Circular-Arc Graphs. - Mathew C. Francis; Pavol Hell; Juraj Stacho (SIAM J. Discret. Math., 2014)

H-coloring degree-bounded (acyclic) digraphs. - Pavol Hell; Aurosish Mishra (Theor. Comput. Sci., 2014)

Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy. - Víctor Dalmau; László Egri; Pavol Hell; Benoît Larose; Arash Rafiey (LICS, 2015)

Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm. - Mathew C. Francis; Pavol Hell; Juraj Stacho (SODA, 2015)

The complexity of signed graph and 2-edge-coloured graph homomorphisms. - Richard C. Brewster; Florent Foucaud; Pavol Hell; Reza Naserasr (CoRR, 2015)

Point determining digraphs, {0, 1}-matrix partitions, and dualities in full homomorphisms. - Pavol Hell; César Hernández-Cruz (Discret. Math., 2015)

Join colourings of chordal graphs. - Pavol Hell; Pei-Lan Yen (Discret. Math., 2015)

Influence diffusion in social networks under time window constraints. - Luisa Gargano; Pavol Hell; Joseph G. Peters; Ugo Vaccaro (Theor. Comput. Sci., 2015)

Preface. - Qian-Ping Gu; Pavol Hell; Boting Yang (Theor. Comput. Sci., 2015)

Minimum Cost Homomorphisms with Constrained Costs. - Pavol Hell; Mayssam Mohammadi Nevisi (COCOON, 2016)

Bi-Arc Digraphs and Conservative Polymorphisms. - Pavol Hell; Arash Rafiey (CoRR, 2016)

Complexity of Correspondence Homomorphisms. - Tomás Feder; Pavol Hell (CoRR, 2017)

Ferrers dimension of grid intersection graphs. - Steven Chaplick; Pavol Hell; Yota Otachi; Toshiki Saitoh; Ryuhei Uehara (Discret. Appl. Math., 2017)

The complexity of tropical graph homomorphisms. - Florent Foucaud; Ararat Harutyunyan; Pavol Hell; Sylvain Legay; Yannis Manoussakis; Reza Naserasr (Discret. Appl. Math., 2017)

Complexity of coloring graphs without paths and cycles. - Pavol Hell; Shenwei Huang (Discret. Appl. Math., 2017)

Strict chordal and strict split digraphs. - Pavol Hell; César Hernández-Cruz (Discret. Appl. Math., 2017)

The complexity of signed graph and edge-coloured graph homomorphisms. - Richard C. Brewster; Florent Foucaud; Pavol Hell; Reza Naserasr (Discret. Math., 2017)

Colourings, homomorphisms, and partitions of transitive digraphs. - Tomás Feder; Pavol Hell; César Hernández-Cruz (Eur. J. Comb., 2017)

Correspondence Homomorphisms to Reflexive Graphs. - Tomás Feder; Pavol Hell (Electron. Notes Discret. Math., 2017)

Distance-Two Coloring of Barnette Graphs. - Tomás Feder; Pavol Hell; Carlos S. Subi (CCCG, 2018)

Interval-Like Graphs and Digraphs. - Pavol Hell; Jing Huang 007; Ross M. McConnell; Arash Rafiey (MFCS, 2018)

Distance-Two Colorings of Barnette Graphs. - Tomás Feder; Pavol Hell; Carlos S. Subi (CoRR, 2018)

Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints. - Tomás Feder; Pavol Hell; Carlos S. Subi (CoRR, 2019)

Vertex arboricity of cographs. - Sebastián González Hermosillo de la Maza; Pavol Hell; César Hernández-Cruz; Seyyed Aliasghar Hosseini; Payam Valadkhan (CoRR, 2019)

Strongly chordal digraphs and Γ-free matrices. - Pavol Hell; César Hernández-Cruz; Jing Huang 007; Jephian C.-H. Lin (CoRR, 2019)

Minimal obstructions to 2-polar cographs. - Pavol Hell; César Hernández-Cruz; Cláudia Linhares Sales (Discret. Appl. Math., 2019)

Partitioning Cographs into Two Forests and One Independent Set. - Pavol Hell; César Hernández-Cruz; Anurag Sanyal (CALDAM, 2020)

List Homomorphism Problems for Signed Graphs. - Jan Bok; Richard C. Brewster; Tomás Feder; Pavol Hell; Nikola Jedlicková (MFCS, 2020)

Complexity of correspondence H-colourings. - Tomás Feder; Pavol Hell (Discret. Appl. Math., 2020)

Hamiltonian cycles in covering graphs of trees. - Pavol Hell; Hiroshi Nishiyama; Ladislav Stacho (Discret. Appl. Math., 2020)

Bipartite Analogues of Comparability and Cocomparability Graphs. - Pavol Hell; Jing Huang 007; Jephian C.-H. Lin; Ross M. McConnell (SIAM J. Discret. Math., 2020)

Min-Orderable Digraphs. - Pavol Hell; Jing Huang 007; Ross M. McConnell; Arash Rafiey (SIAM J. Discret. Math., 2020)

In praise of homomorphisms. - Pavol Hell; Jaroslav Nesetril (Comput. Sci. Rev., 2021)

Distance-two colourings of Barnette graphs. - Tomás Feder; Pavol Hell; Carlos S. Subi (Eur. J. Comb., 2021)

Strong Chordality of Graphs with Possible Loops. - Pavol Hell; César Hernández-Cruz; Jing Huang 007; Jephian C.-H. Lin (SIAM J. Discret. Math., 2021)

Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs. - Jan Bok; Richard C. Brewster; Pavol Hell; Nikola Jedlicková; Arash Rafiey (LATIN, 2022)

Describing hereditary properties by forbidden circular orderings. - Santiago Guzmán-Pro; Pavol Hell; César Hernández-Cruz (Appl. Math. Comput., 2023)

List homomorphism problems for signed trees. - Jan Bok; Richard C. Brewster; Tomás Feder; Pavol Hell; Nikola Jedlicková (Discret. Math., 2023)

Template-driven rainbow coloring of proper interval graphs. - L. Sunil Chandran; Sajal K. Das 001; Pavol Hell; Sajith Padinhatteeri; Raji R. Pillai (Discret. Appl. Math., 2023)

On the Kernel and Related Problems in Interval Digraphs. - Mathew C. Francis; Pavol Hell; Dalu Jacob (Algorithmica, 2023)

Bi-arc Digraphs: Recognition Algorithm and Applications. - Pavol Hell; Akbar Rafiey; Arash Rafiey (LATIN (2), 2024)

Trees with minimum weighted Szeged index. - Pavol Hell; César Hernández-Cruz; Seyyed Aliasghar Hosseini (Art Discret. Appl. Math., 2024)

List homomorphisms to separable signed graphs. - Jan Bok; Richard C. Brewster; Tomás Feder; Pavol Hell; Nikola Jedlicková (Theor. Comput. Sci., 2024)

Strong Cocomparability Graphs and Slash-Free Orderings of Matrices. - Pavol Hell; Jing Huang 007; Jephian C.-H. Lin (SIAM J. Discret. Math., 2024)

Min Orderings and List Homomorphism Dichotomies for Graphs and Signed Graphs. - Jan Bok; Richard C. Brewster; Pavol Hell; Nikola Jedlicková; Arash Rafiey (Algorithmica, 2024)