Complexity of computing the anti-Ramsey numbers. - Saeed Akhoondian Amiri; Alexandru Popa 001; Golnoosh Shahkarami; Hossein Vahidi 001 (CoRR, 2018)

Approximate Minimum Directed Spanning Trees Under Congestion. - Christoph Lenzen 001; Hossein Vahidi 001 (SIROCCO, 2021)

Fast Dynamic Programming in Trees in the MPC Model. - Chetan Gupta 002; Rustam Latypov; Yannic Maus; Shreyas Pai; Simo Särkkä; Jan Studený; Jukka Suomela; Jara Uitto; Hossein Vahidi 001 (SPAA, 2023)

Brief Announcement: Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity. - Chetan Gupta 002; Janne H. Korhonen; Jan Studený; Jukka Suomela; Hossein Vahidi 001 (SPAA, 2024)

Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity. - Chetan Gupta 002; Janne H. Korhonen; Jan Studený; Jukka Suomela; Hossein Vahidi 001 (SIROCCO, 2025)

Complexity of computing the anti-Ramsey numbers for paths. - Saeed Akhoondian Amiri; Alexandru Popa 001; Mohammad Roghani; Golnoosh Shahkarami; Reza Soltani; Hossein Vahidi 001 (Theor. Comput. Sci., 2025)