Francis, Mathew C.; Hell, Pavol; Jacob, Dalu On the kernel and related problems in interval digraphs. (English) Zbl 07691812 Algorithmica 85, No. 6, 1522-1559 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{M. C. Francis} et al., Algorithmica 85, No. 6, 1522--1559 (2023; Zbl 07691812) Full Text: DOI arXiv
Chandran, L. Sunil; Das, Sajal K.; Hell, Pavol; Padinhatteeri, Sajith; Pillai, Raji R. Template-driven rainbow coloring of proper interval graphs. (English) Zbl 1508.05054 Discrete Appl. Math. 328, 97-107 (2023). MSC: 05C15 68R10 68W10 68M14 68P05 PDFBibTeX XMLCite \textit{L. S. Chandran} et al., Discrete Appl. Math. 328, 97--107 (2023; Zbl 1508.05054) Full Text: DOI
Bok, Jan; Brewster, Richard; Feder, Tomás; Hell, Pavol; Jedličková, Nikola List homomorphism problems for signed trees. (English) Zbl 1506.05082 Discrete Math. 346, No. 3, Article ID 113257, 24 p. (2023). MSC: 05C22 05C05 68Q15 05C60 PDFBibTeX XMLCite \textit{J. Bok} et al., Discrete Math. 346, No. 3, Article ID 113257, 24 p. (2023; Zbl 1506.05082) Full Text: DOI
Guzmán-Pro, Santiago; Hell, Pavol; Hernández-Cruz, César Describing hereditary properties by forbidden circular orderings. (English) Zbl 1510.05249 Appl. Math. Comput. 438, Article ID 127555, 14 p. (2023). MSC: 05C75 05C60 68R10 PDFBibTeX XMLCite \textit{S. Guzmán-Pro} et al., Appl. Math. Comput. 438, Article ID 127555, 14 p. (2023; Zbl 1510.05249) Full Text: DOI arXiv
Bok, Jan; Brewster, Richard C.; Hell, Pavol; Jedličková, Nikola; Rafiey, Arash Min orderings and list homomorphism dichotomies for signed and unsigned graphs. (English) Zbl 07719364 Castañeda, Armando (ed.) et al., Latin 2022: theoretical informatics. 15th Latin American symposium, Guanajuato, Mexico, November 7–11, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13568, 510-526 (2022). MSC: 68Qxx 68Rxx 68Wxx PDFBibTeX XMLCite \textit{J. Bok} et al., Lect. Notes Comput. Sci. 13568, 510--526 (2022; Zbl 07719364) Full Text: DOI arXiv
Bok, Jan; Brewster, Richard; Feder, Tomás; Hell, Pavol; Jedličková, Nikola List homomorphisms to separable signed graphs. (English) Zbl 07683160 Balachandran, Niranjan (ed.) et al., Algorithms and discrete applied mathematics. 8th international conference, CALDAM 2022, Puducherry, India, February 10–12, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13179, 22-35 (2022). MSC: 68Wxx PDFBibTeX XMLCite \textit{J. Bok} et al., Lect. Notes Comput. Sci. 13179, 22--35 (2022; Zbl 07683160) Full Text: DOI
Francis, Mathew C.; Hell, Pavol; Jacob, Dalu On the kernel and related problems in interval digraphs. (English) Zbl 07788590 Ahn, Hee-Kap (ed.) et al., 32nd international symposium on algorithms and computation, ISAAC 2021, Fukuoka, Japan, December 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 212, Article 17, 17 p. (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{M. C. Francis} et al., LIPIcs -- Leibniz Int. Proc. Inform. 212, Article 17, 17 p. (2021; Zbl 07788590) Full Text: DOI
Hell, Pavol; Nešetřil, Jaroslav Graph homomorphisms. (English) Zbl 07636087 Beineke, Lowell W. (ed.) et al., Topics in algorithmic graph theory. Cambridge: Cambridge University Press. Encycl. Math. Appl. 178, 262-293 (2021). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Nešetřil}, Encycl. Math. Appl. 178, 262--293 (2021; Zbl 07636087) Full Text: DOI Link
Chandran, L. Sunil; Das, Sajal K.; Hell, Pavol; Padinhatteeri, Sajith; Pillai, Raji R. Template-driven rainbow coloring of proper interval graphs. (English) Zbl 07497552 Mudgal, Apurva (ed.) et al., Algorithms and discrete applied mathematics. 7th international conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021. Proceedings. Lect. Notes Comput. Sci. 12601, 452-470 (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{L. S. Chandran} et al., Lect. Notes Comput. Sci. 12601, 452--470 (2021; Zbl 07497552) Full Text: DOI
Feder, Tomás; Hell, Pavol; Subi, Carlos Distance-two colourings of Barnette graphs. (English) Zbl 1458.05065 Eur. J. Comb. 91, Article ID 103210, 15 p. (2021). MSC: 05C15 05C12 68Q17 PDFBibTeX XMLCite \textit{T. Feder} et al., Eur. J. Comb. 91, Article ID 103210, 15 p. (2021; Zbl 1458.05065) Full Text: DOI arXiv
Bok, Jan; Brewster, Richard; Feder, Tomás; Hell, Pavol; Jedličková, Nikola List homomorphism problems for signed graphs. (English) Zbl 07559391 Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 20, 14 p. (2020). MSC: 68Qxx PDFBibTeX XMLCite \textit{J. Bok} et al., LIPIcs -- Leibniz Int. Proc. Inform. 170, Article 20, 14 p. (2020; Zbl 07559391) Full Text: DOI arXiv
Feder, Tomás; Hell, Pavol Complexity of correspondence \(H\)-colourings. (English) Zbl 1440.05150 Discrete Appl. Math. 281, 235-245 (2020). MSC: 05C60 05C15 68Q17 PDFBibTeX XMLCite \textit{T. Feder} and \textit{P. Hell}, Discrete Appl. Math. 281, 235--245 (2020; Zbl 1440.05150) Full Text: DOI arXiv
Hell, Pavol; Huang, Jing; McConnell, Ross M.; Rafiey, Arash Interval-like graphs and digraphs. (English) Zbl 1494.68195 Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 68, 13 p. (2018). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{P. Hell} et al., LIPIcs -- Leibniz Int. Proc. Inform. 117, Article 68, 13 p. (2018; Zbl 1494.68195) Full Text: DOI arXiv
Feder, Tomás; Hell, Pavol Correspondence homomorphisms to reflexive graphs. (English) Zbl 1383.05212 Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 62, 9-14 (2017). MSC: 05C60 05C15 68Q25 PDFBibTeX XMLCite \textit{T. Feder} and \textit{P. Hell}, Electron. Notes Discrete Math. 62, 9--14 (2017; Zbl 1383.05212) Full Text: DOI
Hell, Pavol; Huang, Shenwei Complexity of coloring graphs without paths and cycles. (English) Zbl 1350.05037 Discrete Appl. Math. 216, Part 1, 211-232 (2017). MSC: 05C15 05C38 68Q17 PDFBibTeX XMLCite \textit{P. Hell} and \textit{S. Huang}, Discrete Appl. Math. 216, Part 1, 211--232 (2017; Zbl 1350.05037) Full Text: DOI
Hell, Pavol; Nevisi, Mayssam Mohammadi Minimum cost homomorphisms with constrained costs. (English) Zbl 1476.68110 Dinh, Thang N. (ed.) et al., Computing and combinatorics. 22nd international conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2–4, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9797, 194-206 (2016). MSC: 68Q25 05C60 68Q17 68R10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{M. M. Nevisi}, Lect. Notes Comput. Sci. 9797, 194--206 (2016; Zbl 1476.68110) Full Text: DOI arXiv
Dalmau, Victor; Egri, Laszló; Hell, Pavol; Larose, Benoît; Rafiey, Arash Descriptive complexity of list H-coloring problems in logspace: a refined dichotomy. (English) Zbl 1401.68104 Proceedings of the 2015 30th annual ACM/IEEE symposium on logic in computer science, LICS 2015, Kyoto, Japan, July 6–10, 2015. Los Alamitos, CA: IEEE Computer Society (ISBN 978-1-4799-8875-4). 487-498 (2015). MSC: 68Q19 68Q25 PDFBibTeX XMLCite \textit{V. Dalmau} et al., in: Proceedings of the 2015 30th annual ACM/IEEE symposium on logic in computer science, LICS 2015, Kyoto, Japan, July 6--10, 2015. Los Alamitos, CA: IEEE Computer Society. 487--498 (2015; Zbl 1401.68104) Full Text: DOI
Francis, Mathew; Hell, Pavol; Stacho, Juraj Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm. (English) Zbl 1371.05244 Indyk, Piotr (ed.), Proceedings of the 26th annual ACM-SIAM symposium on discrete algorithms, SODA 2015, Portland, San Diego, CA, January 4–6, 2015. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-374-7; 978-1-61197-373-0/ebook). 1708-1727 (2015). MSC: 05C75 05C85 68Q25 68W05 PDFBibTeX XMLCite \textit{M. Francis} et al., in: Proceedings of the 26th annual ACM-SIAM symposium on discrete algorithms, SODA 2015, Portland, San Diego, CA, January 4--6, 2015. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1708--1727 (2015; Zbl 1371.05244) Full Text: DOI arXiv
Gu, Qianping (ed.); Hell, Pavol (ed.); Yang, Boting (ed.) Preface. (English) Zbl 1329.00206 Theor. Comput. Sci. 607, Part 1, 1 (2015). MSC: 00B25 68-06 PDFBibTeX XMLCite \textit{Q. Gu} (ed.) et al., Theor. Comput. Sci. 607, Part 1, 1 (2015; Zbl 1329.00206) Full Text: DOI
Gargano, Luisa; Hell, Pavol; Peters, Joseph G.; Vaccaro, Ugo Influence diffusion in social networks under time window constraints. (English) Zbl 1315.91056 Theor. Comput. Sci. 584, 53-66 (2015). MSC: 91D30 05C82 05C85 68Q17 PDFBibTeX XMLCite \textit{L. Gargano} et al., Theor. Comput. Sci. 584, 53--66 (2015; Zbl 1315.91056) Full Text: DOI arXiv
Egri, László; Hell, Pavol; Larose, Benoit; Rafiey, Arash Space complexity of list \(H\)-colouring: a dichotomy. (English) Zbl 1421.68073 Chekuri, Chandra (ed.), Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms, SODA 2014, Portland, OR, USA, January 5–7, 2014. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 349-365 (2014). MSC: 68Q25 05C15 68Q17 68R10 PDFBibTeX XMLCite \textit{L. Egri} et al., in: Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms, SODA 2014, Portland, OR, USA, January 5--7, 2014. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 349--365 (2014; Zbl 1421.68073) Full Text: DOI arXiv
Hell, Pavol; Mohar, Bojan; Rafiey, Arash Ordering without forbidden patterns. (English) Zbl 1425.05134 Schulz, Andreas S. (ed.) et al., Algorithms – ESA 2014. 22nd annual European symposium, Wrocław, Poland, September 8–10, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8737, 554-565 (2014). MSC: 05C75 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{P. Hell} et al., Lect. Notes Comput. Sci. 8737, 554--565 (2014; Zbl 1425.05134) Full Text: DOI arXiv
Hell, Pavol; Mishra, Aurosish \(H\)-coloring degree-bounded (acyclic) digraphs. (English) Zbl 1382.68112 Theor. Comput. Sci. 554, 40-49 (2014). MSC: 68Q25 05C15 05C20 05C85 68Q17 PDFBibTeX XMLCite \textit{P. Hell} and \textit{A. Mishra}, Theor. Comput. Sci. 554, 40--49 (2014; Zbl 1382.68112) Full Text: DOI
Gu, Qianping (ed.); Hell, Pavol (ed.); Yang, Boting (ed.) Algorithmic aspects in information and management. 10th international conference, AAIM 2014, Vancouver, BC, Canada, July 8–11, 2014. Proceedings. (English) Zbl 1309.68009 Lecture Notes in Computer Science 8546. Berlin: Springer (ISBN 978-3-319-07955-4/pbk). xvi, 342 p. (2014). MSC: 68-06 90-06 68Wxx 90Bxx 00B25 PDFBibTeX XMLCite \textit{Q. Gu} (ed.) et al., Algorithmic aspects in information and management. 10th international conference, AAIM 2014, Vancouver, BC, Canada, July 8--11, 2014. Proceedings. Berlin: Springer (2014; Zbl 1309.68009) Full Text: DOI
Chaplick, Steven; Hell, Pavol; Otachi, Yota; Saitoh, Toshiki; Uehara, Ryuhei Intersection dimension of bipartite graphs. (English) Zbl 1406.05084 Gopal, T. V. (ed.) et al., Theory and applications of models of computation. 11th annual conference, TAMC 2014, Chennai, India, April 11–13, 2014. Proceedings. Berlin: Springer (ISBN 978-3-319-06088-0/pbk). Lecture Notes in Computer Science 8402, 323-340 (2014). MSC: 05C75 05C62 68Q17 PDFBibTeX XMLCite \textit{S. Chaplick} et al., Lect. Notes Comput. Sci. 8402, 323--340 (2014; Zbl 1406.05084) Full Text: DOI
Hell, Pavol; Huang, Shenwei Complexity of coloring graphs without paths and cycles. (English) Zbl 1405.68140 Pardo, Alberto (ed.) et al., LATIN 2014: theoretical informatics. 11th Latin American symposium, Montevideo, Uruguay, March 31 – April 4, 2014. Proceedings. Berlin: Springer (ISBN 978-3-642-54422-4/pbk). Lecture Notes in Computer Science 8392, 538-549 (2014). MSC: 68Q25 05C15 68Q17 PDFBibTeX XMLCite \textit{P. Hell} and \textit{S. Huang}, Lect. Notes Comput. Sci. 8392, 538--549 (2014; Zbl 1405.68140) Full Text: DOI arXiv
Feder, Tomás; Hell, Pavol; Nekooei Rizi, Shekoofeh Obstructions to partitions of chordal graphs. (English) Zbl 1277.05137 Discrete Math. 313, No. 19, 1861-1871 (2013). MSC: 05C70 05C60 05C17 68Q17 68Q25 PDFBibTeX XMLCite \textit{T. Feder} et al., Discrete Math. 313, No. 19, 1861--1871 (2013; Zbl 1277.05137) Full Text: DOI
Hell, Pavol; Mishra, Aurosish Small \(H\)-coloring problems for bounded degree digraphs. (English) Zbl 1382.68111 Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 19th international conference, COCOON 2013, Hangzhou, China, June 21–23, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38767-8/pbk). Lecture Notes in Computer Science 7936, 579-590 (2013). MSC: 68Q25 05C15 PDFBibTeX XMLCite \textit{P. Hell} and \textit{A. Mishra}, Lect. Notes Comput. Sci. 7936, 579--590 (2013; Zbl 1382.68111) Full Text: DOI arXiv
Hell, Pavol; Hermann, Miki; Nevisi, Mayssam Mohammadi Counting partitions of graphs. (English) Zbl 1260.68176 Chao, Kun-Mao (ed.) et al., Algorithms and computation. 23rd international symposium, ISAAC 2012, Taipei, Taiwan, December 19–21, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-35260-7/pbk). Lecture Notes in Computer Science 7676, 227-236 (2012). MSC: 68Q25 05C70 68Q17 PDFBibTeX XMLCite \textit{P. Hell} et al., Lect. Notes Comput. Sci. 7676, 227--236 (2012; Zbl 1260.68176) Full Text: DOI
Hell, Pavol; Mastrolilli, Monaldo; Nevisi, Mayssam Mohammadi; Rafiey, Arash Approximation of minimum cost homomorphisms. (English) Zbl 1365.05203 Epstein, Leah (ed.) et al., Algorithms – ESA 2012. 20th annual European symposium, Ljubljana, Slovenia, September 10–12, 2012. Proceeding. Berlin: Springer (ISBN 978-3-642-33089-6/pbk). Lecture Notes in Computer Science 7501, 587-598 (2012). MSC: 05C60 05C62 05C85 68W20 68W25 PDFBibTeX XMLCite \textit{P. Hell} et al., Lect. Notes Comput. Sci. 7501, 587--598 (2012; Zbl 1365.05203) Full Text: DOI
Hell, Pavol; Rafiey, Arash The dichotomy of list homomorphisms for digraphs. (English) Zbl 1376.68067 Randall, Dana (ed.), Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1703-1713 (2011). MSC: 68Q25 05C20 68P05 68R10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{A. Rafiey}, in: Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23--25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1703--1713 (2011; Zbl 1376.68067) Full Text: Link
Groshaus, Marina; Hell, Pavol; Klein, Sulamita; Nogueira, Loana Tito; Protti, Fabio Cycle transversals in bounded degree graphs. (English) Zbl 1283.68155 Discrete Math. Theor. Comput. Sci. 13, No. 1, 45-66 (2011). MSC: 68Q17 68W25 05C85 05C38 PDFBibTeX XMLCite \textit{M. Groshaus} et al., Discrete Math. Theor. Comput. Sci. 13, No. 1, 45--66 (2011; Zbl 1283.68155) Full Text: Link
Feder, Tomás; Hell, Pavol; Jonsson, Peter; Krokhin, Andrei; Nordh, Gustav Retractions to pseudoforests. (English) Zbl 1215.05063 SIAM J. Discrete Math. 24, No. 1, 101-112 (2010). MSC: 05C15 08A70 68R10 PDFBibTeX XMLCite \textit{T. Feder} et al., SIAM J. Discrete Math. 24, No. 1, 101--112 (2010; Zbl 1215.05063) Full Text: DOI
Coury, Michael D.; Hell, Pavol; Kratochvíl, Jan; Vyskočil, Tomáš Faithful representations of graphs by islands in the extended grid. (English) Zbl 1283.68269 López-Ortiz, Alejandro (ed.), LATIN 2010: Theoretical informatics. 9th Latin American symposium, Oaxaca, Mexico, April 19–23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-12199-9/pbk). Lecture Notes in Computer Science 6034, 131-142 (2010). MSC: 68R10 PDFBibTeX XMLCite \textit{M. D. Coury} et al., Lect. Notes Comput. Sci. 6034, 131--142 (2010; Zbl 1283.68269) Full Text: DOI
Hell, Pavol; Kirkpatrick, David Linear-time certifying algorithms for near-graphical sequences. (English) Zbl 1185.05135 Discrete Math. 309, No. 18, 5703-5713 (2009). MSC: 05C85 05C70 05C07 68R10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{D. Kirkpatrick}, Discrete Math. 309, No. 18, 5703--5713 (2009; Zbl 1185.05135) Full Text: DOI
Feder, Tomas; Hell, Pavol; Huang, Jing Extension problems with degree bounds. (English) Zbl 1177.05037 Discrete Appl. Math. 157, No. 7, 1592-1599 (2009). MSC: 05C15 05C85 68Q25 PDFBibTeX XMLCite \textit{T. Feder} et al., Discrete Appl. Math. 157, No. 7, 1592--1599 (2009; Zbl 1177.05037) Full Text: DOI
Hell, Pavol; Nešetřil, Jaroslav Colouring, constraint satisfaction, and complexity. (English) Zbl 1302.68251 Comput. Sci. Rev. 2, No. 3, 143-163 (2008). MSC: 68T20 05C15 68Q25 68-02 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Nešetřil}, Comput. Sci. Rev. 2, No. 3, 143--163 (2008; Zbl 1302.68251) Full Text: DOI
Brewster, Richard C.; Feder, Tomas; Hell, Pavol; Huang, Jing; Macgillivray, Gary Near-unanimity functions and varieties of reflexive graphs. (English) Zbl 1200.05217 SIAM J. Discrete Math. 22, No. 3, 938-960 (2008). MSC: 05C85 68Q10 68W25 PDFBibTeX XMLCite \textit{R. C. Brewster} et al., SIAM J. Discrete Math. 22, No. 3, 938--960 (2008; Zbl 1200.05217) Full Text: DOI
Ekim, Tınaz; Hell, Pavol; Stacho, Juraj; De Werra, Dominique Polarity of chordal graphs. (English) Zbl 1163.05051 Discrete Appl. Math. 156, No. 13, 2469-2479 (2008). MSC: 05C85 68N30 05C35 PDFBibTeX XMLCite \textit{T. Ekim} et al., Discrete Appl. Math. 156, No. 13, 2469--2479 (2008; Zbl 1163.05051) Full Text: DOI
Hell, Pavol; Raspaud, André; Stacho, Juraj On injective colourings of chordal graphs. (English) Zbl 1136.68463 Laber, Eduardo Sany (ed.) et al., LATIN 2008: Theoretical informatics. 8th Latin American symposium, Búzios, Brazil, April 7–11, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78772-3/pbk). Lecture Notes in Computer Science 4957, 520-530 (2008). MSC: 68R10 05C15 68Q17 68Q25 PDFBibTeX XMLCite \textit{P. Hell} et al., Lect. Notes Comput. Sci. 4957, 520--530 (2008; Zbl 1136.68463) Full Text: DOI
Gupta, Arvind; Hell, Pavol; Karimi, Mehdi; Rafiey, Arash Minimum cost homomorphisms to reflexive digraphs. (English) Zbl 1136.68462 Laber, Eduardo Sany (ed.) et al., LATIN 2008: Theoretical informatics. 8th Latin American symposium, Búzios, Brazil, April 7–11, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78772-3/pbk). Lecture Notes in Computer Science 4957, 182-193 (2008). MSC: 68R10 05C20 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{A. Gupta} et al., Lect. Notes Comput. Sci. 4957, 182--193 (2008; Zbl 1136.68462) Full Text: DOI arXiv
Feder, Tomás; Hell, Pavol; Huang, Jing The structure of bi-arc trees. (English) Zbl 1110.05093 Discrete Math. 307, No. 3-5, 393-401 (2007). MSC: 05C85 05C75 05C05 68R10 PDFBibTeX XMLCite \textit{T. Feder} et al., Discrete Math. 307, No. 3--5, 393--401 (2007; Zbl 1110.05093) Full Text: DOI
Feder, Tomás; Hell, Pavol; Huang, Jing List homomorphisms of graphs with bounded degrees. (English) Zbl 1111.05035 Discrete Math. 307, No. 3-5, 386-392 (2007). MSC: 05C15 05C85 68R10 PDFBibTeX XMLCite \textit{T. Feder} et al., Discrete Math. 307, No. 3--5, 386--392 (2007; Zbl 1111.05035) Full Text: DOI
Feder, Tomás; Hell, Pavol; Tucker-Nally, Kim Digraph matrix partitions and trigraph homomorphisms. (English) Zbl 1106.05060 Discrete Appl. Math. 154, No. 17, 2458-2469 (2006). MSC: 05C50 05C20 05C15 68R10 PDFBibTeX XMLCite \textit{T. Feder} et al., Discrete Appl. Math. 154, No. 17, 2458--2469 (2006; Zbl 1106.05060) Full Text: DOI
Feder, Tomás; Hell, Pavol Matrix partitions of perfect graphs. (English) Zbl 1143.05035 Discrete Math. 306, No. 19-20, 2450-2460 (2006). Reviewer: Bert Randerath (Köln) MSC: 05C17 05C15 68R10 05C85 05C50 PDFBibTeX XMLCite \textit{T. Feder} and \textit{P. Hell}, Discrete Math. 306, No. 19--20, 2450--2460 (2006; Zbl 1143.05035) Full Text: DOI
Feder, Tomás; Hell, Pavol Full constraint satisfaction problems. (English) Zbl 1111.68115 SIAM J. Comput. 36, No. 1, 230-246 (2006). MSC: 68T20 68Q15 68Q17 PDFBibTeX XMLCite \textit{T. Feder} and \textit{P. Hell}, SIAM J. Comput. 36, No. 1, 230--246 (2006; Zbl 1111.68115) Full Text: DOI
Feder, Tomás; Hell, Pavol; Král, Daniel; Sgall, Jiří Two algorithms for general list matrix partitions. (English) Zbl 1297.68091 Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23–25, 2005. New York, NY: ACM Press (ISBN 0-89871-585-7). 870-876 (2005). MSC: 68Q25 05C70 05C85 PDFBibTeX XMLCite \textit{T. Feder} et al., in: Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23--25, 2005. New York, NY: ACM Press. 870--876 (2005; Zbl 1297.68091)
Feder, Tomás; Hell, Pavol; Klein, Sulamita; Nogueira, Loana Tito; Protti, Fábio List matrix partitions of chordal graphs. (English) Zbl 1084.05026 Theor. Comput. Sci. 349, No. 1, 52-66 (2005). MSC: 05C15 05C70 68Q25 68R10 PDFBibTeX XMLCite \textit{T. Feder} et al., Theor. Comput. Sci. 349, No. 1, 52--66 (2005; Zbl 1084.05026) Full Text: DOI
Hell, Pavol; Huang, Jing Certifying LexBFS recognition algorithms for proper interval graphs and proper interval bigraphs. (English) Zbl 1069.05056 SIAM J. Discrete Math. 18, No. 3, 554-570 (2005). MSC: 05C62 05C85 68R10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Huang}, SIAM J. Discrete Math. 18, No. 3, 554--570 (2005; Zbl 1069.05056) Full Text: DOI
Feder, Tomás; Hell, Pavol; Klein, Sulamita; Nogueira, Loana Tito; Protti, Fábio List partitions of chordal graphs. (English) Zbl 1196.05060 Farach-Colton, Martin (ed.), LATIN 2004: Theoretical informatics. 6th Latin American symposium, Buenos Aires, Argentina, April 5–8, 2004. Proceedings. Berlin: Springer (ISBN 3-540-21258-2/pbk). Lecture Notes in Computer Science 2976, 100-108 (2004). MSC: 05C69 68Q17 68Q25 PDFBibTeX XMLCite \textit{T. Feder} et al., Lect. Notes Comput. Sci. 2976, 100--108 (2004; Zbl 1196.05060) Full Text: DOI
Hell, Pavol; Nešetřil, Jaroslav Counting list homomorphisms for graphs with bounded degrees. (English) Zbl 1059.05049 Nešetřil, J. (ed.) et al., Graphs, morphisms and statistical physics. Proceedings of the workshop held at Rutgers University, Piscataway, NJ, USA, March 19–21, 2001. Providence, RI: American Mathematical Society (AMS) (ISBN 0-8218-3551-3/hbk). DIMACS. Series in Discrete Mathematics and Theoretical Computer Science 63, 105-112 (2004). Reviewer: Ian M. Wanless (Darwin) MSC: 05C15 05C85 68R10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Nešetřil}, DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 63, 105--112 (2004; Zbl 1059.05049)
Feder, Tomás; Hell, Pavol; Mohar, Bojan Acyclic homomorphisms and circular colorings of digraphs. (English) Zbl 1034.05022 SIAM J. Discrete Math. 17, No. 1, 161-169 (2003). Reviewer: Stanislav Jendrol’ (Košice) MSC: 05C15 05C20 68Q17 PDFBibTeX XMLCite \textit{T. Feder} et al., SIAM J. Discrete Math. 17, No. 1, 161--169 (2003; Zbl 1034.05022) Full Text: DOI
Feder, Tomas; Hell, Pavol; Klein, Sulamita; Motwani, Rajeev List partitions. (English) Zbl 1029.05143 SIAM J. Discrete Math. 16, No. 3, 449-478 (2003). MSC: 05C85 05C15 05C17 68Q25 PDFBibTeX XMLCite \textit{T. Feder} et al., SIAM J. Discrete Math. 16, No. 3, 449--478 (2003; Zbl 1029.05143) Full Text: DOI
Comellas, F.; Hell, P. Broadcasting in generalized chordal rings. (English) Zbl 1031.68012 Networks 42, No. 3, 123-134 (2003). MSC: 68M10 68R10 PDFBibTeX XMLCite \textit{F. Comellas} and \textit{P. Hell}, Networks 42, No. 3, 123--134 (2003; Zbl 1031.68012) Full Text: DOI
Hell, Pavol Algorithmic aspects of graph homomorphisms. (English) Zbl 1035.05089 Wensley, C. D. (ed.), Surveys in combinatorics, 2003. Proceedings of the 19th British combinatorial conference, University of Wales, Bangor, UK, June 29–July 04, 2003. Cambridge: Cambridge University Press (ISBN 0-521-54012-7/pbk). Lond. Math. Soc. Lect. Note Ser. 307, 239-276 (2003). Reviewer: Andreas Brandstädt (Rostock) MSC: 05C85 05C15 68R05 PDFBibTeX XMLCite \textit{P. Hell}, Lond. Math. Soc. Lect. Note Ser. 307, 239--276 (2003; Zbl 1035.05089)
Feder, Tomas; Hell, Pavol; Huang, Jing Bi-arc graphs and the complexity of list homomorphisms. (English) Zbl 1057.05033 J. Graph Theory 42, No. 1, 61-80 (2003). Reviewer: Marek Kubale (Gdańsk) MSC: 05C15 05C85 68R10 PDFBibTeX XMLCite \textit{T. Feder} et al., J. Graph Theory 42, No. 1, 61--80 (2003; Zbl 1057.05033) Full Text: DOI
Gargano, Luisa; Hell, Pavol; Stacho, Ladislav; Vaccaro, Ugo Spanning trees with bounded number of branch vertices. (English) Zbl 1056.68587 Widmayer, Peter (ed.) et al., Automata, languages and programming. 29th international colloquium, ICALP 2002, Málaga, Spain, July 8–13, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43864-5). Lect. Notes Comput. Sci. 2380, 355-365 (2002). MSC: 68T20 68M10 90C27 90C35 68R10 PDFBibTeX XMLCite \textit{L. Gargano} et al., Lect. Notes Comput. Sci. 2380, 355--365 (2002; Zbl 1056.68587) Full Text: Link
Hell, P.; Rosenfeld, M. Antidirected Hamiltonian paths between specified vertices of a tournament. (English) Zbl 0996.05062 Discrete Appl. Math. 117, No. 1-3, 87-98 (2002). Reviewer: J.W.Moon (Edmonton) MSC: 05C20 05C38 05C45 68R10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{M. Rosenfeld}, Discrete Appl. Math. 117, No. 1--3, 87--98 (2002; Zbl 0996.05062) Full Text: DOI
Hell, Pavol; Shamir, Ron; Sharan, Roded A Fully dynamic algorithm for recognizing and representing proper interval graphs. (English) Zbl 0992.68065 SIAM J. Comput. 31, No. 1, 289-305 (2001). MSC: 68Q25 68W40 05C85 PDFBibTeX XMLCite \textit{P. Hell} et al., SIAM J. Comput. 31, No. 1, 289--305 (2001; Zbl 0992.68065) Full Text: DOI
Brewster, Richard C.; Hell, Pavol On homomorphisms to edge-coloured cycles. (English) Zbl 1412.05064 Rusu, Irena (ed.), Proceedings of the 6th international conference on graph theory, Marseille-Luminy, France, August 28–September 2, 2000. Amsterdam: Elsevier. Electron. Notes Discrete Math. 5, 46-49 (2000). MSC: 05C15 05C60 68Q17 PDFBibTeX XMLCite \textit{R. C. Brewster} and \textit{P. Hell}, Electron. Notes Discrete Math. 5, 46--49 (2000; Zbl 1412.05064) Full Text: Link
Galluccio, Anna; Hell, Pavol; Nešetřil, Jaroslav The complexity of \(H\)-colouring of bounded degree graphs. (English) Zbl 0956.05036 Discrete Math. 222, No. 1-3, 101-109 (2000). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C15 68R10 PDFBibTeX XMLCite \textit{A. Galluccio} et al., Discrete Math. 222, No. 1--3, 101--109 (2000; Zbl 0956.05036) Full Text: DOI
Feder, Tomas; Hell, Pavol; Klein, Sulamita; Motwani, Rajeev Complexity of graph partition problems. (English) Zbl 1345.68171 Vitter, Jeffrey Scott (ed.) et al., Proceedings of the 31st annual ACM symposium on theory of computing, STOC 1999. Atlanta, GA, USA, May 1–4, 1999. New York, NY: ACM, Association for Computing Machinery (ISBN 1-58113-067-8). 464-472 (1999). MSC: 68Q25 05C69 05C70 05C85 68Q17 PDFBibTeX XMLCite \textit{T. Feder} et al., in: Proceedings of the 31st annual ACM symposium on theory of computing, STOC 1999. Atlanta, GA, USA, May 1--4, 1999. New York, NY: ACM, Association for Computing Machinery. 464--472 (1999; Zbl 1345.68171) Full Text: DOI
Feder, Tomas; Hell, Pavol; Jing, Huang List homomorphisms and circular arc graphs. (English) Zbl 0985.05048 Combinatorica 19, No. 4, 487-505 (1999). Reviewer: Péter Komjáth (Budapest) MSC: 05C85 05C75 05C15 68R10 PDFBibTeX XMLCite \textit{T. Feder} et al., Combinatorica 19, No. 4, 487--505 (1999; Zbl 0985.05048) Full Text: DOI
Fellows, M.; Hell, P.; Seyffarth, K. Constructions of large planar networks with given degree and diameter. (English) Zbl 1002.90008 Networks 32, No. 4, 275-281 (1998). MSC: 90B10 68M10 90C35 PDFBibTeX XMLCite \textit{M. Fellows} et al., Networks 32, No. 4, 275--281 (1998; Zbl 1002.90008) Full Text: DOI
Haddad, L.; Hell, P.; Mendelsohn, E. On the complexity of coloring areflexive \(h\)-ary relations with given permutation group. (English) Zbl 0964.05023 Ars Comb. 48, 111-128 (1998). Reviewer: Jan Kratochvíl (Praha) MSC: 05C15 05C85 68Q25 PDFBibTeX XMLCite \textit{L. Haddad} et al., Ars Comb. 48, 111--128 (1998; Zbl 0964.05023)
Feder, Tomas; Hell, Pavol List homomorphisms to reflexive graphs. (English) Zbl 0904.05078 J. Comb. Theory, Ser. B 72, No. 2, 236-250 (1998). Reviewer: P.Hell (Burnaby, BC) MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{T. Feder} and \textit{P. Hell}, J. Comb. Theory, Ser. B 72, No. 2, 236--250 (1998; Zbl 0904.05078) Full Text: DOI
Hell, Pavol; Huang, Jing Two remarks on circular arc graphs. (English) Zbl 0868.05043 Graphs Comb. 13, No. 1, 65-72 (1997). Reviewer: Ma Zhongfan (Beijing) MSC: 05C75 68R10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Huang}, Graphs Comb. 13, No. 1, 65--72 (1997; Zbl 0868.05043) Full Text: DOI
Gargano, Luisa; Hell, Pavol; Perennes, Stephane Colouring paths in directed symmetric trees with applications to WDM routing. (English) Zbl 1401.68245 Degano, Pierpaolo (ed.) et al., Automata, languages and programming. 24th international colloquium, ICALP ’97, Bologna, Italy, July 7–11, 1997. Proceedings. Berlin: Springer-Verlag (ISBN 978-3-540-63165-1/pbk; 978-3-540-69194-5/ebook). Lecture Notes in Computer Science 1256, 505-515 (1997). MSC: 68R10 05C15 05C85 90B18 PDFBibTeX XMLCite \textit{L. Gargano} et al., Lect. Notes Comput. Sci. 1256, 505--515 (1997; Zbl 1401.68245) Full Text: DOI
Brewster, Richard C.; Hell, Pavol; MacGillivray, Gary The complexity of restricted graph homomorphisms. (English) Zbl 0873.68167 Discrete Math. 167-168, 145-154 (1997). MSC: 68R10 68Q25 05C15 05C20 PDFBibTeX XMLCite \textit{R. C. Brewster} et al., Discrete Math. 167--168, 145--154 (1997; Zbl 0873.68167) Full Text: DOI
Hell, Pavol; Nešetřil, Jaroslav; Zhu, Xuding Complexity of tree homomorphisms. (English) Zbl 0868.05018 Discrete Appl. Math. 70, No. 1, 23-36 (1996). Reviewer: P.Kirschenhofer (Leoben) MSC: 05C05 68R10 05C15 05C38 PDFBibTeX XMLCite \textit{P. Hell} et al., Discrete Appl. Math. 70, No. 1, 23--36 (1996; Zbl 0868.05018) Full Text: DOI Link
Hell, Pavol; Kirkpatrick, David; Li, Brenda Rounding in symmetric matrices and undirected graphs. (English) Zbl 0920.05062 Discrete Appl. Math. 70, No. 1, 1-21 (1996). MSC: 05C85 05C50 05C70 68R10 05C38 05C05 PDFBibTeX XMLCite \textit{P. Hell} et al., Discrete Appl. Math. 70, No. 1, 1--21 (1996; Zbl 0920.05062) Full Text: DOI
Hell, Pavol; Nešetřil, Jaroslav; Zhu, Xuding Duality and polynomial testing of tree homomorphisms. (English) Zbl 0877.05055 Trans. Am. Math. Soc. 348, No. 4, 1281-1297 (1996). MSC: 05C85 68Q25 05C15 05C20 PDFBibTeX XMLCite \textit{P. Hell} et al., Trans. Am. Math. Soc. 348, No. 4, 1281--1297 (1996; Zbl 0877.05055) Full Text: DOI
Bhattacharya, Binay; Hell, Pavol; Huang, Jing A linear algorithm for maximum weight cliques in proper circular arc graphs. (English) Zbl 0854.05092 SIAM J. Discrete Math. 9, No. 2, 274-289 (1996). Reviewer: M.Kubale (Gdańsk) MSC: 05C85 68Q25 68R10 PDFBibTeX XMLCite \textit{B. Bhattacharya} et al., SIAM J. Discrete Math. 9, No. 2, 274--289 (1996; Zbl 0854.05092) Full Text: DOI
Deng, Xiaotie; Hell, Pavol; Huang, Jing Linear-time representation algorithms for proper circular-arc graphs and proper interval graphs. (English) Zbl 0858.05094 SIAM J. Comput. 25, No. 2, 390-403 (1996). Reviewer: J.Bang-Jensen (Odense) MSC: 05C85 05C75 05C20 68Q25 PDFBibTeX XMLCite \textit{X. Deng} et al., SIAM J. Comput. 25, No. 2, 390--403 (1996; Zbl 0858.05094) Full Text: DOI
Hell, Pavol; Huang, Jing Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs. (English) Zbl 0835.05064 J. Graph Theory 20, No. 3, 361-374 (1995). Reviewer: H.Bodlaender (Utrecht) MSC: 05C85 05C20 68R10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Huang}, J. Graph Theory 20, No. 3, 361--374 (1995; Zbl 0835.05064) Full Text: DOI
Bang-Jensen, Jørgen; Hell, Pavol; MacGillivray, Gary Hereditarily hard \(H\)-colouring problems. (English) Zbl 0816.68090 Discrete Math. 138, No. 1-3, 75-92 (1995). MSC: 68R10 68Q25 05C15 05C20 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Discrete Math. 138, No. 1--3, 75--92 (1995; Zbl 0816.68090) Full Text: DOI
Bang-Jensen, Jørgen; Hell, Pavol; Huang, Jing Optimal recognition of local tournaments. (English) Zbl 0836.05035 Congr. Numerantium 100, 141-146 (1994). MSC: 05C20 68R10 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Congr. Numerantium 100, 141--146 (1994; Zbl 0836.05035)
de Werra, Dominique; Hell, P.; Kameda, T.; Katoh, N.; Solot, Ph.; Yamashita, M. Graph endpoint coloring and distributed processing. (English) Zbl 0772.68008 Networks 23, No. 2, 93-98 (1993). MSC: 68M10 68R10 68W15 PDFBibTeX XMLCite \textit{D. de Werra} et al., Networks 23, No. 2, 93--98 (1993; Zbl 0772.68008) Full Text: DOI
Hell, P.; Kirkpatrick, D. G. Algorithms for degree constrained graph factors of minimum deficiency. (English) Zbl 0764.68118 J. Algorithms 14, No. 1, 115-138 (1993). MSC: 68R10 05C70 05C35 90B10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{D. G. Kirkpatrick}, J. Algorithms 14, No. 1, 115--138 (1993; Zbl 0764.68118) Full Text: DOI
Bermond, Jean-Claude; Hell, Pavol; Liestman, Arthur L.; Peters, Joseph G. Sparse broadcast graphs. (English) Zbl 0764.05042 Discrete Appl. Math. 36, No. 2, 97-130 (1992). Reviewer: S.Stahl (Lawrence) MSC: 05C35 05C90 68Q85 94C15 PDFBibTeX XMLCite \textit{J.-C. Bermond} et al., Discrete Appl. Math. 36, No. 2, 97--130 (1992; Zbl 0764.05042) Full Text: DOI
Hell, Pavol; Nešetřil, Jaroslav The core of a graph. (English) Zbl 0803.68080 Discrete Math. 109, No. 1-3, 117-126 (1992). Reviewer: J.Bang-Jensen (Odense) MSC: 68R10 68Q25 05C75 05C15 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Nešetřil}, Discrete Math. 109, No. 1--3, 117--126 (1992; Zbl 0803.68080) Full Text: DOI
Bang-Jensen, Jørgen; Hell, Pavol; MacGillivray, Gary On the complexity of colouring by superdigraphs of bipartite graphs. (English) Zbl 0783.05047 Discrete Math. 109, No. 1-3, 27-44 (1992). MSC: 05C15 68Q25 05C20 68R10 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Discrete Math. 109, No. 1--3, 27--44 (1992; Zbl 0783.05047) Full Text: DOI
Bermond, Jean-Claude; Hell, Pavol; Liestman, Arthur L.; Peters, Joseph G. Broadcasting in bounded degree graphs. (English) Zbl 0753.68007 SIAM J. Discrete Math. 5, No. 1, 10-24 (1992). Reviewer: R.C.Entringer (Albuquerque) MSC: 68M10 05C99 68R10 94A05 PDFBibTeX XMLCite \textit{J.-C. Bermond} et al., SIAM J. Discrete Math. 5, No. 1, 10--24 (1992; Zbl 0753.68007) Full Text: DOI Link
Hell, Pavol (ed.) Computational combinatorics. (Papers presented at the Workshop on Computational Combinatorics held at Simon Fraser University, Burnaby, British Columbia (Canada), July 20 - August 14, 1987). (English) Zbl 0694.00027 Discrete Applied Mathematics. Combinatorial Algorithms, Operations Research and Computer Science. Vol. 27, No. 1-2. Special Issue. Amsterdam: North-Holland (Elsevier Science Publishers B.V.). VII, 185 p. (1990). MSC: 00Bxx 68-06 05-06 PDFBibTeX XML
Hell, Pavol; Nešetřil, Jaroslav On the complexity of H-coloring. (English) Zbl 0639.05023 J. Comb. Theory, Ser. B 48, No. 1, 92-110 (1990). Reviewer: P.Hell MSC: 05C15 68R10 68Q25 PDFBibTeX XMLCite \textit{P. Hell} and \textit{J. Nešetřil}, J. Comb. Theory, Ser. B 48, No. 1, 92--110 (1990; Zbl 0639.05023) Full Text: DOI
Hell, Pavol; Bang-Jensen, Jørgen; Huang, Jing Local tournaments and proper circular arc graphs. (English) Zbl 0819.68088 Asano, Tetsuo (ed.) et al., Algorithms. International Symposium SIGAL ’90, Tokyo, Japan, August 16-18, 1990. Proceedings. Berlin etc.: Springer-Verlag. Lect. Notes Comput. Sci. 450, 101-108 (1990). MSC: 68R10 PDFBibTeX XMLCite \textit{P. Hell} et al., Lect. Notes Comput. Sci. 450, 101--108 (1990; Zbl 0819.68088)
Bang-Jensen, Jørgen; Hell, Pavol; MacGillivray, Gary The complexity of colouring by semicomplete digraphs. (English) Zbl 0678.05018 SIAM J. Discrete Math. 1, No. 3, 281-298 (1988). MSC: 05C15 05C20 68Q25 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., SIAM J. Discrete Math. 1, No. 3, 281--298 (1988; Zbl 0678.05018) Full Text: DOI
Hell, Pavol; Nešetřil, Jaroslav On the complexity of H-coloring. (English) Zbl 0622.05025 Combinatorics, graph theory, and computing, Proc. 17th Southeast. Conf., Boca Raton/Fl. 1986, Congr. Numerantium 55, 284 (1986). Reviewer: G.Slutzki MSC: 05C15 68R10 PDFBibTeX XML
Hell, P.; Kirkpatrick, D. G. Packings by complete bipartite graphs. (English) Zbl 0597.05050 SIAM J. Algebraic Discrete Methods 7, 199-209 (1986). MSC: 05C70 68R10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{D. G. Kirkpatrick}, SIAM J. Algebraic Discrete Methods 7, 199--209 (1986; Zbl 0597.05050) Full Text: DOI
Farber, Martin; Hahn, Geňa; Hell, Pavol; Miller, Donald Concerning the achromatic number of graphs. (English) Zbl 0577.05032 J. Comb. Theory, Ser. B 40, 21-39 (1986). MSC: 05C15 05C35 68R10 68Q25 PDFBibTeX XMLCite \textit{M. Farber} et al., J. Comb. Theory, Ser. B 40, 21--39 (1986; Zbl 0577.05032) Full Text: DOI
Bollobás, Béla; Hell, Pavol Sorting and graphs. (English) Zbl 0579.68041 Graphs and order. The role of graphs in the theory of ordered sets and its applications, Proc. NATO Adv. Study Inst., Banff/Can. 1984, NATO ASI Ser., Ser. C 147, 169-184 (1985). Reviewer: N.Alon MSC: 68P10 05C35 68R10 05A15 PDFBibTeX XML
Farber, Martin; Hahn, Geňa; Hell, Pavol; Miller, Donald Concerning the achromatic number of graphs. (English) Zbl 0554.05028 J. Comb. Theory, Ser. B (to appear). MSC: 05C15 05C35 68R10 68Q25 PDFBibTeX XML
Graham, R. L.; Hell, Pavol On the history of the minimum spanning tree problem. (English) Zbl 0998.68003 Ann. Hist. Comput. 7, No. 1, 43-57 (1985). MSC: 68-03 01A60 90-03 90B10 PDFBibTeX XMLCite \textit{R. L. Graham} and \textit{P. Hell}, Ann. Hist. Comput. 7, No. 1, 43--57 (1985; Zbl 0998.68003) Full Text: DOI
Hell, P.; Kirkpatrick, D. G. Packings by cliques and by finite families of graphs. (English) Zbl 0582.05046 Discrete Math. 49, 45-59 (1984). MSC: 05C70 05C35 68R10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{D. G. Kirkpatrick}, Discrete Math. 49, 45--59 (1984; Zbl 0582.05046) Full Text: DOI Backlinks: MO
Hell, Pavol; Rosenfeld, Moshe The complexity of finding generalized paths in tournaments. (English) Zbl 0532.68069 J. Algorithms 4, 303-309 (1983). MSC: 68R10 68Q25 05C38 PDFBibTeX XMLCite \textit{P. Hell} and \textit{M. Rosenfeld}, J. Algorithms 4, 303--309 (1983; Zbl 0532.68069) Full Text: DOI
Kirkpatrick, D. G.; Hell, P. On the complexity of general graph factor problems. (English) Zbl 0525.68023 SIAM J. Comput. 12, 601-609 (1983). MSC: 68Q25 68R10 05C70 PDFBibTeX XMLCite \textit{D. G. Kirkpatrick} and \textit{P. Hell}, SIAM J. Comput. 12, 601--609 (1983; Zbl 0525.68023) Full Text: DOI
Haeggkvist, R.; Hell, P. Sorting and merging in rounds. (English) Zbl 0493.68060 SIAM J. Algebraic Discrete Methods 3, 465-473 (1982). MSC: 68P10 68U20 PDFBibTeX XMLCite \textit{R. Haeggkvist} and \textit{P. Hell}, SIAM J. Algebraic Discrete Methods 3, 465--473 (1982; Zbl 0493.68060) Full Text: DOI
Hell, P.; Kirkpatrick, D. G. Scheduling, matching, and coloring. (English) Zbl 0474.05054 Algebraic methods in graph theory, Vol. I, Conf. Szeged 1978, Colloq. Math. Soc. Janos Bolyai 25, 273-279 (1981). MSC: 05C99 03D15 68Q25 05-03 PDFBibTeX XML
Häggkvist, Roland; Hell, Pavol Parallel sorting with constant time for comparisons. (English) Zbl 0461.68062 SIAM J. Comput. 10, 465-472 (1981). MSC: 68P10 68R10 PDFBibTeX XMLCite \textit{R. Häggkvist} and \textit{P. Hell}, SIAM J. Comput. 10, 465--472 (1981; Zbl 0461.68062) Full Text: DOI
Hell, P.; Kirkpatrick, D. G. On generalized matching problems. (English) Zbl 0454.68077 Inf. Process. Lett. 12, 33-35 (1981). MSC: 68R10 05C70 68Q25 PDFBibTeX XMLCite \textit{P. Hell} and \textit{D. G. Kirkpatrick}, Inf. Process. Lett. 12, 33--35 (1981; Zbl 0454.68077) Full Text: DOI