Chechik, Shiri; Johnson, M. P.; Parter, Merav; Peleg, David Secluded connectivity problems. (English) Zbl 1380.68307 Algorithmica 79, No. 3, 708-741 (2017). MSC: 68R10 05C40 68Q17 68Q25 PDFBibTeX XMLCite \textit{S. Chechik} et al., Algorithmica 79, No. 3, 708--741 (2017; Zbl 1380.68307) Full Text: DOI arXiv
Jordán, Tibor; Schlotter, Ildikó Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem. (English) Zbl 1320.68102 J. Discrete Algorithms 30, 29-44 (2015). MSC: 68Q25 05C60 05C85 68Q17 68R10 PDFBibTeX XMLCite \textit{T. Jordán} and \textit{I. Schlotter}, J. Discrete Algorithms 30, 29--44 (2015; Zbl 1320.68102) Full Text: DOI
Borradaile, Glencora; Demaine, Erik D.; Tazari, Siamak Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs. (English) Zbl 1303.05183 Algorithmica 68, No. 2, 287-311 (2014). MSC: 05C85 05C40 05C10 05C05 05C22 05C82 PDFBibTeX XMLCite \textit{G. Borradaile} et al., Algorithmica 68, No. 2, 287--311 (2014; Zbl 1303.05183) Full Text: DOI Link