P. Hell

发表

Sorting and Merging in Rounds

R. Häggkvist, P. Hell, 1982 .

On the complexity of H-coloring

Jaroslav Nesetril, Pavol Hell, J. Nesetril, 1990, J. Comb. Theory, Ser. B.

Absolute planar retracts and the four color conjecture

P. Hell, 1974 .

Cohomomorphisms of graphs and hypergraphs

J. Nesetril, P. Hell, 1979 .

Some results on the Oberwolfach problem

P. Hell, A. Kotzig, A. Rosa, 1974 .

Some results on the Oberwolfach problem

P. Hell, A. Kotzig, A. Rosa, 1974 .

Duality and Polynomial Testing of Tree Homomorphisms

Xuding Zhu, J. Nesetril, P. Hell, 1996 .

Graph Problems Arising from Wavelength-Routing in All-Optical Networks

P. Hell, J. Bermond, B. Beauquier, 2004 .

Parallel Sorting with Constant Time for Comparisons

Pavol Hell, Roland Häggkvist, R. Häggkvist, 1981, SIAM J. Comput..

Sparse pseudo-random graphs are Hamiltonian

P. Hell, T. Feder, Jing Huang, 2003 .

Generalized Colourings (Matrix Partitions) of Cographs

P. Hell, T. Feder, W. Hochstättler, 2006 .

THE PARTIAL ORDER OF GRAPHS AND HOMOMORPHISMS

J. Nesetril, P. Hell, 2004 .

A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs

Roded Sharan, Ron Shamir, Pavol Hell, 2001, SIAM J. Comput..

A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs

Roded Sharan, Ron Shamir, Pavol Hell, 1999, SIAM J. Comput..

Packings by complete bipartite graphs

Pavol Hell, P. Hell, D. Kirkpatrick, 1986 .

Homomorphisms of graphs and of their orientations

J. Nesetril, P. Hell, 1978 .

GRAPHS WITH FORBIDDEN HOMOMORPHIC IMAGES

P. Hell, Donald J. Miller, 1979 .

Algorithmic aspects of graph homomorphisms Pavol Hell

P. Hell, 2008 .

Absolute Retracts and Varieties of Reflexive Graphs

P. Hell, I. Rival, 1987, Canadian Journal of Mathematics.

Computational complexity of graph compaction

P. Hell, N. Vikas, 1997 .

Counting List Homomorphisms and Graphs with Bounded Degrees

Jaroslav Nesetril, Pavol Hell, J. Nesetril, 2001, Graphs, Morphisms and Statistical Physics.

From Graph Colouring to Constraint Satisfaction: There and Back Again

P. Hell, 2006 .

Adjusted Interval Digraphs and Complexity of List Homomorphisms Tomás Feder Pavol Hell Jing Huang Arash Rafiey

P. Hell, T. Feder, Jing Huang, 2010 .

Interval bigraphs and circular arc graphs

P. Hell, Jing Huang, 2004 .

The Existence Problem for Graph Homomorphisms

Pavol Hell, Jaroslav Nešetřil, J. Nesetril, 1988 .

Full embeddings into some categories of graphs

Pavol Hell, P. Hell, 1972 .

Analogues of the Shannon Capacity of a Graph

Fred S. Roberts, Pavol Hell, P. Hell, 1982 .

Comparability and Cocomparability Bigraphs

Jephian C.-H. Lin, P. Hell, Jing Huang, 2019, 1902.00213.

Adjusted Interval Digraphs Tomás Feder Pavol Hell

P. Hell, T. Feder, Jing Huang, 2008 .

A generalization ofthe theorem ofLekkerkerker and Boland

P. Hell, Jing Huang, 2005 .

All Minimal Cograph Obstructions for Arboricity 2

Seyyed, Sebastián González Hermosillo de la Maza, P. Hell, 2019 .

(g,f) - Factors \& Packings, When g>f: Characterizations \& Algorithms

David G. Kirkpatrick, Pavol Hell, P. Hell, 1983 .

Every finite graph is a full subgraph of a rigid graph

Vasek Chvátal, Jaroslav Nešetřil, V. Chvátal, 1971 .

THE STRUCTURE OF COMPOSITION

J. Nesetril, P. Hell, 2004 .

Recognition and Representation of Proper Circular Arc Graphs

Xiaotie Deng, Pavol Hell, Jing Huang, 1992, IPCO.

