Pavol Hell

ORCID

Publication Activity (10 Years)

Years Active: 1972-2024
Publications (10 Years): 50

Top Venues

CoRR

Discret. Appl. Math.

SIAM J. Discret. Math.

Discret. Math.

Publications

Pavol Hell, Jing Huang, Jephian C.-H. Lin
Strong Cocomparability Graphs and Slash-Free Orderings of Matrices. SIAM J. Discret. Math. 38 (1) (2024)
Mathew C. Francis, Pavol Hell, Dalu Jacob
On the Kernel and Related Problems in Interval Digraphs. Algorithmica 85 (6) (2023)
Santiago Guzmán-Pro, Pavol Hell, César Hernández-Cruz
Describing hereditary properties by forbidden circular orderings. Appl. Math. Comput. 438 (2023)
Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
List homomorphisms to separable signed graphs. CoRR (2023)
Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
List homomorphism problems for signed trees. Discret. Math. 346 (3) (2023)
L. Sunil Chandran, Sajal K. Das, Pavol Hell, Sajith Padinhatteeri, Raji R. Pillai
Template-driven rainbow coloring of proper interval graphs. Discret. Appl. Math. 328 (2023)
Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlicková, Arash Rafiey
Min orderings and list homomorphism dichotomies for signed and unsigned graphs. CoRR (2022)
Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
List Homomorphisms to Separable Signed Graphs. CALDAM (2022)
Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlicková, Arash Rafiey
Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs. LATIN (2022)
Pavol Hell, Jaroslav Nesetril
In praise of homomorphisms. Comput. Sci. Rev. 40 (2021)
Mathew C. Francis, Pavol Hell, Dalu Jacob
On the Kernel and Related Problems in Interval Digraphs. ISAAC (2021)
Mathew C. Francis, Pavol Hell, Dalu Jacob
On the Kernel and Related Problems in Interval Digraphs. CoRR (2021)
Tomás Feder, Pavol Hell, Carlos S. Subi
Distance-two colourings of Barnette graphs. Eur. J. Comb. 91 (2021)
Pavol Hell, César Hernández-Cruz, Jing Huang, Jephian C.-H. Lin
Strong Chordality of Graphs with Possible Loops. SIAM J. Discret. Math. 35 (1) (2021)
L. Sunil Chandran, Sajal K. Das, Pavol Hell, Sajith Padinhatteeri, Raji R. Pillai
Template-Driven Rainbow Coloring of Proper Interval Graphs. CALDAM (2021)
Pavol Hell, Hiroshi Nishiyama, Ladislav Stacho
Hamiltonian cycles in covering graphs of trees. Discret. Appl. Math. 282 (2020)
Pavol Hell, César Hernández-Cruz, Anurag Sanyal
Partitioning Cographs into Two Forests and One Independent Set. CALDAM (2020)
Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
List homomorphism problems for signed graphs. CoRR (2020)
Tomás Feder, Pavol Hell
Complexity of correspondence H-colourings. Discret. Appl. Math. 281 (2020)
Pavol Hell, Jing Huang, Jephian C.-H. Lin, Ross M. McConnell
Bipartite Analogues of Comparability and Cocomparability Graphs. SIAM J. Discret. Math. 34 (3) (2020)
Pavol Hell, Jing Huang, Ross M. McConnell, Arash Rafiey
Min-Orderable Digraphs. SIAM J. Discret. Math. 34 (3) (2020)
Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
List Homomorphism Problems for Signed Graphs. MFCS (2020)
Pavol Hell, César Hernández-Cruz, Jing Huang, Jephian C.-H. Lin
Strongly chordal digraphs and Γ-free matrices. CoRR (2019)
Tomás Feder, Pavol Hell, Carlos S. Subi
Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints. CoRR (2019)
Sebastián González Hermosillo de la Maza, Pavol Hell, César Hernández-Cruz, Seyyed Aliasghar Hosseini, Payam Valadkhan
Vertex arboricity of cographs. CoRR (2019)
Pavol Hell, César Hernández-Cruz, Cláudia Linhares Sales
Minimal obstructions to 2-polar cographs. Discret. Appl. Math. 261 (2019)
Tomás Feder, Pavol Hell, Carlos S. Subi
Distance-Two Coloring of Barnette Graphs. CCCG (2018)
Pavol Hell, Jing Huang, Ross M. McConnell, Arash Rafiey
Interval-Like Graphs and Digraphs. MFCS (2018)
Tomás Feder, Pavol Hell, Carlos S. Subi
Distance-Two Colorings of Barnette Graphs. CoRR (2018)
Pavol Hell, Jing Huang, Ross M. McConnell, Arash Rafiey
Interval-Like Graphs and Digraphs. CoRR (2018)
Tomás Feder, Pavol Hell
Correspondence Homomorphisms to Reflexive Graphs. Electron. Notes Discret. Math. 62 (2017)
Tomás Feder, Pavol Hell
Complexity of Correspondence Homomorphisms. CoRR (2017)
Pavol Hell, César Hernández-Cruz
Strict chordal and strict split digraphs. Discret. Appl. Math. 216 (2017)
Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr
The complexity of tropical graph homomorphisms. Discret. Appl. Math. 229 (2017)
Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr
The complexity of signed graph and edge-coloured graph homomorphisms. Discret. Math. 340 (2) (2017)
Tomás Feder, Pavol Hell, César Hernández-Cruz
Colourings, homomorphisms, and partitions of transitive digraphs. Eur. J. Comb. 60 (2017)
Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara
Ferrers dimension of grid intersection graphs. Discret. Appl. Math. 216 (2017)
Pavol Hell, Hiroshi Nishiyama, Ladislav Stacho
Hamiltonian Cycles in Covering Graphs of Trees. COCOA (2) (2017)
Pavol Hell, Shenwei Huang
Complexity of coloring graphs without paths and cycles. Discret. Appl. Math. 216 (2017)
Pavol Hell, Mayssam Mohammadi Nevisi
Minimum Cost Homomorphisms with Constrained Costs. COCOON (2016)
Pavol Hell, Arash Rafiey
Bi-Arc Digraphs and Conservative Polymorphisms. CoRR (2016)
Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr
The complexity of tropical graph homomorphisms. CoRR (2016)
Pavol Hell, Mayssam Mohammadi Nevisi
Minimum Cost Homomorphisms with Constrained Costs. CoRR (2016)
Pavol Hell, César Hernández-Cruz
Point determining digraphs, {0, 1}-matrix partitions, and dualities in full homomorphisms. Discret. Math. 338 (10) (2015)
Qian-Ping Gu, Pavol Hell, Boting Yang
Preface. Theor. Comput. Sci. 607 (2015)
Luisa Gargano, Pavol Hell, Joseph G. Peters, Ugo Vaccaro
Influence diffusion in social networks under time window constraints. Theor. Comput. Sci. 584 (2015)
Víctor Dalmau, László Egri, Pavol Hell, Benoît Larose, Arash Rafiey
Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy. LICS (2015)
Pavol Hell, Pei-Lan Yen
Join colourings of chordal graphs. Discret. Math. 338 (12) (2015)
Mathew C. Francis, Pavol Hell, Juraj Stacho
Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm. SODA (2015)
Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr
The complexity of signed graph and 2-edge-coloured graph homomorphisms. CoRR (2015)
Pavol Hell, Aurosish Mishra
H-coloring degree-bounded (acyclic) digraphs. Theor. Comput. Sci. 554 (2014)
Pavol Hell, César Hernández-Cruz
On the complexity of the 3-kernel problem in some classes of digraphs. Discuss. Math. Graph Theory 34 (1) (2014)
Mathew C. Francis, Pavol Hell, Juraj Stacho
Blocking Quadruple: A New Obstruction to Circular-Arc Graphs. SIAM J. Discret. Math. 28 (2) (2014)
Pavol Hell, Bojan Mohar, Arash Rafiey
Ordering without forbidden patterns. CoRR (2014)
Pavol Hell, Shenwei Huang
Complexity of Coloring Graphs without Paths and Cycles. LATIN (2014)
Tomás Feder, Pavol Hell, Oren Shklarsky
Matrix partitions of split graphs. Discret. Appl. Math. 166 (2014)
Pavol Hell
Graph partitions with prescribed patterns. Eur. J. Comb. 35 (2014)
Pietro Codara, Ottavio M. D'Antona, Pavol Hell
A simple combinatorial interpretation of certain generalized Bell and Stirling numbers. Discret. Math. 318 (2014)
László Egri, Pavol Hell, Benoît Larose, Arash Rafiey
-colouring: a dichotomy. SODA (2014)
Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara
Intersection Dimension of Bipartite Graphs. TAMC (2014)
Pavol Hell, Mark H. Siggers
Semilattice polymorphisms and chordal graphs. Eur. J. Comb. 36 (2014)
Mathew C. Francis, Pavol Hell, Juraj Stacho
Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm. CoRR (2014)
Pavol Hell, Ales Pultr
Connected obstructions to full graph homomorphisms. Eur. J. Comb. 41 (2014)
Pavol Hell, Bojan Mohar, Arash Rafiey
Ordering without Forbidden Patterns. ESA (2014)
Tomás Feder, Pavol Hell, Benoît Larose, Mark H. Siggers, Claude Tardif
Graphs Admitting k-NU Operations. Part 2: The Irreflexive Case. SIAM J. Discret. Math. 28 (2) (2014)
Sandip Das, Mathew C. Francis, Pavol Hell, Jing Huang
Recognition and Characterization of Chronological Interval Digraphs. Electron. J. Comb. 20 (3) (2013)
Mathew C. Francis, Pavol Hell, Juraj Stacho
Obstructions to chordal circular-arc graphs of small independence number. Electron. Notes Discret. Math. 44 (2013)
Marina Groshaus, Pavol Hell, Juraj Stacho
On edge-sets of bicliques in graphs. CoRR (2013)
Pietro Codara, Ottavio M. D'Antona, Pavol Hell
A simple combinatorial interpretation of certain generalized Bell and Stirling numbers. CoRR (2013)
Luisa Gargano, Pavol Hell, Joseph G. Peters, Ugo Vaccaro
Influence Diffusion in Social Networks under Time Window Constraints. SIROCCO (2013)
László Egri, Pavol Hell, Benoît Larose, Arash Rafiey
Space complexity of list H-colouring: a dichotomy. CoRR (2013)
Tomás Feder, Pavol Hell, Benoît Larose, Cynthia Loten, Mark H. Siggers, Claude Tardif
Graphs Admitting k-NU Operations. Part 1: The Reflexive Case. SIAM J. Discret. Math. 27 (4) (2013)
Tomás Feder, Pavol Hell, Oren Shklarsky
Matrix Partitions of Split Graphs. CoRR (2013)
Pavol Hell, Shenwei Huang
Complexity of Coloring Graphs without Paths and Cycles. CoRR (2013)
Pavol Hell, Aurosish Mishra
-Coloring Problems for Bounded Degree Digraphs. COCOON (2013)
Tomás Feder, Pavol Hell, Shekoofeh Nekooei Rizi
Obstructions to partitions of chordal graphs. Discret. Math. 313 (19) (2013)
Luisa Gargano, Pavol Hell, Joseph G. Peters, Ugo Vaccaro
Influence Diffusion in Social Networks under Time Window Constraints. CoRR (2013)
Pavol Hell, Wilfried Imrich, Jaroslav Nesetril
Preface. Discret. Math. 312 (1) (2012)
Pavol Hell, Monaldo Mastrolilli, Mayssam Mohammadi Nevisi, Arash Rafiey
Approximation of Minimum Cost Homomorphisms. ESA (2012)
Pavol Hell, Arash Rafiey
The Dichotomy of Minimum Cost Homomorphism Problems for Digraphs. SIAM J. Discret. Math. 26 (4) (2012)
Tomás Feder, Pavol Hell, Jing Huang, Arash Rafiey
Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms. Discret. Appl. Math. 160 (6) (2012)
Mathew C. Francis, Pavol Hell, Juraj Stacho
Obstructions to chordal circular-arc graphs of small independence number CoRR (2012)
Marina Groshaus, Pavol Hell, Juraj Stacho
On edge-sets of bicliques in graphs. Discret. Appl. Math. 160 (18) (2012)
Pavol Hell, Arash Rafiey
Monotone Proper Interval Digraphs and Min-Max Orderings. SIAM J. Discret. Math. 26 (4) (2012)
Pavol Hell, Miki Hermann, Mayssam Mohammadi Nevisi
Counting Partitions of Graphs. ISAAC (2012)
Aurosish Mishra, Pavol Hell
Small H-coloring problems for bounded degree digraphs CoRR (2012)
Hovhannes A. Harutyunyan, Pavol Hell, Arthur L. Liestman
Messy broadcasting - Decentralized broadcast schemes with limited knowledge. Discret. Appl. Math. 159 (5) (2011)
Tomás Feder, Pavol Hell, David G. Schell, Juraj Stacho
Dichotomy for tree-structured trigraph list homomorphism problems. Discret. Appl. Math. 159 (12) (2011)
Marina Groshaus, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
Cycle transversals in bounded degree graphs. Discret. Math. Theor. Comput. Sci. 13 (1) (2011)
Tomás Feder, Pavol Hell, Shekoofeh Nekooei Rizi
Partitioning Chordal Graphs. Electron. Notes Discret. Math. 38 (2011)
Pavol Hell, Arash Rafiey
The Dichotomy of List Homomorphisms for Digraphs. SODA (2011)
Tomás Feder, Pavol Hell, Peter Jonsson, Andrei A. Krokhin, Gustav Nordh
Retractions to Pseudoforests. SIAM J. Discret. Math. 24 (1) (2010)
Tomás Feder, Pavol Hell, David G. Schell, Juraj Stacho
Dichotomy for tree-structured trigraph list homomorphism problems CoRR (2010)
Michael D. Coury, Pavol Hell, Jan Kratochvíl, Tomás Vyskocil
Faithful Representations of Graphs by Islands in the Extended Grid. LATIN (2010)
Pavol Hell, Arash Rafiey
The Dichotomy of List Homomorphisms for Digraphs CoRR (2010)
Pavol Hell
Generalizations of Interval Graphs. CCCG (2009)
Pavol Hell, David G. Kirkpatrick
Linear-time certifying algorithms for near-graphical sequences. Discret. Math. 309 (18) (2009)
Tomás Feder, Pavol Hell, Jing Huang
Extension problems with degree bounds. Discret. Appl. Math. 157 (7) (2009)
Marina Groshaus, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
Cycle transversals in bounded degree graphs. Electron. Notes Discret. Math. 35 (2009)
Pavol Hell, Zhishi Pan, Tsai-Lien Wong, Xuding Zhu
Adaptable chromatic number of graph products. Discret. Math. 309 (21) (2009)

Pavol Hell.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Pavol Hell