Taletskii, D. S. On the number of minimum total dominating sets in trees. (Russian. English summary) Zbl 1521.05147 Diskretn. Anal. Issled. Oper. 30, No. 1, 110-129 (2023). MSC: 05C69 05C35 05C05 PDFBibTeX XMLCite \textit{D. S. Taletskii}, Diskretn. Anal. Issled. Oper. 30, No. 1, 110--129 (2023; Zbl 1521.05147) Full Text: DOI MNR
Sorochan, S. V. New cases of polynomial solvability of the independent set problem for graphs with forbidden triods. (Russian. English summary) Zbl 1521.05146 Diskretn. Anal. Issled. Oper. 30, No. 1, 85-109 (2023). MSC: 05C69 05C85 05C75 05C05 68R10 68Q17 PDFBibTeX XMLCite \textit{S. V. Sorochan}, Diskretn. Anal. Issled. Oper. 30, No. 1, 85--109 (2023; Zbl 1521.05146) Full Text: DOI MNR
Dakhno, G. S.; Malyshev, D. S. On a countable family of boundary graph classes for the dominating set problem. (Russian. English summary) Zbl 1521.05168 Diskretn. Anal. Issled. Oper. 30, No. 1, 28-39 (2023). MSC: 05C75 05C69 68Q17 PDFBibTeX XMLCite \textit{G. S. Dakhno} and \textit{D. S. Malyshev}, Diskretn. Anal. Issled. Oper. 30, No. 1, 28--39 (2023; Zbl 1521.05168) Full Text: DOI MNR
Voroshilov, V. V. Complexity of the max cut problem with the minimal domination constraint. (Russian. English summary) Zbl 1506.68086 Diskretn. Anal. Issled. Oper. 29, No. 1, 5-17 (2022). MSC: 68R10 05C22 05C69 68Q25 90C35 PDFBibTeX XMLCite \textit{V. V. Voroshilov}, Diskretn. Anal. Issled. Oper. 29, No. 1, 5--17 (2022; Zbl 1506.68086) Full Text: DOI MNR
Voroshilov, Vladimir Vladimirovich A maximum dicut in a digraph induced by a minimal dominating set. (Russian. English summary) Zbl 1493.05139 Diskretn. Anal. Issled. Oper. 27, No. 4, 5-20 (2020). MSC: 05C20 05C22 05C69 05C35 PDFBibTeX XMLCite \textit{V. V. Voroshilov}, Diskretn. Anal. Issled. Oper. 27, No. 4, 5--20 (2020; Zbl 1493.05139) Full Text: DOI MNR
Loverov, Yaroslav Anatol’evich; Orlovich, Yuriĭ Leonidovich NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs. (Russian. English summary) Zbl 1491.68080 Diskretn. Anal. Issled. Oper. 27, No. 2, 65-89 (2020). MSC: 68Q17 05C69 PDFBibTeX XMLCite \textit{Y. A. Loverov} and \textit{Y. L. Orlovich}, Diskretn. Anal. Issled. Oper. 27, No. 2, 65--89 (2020; Zbl 1491.68080) Full Text: DOI MNR
Taletskiĭ, D. S.; Malyshev, D. S. On trees of bounded degree with maximal number of greatest independent sets. (Russian, English) Zbl 1413.05185 Diskretn. Anal. Issled. Oper. 25, No. 2, 101-123 (2018); translation in J. Appl. Ind. Math. 12, No. 2, 369-381 (2018). MSC: 05C35 05C05 05C69 PDFBibTeX XMLCite \textit{D. S. Taletskiĭ} and \textit{D. S. Malyshev}, Diskretn. Anal. Issled. Oper. 25, No. 2, 101--123 (2018; Zbl 1413.05185); translation in J. Appl. Ind. Math. 12, No. 2, 369--381 (2018) Full Text: DOI
Alekseev, V. E.; Sorochan, S. V. New cases of the polynomial solvability of the independent set problem for graphs with forbidden paths. (Russian, English) Zbl 1413.05273 Diskretn. Anal. Issled. Oper. 25, No. 2, 5-18 (2018); translation in J. Appl. Ind. Math. 12, No. 2, 213-219 (2018). MSC: 05C69 05C85 68Q17 PDFBibTeX XMLCite \textit{V. E. Alekseev} and \textit{S. V. Sorochan}, Diskretn. Anal. Issled. Oper. 25, No. 2, 5--18 (2018; Zbl 1413.05273); translation in J. Appl. Ind. Math. 12, No. 2, 213--219 (2018) Full Text: DOI
Malyshev, D. S.; Sirotkin, D. V. Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs. (Russian, English) Zbl 1399.05174 Diskretn. Anal. Issled. Oper. 24, No. 3, 35-60 (2017); translation in J. Appl. Ind. Math. 11, No. 3, 400-414 (2017). MSC: 05C69 05C10 05C85 05C38 05C12 PDFBibTeX XMLCite \textit{D. S. Malyshev} and \textit{D. V. Sirotkin}, Diskretn. Anal. Issled. Oper. 24, No. 3, 35--60 (2017; Zbl 1399.05174); translation in J. Appl. Ind. Math. 11, No. 3, 400--414 (2017) Full Text: DOI
Irzhavskiĭ, P. A.; Kartynnik, Yu. A.; Orlovich, Yu. L. 1-triangle graphs and perfect neighborhood sets. (Russian, English) Zbl 1374.05170 Diskretn. Anal. Issled. Oper. 24, No. 1, 56-80 (2017); translation in J. Appl. Ind. Math. 11, No. 1, 58-69 (2017). MSC: 05C69 05C85 68Q25 PDFBibTeX XMLCite \textit{P. A. Irzhavskiĭ} et al., Diskretn. Anal. Issled. Oper. 24, No. 1, 56--80 (2017; Zbl 1374.05170); translation in J. Appl. Ind. Math. 11, No. 1, 58--69 (2017) Full Text: DOI
Alekseev, V. E.; Zakharova, D. V. Independent sets in graphs without subtrees with many leaves. (Russian, English) Zbl 1349.05247 Diskretn. Anal. Issled. Oper. 23, No. 1, 5-16 (2016); translation in J. Appl. Ind. Math. 10, No. 1, 1-6 (2016). MSC: 05C69 PDFBibTeX XMLCite \textit{V. E. Alekseev} and \textit{D. V. Zakharova}, Diskretn. Anal. Issled. Oper. 23, No. 1, 5--16 (2016; Zbl 1349.05247); translation in J. Appl. Ind. Math. 10, No. 1, 1--6 (2016) Full Text: DOI
Daĭnyak, A. B.; Kurnosov, A. D. On an extremal inverse problem in graph theory. (Russian, English) Zbl 1349.05254 Diskretn. Anal. Issled. Oper. 22, No. 1, 19-31 (2015); translation in J. Appl. Ind. Math. 9, No. 2, 157-164 (2015). MSC: 05C69 PDFBibTeX XMLCite \textit{A. B. Daĭnyak} and \textit{A. D. Kurnosov}, Diskretn. Anal. Issled. Oper. 22, No. 1, 19--31 (2015; Zbl 1349.05254); translation in J. Appl. Ind. Math. 9, No. 2, 157--164 (2015) Full Text: DOI
Malyshev, D. S. Expanding operators for the independent set problem. (Russian, English) Zbl 1324.05143 Diskretn. Anal. Issled. Oper. 20, No. 2, 75-87 (2013); translation in J. Appl. Ind. Math. 7, No. 3, 412-419 (2013). MSC: 05C69 68Q17 05C40 PDFBibTeX XMLCite \textit{D. S. Malyshev}, Diskretn. Anal. Issled. Oper. 20, No. 2, 75--87 (2013; Zbl 1324.05143); translation in J. Appl. Ind. Math. 7, No. 3, 412--419 (2013) Full Text: DOI
Malyshev, D. S. Polynomial solvability of the independent set problem for one class of graphs with small diameter. (Russian) Zbl 1324.05142 Diskretn. Anal. Issled. Oper. 19, No. 4, 66-72 (2012). MSC: 05C69 PDFBibTeX XMLCite \textit{D. S. Malyshev}, Diskretn. Anal. Issled. Oper. 19, No. 4, 66--72 (2012; Zbl 1324.05142) Full Text: MNR
Malyshev, D. S. Polynomial solvability of the independent set problem in a class of graphs without induced simple paths and a cycle with five vertices and a big clique. (Russian) Zbl 1324.05141 Diskretn. Anal. Issled. Oper. 19, No. 3, 58-64 (2012). MSC: 05C69 PDFBibTeX XMLCite \textit{D. S. Malyshev}, Diskretn. Anal. Issled. Oper. 19, No. 3, 58--64 (2012; Zbl 1324.05141) Full Text: MNR
Valyuzhenich, A. A. Some properties of well-based sequences. (Russian) Zbl 1249.11038 Diskretn. Anal. Issled. Oper. 18, No. 1, 15-19 (2011). MSC: 11B75 05C69 PDFBibTeX XMLCite \textit{A. A. Valyuzhenich}, Diskretn. Anal. Issled. Oper. 18, No. 1, 15--19 (2011; Zbl 1249.11038)
Alekseev, V. E.; Zakharova, D. V. Independent sets in the graphs with bounded minors of the extended incidence matrix. (Russian) Zbl 1249.05276 Diskretn. Anal. Issled. Oper. 17, No. 1, 3-10 (2010). MSC: 05C69 PDFBibTeX XMLCite \textit{V. E. Alekseev} and \textit{D. V. Zakharova}, Diskretn. Anal. Issled. Oper. 17, No. 1, 3--10 (2010; Zbl 1249.05276)
Dajnyak, A. B. On the number of independent sets in the trees of a fixed diameter. (Russian) Zbl 1249.05281 Diskretn. Anal. Issled. Oper. 16, No. 2, 61-73 (2009). MSC: 05C69 05C05 PDFBibTeX XMLCite \textit{A. B. Dajnyak}, Diskretn. Anal. Issled. Oper. 16, No. 2, 61--73 (2009; Zbl 1249.05281)