Packings by cliques and by finite families of graphs

David G. Kirkpatrick, Pavol Hell, P. Hell, 1984, Discret. Math..

Factors and Flows

David G. Kirkpatrick, Pavol Hell, P. Hell, 1986 .

On Generalized Matching Problems

David G. Kirkpatrick, Pavol Hell, P. Hell, 1981, Inf. Process. Lett..

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms: Preface

Moshe Lewenstein, Peter Winkler, Yossi Azar, 2006, SODA 2006.

Template-Driven Rainbow Coloring of Proper Interval Graphs

Sajal K. Das, Pavol Hell, L. Sunil Chandran, 2023, CALDAM.

Strongly chordal digraphs and $\Gamma$-free matrices.

P. Hell, Jing Huang, César Hernández-Cruz, 2019, 1909.03597.

Vertex arboricity of cographs

Sebastián González Hermosillo de la Maza, P. Hell, Payam Valadkhan, 2019, ArXiv.

Minimal digraph obstructions for small matrices

P. Hell, C'esar Hern'andez-Cruz, 2016, 1605.09587.

DISTANCE-TWO COLORINGS OF CUBIC PLANAR GRAPHS

Carlos S. Subi, P. Hell, 2018 .

Strong cocomparability graphs and Slash-free orderings of matrices

P. Hell, Jing Huang, J. Lin, 2022, 2210.16714.

List homomorphism problems for signed trees

P. Hell, T. Feder, R. Brewster, 2023, Discrete Mathematics.

Min orderings and list homomorphism dichotomies for signed and unsigned graphs

P. Hell, A. Rafiey, R. Brewster, 2022, LATIN.

C C ] 2 2 A ug 2 01 6 Minimum Cost Homomorphisms with Constrained Costs

P. Hell, M. M. Nevisi, 2018 .

Counterexamples to theorems of Menger type for the diameter

Pavol Hell, John Adrian Bondy, J. Bondy, 1983, Discret. Math..

High-Girth Graphs Avoiding a Minor are Nearly Bipartite

Pavol Hell, Luis A. Goddyn, Anna Galluccio, 2001, J. Comb. Theory, Ser. B.

Complexity of coloring graphs without paths and cycles pdf

Shenwei Huang, Pavol Hell, P. Hell, 2013, Discret. Appl. Math..

Independent packings in structured graphs

Kathie Cameron, Pavol Hell, P. Hell, 2006, Math. Program..

Describing hereditary properties by forbidden circular orderings

Pavol Hell, Santiago Guzm'an-Pro, C'esar Hern'andez-Cruz, 2021, Appl. Math. Comput..

Influence diffusion in social networks under time window constraints

Pavol Hell, Luisa Gargano, Ugo Vaccaro, 2013, Theor. Comput. Sci..

Broadcasting in Bounded Degree Graphs

Arthur L. Liestman, Jean-Claude Bermond, Pavol Hell, 1992, SIAM J. Discret. Math..

Graphs and homomorphisms

Jaroslav Nesetril, Pavol Hell, J. Nesetril, 2004, Oxford lecture series in mathematics and its applications.

On realizations of point determining graphs, and obstructions to full homomorphisms

Pavol Hell, Tomás Feder, P. Hell, 2008, Discret. Math..

Equicovering matroids by distinct bases

Pavol Hell, Pierre Fraisse, P. Hell, 1995, Eur. J. Comb..

Matroids With Weighted Bases and Feynman Integrals

Pavol Hell, P. Hell, 1984 .

List Partitions

Sulamita Klein, Rajeev Motwani, Pavol Hell, 2003, SIAM J. Discret. Math..

List Homomorphisms and Circular Arc Graphs

Pavol Hell, Tomás Feder, Jing Huang, 1999, Comb..

Complexity of graph partition problems

Sulamita Klein, Rajeev Motwani, Pavol Hell, 1999, STOC '99.

List Homomorphisms to Reflexive Graphs

Pavol Hell, Tomás Feder, P. Hell, 1998, J. Comb. Theory, Ser. B.

On the Kernel and Related Problems in Interval Digraphs

Mathew C. Francis, P. Hell, Dalu Jacob, 2021, ISAAC.

On the History of the Minimum Spanning Tree Problem

Ronald L. Graham, Pavol Hell, R. Graham, 1985, Annals of the History of Computing.

Optimal Wavelength-routed Multicasting

