Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Pavol Hell
2010 – today
- 2013
[c18]Pavol Hell, Aurosish Mishra: Small H-Coloring Problems for Bounded Degree Digraphs. COCOON 2013: 579-590- 2012
- [j110]Tomás Feder, Pavol Hell, Jing Huang, Arash Rafiey: Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms. Discrete Applied Mathematics 160(6): 697-707 (2012)
- [j109]Marina Groshaus, Pavol Hell, Juraj Stacho: On edge-sets of bicliques in graphs. Discrete Applied Mathematics 160(18): 2698-2708 (2012)
- [j108]
- [j107]Pavol Hell, Arash Rafiey: Monotone Proper Interval Digraphs and Min-Max Orderings. SIAM J. Discrete Math. 26(4): 1576-1596 (2012)
- [j106]Pavol Hell, Arash Rafiey: The Dichotomy of Minimum Cost Homomorphism Problems for Digraphs. SIAM J. Discrete Math. 26(4): 1597-1608 (2012)
- [c17]Pavol Hell, Monaldo Mastrolilli, Mayssam Mohammadi Nevisi, Arash Rafiey: Approximation of Minimum Cost Homomorphisms. ESA 2012: 587-598
- [c16]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
- [j105]Hovhannes A. Harutyunyan, Pavol Hell, Arthur L. Liestman: Messy broadcasting - Decentralized broadcast schemes with limited knowledge. Discrete Applied Mathematics 159(5): 322-327 (2011)
- [j104]Tomás Feder, Pavol Hell, David G. Schell, Juraj Stacho: Dichotomy for tree-structured trigraph list homomorphism problems. Discrete Applied Mathematics 159(12): 1217-1224 (2011)
- [j103]Marina Groshaus, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti: Cycle transversals in bounded degree graphs. Discrete Mathematics & Theoretical Computer Science 13(1): 45-66 (2011)
- [j102]Tomás Feder, Pavol Hell, Shekoofeh Nekooei Rizi: Partitioning Chordal Graphs. Electronic Notes in Discrete Mathematics 38: 325-330 (2011)
- [c15]
- 2010
- [j101]Tomás Feder, Pavol Hell, Peter Jonsson, Andrei A. Krokhin, Gustav Nordh: Retractions to Pseudoforests. SIAM J. Discrete Math. 24(1): 101-112 (2010)
- [c14]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
- [j100]Tomás Feder, Pavol Hell, Jing Huang: Extension problems with degree bounds. Discrete Applied Mathematics 157(7): 1592-1599 (2009)
- [j99]Pavol Hell, David G. Kirkpatrick: Linear-time certifying algorithms for near-graphical sequences. Discrete Mathematics 309(18): 5703-5713 (2009)
- [j98]Pavol Hell, Zhishi Pan, Tsai-Lien Wong, Xuding Zhu: Adaptable chromatic number of graph products. Discrete Mathematics 309(21): 6153-6159 (2009)
- [j97]Tomás Feder, Pavol Hell, Jing Huang, Arash Rafiey: Adjusted Interval Digraphs. Electronic Notes in Discrete Mathematics 32: 83-91 (2009)
- [j96]Marina Groshaus, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti: Cycle transversals in bounded degree graphs. Electronic Notes in Discrete Mathematics 35: 189-195 (2009)
- [c13]
- [i3]Arash Rafiey, Pavol Hell: Duality for Min-Max Orderings and Dichotomy for Min Cost Homomorphisms. CoRR abs/0907.3016 (2009)
- 2008
- [j95]Pavol Hell, Jaroslav Nesetril: Colouring, constraint satisfaction, and complexity. Computer Science Review 2(3): 143-163 (2008)
- [j94]Tinaz Ekim, Pavol Hell, Juraj Stacho, Dominique de Werra: Polarity of chordal graphs. Discrete Applied Mathematics 156(13): 2469-2479 (2008)
- [j93]Tomás Feder, Pavol Hell: On realizations of point determining graphs, and obstructions to full homomorphisms. Discrete Mathematics 308(9): 1639-1652 (2008)
- [j92]Gregory Gutin, Pavol Hell, Arash Rafiey, Anders Yeo: A dichotomy for minimum cost graph homomorphisms. Eur. J. Comb. 29(4): 900-911 (2008)
- [j91]Pavol Hell, Xuding Zhu: On the adaptable chromatic number of graphs. Eur. J. Comb. 29(4): 912-921 (2008)
- [j90]Richard C. Brewster, Pavol Hell, Romeo Rizzi: Oriented star packings. J. Comb. Theory, Ser. B 98(3): 558-576 (2008)
- [j89]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)
- [j88]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)
- [c12]Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey: Minimum Cost Homomorphisms to Reflexive Digraphs. LATIN 2008: 182-193
- [c11]Pavol Hell, André Raspaud, Juraj Stacho: On Injective Colourings of Chordal Graphs. LATIN 2008: 520-530
- 2007
- [j87]Tomás Feder, Pavol Hell, Wing Xie: Matrix Partitions with Finitely Many Obstructions. Electr. J. Comb. 14(1) (2007)
- [j86]Tomás Feder, Pavol Hell, Jing Huang: List homomorphisms of graphs with bounded degrees. Discrete Mathematics 307(3-5): 386-392 (2007)
- [j85]Tomás Feder, Pavol Hell, Jing Huang: The structure of bi-arc trees. Discrete Mathematics 307(3-5): 393-401 (2007)
- [j84]Tomás Feder, Pavol Hell, Wing Xie: Matrix Partitions with Finitely Many Obstructions. Electronic Notes in Discrete Mathematics 28: 371-378 (2007)
- [i2]Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey: Minimum Cost Homomorphisms to Reflexive Digraphs. CoRR abs/0708.2514 (2007)
- 2006
- [j83]Tomás Feder, Pavol Hell, Kim Tucker-Nally: Digraph matrix partitions and trigraph homomorphisms. Discrete Applied Mathematics 154(17): 2458-2469 (2006)
- [j82]Tomás Feder, Pavol Hell: Matrix partitions of perfect graphs. Discrete Mathematics 306(19-20): 2450-2460 (2006)
- [j81]David Hartvigsen, Pavol Hell, Jácint Szabó: The k-piece packing problem. Journal of Graph Theory 52(4): 267-293 (2006)
- [j80]Kathie Cameron, Pavol Hell: Independent packings in structured graphs. Math. Program. 105(2-3): 201-213 (2006)
- [j79]Tomás Feder, Pavol Hell: Full Constraint Satisfaction Problems. SIAM J. Comput. 36(1): 230-246 (2006)
- [i1]Gregory Gutin, Pavol Hell, Arash Rafiey, Anders Yeo: Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs. CoRR abs/cs/0602038 (2006)
- 2005
- [j78]Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti: Packing r-Cliques in Weighted Chordal Graphs. Annals OR 138(1): 179-187 (2005)
- [j77]Pavol Hell, Jing Huang: A generalization of the theorem of Lekkerkerker and Boland. Discrete Mathematics 299(1-3): 113-119 (2005)
- [j76]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)
- [c10]Tomás Feder, Pavol Hell, Daniel Král, Jiri Sgall: Two algorithms for general list matrix partitions. SODA 2005: 870-876
- 2004
- [j75]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)
- [j74]Luisa Gargano, Mikael Hammar, Pavol Hell, Ladislav Stacho, Ugo Vaccaro: Spanning spiders and light-splitting switches. Discrete Mathematics 285(1-3): 83-95 (2004)
- [j73]Pavol Hell, Juan José Montellano-Ballesteros: Polychromatic cliques. Discrete Mathematics 285(1-3): 319-322 (2004)
- [j72]Pavol Hell, Jing Huang: Interval bigraphs and circular arc graphs. Journal of Graph Theory 46(4): 313-327 (2004)
- [j71]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)
- [c9]Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti: List Partitions of Chordal Graphs. LATIN 2004: 100-108
- 2003
- [j70]Tomás Feder, Pavol Hell, Jing Huang: Bi-arc graphs and the complexity of list homomorphisms. Journal of Graph Theory 42(1): 61-80 (2003)
- [j69]Richard C. Brewster, Pavol Hell, Sarah H. Pantel, Romeo Rizzi, Anders Yeo: Packing paths in digraphs. Journal of Graph Theory 44(2): 81-94 (2003)
- [j68]Francesc Comellas, Pavol Hell: Broadcasting in generalized chordal rings. Networks 42(3): 123-134 (2003)
- [j67]Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani: List Partitions. SIAM J. Discrete Math. 16(3): 449-478 (2003)
- [j66]Tomás Feder, Pavol Hell, Bojan Mohar: Acyclic Homomorphisms and Circular Colorings of Digraphs. SIAM J. Discrete Math. 17(1): 161-169 (2003)
- 2002
- [j65]Pavol Hell, Moshe Rosenfeld: Antidirected hamiltonian paths between specified vertices of a tournament. Discrete Applied Mathematics 117(1-3): 87-98 (2002)
- [j64]Richard C. Brewster, Pavol Hell: Homomorphisms to powers of digraphs. Discrete Mathematics 244(1-3): 31-41 (2002)
- [c8]Luisa Gargano, Pavol Hell, Ladislav Stacho, Ugo Vaccaro: Spanning Trees with Bounded Number of Branch Vertices. ICALP 2002: 355-365
- 2001
- [j63]Pavol Hell, Alexandr V. Kostochka, André Raspaud, Eric Sopena: On nice graphs. Discrete Mathematics 234(1-3): 39-51 (2001)
- [j62]Pavol Hell, Sulamita Klein, Fábio Protti, Loana Tito Nogueira: On generalized split graphs. Electronic Notes in Discrete Mathematics 7: 98-101 (2001)
- [j61]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)
- [j60]Luisa Gargano, Pavol Hell, Stephane Perennes: Coloring all directed paths in a symmetric tree, with an application to optical networks. Journal of Graph Theory 38(4): 183-196 (2001)
- [j59]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
- [j58]Anna Galluccio, Pavol Hell, Jaroslav Nesetril: The complexity of H-colouring of bounded degree graphs. Discrete Mathematics 222(1-3): 101-109 (2000)
- [j57]Richard C. Brewster, Pavol Hell: On homomorphisms to edge-coloured cycles. Electronic Notes in Discrete Mathematics 5: 46-49 (2000)
- [j56]
- [j55]Pavol Hell, Xuding Zhu: The circular chromatic number of series-parallel graphs. Journal of Graph Theory 33(1): 14-24 (2000)
1990 – 1999
- 1999
- [j54]Tomás Feder, Pavol Hell, Jing Huang: List Homomorphisms and Circular Arc Graphs. Combinatorica 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
- [j53]L. Haddad, Pavol Hell, Eric Mendelsohn: On the complexity of coloring areflexive h-ary relations with given permutation group. Ars Comb. 48 (1998)
- [j52]Bruno Beauquier, Pavol Hell, Stephane Perennes: Optimal Wavelength-routed Multicasting. Discrete Applied Mathematics 84(1-3): 15-20 (1998)
- [j51]Tomás Feder, Pavol Hell: List Homomorphisms to Reflexive Graphs. J. Comb. Theory, Ser. B 72(2): 236-250 (1998)
- [j50]Michael R. Fellows, Pavol Hell, Karen Seyffarth: Constructions of large planar networks with given degree and diameter. Networks 32(4): 275-281 (1998)
- 1997
- [j49]Richard C. Brewster, Pavol Hell, Gary MacGillivray: The complexity of restricted graph homomorphisms. Discrete Mathematics 167-168: 145-154 (1997)
- [j48]Pavol Hell, Jing Huang: Two remarks on circular arc graphs. Graphs and Combinatorics 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
- [j47]Pavol Hell, David G. Kirkpatrick, Brenda Li: Rounding in Symmetric Matrices and Undirected Graphs. Discrete Applied Mathematics 70(1): 1-21 (1996)
- [j46]Pavol Hell, Jaroslav Nesetril, Xuding Zhu: Complexity of Tree Homomorphisms. Discrete Applied Mathematics 70(1): 23-36 (1996)
- [j45]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)
- [j44]Binay K. Bhattacharya, Pavol Hell, Jing Huang: A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs. SIAM J. Discrete Math. 9(2): 274-289 (1996)
- 1995
- [j43]Michael R. Fellows, Pavol Hell, Karen Seyffarth: Large Planar Graphs with Given Diameter and Maximum Degree. Discrete Applied Mathematics 61(2): 133-153 (1995)
- [j42]Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray: Hereditarily hard H-colouring problems. Discrete Mathematics 138(1-3): 75-92 (1995)
- [j41]Pavol Hell, Jing Huang: Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs. Journal of Graph Theory 20(3): 361-374 (1995)
- [j40]Pavol Hell, Huishan Zhou, Xuding Zhu: On homomorphisms to acyclic local tournaments. Journal of Graph Theory 20(4): 467-471 (1995)
- [j39]Pavol Hell, Xuding Zhu: The Existence of Homomorphisms to Oriented Cycles. SIAM J. Discrete 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
- [j38]Pavol Hell, Yannis Manoussakis, Zsolt Tuza: Packing Problems in Edge-colored Graphs. Discrete Applied Mathematics 52(3): 295-306 (1994)
- [j37]Pavol Hell, Xingxing Yu, Huishan Zhou: Independence ratios of graph powers. Discrete Mathematics 127(1-3): 213-220 (1994)
- [j36]Jørgen Bang-Jensen, Pavol Hell: On chordal proper circular arc graphs. Discrete Mathematics 128(1-3): 395-398 (1994)
- [j35]Pavol Hell, Xuding Zhu: Homomorphisms to oriented paths. Discrete Mathematics 132(1-3): 107-114 (1994)
- [j34]Pavol Hell, Huishan Zhou, Xuding Zhu: Multiplicativity of Oriented Cycles. J. Comb. Theory, Ser. B 60(2): 239-253 (1994)
- 1993
- [j33]Pavol Hell, Huishan Zhou, Xuding Zhu: Homomorphisms to oriented cycles. Combinatorica 13(4): 421-433 (1993)
- [j32]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)
- [j31]
- [j30]Hans-Jürgen Bandelt, Martin Farber, Pavol Hell: Absolute Reflexive Retracts and Absolute Bipartite Retracts. Discrete Applied Mathematics 44(1-3): 9-20 (1993)
- [j29]Pavol Hell, Karen Seyffarth: Largest planar graphs of diameter two and fixed maximum degree. Discrete Mathematics 111(1-3): 313-322 (1993)
- [j28]
- [j27]Pavol Hell, David G. Kirkpatrick: Algorithms for Degree Constrained Graph Factors of Minimum Deficiency. J. Algorithms 14(1): 115-138 (1993)
- [j26]Jean-Claude Bermond, Pavol Hell: On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs. Journal of Graph Theory 17(5): 647-655 (1993)
- [j25]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
- [j24]Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters: Sparse broadcast graphs. Discrete Applied Mathematics 36(2): 97-130 (1992)
- [j23]Pavol Hell, Donald J. Miller: Achromatic numbers and graph operations. Discrete Mathematics 108(1-3): 297-305 (1992)
- [j22]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)
- [j21]
- [j20]Jean-Claude Bermond, Pavol Hell, Jean-Jacques Quisquater: Construction of Large Packet Radio Networks. Parallel Processing Letters 2: 3-12 (1992)
- [j19]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)
- [c3]Xiaotie Deng, Pavol Hell, Jing Huang: Recognition and Representation of Proper Circular Arc Graphs. IPCO 1992: 114-121
- 1990
- [j18]Jørgen Bang-Jensen, Pavol Hell: The effect of two cycles on the complexity of colourings by directed graphs. Discrete Applied Mathematics 26(1): 1-23 (1990)
- [j17]
- [j16]Katherine Heinrich, Pavol Hell, David G. Kirkpatrick, Guizhen Liu: A simple existence criterion for (g<f)- factors. Discrete Mathematics 85(3): 313-317 (1990)
- [j15]Pavol Hell, Jaroslav Nesetril: On the complexity of H-coloring. J. Comb. Theory, Ser. B 48(1): 92-110 (1990)
- [j14]J. A. Bondy, Pavol Hell: A note on the star chromatic number. Journal of 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
- [j13]Roland Häggkvist, Pavol Hell, Donald J. Miller, Victor Neumann-Lara: On multiplicative graphs and the product conjecture. Combinatorica 8(1): 63-74 (1988)
- [j12]Pavol Hell, Arthur L. Liestman: Broadcasting in one dimension. Discrete Applied Mathematics 21(2): 101-111 (1988)
- [j11]Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray: The Complexity of Colouring by Semicomplete Digraphs. SIAM J. Discrete Math. 1(3): 281-298 (1988)
- [j10]Pavol Hell, David G. Kirkpatrick, Jan Kratochvíl, Igor Kríz: On Restricted Two-Factors. SIAM J. Discrete Math. 1(4): 472-484 (1988)
- 1987
- [j9]Katherine Heinrich, Pavol Hell: On the problem of bandsize. Graphs and Combinatorics 3(1): 279-284 (1987)
- 1986
- [j8]Pierre Fraisse, Pavol Hell, David G. Kirkpatrick: A note onf-factors in directed and undirected multigraphs. Graphs and Combinatorics 2(1): 61-66 (1986)
- [j7]Martin Farber, Gena Hahn, Pavol Hell, Donald J. Miller: Concerning the achromatic number of graphs. J. Comb. Theory, Ser. B 40(1): 21-39 (1986)
- 1984
- [j6]Pavol Hell, David G. Kirkpatrick: Packings by cliques and by finite families of graphs. Discrete Mathematics 49(1): 45-59 (1984)
- 1983
- [j5]J. A. Bondy, Pavol Hell: Counterexamples to theorems of Menger type for the diameter. Discrete Mathematics 44(2): 217-220 (1983)
- [j4]Pavol Hell, Moshe Rosenfeld: The Complexity of Finding Generalized Paths in Tournaments. J. Algorithms 4(4): 303-309 (1983)
- [j3]David G. Kirkpatrick, Pavol Hell: On the Complexity of General Graph Factor Problems. SIAM J. Comput. 12(3): 601-609 (1983)
- 1981
- [j2]Pavol Hell, David G. Kirkpatrick: On Generalized Matching Problems. Inf. Process. Lett. 12(1): 33-35 (1981)
- [j1]Roland Häggkvist, Pavol Hell: Parallel Sorting with Constant Time for Comparisons. SIAM J. Comput. 10(3): 465-472 (1981)
1970 – 1979
- 1978
- [c1]David G. Kirkpatrick, Pavol Hell: On the Completeness of a Generalized Matching Problem. STOC 1978: 240-245
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-23 22:18 CEST by the dblp team