Zhao, Xiaojun; Deng, Qingying; Li, Xiaowang Relating \(g\)-good-neighbor connectivity and \(g\)-good-neighbor diagnosability of strong digraph network. (English) Zbl 07809105 Theor. Comput. Sci. 982, Article ID 114258, 9 p. (2024). MSC: 68Qxx PDFBibTeX XMLCite \textit{X. Zhao} et al., Theor. Comput. Sci. 982, Article ID 114258, 9 p. (2024; Zbl 07809105) Full Text: DOI
Galby, Esther; Marx, Dániel; Schepper, Philipp; Sharma, Roohani; Tale, Prafullkumar Parameterized complexity of multicut in weighted trees. (English) Zbl 07748733 Theor. Comput. Sci. 978, Article ID 114174, 17 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{E. Galby} et al., Theor. Comput. Sci. 978, Article ID 114174, 17 p. (2023; Zbl 07748733) Full Text: DOI
Bang-Jensen, J.; Bessy, S.; Gonçalves, D.; Picasarri-Arrieta, L. Complexity of some arc-partition problems for digraphs. (English) Zbl 07597584 Theor. Comput. Sci. 928, 167-182 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Theor. Comput. Sci. 928, 167--182 (2022; Zbl 07597584) Full Text: DOI
Li, Luyi; Li, Xueliang Digraphs with proper connection number two. (English) Zbl 1504.05109 Theor. Comput. Sci. 873, 64-75 (2021). MSC: 05C20 05C15 05C40 68Q25 PDFBibTeX XMLCite \textit{L. Li} and \textit{X. Li}, Theor. Comput. Sci. 873, 64--75 (2021; Zbl 1504.05109) Full Text: DOI
Bang-Jensen, J.; Bellitto, T.; Lochet, W.; Yeo, A. The directed 2-linkage problem with length constraints. (English) Zbl 1445.68146 Theor. Comput. Sci. 814, 69-73 (2020). Reviewer: K. Subramani (Morgantown) MSC: 68R10 05C20 05C38 68Q25 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Theor. Comput. Sci. 814, 69--73 (2020; Zbl 1445.68146) Full Text: DOI arXiv Link
Bang-Jensen, J.; Knudsen, Kristine V. K.; Saurabh, Saket; Zehavi, Meirav The parameterized complexity landscape of finding 2-partitions of digraphs. (English) Zbl 1434.68205 Theor. Comput. Sci. 795, 108-114 (2019). MSC: 68Q27 68R10 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Theor. Comput. Sci. 795, 108--114 (2019; Zbl 1434.68205) Full Text: DOI
González Hermosillo de la Maza, Sebastián; Hernández-Cruz, César On the complexity of the \(k\)-kernel problem on cyclically \(k\)-partite digraphs. (English) Zbl 1431.68094 Theor. Comput. Sci. 795, 9-19 (2019). MSC: 68R10 68Q17 PDFBibTeX XMLCite \textit{S. González Hermosillo de la Maza} and \textit{C. Hernández-Cruz}, Theor. Comput. Sci. 795, 9--19 (2019; Zbl 1431.68094) Full Text: DOI
Bang-Jensen, Jørgen; Christiansen, Tilde My Degree constrained 2-partitions of semicomplete digraphs. (English) Zbl 1401.05129 Theor. Comput. Sci. 746, 112-123 (2018). MSC: 05C20 05C70 68Q25 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{T. M. Christiansen}, Theor. Comput. Sci. 746, 112--123 (2018; Zbl 1401.05129) Full Text: DOI
Lin, Shangwei; Zhou, Chanchan; Li, Chunfang Arc fault tolerance of Kautz digraphs. (English) Zbl 1371.68215 Theor. Comput. Sci. 687, 1-10 (2017). MSC: 68R10 05C20 05C40 68M15 PDFBibTeX XMLCite \textit{S. Lin} et al., Theor. Comput. Sci. 687, 1--10 (2017; Zbl 1371.68215) Full Text: DOI
Bang-Jensen, J.; Cohen, Nathann; Havet, Frédéric Finding good 2-partitions of digraphs. II. Enumerable properties. (English) Zbl 1345.68168 Theor. Comput. Sci. 640, 1-19 (2016). MSC: 68Q25 05C20 05C70 68Q17 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Theor. Comput. Sci. 640, 1--19 (2016; Zbl 1345.68168) Full Text: DOI
Bang-Jensen, J.; Havet, Frédéric Finding good 2-partitions of digraphs. I. Hereditary properties. (English) Zbl 1342.68150 Theor. Comput. Sci. 636, 85-94 (2016). MSC: 68Q25 05C20 05C70 68Q17 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{F. Havet}, Theor. Comput. Sci. 636, 85--94 (2016; Zbl 1342.68150) Full Text: DOI
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
Milanič, Martin; Rizzi, Romeo; Tomescu, Alexandru I. Set graphs. II. Complexity of set graph recognition and similar problems. (English) Zbl 1298.05146 Theor. Comput. Sci. 547, 70-81 (2014). MSC: 05C20 05C62 05C69 68Q17 68Q25 PDFBibTeX XMLCite \textit{M. Milanič} et al., Theor. Comput. Sci. 547, 70--81 (2014; Zbl 1298.05146) Full Text: DOI arXiv
Bang-Jensen, Jørgen; Bessy, Stéphane (Arc-)disjoint flows in networks. (English) Zbl 1290.90080 Theor. Comput. Sci. 526, 28-40 (2014). MSC: 90C35 05C20 05C45 68Q17 68W05 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{S. Bessy}, Theor. Comput. Sci. 526, 28--40 (2014; Zbl 1290.90080) Full Text: DOI
Berwanger, Dietmar; Grädel, Erich; Kaiser, Łukasz; Rabinovich, Roman Entanglement and the complexity of directed graphs. (English) Zbl 1256.05086 Theor. Comput. Sci. 463, 2-25 (2012). MSC: 05C20 05C57 05C85 91A43 91A24 PDFBibTeX XMLCite \textit{D. Berwanger} et al., Theor. Comput. Sci. 463, 2--25 (2012; Zbl 1256.05086) Full Text: DOI
Guo, Longkun; Shen, Hong On the complexity of the edge-disjoint min-min problem in planar digraphs. (English) Zbl 1242.68114 Theor. Comput. Sci. 432, 58-63 (2012). MSC: 68Q17 05C20 68R10 05C10 PDFBibTeX XMLCite \textit{L. Guo} and \textit{H. Shen}, Theor. Comput. Sci. 432, 58--63 (2012; Zbl 1242.68114) Full Text: DOI
Ortner, Ronald Online regret bounds for Markov decision processes with deterministic transitions. (English) Zbl 1198.90388 Theor. Comput. Sci. 411, No. 29-30, 2684-2695 (2010). MSC: 90C40 60E15 PDFBibTeX XMLCite \textit{R. Ortner}, Theor. Comput. Sci. 411, No. 29--30, 2684--2695 (2010; Zbl 1198.90388) Full Text: DOI
Betzler, Nadja; Uhlmann, Johannes Parameterized complexity of candidate control in elections and related digraph problems. (English) Zbl 1176.68138 Theor. Comput. Sci. 410, No. 52, 5425-5442 (2009). MSC: 68R10 05C20 68Q17 68Q25 91B12 PDFBibTeX XMLCite \textit{N. Betzler} and \textit{J. Uhlmann}, Theor. Comput. Sci. 410, No. 52, 5425--5442 (2009; Zbl 1176.68138) Full Text: DOI
Wang, Guanghui; Liu, Guizhen Paths, cycles and circular colorings in digraphs. (English) Zbl 1168.05028 Theor. Comput. Sci. 410, No. 21-23, 1982-1985 (2009). MSC: 05C20 05C15 05C38 PDFBibTeX XMLCite \textit{G. Wang} and \textit{G. Liu}, Theor. Comput. Sci. 410, No. 21--23, 1982--1985 (2009; Zbl 1168.05028) Full Text: DOI
Yang, Boting; Cao, Yi Monotonicity in digraph search problems. (English) Zbl 1153.68041 Theor. Comput. Sci. 407, No. 1-3, 532-544 (2008). MSC: 68R10 05C20 68Q17 68T20 91A24 91A43 PDFBibTeX XMLCite \textit{B. Yang} and \textit{Y. Cao}, Theor. Comput. Sci. 407, No. 1--3, 532--544 (2008; Zbl 1153.68041) Full Text: DOI
Azriel, D.; Berend, D. On a question of Leiss regarding the Hanoi Tower problem. (English) Zbl 1140.68074 Theor. Comput. Sci. 369, No. 1-3, 377-383 (2006). MSC: 68W40 05C20 91A46 PDFBibTeX XMLCite \textit{D. Azriel} and \textit{D. Berend}, Theor. Comput. Sci. 369, No. 1--3, 377--383 (2006; Zbl 1140.68074) Full Text: DOI
Aguiló, F.; Arteaga, D.; Diego, I. A symbolical algorithm on additive basis and double-loop networks. (English) Zbl 1060.05087 Theor. Comput. Sci. 319, No. 1-3, 423-439 (2004). MSC: 05C85 05C20 PDFBibTeX XMLCite \textit{F. Aguiló} et al., Theor. Comput. Sci. 319, No. 1--3, 423--439 (2004; Zbl 1060.05087) Full Text: DOI
Ceccherini-Silberstein, Tullio; Woess, Wolfgang Growth-sensitivity of context-free languages. (English) Zbl 1059.68056 Theor. Comput. Sci. 307, No. 1, 103-116 (2003). MSC: 68Q45 PDFBibTeX XMLCite \textit{T. Ceccherini-Silberstein} and \textit{W. Woess}, Theor. Comput. Sci. 307, No. 1, 103--116 (2003; Zbl 1059.68056) Full Text: DOI
Cheng, Xiaoyan; Du, Xiufeng; Min, Manki; Ngo, Hung Q.; Ruan, Lu; Sun, Jianhua; Wu, Weili Super link-connectivity of iterated line digraphs. (English) Zbl 1045.68019 Theor. Comput. Sci. 304, No. 1-3, 461-469 (2003). MSC: 68M10 PDFBibTeX XMLCite \textit{X. Cheng} et al., Theor. Comput. Sci. 304, No. 1--3, 461--469 (2003; Zbl 1045.68019) Full Text: DOI
Wan, Peng-Jun Conflict-Free channel set assignment for an optical cluster interconnection network based on rotator digraphs. (English) Zbl 0916.68006 Theor. Comput. Sci. 207, No. 1, 193-201 (1998). MSC: 68M10 PDFBibTeX XMLCite \textit{P.-J. Wan}, Theor. Comput. Sci. 207, No. 1, 193--201 (1998; Zbl 0916.68006) Full Text: DOI
Park, Jung-Heum; Chwa, Kyung-Yong On the construction of regular minimal broadcast digraphs. (English) Zbl 0795.68151 Theor. Comput. Sci. 124, No. 2, 329-342 (1994). MSC: 68R10 05C20 68M10 94C15 PDFBibTeX XMLCite \textit{J.-H. Park} and \textit{K.-Y. Chwa}, Theor. Comput. Sci. 124, No. 2, 329--342 (1994; Zbl 0795.68151) Full Text: DOI
Fraenkel, A. S.; Simonson, S. Geography. (English) Zbl 0799.90145 Theor. Comput. Sci. 110, No. 1, 197-214 (1993). MSC: 91A43 91A46 91A05 PDFBibTeX XMLCite \textit{A. S. Fraenkel} and \textit{S. Simonson}, Theor. Comput. Sci. 110, No. 1, 197--214 (1993; Zbl 0799.90145) Full Text: DOI
Meshulam, Roy A geometric construction of a superconcentrator of depth 2. (English) Zbl 0546.05029 Theor. Comput. Sci. 32, 215-219 (1984). Reviewer: J.Schwarze MSC: 05C20 05C35 PDFBibTeX XMLCite \textit{R. Meshulam}, Theor. Comput. Sci. 32, 215--219 (1984; Zbl 0546.05029) Full Text: DOI