![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Pavol Hell
Person information
- affiliation: Simon Fraser University, Burnaby, Canada
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j158]Jan Bok
, Richard C. Brewster
, Pavol Hell
, Nikola Jedlicková
, Arash Rafiey:
Min Orderings and List Homomorphism Dichotomies for Graphs and Signed Graphs. Algorithmica 86(7): 2289-2316 (2024) - [j157]Pavol Hell, Jing Huang
, Jephian C.-H. Lin
:
Strong Cocomparability Graphs and Slash-Free Orderings of Matrices. SIAM J. Discret. Math. 38(1): 828-844 (2024) - [j156]Jan Bok
, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List homomorphisms to separable signed graphs. Theor. Comput. Sci. 1001: 114580 (2024) - [c37]Pavol Hell, Akbar Rafiey, Arash Rafiey:
Bi-arc Digraphs: Recognition Algorithm and Applications. LATIN (2) 2024: 31-45 - 2023
- [j155]Mathew C. Francis, Pavol Hell, Dalu Jacob:
On the Kernel and Related Problems in Interval Digraphs. Algorithmica 85(6): 1522-1559 (2023) - [j154]Santiago Guzmán-Pro
, Pavol Hell, César Hernández-Cruz
:
Describing hereditary properties by forbidden circular orderings. Appl. Math. Comput. 438: 127555 (2023) - [j153]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: 97-107 (2023) - [j152]Jan Bok
, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List homomorphism problems for signed trees. Discret. Math. 346(3): 113257 (2023) - [i29]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List homomorphisms to separable signed graphs. CoRR abs/2306.06449 (2023) - 2022
- [c36]Jan Bok
, Richard C. Brewster
, Tomás Feder, Pavol Hell
, Nikola Jedlicková
:
List Homomorphisms to Separable Signed Graphs. CALDAM 2022: 22-35 - [c35]Jan Bok
, Richard C. Brewster
, Pavol Hell
, Nikola Jedlicková
, Arash Rafiey:
Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs. LATIN 2022: 510-526 - [i28]Jan Bok
, Richard C. Brewster, Pavol Hell, Nikola Jedlicková, Arash Rafiey:
Min orderings and list homomorphism dichotomies for signed and unsigned graphs. CoRR abs/2206.01068 (2022) - 2021
- [j151]Pavol Hell, Jaroslav Nesetril:
In praise of homomorphisms. Comput. Sci. Rev. 40: 100352 (2021) - [j150]Tomás Feder, Pavol Hell, Carlos S. Subi:
Distance-two colourings of Barnette graphs. Eur. J. Comb. 91: 103210 (2021) - [j149]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): 362-375 (2021) - [c34]L. Sunil Chandran, Sajal K. Das, Pavol Hell, Sajith Padinhatteeri, Raji R. Pillai:
Template-Driven Rainbow Coloring of Proper Interval Graphs. CALDAM 2021: 452-470 - [c33]Mathew C. Francis, Pavol Hell, Dalu Jacob:
On the Kernel and Related Problems in Interval Digraphs. ISAAC 2021: 17:1-17:17 - [i27]Mathew C. Francis, Pavol Hell, Dalu Jacob:
On the Kernel and Related Problems in Interval Digraphs. CoRR abs/2107.08278 (2021) - 2020
- [j148]Tomás Feder, Pavol Hell:
Complexity of correspondence H-colourings. Discret. Appl. Math. 281: 235-245 (2020) - [j147]Pavol Hell, Hiroshi Nishiyama
, Ladislav Stacho:
Hamiltonian cycles in covering graphs of trees. Discret. Appl. Math. 282: 271-281 (2020) - [j146]Pavol Hell, Jing Huang
, Ross M. McConnell, Arash Rafiey:
Min-Orderable Digraphs. SIAM J. Discret. Math. 34(3): 1710-1724 (2020) - [j145]Pavol Hell, Jing Huang
, Jephian C.-H. Lin
, Ross M. McConnell:
Bipartite Analogues of Comparability and Cocomparability Graphs. SIAM J. Discret. Math. 34(3): 1969-1983 (2020) - [c32]Pavol Hell
, César Hernández-Cruz
, Anurag Sanyal:
Partitioning Cographs into Two Forests and One Independent Set. CALDAM 2020: 15-27 - [c31]Jan Bok
, Richard C. Brewster
, Tomás Feder, Pavol Hell
, Nikola Jedlicková
:
List Homomorphism Problems for Signed Graphs. MFCS 2020: 20:1-20:14 - [i26]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List homomorphism problems for signed graphs. CoRR abs/2005.05547 (2020)
2010 – 2019
- 2019
- [j144]Pavol Hell, César Hernández-Cruz
, Cláudia Linhares Sales:
Minimal obstructions to 2-polar cographs. Discret. Appl. Math. 261: 219-228 (2019) - [i25]Tomás Feder, Pavol Hell, Carlos S. Subi:
Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints. CoRR abs/1907.00061 (2019) - [i24]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 abs/1907.07286 (2019) - [i23]Pavol Hell, César Hernández-Cruz, Jing Huang, Jephian C.-H. Lin:
Strongly chordal digraphs and Γ-free matrices. CoRR abs/1909.03597 (2019) - 2018
- [c30]Tomás Feder, Pavol Hell, Carlos S. Subi:
Distance-Two Coloring of Barnette Graphs. CCCG 2018: 304-310 - [c29]Pavol Hell, Jing Huang, Ross M. McConnell, Arash Rafiey:
Interval-Like Graphs and Digraphs. MFCS 2018: 68:1-68:13 - [i22]Pavol Hell, Jing Huang, Ross M. McConnell, Arash Rafiey:
Interval-Like Graphs and Digraphs. CoRR abs/1804.05258 (2018) - [i21]Tomás Feder, Pavol Hell, Carlos S. Subi:
Distance-Two Colorings of Barnette Graphs. CoRR abs/1807.01410 (2018) - 2017
- [j143]Steven Chaplick
, Pavol Hell, Yota Otachi
, Toshiki Saitoh
, Ryuhei Uehara
:
Ferrers dimension of grid intersection graphs. Discret. Appl. Math. 216: 130-135 (2017) - [j142]Pavol Hell, Shenwei Huang:
Complexity of coloring graphs without paths and cycles. Discret. Appl. Math. 216: 211-232 (2017) - [j141]Pavol Hell
, César Hernández-Cruz
:
Strict chordal and strict split digraphs. Discret. Appl. Math. 216: 609-617 (2017) - [j140]Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr:
The complexity of tropical graph homomorphisms. Discret. Appl. Math. 229: 64-81 (2017) - [j139]Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr:
The complexity of signed graph and edge-coloured graph homomorphisms. Discret. Math. 340(2): 223-235 (2017) - [j138]Tomás Feder, Pavol Hell, César Hernández-Cruz
:
Colourings, homomorphisms, and partitions of transitive digraphs. Eur. J. Comb. 60: 55-65 (2017) - [j137]Tomás Feder, Pavol Hell:
Correspondence Homomorphisms to Reflexive Graphs. Electron. Notes Discret. Math. 62: 9-14 (2017) - [c28]Pavol Hell, Hiroshi Nishiyama, Ladislav Stacho:
Hamiltonian Cycles in Covering Graphs of Trees. COCOA (2) 2017: 261-275 - [i20]Tomás Feder, Pavol Hell:
Complexity of Correspondence Homomorphisms. CoRR abs/1703.05881 (2017) - 2016
- [c27]Pavol Hell, Mayssam Mohammadi Nevisi:
Minimum Cost Homomorphisms with Constrained Costs. COCOON 2016: 194-206 - [i19]Pavol Hell, Mayssam Mohammadi Nevisi:
Minimum Cost Homomorphisms with Constrained Costs. CoRR abs/1602.07827 (2016) - [i18]Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr:
The complexity of tropical graph homomorphisms. CoRR abs/1607.04777 (2016) - [i17]Pavol Hell, Arash Rafiey:
Bi-Arc Digraphs and Conservative Polymorphisms. CoRR abs/1608.03368 (2016) - 2015
- [j136]Pavol Hell, César Hernández-Cruz
:
Point determining digraphs, {0, 1}-matrix partitions, and dualities in full homomorphisms. Discret. Math. 338(10): 1755-1762 (2015) - [j135]Pavol Hell
, Pei-Lan Yen:
Join colourings of chordal graphs. Discret. Math. 338(12): 2453-2461 (2015) - [j134]Luisa Gargano
, Pavol Hell
, Joseph G. Peters, Ugo Vaccaro:
Influence diffusion in social networks under time window constraints. Theor. Comput. Sci. 584: 53-66 (2015) - [j133]Qian-Ping Gu, Pavol Hell, Boting Yang:
Preface. Theor. Comput. Sci. 607: 1 (2015) - [c26]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: 487-498 - [c25]Mathew C. Francis, Pavol Hell, Juraj Stacho:
Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm. SODA 2015: 1708-1727 - [i16]Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr:
The complexity of signed graph and 2-edge-coloured graph homomorphisms. CoRR abs/1510.05502 (2015) - 2014
- [j132]Tomás Feder, Pavol Hell, Oren Shklarsky:
Matrix partitions of split graphs. Discret. Appl. Math. 166: 91-96 (2014) - [j131]Pietro Codara
, Ottavio M. D'Antona
, Pavol Hell
:
A simple combinatorial interpretation of certain generalized Bell and Stirling numbers. Discret. Math. 318: 53-57 (2014) - [j130]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): 167-185 (2014) - [j129]Pavol Hell:
Graph partitions with prescribed patterns. Eur. J. Comb. 35: 335-353 (2014) - [j128]Pavol Hell, Mark H. Siggers
:
Semilattice polymorphisms and chordal graphs. Eur. J. Comb. 36: 694-706 (2014) - [j127]Pavol Hell, Ales Pultr
:
Connected obstructions to full graph homomorphisms. Eur. J. Comb. 41: 278-288 (2014) - [j126]Mathew C. Francis, Pavol Hell, Juraj Stacho:
Blocking Quadruple: A New Obstruction to Circular-Arc Graphs. SIAM J. Discret. Math. 28(2): 631-655 (2014) - [j125]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): 817-834 (2014) - [j124]Pavol Hell, Aurosish Mishra:
H-coloring degree-bounded (acyclic) digraphs. Theor. Comput. Sci. 554: 40-49 (2014) - [c24]Pavol Hell, Bojan Mohar, Arash Rafiey:
Ordering without Forbidden Patterns. ESA 2014: 554-565 - [c23]Pavol Hell, Shenwei Huang:
Complexity of Coloring Graphs without Paths and Cycles. LATIN 2014: 538-549 - [c22]László Egri, Pavol Hell, Benoît Larose, Arash Rafiey:
Space complexity of list H-colouring: a dichotomy. SODA 2014: 349-365 - [c21]Steven Chaplick
, Pavol Hell, Yota Otachi
, Toshiki Saitoh
, Ryuhei Uehara
:
Intersection Dimension of Bipartite Graphs. TAMC 2014: 323-340 - [e1]Qianping Gu, Pavol Hell, Boting Yang:
Algorithmic Aspects in Information and Management - 10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings. Lecture Notes in Computer Science 8546, Springer 2014, ISBN 978-3-319-07955-4 [contents] - [i15]Pavol Hell, Bojan Mohar, Arash Rafiey:
Ordering without forbidden patterns. CoRR abs/1408.1461 (2014) - [i14]Mathew C. Francis, Pavol Hell, Juraj Stacho:
Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm. CoRR abs/1408.2639 (2014) - 2013
- [j123]Sandip Das, Mathew C. Francis, Pavol Hell, Jing Huang:
Recognition and Characterization of Chronological Interval Digraphs. Electron. J. Comb. 20(3): 5 (2013) - [j122]Tomás Feder, Pavol Hell, Shekoofeh Nekooei Rizi:
Obstructions to partitions of chordal graphs. Discret. Math. 313(19): 1861-1871 (2013) - [j121]Mathew C. Francis, Pavol Hell, Juraj Stacho:
Obstructions to chordal circular-arc graphs of small independence number. Electron. Notes Discret. Math. 44: 75-81 (2013) - [j120]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): 1940-1963 (2013) - [c20]Pavol Hell, Aurosish Mishra:
Small H-Coloring Problems for Bounded Degree Digraphs. COCOON 2013: 579-590 - [c19]Luisa Gargano
, Pavol Hell, Joseph G. Peters, Ugo Vaccaro:
Influence Diffusion in Social Networks under Time Window Constraints. SIROCCO 2013: 141-152 - [i13]Tomás Feder, Pavol Hell, Oren Shklarsky:
Matrix Partitions of Split Graphs. CoRR abs/1306.1967 (2013) - [i12]Marina Groshaus, Pavol Hell, Juraj Stacho:
On edge-sets of bicliques in graphs. CoRR abs/1307.4629 (2013) - [i11]László Egri, Pavol Hell, Benoît Larose, Arash Rafiey:
Space complexity of list H-colouring: a dichotomy. CoRR abs/1308.0180 (2013) - [i10]Pietro Codara, Ottavio M. D'Antona, Pavol Hell:
A simple combinatorial interpretation of certain generalized Bell and Stirling numbers. CoRR abs/1308.1700 (2013) - [i9]Pavol Hell, Shenwei Huang:
Complexity of Coloring Graphs without Paths and Cycles. CoRR abs/1310.0340 (2013) - [i8]Luisa Gargano, Pavol Hell, Joseph G. Peters, Ugo Vaccaro:
Influence Diffusion in Social Networks under Time Window Constraints. CoRR abs/1311.5193 (2013) - 2012
- [j119]Tomás Feder, Pavol Hell, Jing Huang, Arash Rafiey:
Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms. Discret. Appl. Math. 160(6): 697-707 (2012) - [j118]Marina Groshaus, Pavol Hell, Juraj Stacho:
On edge-sets of bicliques in graphs. Discret. Appl. Math. 160(18): 2698-2708 (2012) - [j117]Pavol Hell, Wilfried Imrich
, Jaroslav Nesetril
:
Preface. Discret. Math. 312(1): 1 (2012) - [j116]Pavol Hell, Arash Rafiey:
Monotone Proper Interval Digraphs and Min-Max Orderings. SIAM J. Discret. Math. 26(4): 1576-1596 (2012) - [j115]Pavol Hell, Arash Rafiey:
The Dichotomy of Minimum Cost Homomorphism Problems for Digraphs. SIAM J. Discret. Math. 26(4): 1597-1608 (2012) - [c18]Pavol Hell, Monaldo Mastrolilli
, Mayssam Mohammadi Nevisi, Arash Rafiey:
Approximation of Minimum Cost Homomorphisms. ESA 2012: 587-598 - [c17]Pavol Hell, Miki Hermann, Mayssam Mohammadi Nevisi:
Counting Partitions of Graphs. ISAAC 2012: 227-236 - [i7]Mathew C. Francis, Pavol Hell, Juraj Stacho:
Obstructions to chordal circular-arc graphs of small independence number. CoRR abs/1210.5701 (2012) - [i6]Aurosish Mishra, Pavol Hell:
Small H-coloring problems for bounded degree digraphs. CoRR abs/1211.6466 (2012) - 2011
- [j114]Hovhannes A. Harutyunyan, Pavol Hell, Arthur L. Liestman:
Messy broadcasting - Decentralized broadcast schemes with limited knowledge. Discret. Appl. Math. 159(5): 322-327 (2011) - [j113]Tomás Feder, Pavol Hell, David G. Schell, Juraj Stacho:
Dichotomy for tree-structured trigraph list homomorphism problems. Discret. Appl. Math. 159(12): 1217-1224 (2011) - [j112]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): 45-66 (2011) - [j111]Tomás Feder, Pavol Hell, Shekoofeh Nekooei Rizi:
Partitioning Chordal Graphs. Electron. Notes Discret. Math. 38: 325-330 (2011) - [c16]Pavol Hell, Arash Rafiey:
The Dichotomy of List Homomorphisms for Digraphs. SODA 2011: 1703-1713 - 2010
- [j110]Tomás Feder, Pavol Hell, Peter Jonsson, Andrei A. Krokhin
, Gustav Nordh:
Retractions to Pseudoforests. SIAM J. Discret. Math. 24(1): 101-112 (2010) - [c15]Michael D. Coury, Pavol Hell, Jan Kratochvíl
, Tomás Vyskocil:
Faithful Representations of Graphs by Islands in the Extended Grid. LATIN 2010: 131-142 - [i5]Pavol Hell, Arash Rafiey:
The Dichotomy of List Homomorphisms for Digraphs. CoRR abs/1004.2908 (2010) - [i4]Tomás Feder, Pavol Hell, David G. Schell, Juraj Stacho:
Dichotomy for tree-structured trigraph list homomorphism problems. CoRR abs/1009.0358 (2010)
2000 – 2009
- 2009
- [j109]Tomás Feder, Pavol Hell, Jing Huang:
Extension problems with degree bounds. Discret. Appl. Math. 157(7): 1592-1599 (2009) - [j108]Pavol Hell, David G. Kirkpatrick:
Linear-time certifying algorithms for near-graphical sequences. Discret. Math. 309(18): 5703-5713 (2009) - [j107]Pavol Hell, Zhishi Pan, Tsai-Lien Wong, Xuding Zhu:
Adaptable chromatic number of graph products. Discret. Math. 309(21): 6153-6159 (2009) - [j106]Tomás Feder, Pavol Hell, Jing Huang, Arash Rafiey:
Adjusted Interval Digraphs. Electron. Notes Discret. Math. 32: 83-91 (2009) - [j105]Marina Groshaus, Pavol Hell, Sulamita Klein, Loana Tito Nogueira
, Fábio Protti:
Cycle transversals in bounded degree graphs. Electron. Notes Discret. Math. 35: 189-195 (2009) - [c14]Pavol Hell:
Generalizations of Interval Graphs. CCCG 2009: 49 - [i3]Arash Rafiey, Pavol Hell:
Duality for Min-Max Orderings and Dichotomy for Min Cost Homomorphisms. CoRR abs/0907.3016 (2009) - 2008
- [j104]Pavol Hell, Jaroslav Nesetril
:
Colouring, constraint satisfaction, and complexity. Comput. Sci. Rev. 2(3): 143-163 (2008) - [j103]Tínaz Ekim
, Pavol Hell, Juraj Stacho, Dominique de Werra:
Polarity of chordal graphs. Discret. Appl. Math. 156(13): 2469-2479 (2008) - [j102]Tomás Feder, Pavol Hell:
On realizations of point determining graphs, and obstructions to full homomorphisms. Discret. Math. 308(9): 1639-1652 (2008) - [j101]Gregory Z. Gutin, Pavol Hell, Arash Rafiey, Anders Yeo:
A dichotomy for minimum cost graph homomorphisms. Eur. J. Comb. 29(4): 900-911 (2008) - [j100]Pavol Hell, Xuding Zhu:
On the adaptable chromatic number of graphs. Eur. J. Comb. 29(4): 912-921 (2008) - [j99]Richard C. Brewster, Pavol Hell, Romeo Rizzi
:
Oriented star packings. J. Comb. Theory B 98(3): 558-576 (2008) - [j98]Tomás Feder, Pavol Hell, Jing Huang:
Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms. SIAM J. Discret. Math. 22(1): 1-14 (2008) - [j97]Richard C. Brewster, Tomás Feder, Pavol Hell, Jing Huang, Gary MacGillivray:
Near-Unanimity Functions and Varieties of Reflexive Graphs. SIAM J. Discret. Math. 22(3): 938-960 (2008) - [c13]Arvind Gupta, Pavol Hell, Mehdi Karimi
, Arash Rafiey:
Minimum Cost Homomorphisms to Reflexive Digraphs. LATIN 2008: 182-193 - [c12]Pavol Hell, André Raspaud, Juraj Stacho:
On Injective Colourings of Chordal Graphs. LATIN 2008: 520-530 - 2007
- [j96]Tomás Feder, Pavol Hell, Wing Xie:
Matrix Partitions with Finitely Many Obstructions. Electron. J. Comb. 14(1) (2007) - [j95]Tomás Feder, Pavol Hell, Jing Huang:
List homomorphisms of graphs with bounded degrees. Discret. Math. 307(3-5): 386-392 (2007) - [j94]Tomás Feder, Pavol Hell, Jing Huang:
The structure of bi-arc trees. Discret. Math. 307(3-5): 393-401 (2007) - [j93]Tomás Feder, Pavol Hell, Wing Xie:
Matrix Partitions with Finitely Many Obstructions. Electron. Notes Discret. Math. 28: 371-378 (2007) - [j92]Pavol Hell, Jarik Nesetril
:
On the Density of Trigraph Homomorphisms. Graphs Comb. 23(Supplement-1): 275-281 (2007) - [i2]Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey:
Minimum Cost Homomorphisms to Reflexive Digraphs. CoRR abs/0708.2514 (2007) - 2006
- [j91]Tomás Feder, Pavol Hell, Kim Tucker-Nally:
Digraph matrix partitions and trigraph homomorphisms. Discret. Appl. Math. 154(17): 2458-2469 (2006) - [j90]Tomás Feder, Pavol Hell:
Matrix partitions of perfect graphs. Discret. Math. 306(19-20): 2450-2460 (2006) - [j89]David Hartvigsen, Pavol Hell, Jácint Szabó:
The k-piece packing problem. J. Graph Theory 52(4): 267-293 (2006) - [j88]Kathie Cameron, Pavol Hell:
Independent packings in structured graphs. Math. Program. 105(2-3): 201-213 (2006) - [j87]Tomás Feder, Pavol Hell:
Full Constraint Satisfaction Problems. SIAM J. Comput. 36(1): 230-246 (2006) - [i1]Gregory Z. Gutin, Pavol Hell, Arash Rafiey, Anders Yeo:
Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs. CoRR abs/cs/0602038 (2006) - 2005
- [j86]Pavol Hell, Sulamita Klein, Loana Tito Nogueira
, Fábio Protti:
Packing r-Cliques in Weighted Chordal Graphs. Ann. Oper. Res. 138(1): 179-187 (2005) - [j85]Pavol Hell, Jing Huang:
A generalization of the theorem of Lekkerkerker and Boland. Discret. Math. 299(1-3): 113-119 (2005) - [j84]Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira
, Fábio Protti:
List matrix partitions of chordal graphs. Theor. Comput. Sci. 349(1): 52-66 (2005) - [c11]Tomás Feder, Pavol Hell, Daniel Král, Jirí Sgall:
Two algorithms for general list matrix partitions. SODA 2005: 870-876 - 2004
- [b1]Pavol Hell, Jaroslav Nesetril:
Graphs and homomorphisms. Oxford lecture series in mathematics and its applications 28, Oxford University Press 2004, ISBN 978-0-19-852817-3, pp. I-XII, 1-244 - [j83]Pavol Hell, Sulamita Klein, Loana Tito Nogueira
, Fábio Protti:
Partitioning chordal graphs into independent sets and cliques. Discret. Appl. Math. 141(1-3): 185-194 (2004) - [j82]Luisa Gargano
, Mikael Hammar, Pavol Hell, Ladislav Stacho, Ugo Vaccaro:
Spanning spiders and light-splitting switches. Discret. Math. 285(1-3): 83-95 (2004) - [j81]Pavol Hell, Juan José Montellano-Ballesteros
:
Polychromatic cliques. Discret. Math. 285(1-3): 319-322 (2004) - [j80]Pavol Hell, Jing Huang:
Interval bigraphs and circular arc graphs. J. Graph Theory 46(4): 313-327 (2004) - [j79]Pavol Hell, Jing Huang:
Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs. SIAM J. Discret. Math. 18(3): 554-570 (2004) - [c10]Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
List Partitions of Chordal Graphs. LATIN 2004: 100-108 - 2003
- [j78]Tomás Feder, Pavol Hell, Jing Huang:
Bi-arc graphs and the complexity of list homomorphisms. J. Graph Theory 42(1): 61-80 (2003) - [j77]Richard C. Brewster, Pavol Hell, Sarah H. Pantel, Romeo Rizzi
, Anders Yeo:
Packing paths in digraphs. J. Graph Theory 44(2): 81-94 (2003) - [j76]Francesc Comellas
, Pavol Hell:
Broadcasting in generalized chordal rings. Networks 42(3): 123-134 (2003) - [j75]Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani:
List Partitions. SIAM J. Discret. Math. 16(3): 449-478 (2003) - [j74]Tomás Feder, Pavol Hell, Bojan Mohar:
Acyclic Homomorphisms and Circular Colorings of Digraphs. SIAM J. Discret. Math. 17(1): 161-169 (2003) - 2002
- [j73]Pavol Hell, Moshe Rosenfeld:
Antidirected hamiltonian paths between specified vertices of a tournament. Discret. Appl. Math. 117(1-3): 87-98 (2002) - [j72]Richard C. Brewster, Pavol Hell:
Homomorphisms to powers of digraphs. Discret. Math. 244(1-3): 31-41 (2002) - [c9]Luisa Gargano
, Pavol Hell, Ladislav Stacho, Ugo Vaccaro:
Spanning Trees with Bounded Number of Branch Vertices. ICALP 2002: 355-365 - 2001
- [j71]Pavol Hell, Alexandr V. Kostochka, André Raspaud, Éric Sopena:
On nice graphs. Discret. Math. 234(1-3): 39-51 (2001) - [j70]Pavol Hell, Sulamita Klein, Fábio Protti, Loana Tito Nogueira:
On generalized split graphs. Electron. Notes Discret. Math. 7: 98-101 (2001) - [j69]Anna Galluccio, Luis A. Goddyn, Pavol Hell:
High-Girth Graphs Avoiding a Minor are Nearly Bipartite. J. Comb. Theory B 83(1): 1-14 (2001) - [j68]Luisa Gargano
, Pavol Hell, Stephane Perennes:
Coloring all directed paths in a symmetric tree, with an application to optical networks. J. Graph Theory 38(4): 183-196 (2001) - [j67]Pavol Hell, Ron Shamir
, Roded Sharan:
A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs. SIAM J. Comput. 31(1): 289-305 (2001) - [c8]Pavol Hell, Jaroslav Nesetril:
Counting List Homomorphisms and Graphs with Bounded Degrees. Graphs, Morphisms and Statistical Physics 2001: 105-112 - 2000
- [j66]Anna Galluccio, Pavol Hell, Jaroslav Nesetril
:
The complexity of H-colouring of bounded degree graphs. Discret. Math. 222(1-3): 101-109 (2000) - [j65]Richard C. Brewster, Pavol Hell:
On homomorphisms to edge-coloured cycles. Electron. Notes Discret. Math. 5: 46-49 (2000) - [j64]Pavol Hell:
Graph Packings. Electron. Notes Discret. Math. 5: 170-173 (2000) - [j63]Pavol Hell, Xuding Zhu:
The circular chromatic number of series-parallel graphs. J. Graph Theory 33(1): 14-24 (2000)
1990 – 1999
- 1999
- [j62]Tomás Feder, Pavol Hell, Jing Huang:
List Homomorphisms and Circular Arc Graphs. Comb. 19(4): 487-505 (1999) - [c7]Pavol Hell, Ron Shamir
, Roded Sharan:
A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs. ESA 1999: 527-539 - [c6]Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani:
Complexity of Graph Partition Problems. STOC 1999: 464-472 - 1998
- [j61]Pavol Hell, Karen Seyffarth:
Broadcasting in planar graphs. Australas. J Comb. 17: 309- (1998) - [j60]L. Haddad, Pavol Hell, Eric Mendelsohn:
On the complexity of coloring areflexive h-ary relations with given permutation group. Ars Comb. 48 (1998) - [j59]Bruno Beauquier, Pavol Hell, Stephane Perennes:
Optimal Wavelength-routed Multicasting. Discret. Appl. Math. 84(1-3): 15-20 (1998) - [j58]Tomás Feder, Pavol Hell:
List Homomorphisms to Reflexive Graphs. J. Comb. Theory B 72(2): 236-250 (1998) - [j57]Michael R. Fellows, Pavol Hell, Karen Seyffarth:
Constructions of large planar networks with given degree and diameter. Networks 32(4): 275-281 (1998) - 1997
- [j56]Richard C. Brewster, Pavol Hell, Gary MacGillivray:
The complexity of restricted graph homomorphisms. Discret. Math. 167-168: 145-154 (1997) - [j55]Pavol Hell, Jing Huang:
Two remarks on circular arc graphs. Graphs Comb. 13(1): 65-72 (1997) - [c5]Luisa Gargano
, Pavol Hell, Stephane Perennes:
Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing. ICALP 1997: 505-515 - 1996
- [j54]Pavol Hell, David G. Kirkpatrick, Brenda Li:
Rounding in Symmetric Matrices and Undirected Graphs. Discret. Appl. Math. 70(1): 1-21 (1996) - [j53]Pavol Hell, Jaroslav Nesetril
, Xuding Zhu:
Complexity of Tree Homomorphisms. Discret. Appl. Math. 70(1): 23-36 (1996) - [j52]Xiaotie Deng
, Pavol Hell, Jing Huang:
Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs. SIAM J. Comput. 25(2): 390-403 (1996) - [j51]Binay K. Bhattacharya, Pavol Hell, Jing Huang:
A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs. SIAM J. Discret. Math. 9(2): 274-289 (1996) - 1995
- [j50]Michael R. Fellows
, Pavol Hell, Karen Seyffarth:
Large Planar Graphs with Given Diameter and Maximum Degree. Discret. Appl. Math. 61(2): 133-153 (1995) - [j49]Jørgen Bang-Jensen
, Pavol Hell, Gary MacGillivray:
Hereditarily hard H-colouring problems. Discret. Math. 138(1-3): 75-92 (1995) - [j48]Pierre Fraisse, Pavol Hell:
Equicovering matroids by distinct bases. Eur. J. Comb. 16(2): 159-162 (1995) - [j47]Gena Hahn, Pavol Hell, Svatopluk Poljak:
On the ultimate independence ratio of a graph. Eur. J. Comb. 16(3): 253-261 (1995) - [j46]Pavol Hell, Jing Huang:
Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs. J. Graph Theory 20(3): 361-374 (1995) - [j45]Pavol Hell, Huishan Zhou, Xuding Zhu:
On homomorphisms to acyclic local tournaments. J. Graph Theory 20(4): 467-471 (1995) - [j44]Pavol Hell, Xuding Zhu:
The Existence of Homomorphisms to Oriented Cycles. SIAM J. Discret. Math. 8(2): 208-222 (1995) - [c4]Evripidis Bampis, Pavol Hell, Yannis Manoussakis, Moshe Rosenfeld:
Finding an Antidirected Hamiltonian Path Starting with a Forward Arc from a Given Vertex of a Tournament. Combinatorics and Computer Science 1995: 67-73 - 1994
- [j43]Pavol Hell, Yannis Manoussakis, Zsolt Tuza:
Packing Problems in Edge-colored Graphs. Discret. Appl. Math. 52(3): 295-306 (1994) - [j42]Pavol Hell, Xingxing Yu, Huishan Zhou:
Independence ratios of graph powers. Discret. Math. 127(1-3): 213-220 (1994) - [j41]Jørgen Bang-Jensen
, Pavol Hell:
On chordal proper circular arc graphs. Discret. Math. 128(1-3): 395-398 (1994) - [j40]Pavol Hell, Xuding Zhu:
Homomorphisms to oriented paths. Discret. Math. 132(1-3): 107-114 (1994) - [j39]Pavol Hell, Huishan Zhou, Xuding Zhu:
Multiplicativity of Oriented Cycles. J. Comb. Theory B 60(2): 239-253 (1994) - 1993
- [j38]Pavol Hell, Huishan Zhou, Xuding Zhu:
Homomorphisms to oriented cycles. Comb. 13(4): 421-433 (1993) - [j37]Jørgen Bang-Jensen
, Pavol Hell:
Fast Algorithms for Finding Hamiltonian Paths and Cycles in In-Tournament Digraphs. Discret. Appl. Math. 41(1): 75-79 (1993) - [j36]Pavol Hell:
Biography of Martin Farber, 1951-1989. Discret. Appl. Math. 44(1-3): 5-7 (1993) - [j35]Hans-Jürgen Bandelt, Martin Farber, Pavol Hell:
Absolute Reflexive Retracts and Absolute Bipartite Retracts. Discret. Appl. Math. 44(1-3): 9-20 (1993) - [j34]Pavol Hell, Karen Seyffarth:
Largest planar graphs of diameter two and fixed maximum degree. Discret. Math. 111(1-3): 313-322 (1993) - [j33]Roland Häggkvist, Pavol Hell:
Universality of A-mote Graphs. Eur. J. Comb. 14(1): 23-27 (1993) - [j32]Pavol Hell, David G. Kirkpatrick:
Algorithms for Degree Constrained Graph Factors of Minimum Deficiency. J. Algorithms 14(1): 115-138 (1993) - [j31]Jean-Claude Bermond, Pavol Hell:
On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs. J. Graph Theory 17(5): 647-655 (1993) - [j30]Dominique de Werra, Pavol Hell, Tiko Kameda, Naoki Katoh, Ph. Solot, Masafumi Yamashita:
Graph endpoint coloring and distributed processing. Networks 23(2): 93-98 (1993) - 1992
- [j29]Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters:
Sparse broadcast graphs. Discret. Appl. Math. 36(2): 97-130 (1992) - [j28]Pavol Hell, Donald J. Miller:
Achromatic numbers and graph operations. Discret. Math. 108(1-3): 297-305 (1992) - [j27]Jørgen Bang-Jensen
, Pavol Hell, Gary MacGillivray:
On the complexity of colouring by superdigraphs of bipartite graphs. Discret. Math. 109(1-3): 27-44 (1992) - [j26]Pavol Hell, Jaroslav Nesetril
:
The core of a graph. Discret. Math. 109(1-3): 117-126 (1992) - [j25]Jean-Claude Bermond, Pavol Hell, Jean-Jacques Quisquater:
Construction of Large Packet Radio Networks. Parallel Process. Lett. 2: 3-12 (1992) - [j24]Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters:
Broadcasting in Bounded Degree Graphs. SIAM J. Discret. Math. 5(1): 10-24 (1992) - [c3]Xiaotie Deng, Pavol Hell, Jing Huang:
Recognition and Representation of Proper Circular Arc Graphs. IPCO 1992: 114-121 - 1991
- [j23]Pavol Hell, Jaroslav Nesetril
:
Images of Rigid Digraphs. Eur. J. Comb. 12(1): 33-42 (1991) - 1990
- [j22]Jørgen Bang-Jensen
, Pavol Hell:
The effect of two cycles on the complexity of colourings by directed graphs. Discret. Appl. Math. 26(1): 1-23 (1990) - [j21]Pavol Hell:
Preface. Discret. Appl. Math. 27(1-2): 1 (1990) - [j20]Katherine Heinrich, Pavol Hell, David G. Kirkpatrick, Guizhen Liu:
A simple existence criterion for (g<f)- factors. Discret. Math. 85(3): 313-317 (1990) - [j19]Pavol Hell, Jaroslav Nesetril
:
On the complexity of H-coloring. J. Comb. Theory B 48(1): 92-110 (1990) - [j18]J. Adrian Bondy, Pavol Hell:
A note on the star chromatic number. J. Graph Theory 14(4): 479-482 (1990) - [c2]Pavol Hell, Jørgen Bang-Jensen
, Jing Huang:
Local Tournaments and Proper Circular Arc Gaphs. SIGAL International Symposium on Algorithms 1990: 101-108
1980 – 1989
- 1988
- [j17]Roland Häggkvist, Pavol Hell, Donald J. Miller, Victor Neumann-Lara:
On multiplicative graphs and the product conjecture. Comb. 8(1): 63-74 (1988) - [j16]Pavol Hell, Arthur L. Liestman:
Broadcasting in one dimension. Discret. Appl. Math. 21(2): 101-111 (1988) - [j15]Jørgen Bang-Jensen
, Pavol Hell, Gary MacGillivray:
The Complexity of Colouring by Semicomplete Digraphs. SIAM J. Discret. Math. 1(3): 281-298 (1988) - [j14]Pavol Hell, David G. Kirkpatrick, Jan Kratochvíl, Igor Kríz:
On Restricted Two-Factors. SIAM J. Discret. Math. 1(4): 472-484 (1988) - 1987
- [j13]Katherine Heinrich, Pavol Hell:
On the problem of bandsize. Graphs Comb. 3(1): 279-284 (1987) - 1986
- [j12]Pierre Fraisse, Pavol Hell, David G. Kirkpatrick:
A note onf-factors in directed and undirected multigraphs. Graphs Comb. 2(1): 61-66 (1986) - [j11]Martin Farber, Gena Hahn, Pavol Hell, Donald J. Miller:
Concerning the achromatic number of graphs. J. Comb. Theory B 40(1): 21-39 (1986) - 1985
- [j10]Ronald L. Graham, Pavol Hell:
On the History of the Minimum Spanning Tree Problem. IEEE Ann. Hist. Comput. 7(1): 43-57 (1985) - 1984
- [j9]Pavol Hell, David G. Kirkpatrick:
Packings by cliques and by finite families of graphs. Discret. Math. 49(1): 45-59 (1984) - 1983
- [j8]J. Adrian Bondy, Pavol Hell:
Counterexamples to theorems of Menger type for the diameter. Discret. Math. 44(2): 217-220 (1983) - [j7]Pavol Hell, Moshe Rosenfeld:
The Complexity of Finding Generalized Paths in Tournaments. J. Algorithms 4(4): 303-309 (1983) - [j6]David G. Kirkpatrick, Pavol Hell:
On the Complexity of General Graph Factor Problems. SIAM J. Comput. 12(3): 601-609 (1983) - 1981
- [j5]Pavol Hell, David G. Kirkpatrick:
On Generalized Matching Problems. Inf. Process. Lett. 12(1): 33-35 (1981) - [j4]Roland Häggkvist, Pavol Hell:
Parallel Sorting with Constant Time for Comparisons. SIAM J. Comput. 10(3): 465-472 (1981)
1970 – 1979
- 1979
- [j3]Pavol Hell, Louis V. Quintas:
An intermediate value theorem for graphs with given automorphism group. J. Graph Theory 3(1): 35-41 (1979) - 1978
- [c1]David G. Kirkpatrick, Pavol Hell:
On the Completeness of a Generalized Matching Problem. STOC 1978: 240-245 - 1976
- [j2]Pavol Hell, Donald J. Miller:
Graph with given achromatic number. Discret. Math. 16(3): 195-207 (1976) - 1972
- [j1]Pavol Hell, Alexander Rosa:
Graph decompositions, handcuffed prisoners and balanced P-designs. Discret. Math. 2(3): 229-252 (1972)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint