Bok, Jan; Fiala, Jiří; Jedličková, Nikola; Kratochvíl, Jan; Rzążewski, Paweł List covering of regular multigraphs with semi-edges. (English) Zbl 07823158 Algorithmica 86, No. 3, 782-807 (2024). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{J. Bok} et al., Algorithmica 86, No. 3, 782--807 (2024; Zbl 07823158) Full Text: DOI
Bok, Jan; Fiala, Jiří; Jedličková, Nikola; Kratochvíl, Jan; Rzążewski, Paweł List covering of regular multigraphs. (English) Zbl 07577702 Bazgan, Cristina (ed.) et al., Combinatorial algorithms. 33rd international workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13270, 228-242 (2022). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{J. Bok} et al., Lect. Notes Comput. Sci. 13270, 228--242 (2022; Zbl 07577702) Full Text: DOI arXiv
Bok, Jan; Fiala, Jiří; Jedličková, Nikola; Kratochvíl, Jan; Seifrtová, Michaela Computational complexity of covering disconnected multigraphs. (English) Zbl 07530226 Bampis, Evripidis (ed.) et al., Fundamentals of computation theory. 23rd international symposium, FCT 2021, Athens, Greece, September 12–15, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12867, 85-99 (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{J. Bok} et al., Lect. Notes Comput. Sci. 12867, 85--99 (2021; Zbl 07530226) Full Text: DOI
Fiala, Jiří; Klavík, Pavel; Kratochvíl, Jan; Nedela, Roman 3-connected reduction for regular graph covers. (English) Zbl 1393.05207 Eur. J. Comb. 73, 170-210 (2018). MSC: 05C70 PDFBibTeX XMLCite \textit{J. Fiala} et al., Eur. J. Comb. 73, 170--210 (2018; Zbl 1393.05207) Full Text: DOI arXiv
Chaplick, Steven; Fiala, Jiří; van ’t Hof, Pim; Paulusma, Daniël; Tesař, Marek Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree. (English) Zbl 1430.68122 Theor. Comput. Sci. 590, 86-95 (2015). MSC: 68Q25 05C60 68Q17 PDFBibTeX XMLCite \textit{S. Chaplick} et al., Theor. Comput. Sci. 590, 86--95 (2015; Zbl 1430.68122) Full Text: DOI arXiv
Fiala, Jiří; Paulusma, Daniël Comparing universal covers in polynomial time. (English) Zbl 1205.68260 Theory Comput. Syst. 46, No. 4, 620-635 (2010). MSC: 68R10 05C70 05C85 90C59 PDFBibTeX XMLCite \textit{J. Fiala} and \textit{D. Paulusma}, Theory Comput. Syst. 46, No. 4, 620--635 (2010; Zbl 1205.68260) Full Text: DOI Link
Fiala, Jiří; Golovach, Petr A. Complexity of the packing coloring problem for trees. (English) Zbl 1219.05185 Discrete Appl. Math. 158, No. 7, 771-778 (2010). Reviewer: Haiko Müller (Leeds) MSC: 05C85 05C05 05C15 68R10 PDFBibTeX XMLCite \textit{J. Fiala} and \textit{P. A. Golovach}, Discrete Appl. Math. 158, No. 7, 771--778 (2010; Zbl 1219.05185) Full Text: DOI
Fiala, Jiří; Klavžar, Sandi; Lidický, Bernard The packing chromatic number of infinite product graphs. (English) Zbl 1207.05165 Eur. J. Comb. 30, No. 5, 1101-1113 (2009). MSC: 05C76 PDFBibTeX XMLCite \textit{J. Fiala} et al., Eur. J. Comb. 30, No. 5, 1101--1113 (2009; Zbl 1207.05165) Full Text: DOI
Fiala, Jiří; Kratochvíl, Jan Locally constrained graph homomorphisms – structure, complexity, and applications. (English) Zbl 1302.05122 Comput. Sci. Rev. 2, No. 2, 97-111 (2008). MSC: 05C60 05C15 05C70 05C85 68R10 05-02 PDFBibTeX XMLCite \textit{J. Fiala} and \textit{J. Kratochvíl}, Comput. Sci. Rev. 2, No. 2, 97--111 (2008; Zbl 1302.05122) Full Text: DOI Backlinks: MO
Fiala, Jiří; Golovach, Petr A. Complexity of the packing coloring problem for trees. (English) Zbl 1202.05025 Broersma, Hajo (ed.) et al., Graph-theoretic concepts in computer science. 34th international workshop, WG 2008, Durham, UK, June 30–July 2, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-92247-6/pbk). Lecture Notes in Computer Science 5344, 134-145 (2008). MSC: 05C05 05C70 05C85 05C12 68Q17 68Q25 PDFBibTeX XMLCite \textit{J. Fiala} and \textit{P. A. Golovach}, Lect. Notes Comput. Sci. 5344, 134--145 (2008; Zbl 1202.05025) Full Text: DOI
Fiala, Jiří; Paulusma, Daniël Comparing universal covers in polynomial time. (English) Zbl 1142.68456 Hirsch, Edward A. (ed.) et al., Computer science – theory and applications. Third international computer science symposium in Russia, CSR 2008 Moscow, Russia, June 7–12, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79708-1/pbk). Lecture Notes in Computer Science 5010, 158-167 (2008). MSC: 68R10 05C70 05C85 90C59 PDFBibTeX XMLCite \textit{J. Fiala} and \textit{D. Paulusma}, Lect. Notes Comput. Sci. 5010, 158--167 (2008; Zbl 1142.68456) Full Text: DOI Link
Fiala, Jiří; Paulusma, Daniël; Telle, Jan Arne Locally constrained graph homomorphisms and equitable partitions. (English) Zbl 1205.05141 Eur. J. Comb. 29, No. 4, 850-880 (2008). MSC: 05C50 05C07 05C60 05C70 05C85 68Q25 PDFBibTeX XMLCite \textit{J. Fiala} et al., Eur. J. Comb. 29, No. 4, 850--880 (2008; Zbl 1205.05141) Full Text: DOI Link
Fiala, Jiří; Kratochvíl, Jan; Pór, Attila On the computational complexity of partial covers of theta graphs. (English) Zbl 1138.05061 Discrete Appl. Math. 156, No. 7, 1143-1149 (2008). MSC: 05C75 PDFBibTeX XMLCite \textit{J. Fiala} et al., Discrete Appl. Math. 156, No. 7, 1143--1149 (2008; Zbl 1138.05061) Full Text: DOI
Fiala, Jiří; Maxová, Jana Cantor–Bernstein type theorem for locally constrained graph homomorphisms. (English) Zbl 1107.05066 Eur. J. Comb. 27, No. 7, 1111-1116 (2006). Reviewer: Thomas Andreae (Hamburg) MSC: 05C60 68R10 90B10 PDFBibTeX XMLCite \textit{J. Fiala} and \textit{J. Maxová}, Eur. J. Comb. 27, No. 7, 1111--1116 (2006; Zbl 1107.05066) Full Text: DOI
Fiala, Jiří; Paulusma, Daniël A complete complexity classification of the role assignment problem. (English) Zbl 1124.91055 Theor. Comput. Sci. 349, No. 1, 67-81 (2005). MSC: 91D30 68Q17 68Q25 05C70 05C15 03D15 PDFBibTeX XMLCite \textit{J. Fiala} and \textit{D. Paulusma}, Theor. Comput. Sci. 349, No. 1, 67--81 (2005; Zbl 1124.91055) Full Text: DOI
Fiala, Jiří; Kloks, Ton; Kratochvíl, Jan Fixed-parameter complexity of \(\lambda\)-labelings. (English) Zbl 0982.05085 Discrete Appl. Math. 113, No. 1, 59-72 (2001). Reviewer: Hans L.Bodlaender (Utrecht) MSC: 05C78 68R10 05C90 05C15 PDFBibTeX XMLCite \textit{J. Fiala} et al., Discrete Appl. Math. 113, No. 1, 59--72 (2001; Zbl 0982.05085) Full Text: DOI