Ashkan Aazami

Ashkan Aazami, Joseph Cheriyan, Bundit Laekhanukit: A bad example for the iterative rounding method for mincost k-connected spanning subgraphs. Discrete Optimization 10(1): 25-41 (2013)

Ashkan Aazami, Joseph Cheriyan, Krishnam Raju Jampani: Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs. Algorithmica 63(1-2): 425-456 (2012)

Ashkan Aazami: Domination in graphs with bounded propagation: algorithms, formulations and hardness results. J. Comb. Optim. 19(4): 429-456 (2010)

Prahladh Harsha, Moses Charikar, Matthew Andrews, Sanjeev Arora, Subhash Khot, Dana Moshkovitz, Lisa Zhang, Ashkan Aazami, Dev Desai, Igor Gorodezky, Geetha Jagannathan, Alexander S. Kulikov, Darakhshan J. Mir, Alantha Newman, Aleksandar Nikolov, David Pritchard, Gwen Spencer: Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes). CoRR abs/1002.3864 (2010)

Ashkan Aazami, Kael Stilp: Approximation Algorithms and Hardness for Domination with Propagation. SIAM J. Discrete Math. 23(3): 1382-1399 (2009)

Ashkan Aazami, Joseph Cheriyan, Krishnam Raju Jampani: Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs. APPROX-RANDOM 2009: 1-14

Ashkan Aazami: Domination in graphs with bounded propagation: algorithms, formulations and hardness results. CoRR abs/0802.2130 (2008)

Ashkan Aazami, Michael D. Stilp: Approximation Algorithms and Hardness for Domination with Propagation. APPROX-RANDOM 2007: 1-15

Ashkan Aazami, Michael D. Stilp: Approximation algorithms and hardness for domination with propagation. CoRR abs/0710.2139 (2007)

Ashkan Aazami, Shahram Ghandeharizadeh, Tooraj Helmi: Near Optimal Number of Replicas for Continuous Media in Ad-hoc Networks of Wireless Devices. Multimedia Information Systems 2004: 40-49