Aazami, A.; Cheriyan, J.; Jampani, K. R. Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs. (English) Zbl 1236.68076 Algorithmica 63, No. 1-2, 425-456 (2012). MSC: 68Q17 68W25 05C70 05C05 05C10 PDFBibTeX XMLCite \textit{A. Aazami} et al., Algorithmica 63, No. 1--2, 425--456 (2012; Zbl 1236.68076) Full Text: DOI
Aazami, Ashkan Domination in graphs with bounded propagation: Algorithms, formulations and hardness results. (English) Zbl 1192.90215 J. Comb. Optim. 19, No. 4, 429-456 (2010). MSC: 90C35 90C27 PDFBibTeX XMLCite \textit{A. Aazami}, J. Comb. Optim. 19, No. 4, 429--456 (2010; Zbl 1192.90215) Full Text: DOI arXiv
Aazami, Ashkan; Stilp, Kael Approximation algorithms and hardness for domination with propagation. (English) Zbl 1209.68628 SIAM J. Discrete Math. 23, No. 3, 1382-1399 (2009). MSC: 68W25 90C27 PDFBibTeX XMLCite \textit{A. Aazami} and \textit{K. Stilp}, SIAM J. Discrete Math. 23, No. 3, 1382--1399 (2009; Zbl 1209.68628) Full Text: DOI
Aazami, Ashkan; Stilp, Michael D. Approximation algorithms and hardness for domination with propagation. (English) Zbl 1171.68867 Charikar, Moses (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 10th international workshop, APPROX 2007, and 11th international workshop, RANDOM 2007, Princeton, NJ, USA, August 20–22, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74207-4/pbk). Lecture Notes in Computer Science 4627, 1-15 (2007). MSC: 68W25 05C69 05C85 68Q17 68Q25 90C59 PDFBibTeX XMLCite \textit{A. Aazami} and \textit{M. D. Stilp}, Lect. Notes Comput. Sci. 4627, 1--15 (2007; Zbl 1171.68867) Full Text: DOI