Peleg, David; Sau, Ignasi; Shalom, Mordechai On approximating the \(d\)-girth of a graph. (English) Zbl 1285.05041 Discrete Appl. Math. 161, No. 16-17, 2587-2596 (2013). MSC: 05C10 05C07 05C35 05C38 68Q17 68W20 68W25 PDFBibTeX XMLCite \textit{D. Peleg} et al., Discrete Appl. Math. 161, No. 16--17, 2587--2596 (2013; Zbl 1285.05041) Full Text: DOI
Amini, Omid; Peleg, David; Pérennes, Stéphane; Sau, Ignasi; Saurabh, Saket On the approximability of some degree-constrained subgraph problems. (English) Zbl 1246.05040 Discrete Appl. Math. 160, No. 12, 1661-1679 (2012). MSC: 05C07 05C60 68W25 PDFBibTeX XMLCite \textit{O. Amini} et al., Discrete Appl. Math. 160, No. 12, 1661--1679 (2012; Zbl 1246.05040) Full Text: DOI
Peleg, David; Sau, Ignasi; Shalom, Mordechai On approximating the \(d\)-girth of a graph. (English) Zbl 1298.68297 Černá, Ivana (ed.) et al., SOFSEM 2011: Theory and practice of computer science. 37th conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 22–28, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-18380-5/pbk). Lecture Notes in Computer Science 6543, 467-481 (2011). MSC: 68W25 05C35 68Q17 PDFBibTeX XMLCite \textit{D. Peleg} et al., Lect. Notes Comput. Sci. 6543, 467--481 (2011; Zbl 1298.68297) Full Text: DOI
Amini, Omid; Peleg, David; Pérennes, Stéphane; Sau, Ignasi; Saurabh, Saket Degree-constrained subgraph problems: Hardness and approximation results. (English) Zbl 1209.68629 Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 6th international workshop, WAOA 2008, Karlsruhe, Germany, September 18–19, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-93979-5/pbk). Lecture Notes in Computer Science 5426, 29-42 (2009). MSC: 68W25 05C85 68Q17 68R10 PDFBibTeX XMLCite \textit{O. Amini} et al., Lect. Notes Comput. Sci. 5426, 29--42 (2009; Zbl 1209.68629) Full Text: DOI Link