Stéphane Pérennes, Pavol Hell, Bruno Beauquier, 1998, Discret. Appl. Math..

Matrix partitions of split graphs pdf

Pavol Hell, Tomás Feder, Oren Shklarsky, 2013, Discret. Appl. Math..

Space complexity of list H-colouring: a dichotomy pdf

Pavol Hell, Arash Rafiey, Benoît Larose, 2013, SODA.

AN INTRODUCTION TO THE CATEGORY OF GRAPHS *

Pavol Hell, P. Hell, 1979 .

On some strongly rigid families of graphs and the full embeddings they induce

Pavol Hell, P. Hell, 1974 .

Groups and Monoids of Regular Graphs (And of Graphs with Bounded Degrees)

Pavol Hell, Jaroslav Nešetřil, J. Nesetril, 1973, Canadian Journal of Mathematics.

Sorting and Graphs

Béla Bollobás, Pavol Hell, B. Bollobás, 1985 .

The Complexity of Finding Generalized Paths in Tournaments

Pavol Hell, Moshe Rosenfeld, P. Hell, 1983, J. Algorithms.

Algorithmic Aspects in Information and Management

Boting Yang, Pavol Hell, Qianping Gu, 2014, Lecture Notes in Computer Science.

Ordering without Forbidden Patterns pdf

Bojan Mohar, Pavol Hell, Arash Rafiey, 2014, ESA.

A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs

Pavol Hell, Jing Huang, Binay Bhattacharya, 1996, SIAM J. Discret. Math..

Spanning spiders and light-splitting switches

Pavol Hell, Luisa Gargano, Ugo Vaccaro, 2004, Discret. Math..

Spanning Trees with Bounded Number of Branch Vertices

Pavol Hell, Luisa Gargano, Ugo Vaccaro, 2002, ICALP.

Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm

Pavol Hell, Juraj Stacho, Mathew C. Francis, 2014, SODA.

Intersection Dimension of Bipartite Graphs

Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, 2014, TAMC.

A dichotomy for minimum cost graph homomorphisms

Gregory Gutin, Anders Yeo, Pavol Hell, 2008, Eur. J. Comb..

Digraph matrix partitions and trigraph homomorphisms

Pavol Hell, Tomás Feder, Kim Tucker-Nally, 2006, Discret. Appl. Math..

Matrix partitions of perfect graphs

Pavol Hell, Tomás Feder, P. Hell, 2006, Discret. Math..

List matrix partitions of chordal graphs

Sulamita Klein, Fábio Protti, Pavol Hell, 2005, Theor. Comput. Sci..

A generalization of the theorem of Lekkerkerker and Boland

Pavol Hell, Jing Huang, P. Hell, 2005, Discret. Math..

Partitioning chordal graphs into independent sets and cliques

Sulamita Klein, Pavol Hell, Fábio Protti, 2004, Discret. Appl. Math..

Bandwidth versus Bandsize

Peter Winkler, Paul Erdös, Pavol Hell, 1988 .

On edge-sets of bicliques in graphs pdf

Pavol Hell, Juraj Stacho, Marina Groshaus, 2012, Discret. Appl. Math..

Minimum Cost Homomorphisms to Reflexive Digraphs pdf

Pavol Hell, Arash Rafiey, Mehdi Karimi, 2007, LATIN.

Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs pdf

Gregory Gutin, Anders Yeo, Pavol Hell, 2006, ArXiv.

Absolute Reflexive Retracts and Absolute Bipartite Retracts

Hans-Jürgen Bandelt, Martin Farber, Pavol Hell, 1993, Discret. Appl. Math..

A simple combinatorial interpretation of certain generalized Bell and Stirling numbers pdf

Pietro Codara, Pavol Hell, Ottavio M. D'Antona, 2013, Discret. Math..

On the Complexity of General Graph Factor Problems

David G. Kirkpatrick, Pavol Hell, P. Hell, 1981, SIAM J. Comput..

Counting Partitions of Graphs

Pavol Hell, Mayssam Mohammadi Nevisi, Miki Hermann, 2012, ISAAC.

Adjusted Interval Digraphs

Pavol Hell, Tomás Feder, Arash Rafiey, 2009, Electron. Notes Discret. Math..

List homomorphisms of graphs with bounded degrees

Pavol Hell, Tomás Feder, Jing Huang, 2007, Discret. Math..

Full Constraint Satisfaction Problems

