Brandstädt, Andreas; Mosca, Raffaele Combining decomposition approaches for the maximum weight stable set problem. (English) Zbl 07687175 Theor. Comput. Sci. 960, Article ID 113914, 16 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. Brandstädt} and \textit{R. Mosca}, Theor. Comput. Sci. 960, Article ID 113914, 16 p. (2023; Zbl 07687175) Full Text: DOI
Brandstädt, Andreas; Mosca, Raffaele On efficient domination for some classes of \(H\)-free chordal graphs. (English) Zbl 1440.05158 Discrete Appl. Math. 281, 81-95 (2020). MSC: 05C69 68Q17 PDFBibTeX XMLCite \textit{A. Brandstädt} and \textit{R. Mosca}, Discrete Appl. Math. 281, 81--95 (2020; Zbl 1440.05158) Full Text: DOI arXiv
Bacsó, Gábor; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Tuza, Zsolt; van Leeuwen, Erik Jan Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs. (English) Zbl 1428.05291 Algorithmica 81, No. 2, 421-438 (2019). MSC: 05C85 05C69 05C35 68Q25 PDFBibTeX XMLCite \textit{G. Bacsó} et al., Algorithmica 81, No. 2, 421--438 (2019; Zbl 1428.05291) Full Text: DOI arXiv
Brandstädt, Andreas; Giakoumakis, Vassilis; Milanič, Martin Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs. (English) Zbl 1398.05148 Discrete Appl. Math. 250, 130-144 (2018). MSC: 05C69 PDFBibTeX XMLCite \textit{A. Brandstädt} et al., Discrete Appl. Math. 250, 130--144 (2018; Zbl 1398.05148) Full Text: DOI
Abrishami, G.; Rahbarnia, F. Polynomial-time algorithm for weighted efficient domination problem on diameter three planar graphs. (English) Zbl 1478.68204 Inf. Process. Lett. 140, 25-29 (2018). MSC: 68R10 05C10 05C69 05C85 68Q25 68W40 PDFBibTeX XMLCite \textit{G. Abrishami} and \textit{F. Rahbarnia}, Inf. Process. Lett. 140, 25--29 (2018; Zbl 1478.68204) Full Text: DOI
Brandstädt, Andreas; Mosca, Raffaele Maximum weight independent sets for (\(P_7\), triangle)-free graphs in polynomial time. (English) Zbl 1377.05185 Discrete Appl. Math. 236, 57-65 (2018). MSC: 05C85 05C69 05C22 68W40 PDFBibTeX XMLCite \textit{A. Brandstädt} and \textit{R. Mosca}, Discrete Appl. Math. 236, 57--65 (2018; Zbl 1377.05185) Full Text: DOI arXiv
Brandstädt, Andreas; Eschen, Elaine M.; Friese, Erik; Karthick, T. Efficient domination for classes of \(P_6\)-free graphs. (English) Zbl 1476.05151 Discrete Appl. Math. 223, 15-27 (2017). Reviewer: S. Venkitesh (Mumbai) MSC: 05C69 05C85 PDFBibTeX XMLCite \textit{A. Brandstädt} et al., Discrete Appl. Math. 223, 15--27 (2017; Zbl 1476.05151) Full Text: DOI arXiv
Brandstädt, Andreas; Mosca, Raffaele On efficient domination for some classes of \(H\)-free chordal graphs. (English) Zbl 1383.05229 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, 57-62 (2017). MSC: 05C69 PDFBibTeX XMLCite \textit{A. Brandstädt} and \textit{R. Mosca}, Electron. Notes Discrete Math. 62, 57--62 (2017; Zbl 1383.05229) Full Text: DOI
Karthick, T. Independent sets in some classes of \(S_{i,j,k}\)-free graphs. (English) Zbl 1407.90326 J. Comb. Optim. 34, No. 2, 612-630 (2017). MSC: 90C35 90C27 PDFBibTeX XMLCite \textit{T. Karthick}, J. Comb. Optim. 34, No. 2, 612--630 (2017; Zbl 1407.90326) Full Text: DOI
Brause, Christoph A subexponential-time algorithm for the maximum independent set problem in \(P_t\)-free graphs. (English) Zbl 1369.05159 Discrete Appl. Math. 231, 113-118 (2017). MSC: 05C69 05C85 PDFBibTeX XMLCite \textit{C. Brause}, Discrete Appl. Math. 231, 113--118 (2017; Zbl 1369.05159) Full Text: DOI
Munaro, Andrea Boundary classes for graph problems involving non-local properties. (English) Zbl 1372.68142 Theor. Comput. Sci. 692, 46-71 (2017). MSC: 68Q25 05C45 05C69 05C70 68Q17 PDFBibTeX XMLCite \textit{A. Munaro}, Theor. Comput. Sci. 692, 46--71 (2017; Zbl 1372.68142) Full Text: DOI
Brandstädt, Andreas; Mosca, Raffaele Weighted efficient domination for \(P_5\)-free and \(P_6\)-free graphs. (English) Zbl 1352.05143 SIAM J. Discrete Math. 30, No. 4, 2288-2303 (2016). MSC: 05C69 05C70 05C85 05C22 68Q17 PDFBibTeX XMLCite \textit{A. Brandstädt} and \textit{R. Mosca}, SIAM J. Discrete Math. 30, No. 4, 2288--2303 (2016; Zbl 1352.05143) Full Text: DOI
Maffray, Frédéric; Pastor, Lucas The maximum weight stable set problem in (\(P_6\), bull)-free graphs. (English) Zbl 1417.05223 Heggernes, Pinar (ed.), Graph-theoretic concepts in computer science. 42nd international workshop, WG 2016, Istanbul, Turkey, June 22–24, 2016. Revised selected papers. Berlin: Springer. Lect. Notes Comput. Sci. 9941, 85-96 (2016). MSC: 05C85 05C75 68Q25 PDFBibTeX XMLCite \textit{F. Maffray} and \textit{L. Pastor}, Lect. Notes Comput. Sci. 9941, 85--96 (2016; Zbl 1417.05223) Full Text: DOI arXiv
Brandstädt, Andreas; Mosca, Raffaele Weighted efficient domination for \(P_6\)-free and for \(P_5\)-free graphs. (English) Zbl 1417.05151 Heggernes, Pinar (ed.), Graph-theoretic concepts in computer science. 42nd international workshop, WG 2016, Istanbul, Turkey, June 22–24, 2016. Revised selected papers. Berlin: Springer. Lect. Notes Comput. Sci. 9941, 38-49 (2016). MSC: 05C69 05C22 05C70 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{A. Brandstädt} and \textit{R. Mosca}, Lect. Notes Comput. Sci. 9941, 38--49 (2016; Zbl 1417.05151) Full Text: DOI
Karthick, T. Structure of squares and efficient domination in graph classes. (English) Zbl 1353.05094 Theor. Comput. Sci. 652, 38-46 (2016). MSC: 05C69 05C85 PDFBibTeX XMLCite \textit{T. Karthick}, Theor. Comput. Sci. 652, 38--46 (2016; Zbl 1353.05094) Full Text: DOI
Brandstädt, Andreas; Eschen, Elaine M.; Friese, Erik Efficient domination for some subclasses of \(P_6\)-free graphs in polynomial time. (English) Zbl 1417.05150 Mayr, Ernst W. (ed.), Graph-theoretic concepts in computer science. 41st international workshop, WG 2015, Garching, Germany, June 17–19, 2015. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 9224, 78-89 (2016). MSC: 05C69 05C85 68Q25 PDFBibTeX XMLCite \textit{A. Brandstädt} et al., Lect. Notes Comput. Sci. 9224, 78--89 (2016; Zbl 1417.05150) Full Text: DOI
Karthick, T.; Maffray, Frédéric Weighted independent sets in classes of \(P_6\)-free graphs. (English) Zbl 1339.05170 Discrete Appl. Math. 209, 217-226 (2016). MSC: 05C22 05C69 68Q17 PDFBibTeX XMLCite \textit{T. Karthick} and \textit{F. Maffray}, Discrete Appl. Math. 209, 217--226 (2016; Zbl 1339.05170) Full Text: DOI
Brandstädt, Andreas; Karthick, T. Weighted efficient domination in two subclasses of \(P_6\)-free graphs. (English) Zbl 1329.05225 Discrete Appl. Math. 201, 38-46 (2016). MSC: 05C69 05C85 PDFBibTeX XMLCite \textit{A. Brandstädt} and \textit{T. Karthick}, Discrete Appl. Math. 201, 38--46 (2016; Zbl 1329.05225) Full Text: DOI
Karthick, T. Weighted independent sets in a subclass of \(P_6\)-free graphs. (English) Zbl 1329.05140 Discrete Math. 339, No. 4, 1412-1418 (2016). MSC: 05C22 05C85 05C69 PDFBibTeX XMLCite \textit{T. Karthick}, Discrete Math. 339, No. 4, 1412--1418 (2016; Zbl 1329.05140) Full Text: DOI arXiv