Milanič, Martin; Pivač, Nevena Computing well-covered vector spaces of graphs using modular decomposition. (English) Zbl 07784411 Comput. Appl. Math. 42, No. 8, Paper No. 360, 23 p. (2023). MSC: 05C85 05C69 05C75 05C50 05C70 15A03 05C22 PDFBibTeX XMLCite \textit{M. Milanič} and \textit{N. Pivač}, Comput. Appl. Math. 42, No. 8, Paper No. 360, 23 p. (2023; Zbl 07784411) Full Text: DOI arXiv OA License
Ekim, Tınaz; Gözüpek, Didem; Hujdurović, Ademir; Milanič, Martin Mind the independence gap. (English) Zbl 1443.05141 Discrete Math. 343, No. 9, Article ID 111943, 10 p. (2020). MSC: 05C69 05C70 05C85 PDFBibTeX XMLCite \textit{T. Ekim} et al., Discrete Math. 343, No. 9, Article ID 111943, 10 p. (2020; Zbl 1443.05141) Full Text: DOI arXiv
Chiarelli, Nina; Hartinger, Tatiana R.; Johnson, Matthew; Milanič, Martin; Paulusma, Daniël Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity. (English) Zbl 1380.68219 Theor. Comput. Sci. 705, 75-83 (2018). MSC: 68Q25 05C85 68Q17 68R10 PDFBibTeX XMLCite \textit{N. Chiarelli} et al., Theor. Comput. Sci. 705, 75--83 (2018; Zbl 1380.68219) Full Text: DOI arXiv Link
Milanič, Martin; Muršič, Peter; Mydlarz, Marcelo Induced embeddings into Hamming graphs. (English) Zbl 1441.68193 Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 28, 15 p. (2017). MSC: 68R10 05C62 68Q17 68Q25 68U05 PDFBibTeX XMLCite \textit{M. Milanič} et al., LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 28, 15 p. (2017; Zbl 1441.68193) Full Text: DOI
Hartinger, Tatiana R.; Johnson, Matthew; Milanič, Martin; Paulusma, Daniël The price of connectivity for cycle transversals. (English) Zbl 1343.05157 Eur. J. Comb. 58, 203-224 (2016). MSC: 05D15 05C40 05C60 PDFBibTeX XMLCite \textit{T. R. Hartinger} et al., Eur. J. Comb. 58, 203--224 (2016; Zbl 1343.05157) Full Text: DOI
Chiarelli, Nina; Milanič, Martin On a class of graphs between threshold and total domishold graphs. (English) Zbl 1320.05087 Discrete Appl. Math. 195, 43-58 (2015). MSC: 05C69 05C85 PDFBibTeX XMLCite \textit{N. Chiarelli} and \textit{M. Milanič}, Discrete Appl. Math. 195, 43--58 (2015; Zbl 1320.05087) Full Text: DOI
Hartinger, Tatiana R.; Johnson, Matthew; Milanič, Martin; Paulusma, Daniël The price of connectivity for cycle transversals. (English) Zbl 1455.05076 Italiano, F. (ed.) et al., Mathematical foundations of computer science 2015. 40th international symposium, MFCS 2015, Milan, Italy, August 24–28, 2015. Proceedings. Part II. Berlin: Springer. Lect. Notes Comput. Sci. 9235, 395-406 (2015). MSC: 05D15 05C38 05C40 05C60 PDFBibTeX XMLCite \textit{T. R. Hartinger} et al., Lect. Notes Comput. Sci. 9235, 395--406 (2015; Zbl 1455.05076) Full Text: DOI Link
Milanič, Martin; Schaudt, Oliver Computing square roots of trivially perfect and threshold graphs. (English) Zbl 1287.05095 Discrete Appl. Math. 161, No. 10-11, 1538-1545 (2013). MSC: 05C62 05C85 68Q25 PDFBibTeX XMLCite \textit{M. Milanič} and \textit{O. Schaudt}, Discrete Appl. Math. 161, No. 10--11, 1538--1545 (2013; Zbl 1287.05095) Full Text: DOI
Milanič, Martin Hereditary efficiently dominatable graphs. (English) Zbl 1269.05089 J. Graph Theory 73, No. 3-4, 400-424 (2013). MSC: 05C69 05C85 PDFBibTeX XMLCite \textit{M. Milanič}, J. Graph Theory 73, No. 3--4, 400--424 (2013; Zbl 1269.05089) Full Text: DOI Link
Kamiński, Marcin; Lozin, Vadim V.; Milanič, Martin Recent developments on graphs of bounded clique-width. (English) Zbl 1211.05165 Discrete Appl. Math. 157, No. 12, 2747-2761 (2009). MSC: 05C85 68R10 03B25 03B70 05C40 68Q25 PDFBibTeX XMLCite \textit{M. Kamiński} et al., Discrete Appl. Math. 157, No. 12, 2747--2761 (2009; Zbl 1211.05165) Full Text: DOI