Crespelle, Christophe; Drange, Pål Grønås; Fomin, Fedor V.; Golovach, Petr A survey of parameterized algorithms and the complexity of edge modification. (English) Zbl 07698754 Comput. Sci. Rev. 48, Article ID 100556, 31 p. (2023). MSC: 68-02 68-XX PDFBibTeX XMLCite \textit{C. Crespelle} et al., Comput. Sci. Rev. 48, Article ID 100556, 31 p. (2023; Zbl 07698754) Full Text: DOI arXiv
Blum, Johannes; Li, Ruoying; Storandt, Sabine Fission: practical algorithms for computing minimum balanced node separators. (English) Zbl 07711948 Discrete Math. Algorithms Appl. 14, No. 8, Article ID 2250048, 26 p. (2022). MSC: 68R10 PDFBibTeX XMLCite \textit{J. Blum} et al., Discrete Math. Algorithms Appl. 14, No. 8, Article ID 2250048, 26 p. (2022; Zbl 07711948) Full Text: DOI
Berberler, Murat Erşen Computational complexity of network vulnerability analysis. (English) Zbl 1514.05084 Acta Univ. Sapientiae, Inform. 14, No. 2, 199-207 (2022). MSC: 05C40 05C85 68M10 PDFBibTeX XMLCite \textit{M. E. Berberler}, Acta Univ. Sapientiae, Inform. 14, No. 2, 199--207 (2022; Zbl 1514.05084) Full Text: DOI
Markenzon, Lilian; Waga, Christina F. E. M. The scattering number of strictly chordal graphs: linear time determination. (English) Zbl 1490.05254 Graphs Comb. 38, No. 3, Paper No. 102, 14 p. (2022). MSC: 05C85 05C40 68Q25 PDFBibTeX XMLCite \textit{L. Markenzon} and \textit{C. F. E. M. Waga}, Graphs Comb. 38, No. 3, Paper No. 102, 14 p. (2022; Zbl 1490.05254) Full Text: DOI
Belmonte, Rémy; Hanaka, Tesshu; Katsikarelis, Ioannis; Lampis, Michael; Ono, Hirotaka; Otachi, Yota Parameterized complexity of safe set. (English) Zbl 1447.05200 J. Graph Algorithms Appl. 24, No. 3, 215-245 (2020). MSC: 05C99 05C85 68Q27 68R10 PDFBibTeX XMLCite \textit{R. Belmonte} et al., J. Graph Algorithms Appl. 24, No. 3, 215--245 (2020; Zbl 1447.05200) Full Text: DOI
Park, Jung-Heum; Lim, Hyeong-Seok Characterization of interval graphs that are unpaired 2-disjoint path coverable. (English) Zbl 1437.05200 Theor. Comput. Sci. 821, 71-86 (2020). MSC: 05C70 05C38 PDFBibTeX XMLCite \textit{J.-H. Park} and \textit{H.-S. Lim}, Theor. Comput. Sci. 821, 71--86 (2020; Zbl 1437.05200) Full Text: DOI
Markenzon, Lilian; Waga, Christina F. E. M. Toughness and Hamiltonicity of strictly chordal graphs. (English) Zbl 07770946 Int. Trans. Oper. Res. 26, No. 2, 725-731 (2019). MSC: 90-XX PDFBibTeX XMLCite \textit{L. Markenzon} and \textit{C. F. E. M. Waga}, Int. Trans. Oper. Res. 26, No. 2, 725--731 (2019; Zbl 07770946) Full Text: DOI
Yiğit, Esin; Berberler, Zeynep Nihan A note on the link residual closeness of graphs under join operation. (English) Zbl 1415.68161 Int. J. Found. Comput. Sci. 30, No. 3, 417-424 (2019). MSC: 68R10 05C82 68M15 PDFBibTeX XMLCite \textit{E. Yiğit} and \textit{Z. N. Berberler}, Int. J. Found. Comput. Sci. 30, No. 3, 417--424 (2019; Zbl 1415.68161) Full Text: DOI
Aytaç, Aysun; Berberler, Zeynep Nihan Odabaş Network robustness and residual closeness. (English) Zbl 1403.05152 RAIRO, Oper. Res. 52, No. 3, 839-847 (2018). MSC: 05C90 05C40 05C82 68M10 68M15 68R10 90B18 PDFBibTeX XMLCite \textit{A. Aytaç} and \textit{Z. N. O. Berberler}, RAIRO, Oper. Res. 52, No. 3, 839--847 (2018; Zbl 1403.05152) Full Text: DOI
Berberler, Zeynep Nihan; Yigit, Esin Link vulnerability in networks. (English) Zbl 1387.05242 Int. J. Found. Comput. Sci. 29, No. 3, 447-456 (2018). MSC: 05C82 90B10 PDFBibTeX XMLCite \textit{Z. N. Berberler} and \textit{E. Yigit}, Int. J. Found. Comput. Sci. 29, No. 3, 447--456 (2018; Zbl 1387.05242) Full Text: DOI
Abreu, N. M. M.; Markenzon, L. Vulnerability of subclasses of chordal graphs. (English) Zbl 1388.90115 Gouveia, Luís (ed.) et al., Proceedings of the 8th international network optimization conference (INOC 2017), Lisbon, Portugal, February 26–28, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 64, 55-63 (2018). MSC: 90C35 05C40 PDFBibTeX XMLCite \textit{N. M. M. Abreu} and \textit{L. Markenzon}, Electron. Notes Discrete Math. 64, 55--63 (2018; Zbl 1388.90115) Full Text: DOI
Drange, Pål Grønås; Dregi, Markus; van ’t Hof, Pim On the computational complexity of vertex integrity and component order connectivity. (English) Zbl 1355.68115 Algorithmica 76, No. 4, 1181-1202 (2016). MSC: 68Q25 05C22 05C85 PDFBibTeX XMLCite \textit{P. G. Drange} et al., Algorithmica 76, No. 4, 1181--1202 (2016; Zbl 1355.68115) Full Text: DOI arXiv
Broersma, Hajo; Fiala, Jiří; Golovach, Petr A.; Kaiser, Tomáš; Paulusma, Daniël; Proskurowski, Andrzej Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs. (English) Zbl 1316.05080 J. Graph Theory 79, No. 4, 282-299 (2015). MSC: 05C40 05C85 05C45 PDFBibTeX XMLCite \textit{H. Broersma} et al., J. Graph Theory 79, No. 4, 282--299 (2015; Zbl 1316.05080) Full Text: DOI arXiv Link
Bykova, V. V. Measures for graph integrity: a comparative survey. (Russian. English summary) Zbl 07310279 Prikl. Diskretn. Mat. 2014, No. 4(26), 96-111 (2014). MSC: 90-XX 05-XX PDFBibTeX XMLCite \textit{V. V. Bykova}, Prikl. Diskretn. Mat. 2014, No. 4(26), 96--111 (2014; Zbl 07310279) Full Text: MNR
Drange, Pål Grønås; Dregi, Markus Sortland; van’t Hof, Pim On the computational complexity of vertex integrity and component order connectivity. (English) Zbl 1352.68103 Ahn, Hee-Kap (ed.) et al., Algorithms and computation. 25th international symposium, ISAAC 2014, Jeonju, Korea, December 15–17, 2014. Proceedings. Cham: Springer (ISBN 978-3-319-13074-3/pbk; 978-3-319-13075-0/ebook). Lecture Notes in Computer Science 8889, 285-297 (2014). MSC: 68Q25 05C22 05C85 PDFBibTeX XMLCite \textit{P. G. Drange} et al., Lect. Notes Comput. Sci. 8889, 285--297 (2014; Zbl 1352.68103) Full Text: DOI arXiv
Ozeki, Kenta; Vrána, Petr 2-edge-Hamiltonian-connectedness of 4-connected plane graphs. (English) Zbl 1296.05116 Eur. J. Comb. 35, 432-448 (2014). MSC: 05C45 05C10 05C85 05C40 PDFBibTeX XMLCite \textit{K. Ozeki} and \textit{P. Vrána}, Eur. J. Comb. 35, 432--448 (2014; Zbl 1296.05116) Full Text: DOI
Belmonte, Rémy; Vatshelle, Martin Graph classes with structured neighborhoods and algorithmic applications. (English) Zbl 1408.68109 Theor. Comput. Sci. 511, 54-65 (2013). MSC: 68R10 05C70 05C75 05C85 PDFBibTeX XMLCite \textit{R. Belmonte} and \textit{M. Vatshelle}, Theor. Comput. Sci. 511, 54--65 (2013; Zbl 1408.68109) Full Text: DOI Backlinks: MO
Bodlaender, Hans L.; Grigoriev, Alexander; Grigorieva, Nadejda V.; Hendriks, Albert The valve location problem in simple network topologies. (English) Zbl 1202.90260 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, 55-65 (2008). MSC: 90C35 68Q17 68Q25 90C39 90C59 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., Lect. Notes Comput. Sci. 5344, 55--65 (2008; Zbl 1202.90260) Full Text: DOI
Kirlangiç, Alpay; Aytaç, Aysun Ozan The scattering number of thorn graphs. (English) Zbl 1055.05092 Int. J. Comput. Math. 81, No. 3, 299-311 (2004). Reviewer: Hang Tong Lau (St. Laurent/Quebec) MSC: 05C40 PDFBibTeX XMLCite \textit{A. Kirlangiç} and \textit{A. O. Aytaç}, Int. J. Comput. Math. 81, No. 3, 299--311 (2004; Zbl 1055.05092) Full Text: DOI
Kloks, Ton; Müller, Haiko; Wong, C. K. Vertex ranking of asteroidal triple-free graphs. (English) Zbl 1339.05395 Inf. Process. Lett. 68, No. 4, 201-206 (1998). MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{T. Kloks} et al., Inf. Process. Lett. 68, No. 4, 201--206 (1998; Zbl 1339.05395) Full Text: DOI Link
Kloks, Ton; Müller, Haiko; Wong, C. K. Vertex ranking of asteroidal triple-free graphs. (English) Zbl 1512.05374 Asano, Tetsuo (ed.) et al., Algorithms and computation. 7th international symposium, ISAAC ’96, Osaka, Japan, December 16–18, 1996. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1178, 174-182 (1996). MSC: 05C85 68W40 PDFBibTeX XMLCite \textit{T. Kloks} et al., Lect. Notes Comput. Sci. 1178, 174--182 (1996; Zbl 1512.05374) Full Text: DOI