Darties, Benoît; Champseix, Nicolas; Chateau, Annie; Giroudeau, Rodolphe; Weller, Mathias Complexity and lowers bounds for power edge set problem. (English) Zbl 1410.68292 J. Discrete Algorithms 52-53, 70-91 (2018). MSC: 68R10 05C85 68Q25 68W25 PDFBibTeX XMLCite \textit{B. Darties} et al., J. Discrete Algorithms 52--53, 70--91 (2018; Zbl 1410.68292) Full Text: DOI
Berend, Daniel; Golan, Shahar Counting solutions to CSP using generating polynomials. (English) Zbl 1298.68106 J. Discrete Algorithms 26, 89-97 (2014). MSC: 68Q25 05A15 PDFBibTeX XMLCite \textit{D. Berend} and \textit{S. Golan}, J. Discrete Algorithms 26, 89--97 (2014; Zbl 1298.68106) Full Text: DOI
Chimani, Markus; Mutzel, Petra; Zey, Bernd Improved Steiner tree algorithms for bounded treewidth. (English) Zbl 1257.05166 J. Discrete Algorithms 16, 67-78 (2012). MSC: 05C85 05C05 PDFBibTeX XMLCite \textit{M. Chimani} et al., J. Discrete Algorithms 16, 67--78 (2012; Zbl 1257.05166) 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
Amini, Omid; Sau, Ignasi; Saurabh, Saket Parameterized complexity of finding small degree-constrained subgraphs. (English) Zbl 1242.68119 J. Discrete Algorithms 10, 70-83 (2012). MSC: 68Q25 05C85 90C39 PDFBibTeX XMLCite \textit{O. Amini} et al., J. Discrete Algorithms 10, 70--83 (2012; Zbl 1242.68119) Full Text: DOI