| 2008 |
|---|
| 83 | EE | Arvind Gupta,
Pavol Hell,
Mehdi Karimi,
Arash Rafiey:
Minimum Cost Homomorphisms to Reflexive Digraphs.
LATIN 2008: 182-193 |
| 82 | EE | Pavol Hell,
André Raspaud,
Juraj Stacho:
On Injective Colourings of Chordal Graphs.
LATIN 2008: 520-530 |
| 81 | EE | Tomás Feder,
Pavol Hell:
On realizations of point determining graphs, and obstructions to full homomorphisms.
Discrete Mathematics 308(9): 1639-1652 (2008) |
| 80 | EE | Richard C. Brewster,
Pavol Hell,
Romeo Rizzi:
Oriented star packings.
J. Comb. Theory, Ser. B 98(3): 558-576 (2008) |
| 79 | EE | Tomás Feder,
Pavol Hell,
Jing Huang:
Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms.
SIAM J. Discrete Math. 22(1): 1-14 (2008) |
| 78 | EE | Richard C. Brewster,
Tomás Feder,
Pavol Hell,
Jing Huang,
Gary MacGillivray:
Near-Unanimity Functions and Varieties of Reflexive Graphs.
SIAM J. Discrete Math. 22(3): 938-960 (2008) |
| 2007 |
|---|
| 77 | EE | Arvind Gupta,
Pavol Hell,
Mehdi Karimi,
Arash Rafiey:
Minimum Cost Homomorphisms to Reflexive Digraphs
CoRR abs/0708.2514: (2007) |
| 76 | EE | Tomás Feder,
Pavol Hell,
Jing Huang:
List homomorphisms of graphs with bounded degrees.
Discrete Mathematics 307(3-5): 386-392 (2007) |
| 75 | EE | Tomás Feder,
Pavol Hell,
Jing Huang:
The structure of bi-arc trees.
Discrete Mathematics 307(3-5): 393-401 (2007) |
| 74 | EE | Tomás Feder,
Pavol Hell,
Wing Xie:
Matrix Partitions with Finitely Many Obstructions.
Electr. J. Comb. 14(1): (2007) |
| 2006 |
|---|
| 73 | EE | Gregory Gutin,
Pavol Hell,
Arash Rafiey,
Anders Yeo:
Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs
CoRR abs/cs/0602038: (2006) |
| 72 | EE | Tomás Feder,
Pavol Hell,
Kim Tucker-Nally:
Digraph matrix partitions and trigraph homomorphisms.
Discrete Applied Mathematics 154(17): 2458-2469 (2006) |
| 71 | EE | Tomás Feder,
Pavol Hell:
Matrix partitions of perfect graphs.
Discrete Mathematics 306(19-20): 2450-2460 (2006) |
| 70 | EE | David Hartvigsen,
Pavol Hell,
Jácint Szabó:
The k-piece packing problem.
Journal of Graph Theory 52(4): 267-293 (2006) |
| 69 | EE | Kathie Cameron,
Pavol Hell:
Independent packings in structured graphs.
Math. Program. 105(2-3): 201-213 (2006) |
| 68 | EE | Tomás Feder,
Pavol Hell:
Full Constraint Satisfaction Problems.
SIAM J. Comput. 36(1): 230-246 (2006) |
| 2005 |
|---|
| 67 | EE | Tomás Feder,
Pavol Hell,
Daniel Král,
Jiri Sgall:
Two algorithms for general list matrix partitions.
SODA 2005: 870-876 |
| 66 | EE | Pavol Hell,
Jing Huang:
A generalization of the theorem of Lekkerkerker and Boland.
Discrete Mathematics 299(1-3): 113-119 (2005) |
| 65 | EE | 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) |
| 2004 |
|---|
| 64 | EE | Tomás Feder,
Pavol Hell,
Sulamita Klein,
Loana Tito Nogueira,
Fábio Protti:
List Partitions of Chordal Graphs.
LATIN 2004: 100-108 |
| 63 | EE | Pavol Hell,
Sulamita Klein,
Loana Tito Nogueira,
Fábio Protti:
Partitioning chordal graphs into independent sets and cliques.
Discrete Applied Mathematics 141(1-3): 185-194 (2004) |
| 62 | EE | Pavol Hell,
Juan José Montellano-Ballesteros:
Polychromatic cliques.
Discrete Mathematics 285(1-3): 319-322 (2004) |
| 61 | EE | Luisa Gargano,
Mikael Hammar,
Pavol Hell,
Ladislav Stacho,
Ugo Vaccaro:
Spanning spiders and light-splitting switches.
Discrete Mathematics 285(1-3): 83-95 (2004) |
| 60 | EE | Pavol Hell,
Jing Huang:
Interval bigraphs and circular arc graphs.
Journal of Graph Theory 46(4): 313-327 (2004) |
| 59 | EE | Pavol Hell,
Jing Huang:
Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs.
SIAM J. Discrete Math. 18(3): 554-570 (2004) |
| 2003 |
|---|
| 58 | EE | Francesc Comellas,
Pavol Hell:
Broadcasting in generalized chordal rings.
Networks 42(3): 123-134 (2003) |
| 57 | EE | Tomás Feder,
Pavol Hell,
Sulamita Klein,
Rajeev Motwani:
List Partitions.
SIAM J. Discrete Math. 16(3): 449-478 (2003) |
| 56 | EE | Tomás Feder,
Pavol Hell,
Bojan Mohar:
Acyclic Homomorphisms and Circular Colorings of Digraphs.
SIAM J. Discrete Math. 17(1): 161-169 (2003) |
| 2002 |
|---|
| 55 | EE | Luisa Gargano,
Pavol Hell,
Ladislav Stacho,
Ugo Vaccaro:
Spanning Trees with Bounded Number of Branch Vertices.
ICALP 2002: 355-365 |
| 54 | | Pavol Hell,
Moshe Rosenfeld:
Antidirected hamiltonian paths between specified vertices of a tournament.
Discrete Applied Mathematics 117(1-3): 87-98 (2002) |
| 53 | EE | Richard C. Brewster,
Pavol Hell:
Homomorphisms to powers of digraphs.
Discrete Mathematics 244(1-3): 31-41 (2002) |
| 2001 |
|---|
| 52 | EE | Pavol Hell,
Alexandr V. Kostochka,
André Raspaud,
Eric Sopena:
On nice graphs.
Discrete Mathematics 234(1-3): 39-51 (2001) |
| 51 | EE | Anna Galluccio,
Luis A. Goddyn,
Pavol Hell:
High-Girth Graphs Avoiding a Minor are Nearly Bipartite.
J. Comb. Theory, Ser. B 83(1): 1-14 (2001) |
| 50 | EE | 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) |
| 2000 |
|---|
| 49 | EE | Anna Galluccio,
Pavol Hell,
Jaroslav Nesetril:
The complexity of H-colouring of bounded degree graphs.
Discrete Mathematics 222(1-3): 101-109 (2000) |
| 1999 |
|---|
| 48 | EE | Pavol Hell,
Ron Shamir,
Roded Sharan:
A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs.
ESA 1999: 527-539 |
| 47 | EE | Tomás Feder,
Pavol Hell,
Sulamita Klein,
Rajeev Motwani:
Complexity of Graph Partition Problems.
STOC 1999: 464-472 |
| 46 | EE | Tomás Feder,
Pavol Hell,
Jing Huang:
List Homomorphisms and Circular Arc Graphs.
Combinatorica 19(4): 487-505 (1999) |
| 1998 |
|---|
| 45 | | L. Haddad,
Pavol Hell,
Eric Mendelsohn:
On the complexity of coloring areflexive h-ary relations with given permutation group.
Ars Comb. 48: (1998) |
| 44 | EE | Bruno Beauquier,
Pavol Hell,
Stephane Perennes:
Optimal Wavelength-routed Multicasting.
Discrete Applied Mathematics 84(1-3): 15-20 (1998) |
| 43 | EE | Tomás Feder,
Pavol Hell:
List Homomorphisms to Reflexive Graphs.
J. Comb. Theory, Ser. B 72(2): 236-250 (1998) |
| 42 | EE | Michael R. Fellows,
Pavol Hell,
Karen Seyffarth:
Constructions of large planar networks with given degree and diameter.
Networks 32(4): 275-281 (1998) |
| 1997 |
|---|
| 41 | | Luisa Gargano,
Pavol Hell,
Stephane Perennes:
Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing.
ICALP 1997: 505-515 |
| 40 | EE | Richard C. Brewster,
Pavol Hell,
Gary MacGillivray:
The complexity of restricted graph homomorphisms.
Discrete Mathematics 167-168: 145-154 (1997) |
| 1996 |
|---|
| 39 | EE | Pavol Hell,
David G. Kirkpatrick,
Brenda Li:
Rounding in Symmetric Matrices and Undirected Graphs.
Discrete Applied Mathematics 70(1): 1-21 (1996) |
| 38 | EE | Pavol Hell,
Jaroslav Nesetril,
Xuding Zhu:
Complexity of Tree Homomorphisms.
Discrete Applied Mathematics 70(1): 23-36 (1996) |
| 37 | | 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) |
| 36 | EE | Binay K. Bhattacharya,
Pavol Hell,
Jing Huang:
A Linear Algorithm for Maximum Weight Cliques in ProperCircular Arc Graphs.
SIAM J. Discrete Math. 9(2): 274-289 (1996) |
| 1995 |
|---|
| 35 | | 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 |
| 34 | EE | Michael R. Fellows,
Pavol Hell,
Karen Seyffarth:
Large Planar Graphs with Given Diameter and Maximum Degree.
Discrete Applied Mathematics 61(2): 133-153 (1995) |
| 33 | EE | Jørgen Bang-Jensen,
Pavol Hell,
Gary MacGillivray:
Hereditarily hard H-colouring problems.
Discrete Mathematics 138(1-3): 75-92 (1995) |
| 32 | EE | Pavol Hell,
Xuding Zhu:
The Existence of Homomorphisms to Oriented Cycles.
SIAM J. Discrete Math. 8(2): 208-222 (1995) |
| 1994 |
|---|
| 31 | EE | Pavol Hell,
Yannis Manoussakis,
Zsolt Tuza:
Packing Problems in Edge-colored Graphs.
Discrete Applied Mathematics 52(3): 295-306 (1994) |
| 30 | EE | Pavol Hell,
Xingxing Yu,
Huishan Zhou:
Independence ratios of graph powers.
Discrete Mathematics 127(1-3): 213-220 (1994) |
| 29 | EE | Jørgen Bang-Jensen,
Pavol Hell:
On chordal proper circular arc graphs.
Discrete Mathematics 128(1-3): 395-398 (1994) |
| 28 | EE | Pavol Hell,
Xuding Zhu:
Homomorphisms to oriented paths.
Discrete Mathematics 132(1-3): 107-114 (1994) |
| 27 | EE | Pavol Hell,
Huishan Zhou,
Xuding Zhu:
Multiplicativity of Oriented Cycles.
J. Comb. Theory, Ser. B 60(2): 239-253 (1994) |
| 1993 |
|---|
| 26 | | Pavol Hell,
Huishan Zhou,
Xuding Zhu:
Homomorphisms to oriented cycles.
Combinatorica 13(4): 421-433 (1993) |
| 25 | EE | Jørgen Bang-Jensen,
Pavol Hell:
Fast Algorithms for Finding Hamiltonian Paths and Cycles in In-Tournament Digraphs.
Discrete Applied Mathematics 41(1): 75-79 (1993) |
| 24 | EE | Pavol Hell:
Biography of Martin Farber, 1951-1989.
Discrete Applied Mathematics 44(1-3): 5-7 (1993) |
| 23 | EE | Hans-Jürgen Bandelt,
Martin Farber,
Pavol Hell:
Absolute Reflexive Retracts and Absolute Bipartite Retracts.
Discrete Applied Mathematics 44(1-3): 9-20 (1993) |
| 22 | EE | Pavol Hell,
Karen Seyffarth:
Largest planar graphs of diameter two and fixed maximum degree.
Discrete Mathematics 111(1-3): 313-322 (1993) |
| 21 | EE | Roland Häggkvist,
Pavol Hell:
Universality of A-mote Graphs.
Eur. J. Comb. 14(1): 23-27 (1993) |
| 20 | | Pavol Hell,
David G. Kirkpatrick:
Algorithms for Degree Constrained Graph Factors of Minimum Deficiency.
J. Algorithms 14(1): 115-138 (1993) |
| 1992 |
|---|
| 19 | | Xiaotie Deng,
Pavol Hell,
Jing Huang:
Recognition and Representation of Proper Circular Arc Graphs.
IPCO 1992: 114-121 |
| 18 | EE | Pavol Hell,
Donald J. Miller:
Achromatic numbers and graph operations.
Discrete Mathematics 108(1-3): 297-305 (1992) |
| 17 | EE | Pavol Hell,
Jaroslav Nesetril:
The core of a graph.
Discrete Mathematics 109(1-3): 117-126 (1992) |
| 16 | EE | Jørgen Bang-Jensen,
Pavol Hell,
Gary MacGillivray:
On the complexity of colouring by superdigraphs of bipartite graphs.
Discrete Mathematics 109(1-3): 27-44 (1992) |
| 15 | | Jean-Claude Bermond,
Pavol Hell,
Jean-Jacques Quisquater:
Construction of Large Packet Radio Networks.
Parallel Processing Letters 2: 3-12 (1992) |
| 14 | | Jean-Claude Bermond,
Pavol Hell,
Arthur L. Liestman,
Joseph G. Peters:
Broadcasting in Bounded Degree Graphs.
SIAM J. Discrete Math. 5(1): 10-24 (1992) |
| 1990 |
|---|
| 13 | | Pavol Hell,
Jørgen Bang-Jensen,
Jing Huang:
Local Tournaments and Proper Circular Arc Gaphs.
SIGAL International Symposium on Algorithms 1990: 101-108 |
| 12 | EE | Katherine Heinrich,
Pavol Hell,
David G. Kirkpatrick,
Guizhen Liu:
A simple existence criterion for (g<f)- factors.
Discrete Mathematics 85(3): 313-317 (1990) |
| 11 | EE | Pavol Hell,
Jaroslav Nesetril:
On the complexity of H-coloring.
J. Comb. Theory, Ser. B 48(1): 92-110 (1990) |
| 1988 |
|---|
| 10 | | Roland Häggkvist,
Pavol Hell,
Donald J. Miller,
Victor Neumann-Lara:
On multiplicative graphs and the product conjecture.
Combinatorica 8(1): 63-74 (1988) |
| 9 | | Jørgen Bang-Jensen,
Pavol Hell,
Gary MacGillivray:
The Complexity of Colouring by Semicomplete Digraphs.
SIAM J. Discrete Math. 1(3): 281-298 (1988) |
| 8 | | Pavol Hell,
David G. Kirkpatrick,
Jan Kratochvíl,
Igor Kríz:
On Restricted Two-Factors.
SIAM J. Discrete Math. 1(4): 472-484 (1988) |
| 1986 |
|---|
| 7 | EE | Martin Farber,
Gena Hahn,
Pavol Hell,
Donald Miller:
Concerning the achromatic number of graphs.
J. Comb. Theory, Ser. B 40(1): 21-39 (1986) |
| 1984 |
|---|
| 6 | EE | Pavol Hell,
David G. Kirkpatrick:
Packings by cliques and by finite families of graphs.
Discrete Mathematics 49(1): 45-59 (1984) |
| 1983 |
|---|
| 5 | | Pavol Hell,
Moshe Rosenfeld:
The Complexity of Finding Generalized Paths in Tournaments.
J. Algorithms 4(4): 303-309 (1983) |
| 4 | | David G. Kirkpatrick,
Pavol Hell:
On the Complexity of General Graph Factor Problems.
SIAM J. Comput. 12(3): 601-609 (1983) |
| 1981 |
|---|
| 3 | | Pavol Hell,
David G. Kirkpatrick:
On Generalized Matching Problems.
Inf. Process. Lett. 12(1): 33-35 (1981) |
| 2 | | Roland Häggkvist,
Pavol Hell:
Parallel Sorting with Constant Time for Comparisons.
SIAM J. Comput. 10(3): 465-472 (1981) |
| 1978 |
|---|
| 1 | | David G. Kirkpatrick,
Pavol Hell:
On the Completeness of a Generalized Matching Problem
STOC 1978: 240-245 |
