1. Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs
2. Ittai Abraham , Cyril Gavoille , and Dahlia Malkhi . 2005 . Compact routing for graphs excluding a fixed minor . In International Symposium on Distributed Computing. Springer, 442--456 . Ittai Abraham, Cyril Gavoille, and Dahlia Malkhi. 2005. Compact routing for graphs excluding a fixed minor. In International Symposium on Distributed Computing. Springer, 442--456.
3. Ittai Abraham , Cyril Gavoille , Dahlia Malkhi , and Udi Wieder . 2007 . Strong-diameter decompositions of minor free graphs . In Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures. 16--24 . Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, and Udi Wieder. 2007. Strong-diameter decompositions of minor free graphs. In Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures. 16--24.
4. Saeed Akhoondian Amiri , Stefan Schmid , and Sebastian Siebertz . 2016 . A local constant factor MDS approximation for bounded genus graphs . In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (PODC). 227--233 . Saeed Akhoondian Amiri, Stefan Schmid, and Sebastian Siebertz. 2016. A local constant factor MDS approximation for bounded genus graphs. In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (PODC). 227--233.
5. Distributed dominating set approximations beyond planar graphs;Amiri Saeed Akhoondian;ACM Transactions on Algorithms (TALG),2019