Dallard, Clément; Milanič, Martin; Štorgel, Kenny Treewidth versus clique number. II: Tree-independence number. (English) Zbl 07796423 J. Comb. Theory, Ser. B 164, 404-442 (2024). MSC: 05C70 05C05 05C69 PDFBibTeX XMLCite \textit{C. Dallard} et al., J. Comb. Theory, Ser. B 164, 404--442 (2024; Zbl 07796423) Full Text: DOI arXiv
Dallard, Clément; Milanič, Martin; Štorgel, Kenny Treewidth versus clique number. I: Graph classes with a forbidden structure. (English) Zbl 1479.05308 SIAM J. Discrete Math. 35, No. 4, 2618-2646 (2021). MSC: 05C75 05C05 05C69 05C83 05C40 05C85 68P05 PDFBibTeX XMLCite \textit{C. Dallard} et al., SIAM J. Discrete Math. 35, No. 4, 2618--2646 (2021; Zbl 1479.05308) Full Text: DOI arXiv
Milanič, Martin; Pivač, Nevena Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem. (English) Zbl 1459.05277 Electron. J. Comb. 28, No. 1, Research Paper P1.41, 27 p. (2021). MSC: 05C75 05C40 05C30 05C76 05C69 PDFBibTeX XMLCite \textit{M. Milanič} and \textit{N. Pivač}, Electron. J. Comb. 28, No. 1, Research Paper P1.41, 27 p. (2021; Zbl 1459.05277) Full Text: DOI
Brešar, Boštjan; Hartinger, Tatiana Romina; Kos, Tim; Milanič, Martin 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs. (English) Zbl 1395.05043 Discrete Appl. Math. 248, 33-45 (2018). MSC: 05C10 05C83 PDFBibTeX XMLCite \textit{B. Brešar} et al., Discrete Appl. Math. 248, 33--45 (2018; Zbl 1395.05043) Full Text: DOI
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
Hartinger, Tatiana Romina; Milanič, Martin Partial characterizations of 1-perfectly orientable graphs. (English) Zbl 1365.05109 J. Graph Theory 85, No. 2, 378-394 (2017). MSC: 05C20 05C75 PDFBibTeX XMLCite \textit{T. R. Hartinger} and \textit{M. Milanič}, J. Graph Theory 85, No. 2, 378--394 (2017; Zbl 1365.05109) Full Text: DOI arXiv
Boros, Endre; Chiarelli, Nina; Milanič, Martin Equistarable bipartite graphs. (English) Zbl 1334.05110 Discrete Math. 339, No. 7, 1960-1969 (2016). MSC: 05C70 PDFBibTeX XMLCite \textit{E. Boros} et al., Discrete Math. 339, No. 7, 1960--1969 (2016; Zbl 1334.05110) Full Text: DOI arXiv
Bonomo, Flavia; Grippo, Luciano N.; Milanič, Martin; Safe, Martín D. Graph classes with and without powers of bounded clique-width. (English) Zbl 1326.05104 Discrete Appl. Math. 199, 3-15 (2016). MSC: 05C69 05C12 PDFBibTeX XMLCite \textit{F. Bonomo} et al., Discrete Appl. Math. 199, 3--15 (2016; Zbl 1326.05104) Full Text: DOI arXiv
Cicalese, Ferdinando; Cordasco, Gennaro; Gargano, Luisa; Milanič, Martin; Peters, Joseph; Vaccaro, Ugo Spread of influence in weighted networks under time and budget constraints. (English) Zbl 1327.68175 Theor. Comput. Sci. 586, 40-58 (2015). MSC: 68R10 05C85 68Q17 68Q25 91D30 PDFBibTeX XMLCite \textit{F. Cicalese} et al., Theor. Comput. Sci. 586, 40--58 (2015; Zbl 1327.68175) Full Text: DOI arXiv
Cicalese, Ferdinando; Cordasco, Gennaro; Gargano, Luisa; Milanič, Martin; Vaccaro, Ugo Latency-bounded target set selection in social networks. (English) Zbl 1358.05272 Theor. Comput. Sci. 535, 1-15 (2014). MSC: 05C85 91D30 68W40 PDFBibTeX XMLCite \textit{F. Cicalese} et al., Theor. Comput. Sci. 535, 1--15 (2014; Zbl 1358.05272) Full Text: DOI arXiv