Path Planning with Objectives Minimum Length and Maximum Clearance. - Mansoor Davoodi; Arman Rouhani; Maryam Sanisales (TTCS, 2020)

An improved bound for the price of anarchy for related machine scheduling. - André Berger; Arman Rouhani; Marc Schröder 002 (CoRR, 2024)

Cost Preserving Dependent Rounding for Allocation Problems. - Lars Rohwedder; Arman Rouhani; Leo Wennmann (ICALP, 2025)

Fixed order scheduling with deadlines. - André Berger; Arman Rouhani; Marc Schröder 002 (Oper. Res. Lett., 2025)