Bazgan, Cristina; Chopin, Morgan; Nichterlein, André; Sikora, Florian Parameterized approximability of maximizing the spread of influence in networks. (English) Zbl 1361.68105 J. Discrete Algorithms 27, 54-65 (2014). MSC: 68Q25 05C82 68W25 91D30 PDFBibTeX XMLCite \textit{C. Bazgan} et al., J. Discrete Algorithms 27, 54--65 (2014; Zbl 1361.68105) Full Text: DOI
Bonsma, Paul; Broersma, Hajo; Patel, Viresh; Pyatkin, Artem The complexity of finding uniform sparsest cuts in various graph classes. (English) Zbl 1248.05208 J. Discrete Algorithms 14, 136-149 (2012). MSC: 05C99 05C85 68Q17 PDFBibTeX XMLCite \textit{P. Bonsma} et al., J. Discrete Algorithms 14, 136--149 (2012; Zbl 1248.05208) Full Text: DOI
Mihara, Takashi Quantum protocols for untrusted computations. (English) Zbl 1134.94376 J. Discrete Algorithms 5, No. 1, 65-72 (2007). MSC: 94A62 81P68 68Q05 68M12 PDFBibTeX XMLCite \textit{T. Mihara}, J. Discrete Algorithms 5, No. 1, 65--72 (2007; Zbl 1134.94376) Full Text: DOI
Engelberg, Roee; Könemann, Jochen; Leonardi, Stefano; Naor, Joseph (Seffi) Cut problems in graphs with a budget constraint. (English) Zbl 1135.90419 J. Discrete Algorithms 5, No. 2, 262-279 (2007). MSC: 90C35 05C40 90C55 PDFBibTeX XMLCite \textit{R. Engelberg} et al., J. Discrete Algorithms 5, No. 2, 262--279 (2007; Zbl 1135.90419) Full Text: DOI