Pavol Hell, Tomás Feder, P. Hell, 2006, SIAM J. Comput..

Algorithmic aspects of graph homomorphisms

Pavol Hell, C. D. Wensley, P. Hell, 2003 .

The complexity of H-colouring of bounded degree graphs

Jaroslav Nesetril, Pavol Hell, Anna Galluccio, 2000, Discret. Math..

Complexity of Tree Homomorphisms

Jaroslav Nesetril, Xuding Zhu, Pavol Hell, 1996, Discret. Appl. Math..

Hereditarily hard H-colouring problems

Gary MacGillivray, Jørgen Bang-Jensen, Pavol Hell, 1995, Discret. Math..

On the complexity of colouring by superdigraphs of bipartite graphs

Gary MacGillivray, Jørgen Bang-Jensen, Pavol Hell, 1992, Discret. Math..

The core of a graph

Jaroslav Nesetril, Pavol Hell, J. Nesetril, 1992, Discret. Math..

The effect of two cycles on the complexity of colourings by directed graphs

Jørgen Bang-Jensen, Pavol Hell, P. Hell, 1989, Discret. Appl. Math..

The Complexity of Colouring by Semicomplete Digraphs

Gary MacGillivray, Jørgen Bang-Jensen, Pavol Hell, 1988, SIAM J. Discret. Math..

Acyclic Homomorphisms and Circular Colorings of Digraphs

Bojan Mohar, Pavol Hell, Tomás Feder, 2003, SIAM J. Discret. Math..

Absolute retracts in graphs

Pavol Hell, P. Hell, 1974 .

Adaptable chromatic number of graph products

Xuding Zhu, Tsai-Lien Wong, Pavol Hell, 2009, Discret. Math..

On the adaptable chromatic number of graphs

Xuding Zhu, Pavol Hell, Xuding Zhu, 2008, Eur. J. Comb..

Matrix Partitions with Finitely Many Obstructions

Pavol Hell, Tomás Feder, Wing Xie, 2007, Electron. Notes Discret. Math..

Two algorithms for general list matrix partitions

Daniel Král, Jirí Sgall, Pavol Hell, 2005, SODA '05.

Graph homomorphisms

J. Nesetril, P. Hell, 2021, Topics in Algorithmic Graph Theory.

Oriented star packings

Richard C. Brewster, Pavol Hell, Romeo Rizzi, 2008, J. Comb. Theory, Ser. B.

The Dichotomy of Minimum Cost Homomorphism Problems for Digraphs

Pavol Hell, Arash Rafiey, P. Hell, 2012, SIAM J. Discret. Math..

Approximation of Minimum Cost Homomorphisms

Pavol Hell, Mayssam Mohammadi Nevisi, Arash Rafiey, 2012, ESA.

On the completeness of a generalized matching problem

David G. Kirkpatrick, Pavol Hell, P. Hell, 1978, STOC.

Distance-two colourings of Barnette graphs

Pavol Hell, Carlos S. Subi, Tomás Feder, 2020, Eur. J. Comb..

Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs

Pavol Hell, Jing Huang, P. Hell, 2005, SIAM J. Discret. Math..

Cycle transversals in bounded degree graphs

Sulamita Klein, Pavol Hell, Fábio Protti, 2009, Discret. Math. Theor. Comput. Sci..

Colouring, constraint satisfaction, and complexity

Jaroslav Nesetril, Pavol Hell, J. Nesetril, 2008, Comput. Sci. Rev..

Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs

Xiaotie Deng, Pavol Hell, Jing Huang, 1996, SIAM J. Comput..

Images of Rigid Digraphs

Jaroslav Nesetril, Pavol Hell, J. Nesetril, 1991, Eur. J. Comb..

Duality and Polynomial Testing of Tree Homomorphisms

Xuding Zhu, J. Nesetril, P. Hell, 1996 .

Local Tournaments and Proper Circular Arc Gaphs

Jørgen Bang-Jensen, Pavol Hell, Jing Huang, 1990, SIGAL International Symposium on Algorithms.

On the Density of Trigraph Homomorphisms

Jaroslav Nesetril, Pavol Hell, J. Nesetril, 2007, Graphs Comb..

Intersection Dimension of Bipartite Graphs

P. Hell, Ryuhei Uehara, Toshiki Saitoh, 2014, TAMC.

Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints pdf

Pavol Hell, Carlos S. Subi, Carlos Subi, 2019, ArXiv.

