default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPavol Hell
- > Home > Persons > Pavol Hell
Publications
- 2024
[j156]Jan Bok
, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List homomorphisms to separable signed graphs. Theor. Comput. Sci. 1001: 114580 (2024)- 2023
- [j152]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List homomorphism problems for signed trees. Discret. Math. 346(3): 113257 (2023) - [i29]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List homomorphisms to separable signed graphs. CoRR abs/2306.06449 (2023) - 2022
- [c36]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List Homomorphisms to Separable Signed Graphs. CALDAM 2022: 22-35 - 2021
- [j150]Tomás Feder, Pavol Hell, Carlos S. Subi:
Distance-two colourings of Barnette graphs. Eur. J. Comb. 91: 103210 (2021) - 2020
- [j148]Tomás Feder, Pavol Hell:
Complexity of correspondence H-colourings. Discret. Appl. Math. 281: 235-245 (2020) - [c31]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List Homomorphism Problems for Signed Graphs. MFCS 2020: 20:1-20:14 - [i26]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List homomorphism problems for signed graphs. CoRR abs/2005.05547 (2020) - 2019
- [i25]Tomás Feder, Pavol Hell, Carlos S. Subi:
Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints. CoRR abs/1907.00061 (2019) - 2018
- [c30]Tomás Feder, Pavol Hell, Carlos S. Subi:
Distance-Two Coloring of Barnette Graphs. CCCG 2018: 304-310 - [i21]Tomás Feder, Pavol Hell, Carlos S. Subi:
Distance-Two Colorings of Barnette Graphs. CoRR abs/1807.01410 (2018) - 2017
- [j138]Tomás Feder, Pavol Hell, César Hernández-Cruz:
Colourings, homomorphisms, and partitions of transitive digraphs. Eur. J. Comb. 60: 55-65 (2017) - [j137]Tomás Feder, Pavol Hell:
Correspondence Homomorphisms to Reflexive Graphs. Electron. Notes Discret. Math. 62: 9-14 (2017) - [i20]Tomás Feder, Pavol Hell:
Complexity of Correspondence Homomorphisms. CoRR abs/1703.05881 (2017) - 2014
- [j132]Tomás Feder, Pavol Hell, Oren Shklarsky:
Matrix partitions of split graphs. Discret. Appl. Math. 166: 91-96 (2014) - [j125]Tomás Feder, Pavol Hell, Benoît Larose, Mark H. Siggers, Claude Tardif:
Graphs Admitting k-NU Operations. Part 2: The Irreflexive Case. SIAM J. Discret. Math. 28(2): 817-834 (2014) - 2013
- [j122]Tomás Feder, Pavol Hell, Shekoofeh Nekooei Rizi:
Obstructions to partitions of chordal graphs. Discret. Math. 313(19): 1861-1871 (2013) - [j120]Tomás Feder, Pavol Hell, Benoît Larose, Cynthia Loten, Mark H. Siggers, Claude Tardif:
Graphs Admitting k-NU Operations. Part 1: The Reflexive Case. SIAM J. Discret. Math. 27(4): 1940-1963 (2013) - [i13]Tomás Feder, Pavol Hell, Oren Shklarsky:
Matrix Partitions of Split Graphs. CoRR abs/1306.1967 (2013) - 2012
- [j119]Tomás Feder, Pavol Hell, Jing Huang, Arash Rafiey:
Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms. Discret. Appl. Math. 160(6): 697-707 (2012) - 2011
- [j113]Tomás Feder, Pavol Hell, David G. Schell, Juraj Stacho:
Dichotomy for tree-structured trigraph list homomorphism problems. Discret. Appl. Math. 159(12): 1217-1224 (2011) - [j111]Tomás Feder, Pavol Hell, Shekoofeh Nekooei Rizi:
Partitioning Chordal Graphs. Electron. Notes Discret. Math. 38: 325-330 (2011) - 2010
- [j110]Tomás Feder, Pavol Hell, Peter Jonsson, Andrei A. Krokhin, Gustav Nordh:
Retractions to Pseudoforests. SIAM J. Discret. Math. 24(1): 101-112 (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) - 2009
- [j109]Tomás Feder, Pavol Hell, Jing Huang:
Extension problems with degree bounds. Discret. Appl. Math. 157(7): 1592-1599 (2009) - [j106]Tomás Feder, Pavol Hell, Jing Huang, Arash Rafiey:
Adjusted Interval Digraphs. Electron. Notes Discret. Math. 32: 83-91 (2009) - 2008
- [j102]Tomás Feder, Pavol Hell:
On realizations of point determining graphs, and obstructions to full homomorphisms. Discret. Math. 308(9): 1639-1652 (2008) - [j98]Tomás Feder, Pavol Hell, Jing Huang:
Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms. SIAM J. Discret. Math. 22(1): 1-14 (2008) - [j97]Richard C. Brewster, Tomás Feder, Pavol Hell, Jing Huang, Gary MacGillivray:
Near-Unanimity Functions and Varieties of Reflexive Graphs. SIAM J. Discret. Math. 22(3): 938-960 (2008) - 2007
- [j96]Tomás Feder, Pavol Hell, Wing Xie:
Matrix Partitions with Finitely Many Obstructions. Electron. J. Comb. 14(1) (2007) - [j95]Tomás Feder, Pavol Hell, Jing Huang:
List homomorphisms of graphs with bounded degrees. Discret. Math. 307(3-5): 386-392 (2007) - [j94]Tomás Feder, Pavol Hell, Jing Huang:
The structure of bi-arc trees. Discret. Math. 307(3-5): 393-401 (2007) - [j93]Tomás Feder, Pavol Hell, Wing Xie:
Matrix Partitions with Finitely Many Obstructions. Electron. Notes Discret. Math. 28: 371-378 (2007) - 2006
- [j91]Tomás Feder, Pavol Hell, Kim Tucker-Nally:
Digraph matrix partitions and trigraph homomorphisms. Discret. Appl. Math. 154(17): 2458-2469 (2006) - [j90]Tomás Feder, Pavol Hell:
Matrix partitions of perfect graphs. Discret. Math. 306(19-20): 2450-2460 (2006) - [j87]Tomás Feder, Pavol Hell:
Full Constraint Satisfaction Problems. SIAM J. Comput. 36(1): 230-246 (2006) - 2005
- [j84]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) - [c11]Tomás Feder, Pavol Hell, Daniel Král, Jirí Sgall:
Two algorithms for general list matrix partitions. SODA 2005: 870-876 - 2004
- [c10]Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
List Partitions of Chordal Graphs. LATIN 2004: 100-108 - 2003
- [j78]Tomás Feder, Pavol Hell, Jing Huang:
Bi-arc graphs and the complexity of list homomorphisms. J. Graph Theory 42(1): 61-80 (2003) - [j75]Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani:
List Partitions. SIAM J. Discret. Math. 16(3): 449-478 (2003) - [j74]Tomás Feder, Pavol Hell, Bojan Mohar:
Acyclic Homomorphisms and Circular Colorings of Digraphs. SIAM J. Discret. Math. 17(1): 161-169 (2003) - 1999
- [j62]Tomás Feder, Pavol Hell, Jing Huang:
List Homomorphisms and Circular Arc Graphs. Comb. 19(4): 487-505 (1999) - [c6]Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani:
Complexity of Graph Partition Problems. STOC 1999: 464-472 - 1998
- [j58]Tomás Feder, Pavol Hell:
List Homomorphisms to Reflexive Graphs. J. Comb. Theory B 72(2): 236-250 (1998)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
