| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Pavol Hell, Wilfried Imrich, Jaroslav Nesetril |
Preface.  |
Discrete Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Jing Huang, Arash Rafiey |
Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms.  |
Discrete Applied Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Shekoofeh Nekooei Rizi |
Partitioning Chordal Graphs.  |
Electronic Notes in Discrete Mathematics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marina Groshaus, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti |
Cycle transversals in bounded degree graphs.  |
Discrete Mathematics & Theoretical Computer Science  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, David G. Schell, Juraj Stacho |
Dichotomy for tree-structured trigraph list homomorphism problems.  |
Discrete Applied Mathematics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hovhannes A. Harutyunyan, Pavol Hell, Arthur L. Liestman |
Messy broadcasting - Decentralized broadcast schemes with limited knowledge.  |
Discrete Applied Mathematics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Arash Rafiey |
The Dichotomy of List Homomorphisms for Digraphs.  |
SODA  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Pavol Hell, Arash Rafiey |
The Dichotomy of List Homomorphisms for Digraphs  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, David G. Schell, Juraj Stacho |
Dichotomy for tree-structured trigraph list homomorphism problems  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Peter Jonsson, Andrei A. Krokhin, Gustav Nordh |
Retractions to Pseudoforests.  |
SIAM J. Discrete Math.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael D. Coury, Pavol Hell, Jan Kratochvíl, Tomás Vyskocil |
Faithful Representations of Graphs by Islands in the Extended Grid.  |
LATIN  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marina Groshaus, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti |
Cycle transversals in bounded degree graphs.  |
Electronic Notes in Discrete Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Jing Huang, Arash Rafiey |
Adjusted Interval Digraphs.  |
Electronic Notes in Discrete Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, David G. Kirkpatrick |
Linear-time certifying algorithms for near-graphical sequences.  |
Discrete Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Zhishi Pan, Tsai-Lien Wong, Xuding Zhu |
Adaptable chromatic number of graph products.  |
Discrete Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Arash Rafiey, Pavol Hell |
Duality for Min-Max Orderings and Dichotomy for Min Cost Homomorphisms  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Jing Huang |
Extension problems with degree bounds.  |
Discrete Applied Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell |
Generalizations of Interval Graphs.  |
CCCG  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Pavol Hell, Jaroslav Nesetril |
Colouring, constraint satisfaction, and complexity.  |
Computer Science Review  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard C. Brewster, Pavol Hell, Romeo Rizzi |
Oriented star packings.  |
J. Comb. Theory, Ser. B  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell |
On realizations of point determining graphs, and obstructions to full homomorphisms.  |
Discrete Mathematics  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregory Gutin, Pavol Hell, Arash Rafiey, Anders Yeo |
A dichotomy for minimum cost graph homomorphisms.  |
Eur. J. Comb.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Xuding Zhu |
On the adaptable chromatic number of graphs.  |
Eur. J. Comb.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Jing Huang |
Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms.  |
SIAM J. Discrete Math.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard C. Brewster, Tomás Feder, Pavol Hell, Jing Huang, Gary MacGillivray |
Near-Unanimity Functions and Varieties of Reflexive Graphs.  |
SIAM J. Discrete Math.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tinaz Ekim, Pavol Hell, Juraj Stacho, Dominique de Werra |
Polarity of chordal graphs.  |
Discrete Applied Mathematics  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey |
Minimum Cost Homomorphisms to Reflexive Digraphs.  |
LATIN  |
2008 |
DBLP DOI BibTeX RDF |
minimum cost homomorphism, reflexive digraph, NP-completeness, polynomial time algorithm, homomorphism, dichotomy |
| 1 | Pavol Hell, André Raspaud, Juraj Stacho |
On Injective Colourings of Chordal Graphs.  |
LATIN  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Wing Xie |
Matrix Partitions with Finitely Many Obstructions.  |
Electronic Notes in Discrete Mathematics  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Jing Huang |
The structure of bi-arc trees.  |
Discrete Mathematics  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Jing Huang |
List homomorphisms of graphs with bounded degrees.  |
Discrete Mathematics  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Wing Xie |
Matrix Partitions with Finitely Many Obstructions.  |
Electr. J. Comb.  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey |
Minimum Cost Homomorphisms to Reflexive Digraphs  |
CoRR  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell |
Matrix partitions of perfect graphs.  |
Discrete Mathematics  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregory Gutin, Pavol Hell, Arash Rafiey, Anders Yeo |
Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs  |
CoRR  |
2006 |
DBLP BibTeX RDF |
|
| 1 | David Hartvigsen, Pavol Hell, Jácint Szabó |
The k-piece packing problem.  |
Journal of Graph Theory  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Kim Tucker-Nally |
Digraph matrix partitions and trigraph homomorphisms.  |
Discrete Applied Mathematics  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Kathie Cameron, Pavol Hell |
Independent packings in structured graphs.  |
Math. Program.  |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 20E28, 20G40, 20C20 |
| 1 | Tomás Feder, Pavol Hell |
Full Constraint Satisfaction Problems.  |
SIAM J. Comput.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti |
List matrix partitions of chordal graphs.  |
Theor. Comput. Sci.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Jing Huang |
A generalization of the theorem of Lekkerkerker and Boland.  |
Discrete Mathematics  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti |
Packing r-Cliques in Weighted Chordal Graphs.  |
Annals OR  |
2005 |
DBLP DOI BibTeX RDF |
min-max theorems, linear programming duality, complementary slackness, greedy algorithms, chordal graphs |
| 1 | Tomás Feder, Pavol Hell, Daniel Král, Jiri Sgall |
Two algorithms for general list matrix partitions.  |
SODA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Luisa Gargano, Mikael Hammar, Pavol Hell, Ladislav Stacho, Ugo Vaccaro |
Spanning spiders and light-splitting switches.  |
Discrete Mathematics  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Juan José Montellano-Ballesteros |
Polychromatic cliques.  |
Discrete Mathematics  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Jing Huang |
Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs.  |
SIAM J. Discrete Math.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Jing Huang |
Interval bigraphs and circular arc graphs.  |
Journal of Graph Theory  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti |
Partitioning chordal graphs into independent sets and cliques.  |
Discrete Applied Mathematics  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti |
List Partitions of Chordal Graphs.  |
LATIN  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Francesc Comellas, Pavol Hell |
Broadcasting in generalized chordal rings.  |
Networks  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Bojan Mohar |
Acyclic Homomorphisms and Circular Colorings of Digraphs.  |
SIAM J. Discrete Math.  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani |
List Partitions.  |
SIAM J. Discrete Math.  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Richard C. Brewster, Pavol Hell |
Homomorphisms to powers of digraphs.  |
Discrete Mathematics  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Moshe Rosenfeld |
Antidirected hamiltonian paths between specified vertices of a tournament.  |
Discrete Applied Mathematics  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Luisa Gargano, Pavol Hell, Ladislav Stacho, Ugo Vaccaro |
Spanning Trees with Bounded Number of Branch Vertices.  |
ICALP  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Galluccio, Luis A. Goddyn, Pavol Hell |
High-Girth Graphs Avoiding a Minor are Nearly Bipartite.  |
J. Comb. Theory, Ser. B  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Sulamita Klein, Fábio Protti, Loana Tito Nogueira |
On generalized split graphs.  |
Electronic Notes in Discrete Mathematics  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Alexandr V. Kostochka, André Raspaud, Eric Sopena |
On nice graphs.  |
Discrete Mathematics  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Ron Shamir, Roded Sharan |
A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs.  |
SIAM J. Comput.  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell |
Graph Packings.  |
Electronic Notes in Discrete Mathematics  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard C. Brewster, Pavol Hell |
On homomorphisms to edge-coloured cycles.  |
Electronic Notes in Discrete Mathematics  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Galluccio, Pavol Hell, Jaroslav Nesetril |
The complexity of H-colouring of bounded degree graphs.  |
Discrete Mathematics  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Jing Huang |
List Homomorphisms and Circular Arc Graphs.  |
Combinatorica  |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05C85, 68R10, 05C15, 05C75 |
| 1 | Pavol Hell, Ron Shamir, Roded Sharan |
A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs.  |
ESA  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani |
Complexity of Graph Partition Problems.  |
STOC  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell |
List Homomorphisms to Reflexive Graphs.  |
J. Comb. Theory, Ser. B  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Pavol Hell, Karen Seyffarth |
Constructions of large planar networks with given degree and diameter.  |
Networks  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Beauquier, Pavol Hell, Stephane Perennes |
Optimal Wavelength-routed Multicasting.  |
Discrete Applied Mathematics  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Haddad, Pavol Hell, Eric Mendelsohn |
On the complexity of coloring areflexive h-ary relations with given permutation group.  |
Ars Comb.  |
1998 |
DBLP BibTeX RDF |
|
| 1 | Richard C. Brewster, Pavol Hell, Gary MacGillivray |
The complexity of restricted graph homomorphisms.  |
Discrete Mathematics  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Jing Huang |
Two remarks on circular arc graphs.  |
Graphs and Combinatorics  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Luisa Gargano, Pavol Hell, Stephane Perennes |
Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing.  |
ICALP  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Binay K. Bhattacharya, Pavol Hell, Jing Huang |
A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs.  |
SIAM J. Discrete Math.  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, David G. Kirkpatrick, Brenda Li |
Rounding in Symmetric Matrices and Undirected Graphs.  |
Discrete Applied Mathematics  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Jaroslav Nesetril, Xuding Zhu |
Complexity of Tree Homomorphisms.  |
Discrete Applied Mathematics  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaotie Deng, Pavol Hell, Jing Huang |
Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs.  |
SIAM J. Comput.  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray |
Hereditarily hard H-colouring problems.  |
Discrete Mathematics  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Xuding Zhu |
The Existence of Homomorphisms to Oriented Cycles.  |
SIAM J. Discrete Math.  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Pavol Hell, Karen Seyffarth |
Large Planar Graphs with Given Diameter and Maximum Degree.  |
Discrete Applied Mathematics  |
1995 |
DBLP DOI BibTeX RDF |
|
| 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.  |
Combinatorics and Computer Science  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Huishan Zhou, Xuding Zhu |
Multiplicativity of Oriented Cycles.  |
J. Comb. Theory, Ser. B  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Xingxing Yu, Huishan Zhou |
Independence ratios of graph powers.  |
Discrete Mathematics  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Pavol Hell |
On chordal proper circular arc graphs.  |
Discrete Mathematics  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Xuding Zhu |
Homomorphisms to oriented paths.  |
Discrete Mathematics  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Yannis Manoussakis, Zsolt Tuza |
Packing Problems in Edge-colored Graphs.  |
Discrete Applied Mathematics  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Karen Seyffarth |
Largest planar graphs of diameter two and fixed maximum degree.  |
Discrete Mathematics  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Roland Häggkvist, Pavol Hell |
Universality of A-mote Graphs.  |
Eur. J. Comb.  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, David G. Kirkpatrick |
Algorithms for Degree Constrained Graph Factors of Minimum Deficiency.  |
J. Algorithms  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Huishan Zhou, Xuding Zhu |
Homomorphisms to oriented cycles.  |
Combinatorica  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell |
Biography of Martin Farber, 1951-1989.  |
Discrete Applied Mathematics  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans-Jürgen Bandelt, Martin Farber, Pavol Hell |
Absolute Reflexive Retracts and Absolute Bipartite Retracts.  |
Discrete Applied Mathematics  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Pavol Hell |
Fast Algorithms for Finding Hamiltonian Paths and Cycles in In-Tournament Digraphs.  |
Discrete Applied Mathematics  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Jaroslav Nesetril |
The core of a graph.  |
Discrete Mathematics  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray |
On the complexity of colouring by superdigraphs of bipartite graphs.  |
Discrete Mathematics  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Donald J. Miller |
Achromatic numbers and graph operations.  |
Discrete Mathematics  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Claude Bermond, Pavol Hell, Jean-Jacques Quisquater |
Construction of Large Packet Radio Networks.  |
Parallel Processing Letters  |
1992 |
DBLP BibTeX RDF |
|
| 1 | Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters |
Broadcasting in Bounded Degree Graphs.  |
SIAM J. Discrete Math.  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters |
Sparse broadcast graphs.  |
Discrete Applied Mathematics  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaotie Deng, Pavol Hell, Jing Huang |
Recognition and Representation of Proper Circular Arc Graphs.  |
IPCO  |
1992 |
DBLP BibTeX RDF |
|
| 1 | Pavol Hell, Jaroslav Nesetril |
On the complexity of H-coloring.  |
J. Comb. Theory, Ser. B  |
1990 |
DBLP DOI BibTeX RDF |
|