Monotone Proper Interval Digraphs and Min-Max Orderings

Pavol Hell, Arash Rafiey, P. Hell, 2012, SIAM J. Discret. Math..

Colourings, homomorphisms, and partitions of transitive digraphs

Pavol Hell, Tomás Feder, César Hernández-Cruz, 2015, Eur. J. Comb..

On homomorphisms to acyclic local tournaments

Pavol Hell, Huishan Zhou, Xuding Zhu, 1995, J. Graph Theory.

Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs

Pavol Hell, Jing Huang, P. Hell, 1995, J. Graph Theory.

Finding an Antidirected Hamiltonian Path Starting with a Forward Arc from a Given Vertex of a Tournament

Evripidis Bampis, Yannis Manoussakis, Pavol Hell, 1995, Combinatorics and Computer Science.

The Existence of Homomorphisms to Oriented Cycles

Xuding Zhu, Pavol Hell, Xuding Zhu, 1995, SIAM J. Discret. Math..

Homomorphisms to oriented paths

Xuding Zhu, Pavol Hell, Xuding Zhu, 1994, Discret. Math..

On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs

Jean-Claude Bermond, Pavol Hell, P. Hell, 1993, J. Graph Theory.

Fast Algorithms for Finding Hamiltonian Paths and Cycles in In-Tournament Digraphs

Jørgen Bang-Jensen, Pavol Hell, P. Hell, 1993, Discret. Appl. Math..

On multiplicative graphs and the product conjecture

Pavol Hell, Donald J. Miller, Roland Häggkvist, 1988, Comb..

Tournament-like oriented graphs

Pavol Hell, Jing Huang, P. Hell, 1992 .

The complexity of signed graph and edge-coloured graph homomorphisms pdf

Richard C. Brewster, Pavol Hell, Florent Foucaud, 2015, Discret. Math..

Minimal obstructions to 2-polar cographs

Pavol Hell, Cláudia Linhares Sales, César Hernández-Cruz, 2017, Discret. Appl. Math..

Strict chordal and strict split digraphs

Pavol Hell, César Hernández-Cruz, P. Hell, 2017, Discret. Appl. Math..

Obstructions to partitions of chordal graphs

Pavol Hell, Tomás Feder, Shekoofeh Nekooei Rizi, 2013, Discret. Math..

Partitioning Chordal Graphs

Pavol Hell, Tomás Feder, Shekoofeh Nekooei Rizi, 2011, Electron. Notes Discret. Math..

Packing r-Cliques in Weighted Chordal Graphs

Sulamita Klein, Pavol Hell, Fábio Protti, 2005, Ann. Oper. Res..

Graph partitions with prescribed patterns

Pavol Hell, P. Hell, 2014, Eur. J. Comb..

Distance-Two Coloring of Barnette Graphs

Pavol Hell, Tomás Feder, Carlos S. Subi, 2018, CCCG.

Constructions of large planar networks with given degree and diameter

P. Hell, M. Fellows, K. Seyffarth, 1998, Networks.

Large Planar Graphs with Given Diameter and Maximum Degree

Michael R. Fellows, Pavol Hell, Karen Seyffarth, 1995, Discret. Appl. Math..

Largest planar graphs of diameter two and fixed maximum degree

Pavol Hell, Karen Seyffarth, P. Hell, 1993, Discret. Math..

Construction of Large Packet Radio Networks

Jean-Claude Bermond, Jean-Jacques Quisquater, Pavol Hell, 1992, Parallel Process. Lett..

On the problem of bandsize

Katherine Heinrich, Pavol Hell, P. Hell, 1987, Graphs Comb..

Bi-Arc Digraphs and Conservative Polymorphisms pdf

Pavol Hell, Arash Rafiey, P. Hell, 2016, ArXiv.

Concerning the achromatic number of graphs

Martin Farber, Gena Hahn, Pavol Hell, 1986, J. Comb. Theory B.

The k‐piece packing problem

Jácint Szabó, Pavol Hell, David Hartvigsen, 2006, J. Graph Theory.

Universality of A-mote Graphs

Pavol Hell, Roland Häggkvist, R. Häggkvist, 1993, Eur. J. Comb..

The circular chromatic number of series-parallel graphs

Xuding Zhu, P. Hell, 2000, Journal of Graph Theory.

Preface

Jaroslav Nesetril, Pavol Hell, Wilfried Imrich, 2012, Discrete Mathematics.