Pavol Hell - RankMe

227 papers A* 9A 3B 12C 2Misc 2Journal 188Unranked 10

Year	Rank	Type	Title / Venue / Authors
2024	—	`conf`	Bi-arc Digraphs: Recognition Algorithm and Applications. LATIN (2) Pavol Hell, Akbar Rafiey, Arash Rafiey
2024	J	`jnl`	List homomorphisms to separable signed graphs. Theor. Comput. Sci. Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
2024	J	`jnl`	Min Orderings and List Homomorphism Dichotomies for Graphs and Signed Graphs. Algorithmica Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlicková, Arash Rafiey
2024	J	`jnl`	Strong Cocomparability Graphs and Slash-Free Orderings of Matrices. SIAM J. Discret. Math. Pavol Hell, Jing Huang, Jephian C.-H. Lin
2024	J	`jnl`	Trees with minimum weighted Szeged index. Art Discret. Appl. Math. Pavol Hell, César Hernández-Cruz, Seyyed Aliasghar Hosseini
2023	J	`jnl`	Describing hereditary properties by forbidden circular orderings. Appl. Math. Comput. Santiago Guzmán-Pro, Pavol Hell, César Hernández-Cruz
2023	J	`jnl`	List homomorphism problems for signed trees. Discret. Math. Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
2023	J	`jnl`	List homomorphisms to separable signed graphs. CoRR Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
2023	J	`jnl`	On the Kernel and Related Problems in Interval Digraphs. Algorithmica Mathew C. Francis, Pavol Hell, Dalu Jacob
2023	J	`jnl`	Template-driven rainbow coloring of proper interval graphs. Discret. Appl. Math. L. Sunil Chandran, Sajal K. Das, Pavol Hell, Sajith Padinhatteeri, Raji R. Pillai
2022	—	`conf`	List Homomorphisms to Separable Signed Graphs. CALDAM Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
2022	B	`conf`	Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs. LATIN Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlicková, Arash Rafiey
2022	J	`jnl`	Min orderings and list homomorphism dichotomies for signed and unsigned graphs. CoRR Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlicková, Arash Rafiey
2021	J	`jnl`	Distance-two colourings of Barnette graphs. Eur. J. Comb. Tomás Feder, Pavol Hell, Carlos S. Subi
2021	J	`jnl`	In praise of homomorphisms. Comput. Sci. Rev. Pavol Hell, Jaroslav Nesetril
2021	B	`conf`	On the Kernel and Related Problems in Interval Digraphs. ISAAC Mathew C. Francis, Pavol Hell, Dalu Jacob
2021	J	`jnl`	On the Kernel and Related Problems in Interval Digraphs. CoRR Mathew C. Francis, Pavol Hell, Dalu Jacob
2021	J	`jnl`	Strong Chordality of Graphs with Possible Loops. SIAM J. Discret. Math. Pavol Hell, César Hernández-Cruz, Jing Huang, Jephian C.-H. Lin
2021	—	`conf`	Template-Driven Rainbow Coloring of Proper Interval Graphs. CALDAM L. Sunil Chandran, Sajal K. Das, Pavol Hell, Sajith Padinhatteeri, Raji R. Pillai
2020	J	`jnl`	Bipartite Analogues of Comparability and Cocomparability Graphs. SIAM J. Discret. Math. Pavol Hell, Jing Huang, Jephian C.-H. Lin, Ross M. McConnell
2020	J	`jnl`	Complexity of correspondence H-colourings. Discret. Appl. Math. Tomás Feder, Pavol Hell
2020	J	`jnl`	Hamiltonian cycles in covering graphs of trees. Discret. Appl. Math. Pavol Hell, Hiroshi Nishiyama, Ladislav Stacho
2020	B	`conf`	List Homomorphism Problems for Signed Graphs. MFCS Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
2020	J	`jnl`	List homomorphism problems for signed graphs. CoRR Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
2020	J	`jnl`	Min-Orderable Digraphs. SIAM J. Discret. Math. Pavol Hell, Jing Huang, Ross M. McConnell, Arash Rafiey
2020	—	`conf`	Partitioning Cographs into Two Forests and One Independent Set. CALDAM Pavol Hell, César Hernández-Cruz, Anurag Sanyal
2019	J	`jnl`	Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints. CoRR Tomás Feder, Pavol Hell, Carlos S. Subi
2019	J	`jnl`	Minimal obstructions to 2-polar cographs. Discret. Appl. Math. Pavol Hell, César Hernández-Cruz, Cláudia Linhares Sales
2019	J	`jnl`	Strongly chordal digraphs and Γ-free matrices. CoRR Pavol Hell, César Hernández-Cruz, Jing Huang, Jephian C.-H. Lin
2019	J	`jnl`	Vertex arboricity of cographs. CoRR Sebastián González Hermosillo de la Maza, Pavol Hell, César Hernández-Cruz, Seyyed Aliasghar Hosseini, Payam Valadkhan
2018	—	`conf`	Distance-Two Coloring of Barnette Graphs. CCCG Tomás Feder, Pavol Hell, Carlos S. Subi
2018	J	`jnl`	Distance-Two Colorings of Barnette Graphs. CoRR Tomás Feder, Pavol Hell, Carlos S. Subi
2018	B	`conf`	Interval-Like Graphs and Digraphs. MFCS Pavol Hell, Jing Huang, Ross M. McConnell, Arash Rafiey
2018	J	`jnl`	Interval-Like Graphs and Digraphs. CoRR Pavol Hell, Jing Huang, Ross M. McConnell, Arash Rafiey
2017	J	`jnl`	Colourings, homomorphisms, and partitions of transitive digraphs. Eur. J. Comb. Tomás Feder, Pavol Hell, César Hernández-Cruz
2017	J	`jnl`	Complexity of Correspondence Homomorphisms. CoRR Tomás Feder, Pavol Hell
2017	J	`jnl`	Complexity of coloring graphs without paths and cycles. Discret. Appl. Math. Pavol Hell, Shenwei Huang
2017	J	`jnl`	Correspondence Homomorphisms to Reflexive Graphs. Electron. Notes Discret. Math. Tomás Feder, Pavol Hell
2017	J	`jnl`	Ferrers dimension of grid intersection graphs. Discret. Appl. Math. Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara
2017	—	`conf`	Hamiltonian Cycles in Covering Graphs of Trees. COCOA (2) Pavol Hell, Hiroshi Nishiyama, Ladislav Stacho
2017	J	`jnl`	Strict chordal and strict split digraphs. Discret. Appl. Math. Pavol Hell, César Hernández-Cruz
2017	J	`jnl`	The complexity of signed graph and edge-coloured graph homomorphisms. Discret. Math. Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr
2017	J	`jnl`	The complexity of tropical graph homomorphisms. Discret. Appl. Math. Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr
2016	J	`jnl`	Bi-Arc Digraphs and Conservative Polymorphisms. CoRR Pavol Hell, Arash Rafiey
2016	Misc	`conf`	Minimum Cost Homomorphisms with Constrained Costs. COCOON Pavol Hell, Mayssam Mohammadi Nevisi
2016	J	`jnl`	Minimum Cost Homomorphisms with Constrained Costs. CoRR Pavol Hell, Mayssam Mohammadi Nevisi
2016	J	`jnl`	The complexity of tropical graph homomorphisms. CoRR Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr
2015	A*	`conf`	Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy. LICS Víctor Dalmau, László Egri, Pavol Hell, Benoît Larose, Arash Rafiey
2015	A*	`conf`	Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm. SODA Mathew C. Francis, Pavol Hell, Juraj Stacho
2015	J	`jnl`	Influence diffusion in social networks under time window constraints. Theor. Comput. Sci. Luisa Gargano, Pavol Hell, Joseph G. Peters, Ugo Vaccaro
2015	J	`jnl`	Join colourings of chordal graphs. Discret. Math. Pavol Hell, Pei-Lan Yen
2015	J	`jnl`	Point determining digraphs, {0, 1}-matrix partitions, and dualities in full homomorphisms. Discret. Math. Pavol Hell, César Hernández-Cruz
2015	J	`jnl`	Preface. Theor. Comput. Sci. Qian-Ping Gu, Pavol Hell, Boting Yang
2015	J	`jnl`	The complexity of signed graph and 2-edge-coloured graph homomorphisms. CoRR Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr
2014	J	`jnl`	A simple combinatorial interpretation of certain generalized Bell and Stirling numbers. Discret. Math. Pietro Codara, Ottavio M. D'Antona, Pavol Hell
2014	C	`ed.`	Algorithmic Aspects in Information and Management - 10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings AAIM Qianping Gu, Pavol Hell, Boting Yang
2014	J	`jnl`	Blocking Quadruple: A New Obstruction to Circular-Arc Graphs. SIAM J. Discret. Math. Mathew C. Francis, Pavol Hell, Juraj Stacho
2014	B	`conf`	Complexity of Coloring Graphs without Paths and Cycles. LATIN Pavol Hell, Shenwei Huang
2014	J	`jnl`	Connected obstructions to full graph homomorphisms. Eur. J. Comb. Pavol Hell, Ales Pultr
2014	J	`jnl`	Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm. CoRR Mathew C. Francis, Pavol Hell, Juraj Stacho
2014	J	`jnl`	Graph partitions with prescribed patterns. Eur. J. Comb. Pavol Hell
2014	J	`jnl`	Graphs Admitting k-NU Operations. Part 2: The Irreflexive Case. SIAM J. Discret. Math. Tomás Feder, Pavol Hell, Benoît Larose, Mark H. Siggers, Claude Tardif
2014	J	`jnl`	H-coloring degree-bounded (acyclic) digraphs. Theor. Comput. Sci. Pavol Hell, Aurosish Mishra
2014	C	`conf`	Intersection Dimension of Bipartite Graphs. TAMC Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara
2014	J	`jnl`	Matrix partitions of split graphs. Discret. Appl. Math. Tomás Feder, Pavol Hell, Oren Shklarsky
2014	J	`jnl`	On the complexity of the 3-kernel problem in some classes of digraphs. Discuss. Math. Graph Theory Pavol Hell, César Hernández-Cruz
2014	A	`conf`	Ordering without Forbidden Patterns. ESA Pavol Hell, Bojan Mohar, Arash Rafiey
2014	J	`jnl`	Ordering without forbidden patterns. CoRR Pavol Hell, Bojan Mohar, Arash Rafiey
2014	J	`jnl`	Semilattice polymorphisms and chordal graphs. Eur. J. Comb. Pavol Hell, Mark H. Siggers
2014	A*	`conf`	Space complexity of list SODA László Egri, Pavol Hell, Benoît Larose, Arash Rafiey
2013	J	`jnl`	A simple combinatorial interpretation of certain generalized Bell and Stirling numbers. CoRR Pietro Codara, Ottavio M. D'Antona, Pavol Hell
2013	J	`jnl`	Complexity of Coloring Graphs without Paths and Cycles. CoRR Pavol Hell, Shenwei Huang
2013	J	`jnl`	Graphs Admitting k-NU Operations. Part 1: The Reflexive Case. SIAM J. Discret. Math. Tomás Feder, Pavol Hell, Benoît Larose, Cynthia Loten, Mark H. Siggers, Claude Tardif
2013	B	`conf`	Influence Diffusion in Social Networks under Time Window Constraints. SIROCCO Luisa Gargano, Pavol Hell, Joseph G. Peters, Ugo Vaccaro
2013	J	`jnl`	Influence Diffusion in Social Networks under Time Window Constraints. CoRR Luisa Gargano, Pavol Hell, Joseph G. Peters, Ugo Vaccaro
2013	J	`jnl`	Matrix Partitions of Split Graphs. CoRR Tomás Feder, Pavol Hell, Oren Shklarsky
2013	J	`jnl`	Obstructions to chordal circular-arc graphs of small independence number. Electron. Notes Discret. Math. Mathew C. Francis, Pavol Hell, Juraj Stacho
2013	J	`jnl`	Obstructions to partitions of chordal graphs. Discret. Math. Tomás Feder, Pavol Hell, Shekoofeh Nekooei Rizi
2013	J	`jnl`	On edge-sets of bicliques in graphs. CoRR Marina Groshaus, Pavol Hell, Juraj Stacho
2013	J	`jnl`	Recognition and Characterization of Chronological Interval Digraphs. Electron. J. Comb. Sandip Das, Mathew C. Francis, Pavol Hell, Jing Huang
2013	Misc	`conf`	Small COCOON Pavol Hell, Aurosish Mishra
2013	J	`jnl`	Space complexity of list H-colouring: a dichotomy. CoRR László Egri, Pavol Hell, Benoît Larose, Arash Rafiey
2012	A	`conf`	Approximation of Minimum Cost Homomorphisms. ESA Pavol Hell, Monaldo Mastrolilli, Mayssam Mohammadi Nevisi, Arash Rafiey
2012	B	`conf`	Counting Partitions of Graphs. ISAAC Pavol Hell, Miki Hermann, Mayssam Mohammadi Nevisi
2012	J	`jnl`	Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms. Discret. Appl. Math. Tomás Feder, Pavol Hell, Jing Huang, Arash Rafiey
2012	J	`jnl`	Monotone Proper Interval Digraphs and Min-Max Orderings. SIAM J. Discret. Math. Pavol Hell, Arash Rafiey
2012	J	`jnl`	Obstructions to chordal circular-arc graphs of small independence number CoRR Mathew C. Francis, Pavol Hell, Juraj Stacho
2012	J	`jnl`	On edge-sets of bicliques in graphs. Discret. Appl. Math. Marina Groshaus, Pavol Hell, Juraj Stacho
2012	J	`jnl`	Preface. Discret. Math. Pavol Hell, Wilfried Imrich, Jaroslav Nesetril
2012	J	`jnl`	Small H-coloring problems for bounded degree digraphs CoRR Aurosish Mishra, Pavol Hell
2012	J	`jnl`	The Dichotomy of Minimum Cost Homomorphism Problems for Digraphs. SIAM J. Discret. Math. Pavol Hell, Arash Rafiey
2011	J	`jnl`	Cycle transversals in bounded degree graphs. Discret. Math. Theor. Comput. Sci. Marina Groshaus, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2011	J	`jnl`	Dichotomy for tree-structured trigraph list homomorphism problems. Discret. Appl. Math. Tomás Feder, Pavol Hell, David G. Schell, Juraj Stacho
2011	J	`jnl`	Messy broadcasting - Decentralized broadcast schemes with limited knowledge. Discret. Appl. Math. Hovhannes A. Harutyunyan, Pavol Hell, Arthur L. Liestman
2011	J	`jnl`	Partitioning Chordal Graphs. Electron. Notes Discret. Math. Tomás Feder, Pavol Hell, Shekoofeh Nekooei Rizi
2011	A*	`conf`	The Dichotomy of List Homomorphisms for Digraphs. SODA Pavol Hell, Arash Rafiey
2010	J	`jnl`	Dichotomy for tree-structured trigraph list homomorphism problems CoRR Tomás Feder, Pavol Hell, David G. Schell, Juraj Stacho
2010	B	`conf`	Faithful Representations of Graphs by Islands in the Extended Grid. LATIN Michael D. Coury, Pavol Hell, Jan Kratochvíl, Tomás Vyskocil
2010	J	`jnl`	Retractions to Pseudoforests. SIAM J. Discret. Math. Tomás Feder, Pavol Hell, Peter Jonsson, Andrei A. Krokhin, Gustav Nordh
2010	J	`jnl`	The Dichotomy of List Homomorphisms for Digraphs CoRR Pavol Hell, Arash Rafiey
2009	J	`jnl`	Adaptable chromatic number of graph products. Discret. Math. Pavol Hell, Zhishi Pan, Tsai-Lien Wong, Xuding Zhu
2009	J	`jnl`	Adjusted Interval Digraphs. Electron. Notes Discret. Math. Tomás Feder, Pavol Hell, Jing Huang, Arash Rafiey
2009	J	`jnl`	Cycle transversals in bounded degree graphs. Electron. Notes Discret. Math. Marina Groshaus, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2009	J	`jnl`	Duality for Min-Max Orderings and Dichotomy for Min Cost Homomorphisms CoRR Arash Rafiey, Pavol Hell
2009	J	`jnl`	Extension problems with degree bounds. Discret. Appl. Math. Tomás Feder, Pavol Hell, Jing Huang
2009	—	`conf`	Generalizations of Interval Graphs. CCCG Pavol Hell
2009	J	`jnl`	Linear-time certifying algorithms for near-graphical sequences. Discret. Math. Pavol Hell, David G. Kirkpatrick
2008	J	`jnl`	A dichotomy for minimum cost graph homomorphisms. Eur. J. Comb. Gregory Z. Gutin, Pavol Hell, Arash Rafiey, Anders Yeo
2008	J	`jnl`	Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms. SIAM J. Discret. Math. Tomás Feder, Pavol Hell, Jing Huang
2008	J	`jnl`	Colouring, constraint satisfaction, and complexity. Comput. Sci. Rev. Pavol Hell, Jaroslav Nesetril
2008	B	`conf`	Minimum Cost Homomorphisms to Reflexive Digraphs. LATIN Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey
2008	J	`jnl`	Near-Unanimity Functions and Varieties of Reflexive Graphs. SIAM J. Discret. Math. Richard C. Brewster, Tomás Feder, Pavol Hell, Jing Huang, Gary MacGillivray
2008	B	`conf`	On Injective Colourings of Chordal Graphs. LATIN Pavol Hell, André Raspaud, Juraj Stacho
2008	J	`jnl`	On realizations of point determining graphs, and obstructions to full homomorphisms. Discret. Math. Tomás Feder, Pavol Hell
2008	J	`jnl`	On the adaptable chromatic number of graphs. Eur. J. Comb. Pavol Hell, Xuding Zhu
2008	J	`jnl`	Oriented star packings. J. Comb. Theory B Richard C. Brewster, Pavol Hell, Romeo Rizzi
2008	J	`jnl`	Polarity of chordal graphs. Discret. Appl. Math. Tínaz Ekim, Pavol Hell, Juraj Stacho, Dominique de Werra
2007	J	`jnl`	List homomorphisms of graphs with bounded degrees. Discret. Math. Tomás Feder, Pavol Hell, Jing Huang
2007	J	`jnl`	Matrix Partitions with Finitely Many Obstructions. Electron. J. Comb. Tomás Feder, Pavol Hell, Wing Xie
2007	J	`jnl`	Matrix Partitions with Finitely Many Obstructions. Electron. Notes Discret. Math. Tomás Feder, Pavol Hell, Wing Xie
2007	J	`jnl`	Minimum Cost Homomorphisms to Reflexive Digraphs CoRR Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey
2007	J	`jnl`	On the Density of Trigraph Homomorphisms. Graphs Comb. Pavol Hell, Jarik Nesetril
2007	J	`jnl`	The structure of bi-arc trees. Discret. Math. Tomás Feder, Pavol Hell, Jing Huang
2006	J	`jnl`	Digraph matrix partitions and trigraph homomorphisms. Discret. Appl. Math. Tomás Feder, Pavol Hell, Kim Tucker-Nally
2006	J	`jnl`	Full Constraint Satisfaction Problems. SIAM J. Comput. Tomás Feder, Pavol Hell
2006	J	`jnl`	Independent packings in structured graphs. Math. Program. Kathie Cameron, Pavol Hell
2006	J	`jnl`	Matrix partitions of perfect graphs. Discret. Math. Tomás Feder, Pavol Hell
2006	J	`jnl`	Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs CoRR Gregory Z. Gutin, Pavol Hell, Arash Rafiey, Anders Yeo
2006	J	`jnl`	The J. Graph Theory David Hartvigsen, Pavol Hell, Jácint Szabó
2005	J	`jnl`	A generalization of the theorem of Lekkerkerker and Boland. Discret. Math. Pavol Hell, Jing Huang
2005	J	`jnl`	List matrix partitions of chordal graphs. Theor. Comput. Sci. Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2005	J	`jnl`	Packing Ann. Oper. Res. Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2005	A*	`conf`	Two algorithms for general list matrix partitions. SODA Tomás Feder, Pavol Hell, Daniel Král, Jirí Sgall
2004	J	`jnl`	Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs. SIAM J. Discret. Math. Pavol Hell, Jing Huang
2004	—	`book`	Graphs and homomorphisms. Pavol Hell, Jaroslav Nesetril
2004	J	`jnl`	Interval bigraphs and circular arc graphs. J. Graph Theory Pavol Hell, Jing Huang
2004	B	`conf`	List Partitions of Chordal Graphs. LATIN Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2004	J	`jnl`	Partitioning chordal graphs into independent sets and cliques. Discret. Appl. Math. Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2004	J	`jnl`	Polychromatic cliques. Discret. Math. Pavol Hell, Juan José Montellano-Ballesteros
2004	J	`jnl`	Spanning spiders and light-splitting switches. Discret. Math. Luisa Gargano, Mikael Hammar, Pavol Hell, Ladislav Stacho, Ugo Vaccaro
2003	J	`jnl`	Acyclic Homomorphisms and Circular Colorings of Digraphs. SIAM J. Discret. Math. Tomás Feder, Pavol Hell, Bojan Mohar
2003	J	`jnl`	Bi-arc graphs and the complexity of list homomorphisms. J. Graph Theory Tomás Feder, Pavol Hell, Jing Huang
2003	J	`jnl`	Broadcasting in generalized chordal rings. Networks Francesc Comellas, Pavol Hell
2003	J	`jnl`	List Partitions. SIAM J. Discret. Math. Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani
2003	J	`jnl`	Packing paths in digraphs. J. Graph Theory Richard C. Brewster, Pavol Hell, Sarah H. Pantel, Romeo Rizzi, Anders Yeo
2002	J	`jnl`	Antidirected hamiltonian paths between specified vertices of a tournament. Discret. Appl. Math. Pavol Hell, Moshe Rosenfeld
2002	J	`jnl`	Homomorphisms to powers of digraphs. Discret. Math. Richard C. Brewster, Pavol Hell
2002	A*	`conf`	Spanning Trees with Bounded Number of Branch Vertices. ICALP Luisa Gargano, Pavol Hell, Ladislav Stacho, Ugo Vaccaro
2001	J	`jnl`	A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs. SIAM J. Comput. Pavol Hell, Ron Shamir, Roded Sharan
2001	J	`jnl`	Coloring all directed paths in a symmetric tree, with an application to optical networks. J. Graph Theory Luisa Gargano, Pavol Hell, Stephane Perennes
2001	—	`conf`	Counting List Homomorphisms and Graphs with Bounded Degrees. Graphs, Morphisms and Statistical Physics Pavol Hell, Jaroslav Nesetril
2001	J	`jnl`	High-Girth Graphs Avoiding a Minor are Nearly Bipartite. J. Comb. Theory B Anna Galluccio, Luis A. Goddyn, Pavol Hell
2001	J	`jnl`	On generalized split graphs. Electron. Notes Discret. Math. Pavol Hell, Sulamita Klein, Fábio Protti, Loana Tito Nogueira
2001	J	`jnl`	On nice graphs. Discret. Math. Pavol Hell, Alexandr V. Kostochka, André Raspaud, Éric Sopena
2000	J	`jnl`	Graph Packings. Electron. Notes Discret. Math. Pavol Hell
2000	J	`jnl`	On homomorphisms to edge-coloured cycles. Electron. Notes Discret. Math. Richard C. Brewster, Pavol Hell
2000	J	`jnl`	The circular chromatic number of series-parallel graphs. J. Graph Theory Pavol Hell, Xuding Zhu
2000	J	`jnl`	The complexity of Discret. Math. Anna Galluccio, Pavol Hell, Jaroslav Nesetril
1999	A	`conf`	A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs. ESA Pavol Hell, Ron Shamir, Roded Sharan
1999	A*	`conf`	Complexity of Graph Partition Problems. STOC Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani
1999	J	`jnl`	List Homomorphisms and Circular Arc Graphs. Comb. Tomás Feder, Pavol Hell, Jing Huang
1998	J	`jnl`	Broadcasting in planar graphs. Australas. J Comb. Pavol Hell, Karen Seyffarth
1998	J	`jnl`	Constructions of large planar networks with given degree and diameter. Networks Michael R. Fellows, Pavol Hell, Karen Seyffarth
1998	J	`jnl`	List Homomorphisms to Reflexive Graphs. J. Comb. Theory B Tomás Feder, Pavol Hell
1998	J	`jnl`	On the complexity of coloring areflexive h-ary relations with given permutation group. Ars Comb. L. Haddad, Pavol Hell, Eric Mendelsohn
1998	J	`jnl`	Optimal Wavelength-routed Multicasting. Discret. Appl. Math. Bruno Beauquier, Pavol Hell, Stephane Perennes
1997	A*	`conf`	Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing. ICALP Luisa Gargano, Pavol Hell, Stephane Perennes
1997	J	`jnl`	The complexity of restricted graph homomorphisms. Discret. Math. Richard C. Brewster, Pavol Hell, Gary MacGillivray
1997	J	`jnl`	Two remarks on circular arc graphs. Graphs Comb. Pavol Hell, Jing Huang
1996	J	`jnl`	A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs. SIAM J. Discret. Math. Binay K. Bhattacharya, Pavol Hell, Jing Huang
1996	J	`jnl`	Complexity of Tree Homomorphisms. Discret. Appl. Math. Pavol Hell, Jaroslav Nesetril, Xuding Zhu
1996	J	`jnl`	Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs. SIAM J. Comput. Xiaotie Deng, Pavol Hell, Jing Huang
1996	J	`jnl`	Rounding in Symmetric Matrices and Undirected Graphs. Discret. Appl. Math. Pavol Hell, David G. Kirkpatrick, Brenda Li
1995	J	`jnl`	Equicovering matroids by distinct bases. Eur. J. Comb. Pierre Fraisse, Pavol Hell
1995	—	`conf`	Finding an Antidirected Hamiltonian Path Starting with a Forward Arc from a Given Vertex of a Tournament. Combinatorics and Computer Science Evripidis Bampis, Pavol Hell, Yannis Manoussakis, Moshe Rosenfeld
1995	J	`jnl`	Hereditarily hard H-colouring problems. Discret. Math. Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray
1995	J	`jnl`	Large Planar Graphs with Given Diameter and Maximum Degree. Discret. Appl. Math. Michael R. Fellows, Pavol Hell, Karen Seyffarth
1995	J	`jnl`	Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs. J. Graph Theory Pavol Hell, Jing Huang
1995	J	`jnl`	On homomorphisms to acyclic local tournaments. J. Graph Theory Pavol Hell, Huishan Zhou, Xuding Zhu
1995	J	`jnl`	On the ultimate independence ratio of a graph. Eur. J. Comb. Gena Hahn, Pavol Hell, Svatopluk Poljak
1995	J	`jnl`	The Existence of Homomorphisms to Oriented Cycles. SIAM J. Discret. Math. Pavol Hell, Xuding Zhu
1994	J	`jnl`	Homomorphisms to oriented paths. Discret. Math. Pavol Hell, Xuding Zhu
1994	J	`jnl`	Independence ratios of graph powers. Discret. Math. Pavol Hell, Xingxing Yu, Huishan Zhou
1994	J	`jnl`	Multiplicativity of Oriented Cycles. J. Comb. Theory B Pavol Hell, Huishan Zhou, Xuding Zhu
1994	J	`jnl`	On chordal proper circular arc graphs. Discret. Math. Jørgen Bang-Jensen, Pavol Hell
1994	J	`jnl`	Packing Problems in Edge-colored Graphs. Discret. Appl. Math. Pavol Hell, Yannis Manoussakis, Zsolt Tuza
1993	J	`jnl`	Absolute Reflexive Retracts and Absolute Bipartite Retracts. Discret. Appl. Math. Hans-Jürgen Bandelt, Martin Farber, Pavol Hell
1993	J	`jnl`	Algorithms for Degree Constrained Graph Factors of Minimum Deficiency. J. Algorithms Pavol Hell, David G. Kirkpatrick
1993	J	`jnl`	Biography of Martin Farber, 1951-1989. Discret. Appl. Math. Pavol Hell
1993	J	`jnl`	Fast Algorithms for Finding Hamiltonian Paths and Cycles in In-Tournament Digraphs. Discret. Appl. Math. Jørgen Bang-Jensen, Pavol Hell
1993	J	`jnl`	Graph endpoint coloring and distributed processing. Networks Dominique de Werra, Pavol Hell, Tiko Kameda, Naoki Katoh, Ph. Solot, Masafumi Yamashita
1993	J	`jnl`	Homomorphisms to oriented cycles. Comb. Pavol Hell, Huishan Zhou, Xuding Zhu
1993	J	`jnl`	Largest planar graphs of diameter two and fixed maximum degree. Discret. Math. Pavol Hell, Karen Seyffarth
1993	J	`jnl`	On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs. J. Graph Theory Jean-Claude Bermond, Pavol Hell
1993	J	`jnl`	Universality of A-mote Graphs. Eur. J. Comb. Roland Häggkvist, Pavol Hell
1992	J	`jnl`	Achromatic numbers and graph operations. Discret. Math. Pavol Hell, Donald J. Miller
1992	J	`jnl`	Broadcasting in Bounded Degree Graphs. SIAM J. Discret. Math. Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters
1992	J	`jnl`	Construction of Large Packet Radio Networks. Parallel Process. Lett. Jean-Claude Bermond, Pavol Hell, Jean-Jacques Quisquater
1992	J	`jnl`	On the complexity of colouring by superdigraphs of bipartite graphs. Discret. Math. Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray
1992	B	`conf`	Recognition and Representation of Proper Circular Arc Graphs. IPCO Xiaotie Deng, Pavol Hell, Jing Huang
1992	J	`jnl`	Sparse broadcast graphs. Discret. Appl. Math. Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters
1992	J	`jnl`	The core of a graph. Discret. Math. Pavol Hell, Jaroslav Nesetril
1991	J	`jnl`	Images of Rigid Digraphs. Eur. J. Comb. Pavol Hell, Jaroslav Nesetril
1990	J	`jnl`	A note on the star chromatic number. J. Graph Theory J. Adrian Bondy, Pavol Hell
1990	J	`jnl`	A simple existence criterion for (g<f)- factors. Discret. Math. Katherine Heinrich, Pavol Hell, David G. Kirkpatrick, Guizhen Liu
1990	—	`conf`	Local Tournaments and Proper Circular Arc Gaphs. SIGAL International Symposium on Algorithms Pavol Hell, Jørgen Bang-Jensen, Jing Huang
1990	J	`jnl`	On the complexity of J. Comb. Theory B Pavol Hell, Jaroslav Nesetril
1990	J	`jnl`	Preface. Discret. Appl. Math. Pavol Hell
1990	J	`jnl`	The effect of two cycles on the complexity of colourings by directed graphs. Discret. Appl. Math. Jørgen Bang-Jensen, Pavol Hell
1988	J	`jnl`	Broadcasting in one dimension. Discret. Appl. Math. Pavol Hell, Arthur L. Liestman
1988	J	`jnl`	On Restricted Two-Factors. SIAM J. Discret. Math. Pavol Hell, David G. Kirkpatrick, Jan Kratochvíl, Igor Kríz
1988	J	`jnl`	On multiplicative graphs and the product conjecture. Comb. Roland Häggkvist, Pavol Hell, Donald J. Miller, Victor Neumann-Lara
1988	J	`jnl`	The Complexity of Colouring by Semicomplete Digraphs. SIAM J. Discret. Math. Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray
1987	J	`jnl`	On the problem of bandsize. Graphs Comb. Katherine Heinrich, Pavol Hell
1986	J	`jnl`	A note on Graphs Comb. Pierre Fraisse, Pavol Hell, David G. Kirkpatrick
1986	J	`jnl`	Concerning the achromatic number of graphs. J. Comb. Theory B Martin Farber, Gena Hahn, Pavol Hell, Donald J. Miller
1985	J	`jnl`	On the History of the Minimum Spanning Tree Problem. IEEE Ann. Hist. Comput. Ronald L. Graham, Pavol Hell
1984	J	`jnl`	Packings by cliques and by finite families of graphs. Discret. Math. Pavol Hell, David G. Kirkpatrick
1983	J	`jnl`	Counterexamples to theorems of Menger type for the diameter. Discret. Math. J. Adrian Bondy, Pavol Hell
1983	J	`jnl`	On the Complexity of General Graph Factor Problems. SIAM J. Comput. David G. Kirkpatrick, Pavol Hell
1983	J	`jnl`	The Complexity of Finding Generalized Paths in Tournaments. J. Algorithms Pavol Hell, Moshe Rosenfeld
1981	J	`jnl`	On Generalized Matching Problems. Inf. Process. Lett. Pavol Hell, David G. Kirkpatrick
1981	J	`jnl`	Parallel Sorting with Constant Time for Comparisons. SIAM J. Comput. Roland Häggkvist, Pavol Hell
1979	J	`jnl`	An intermediate value theorem for graphs with given automorphism group. J. Graph Theory Pavol Hell, Louis V. Quintas
1978	A*	`conf`	On the Completeness of a Generalized Matching Problem STOC David G. Kirkpatrick, Pavol Hell
1976	J	`jnl`	Graph with given achromatic number. Discret. Math. Pavol Hell, Donald J. Miller
1972	J	`jnl`	Graph decompositions, handcuffed prisoners and balanced P-designs. Discret. Math. Pavol Hell, Alexander Rosa