The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Pavol Hell: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  77. Generalizations of Interval Graphs. [Citation Graph (, )][DBLP]


  78. On Injective Colourings of Chordal Graphs. [Citation Graph (, )][DBLP]


  79. Minimum Cost Homomorphisms to Reflexive Digraphs. [Citation Graph (, )][DBLP]


  80. Faithful Representations of Graphs by Islands in the Extended Grid. [Citation Graph (, )][DBLP]


  81. Matrix Partitions with Finitely Many Obstructions. [Citation Graph (, )][DBLP]


  82. Duality for Min-Max Orderings and Dichotomy for Min Cost Homomorphisms [Citation Graph (, )][DBLP]


  83. The Dichotomy of List Homomorphisms for Digraphs [Citation Graph (, )][DBLP]


  84. Polarity of chordal graphs. [Citation Graph (, )][DBLP]


  85. Sparse broadcast graphs. [Citation Graph (, )][DBLP]


  86. Broadcasting in one dimension. [Citation Graph (, )][DBLP]


  87. The effect of two cycles on the complexity of colourings by directed graphs. [Citation Graph (, )][DBLP]


  88. Preface. [Citation Graph (, )][DBLP]


  89. Extension problems with degree bounds. [Citation Graph (, )][DBLP]


  90. On realizations of point determining graphs, and obstructions to full homomorphisms. [Citation Graph (, )][DBLP]


  91. Linear-time certifying algorithms for near-graphical sequences. [Citation Graph (, )][DBLP]


  92. Adaptable chromatic number of graph products. [Citation Graph (, )][DBLP]


  93. On the adaptable chromatic number of graphs. [Citation Graph (, )][DBLP]


  94. A dichotomy for minimum cost graph homomorphisms. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.611secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002