A Walk in the Clouds: Routing Through VNFs on Bidirected Networks. - Klaus-Tycho Foerster; Mahmoud Parham; Stefan Schmid 001 (ALGOCLOUD, 2017)

TI-MFA: Keep calm and reroute segments fast. - Klaus-Tycho Foerster; Mahmoud Parham; Marco Chiesa; Stefan Schmid 001 (INFOCOM Workshops, 2018)

Waypoint Routing in Special Networks. - Saeed Akhoondian Amiri; Klaus-Tycho Foerster; Riko Jacob; Mahmoud Parham; Stefan Schmid 001 (Networking, 2018)

Local Fast Segment Rerouting on Hypercubes. - Klaus-Tycho Foerster; Mahmoud Parham; Stefan Schmid 001; Tao Wen (OPODIS, 2018)

Short Schedules for Fast Flow Rerouting. - Saeed Akhoondian Amiri; Szymon Dudycz; Mahmoud Parham; Stefan Schmid 001; Sebastian Wiederrecht (CoRR, 2018)

On Polynomial-Time Congestion-Free Software-Defined Network Updates. - Saeed Akhoondian Amiri; Szymon Dudycz; Mahmoud Parham; Stefan Schmid 001; Sebastian Wiederrecht (Networking, 2019)

Competitive clustering of stochastic communication patterns on a ring. - Chen Avin; Louis Cohen; Mahmoud Parham; Stefan Schmid 001 (Computing, 2019)

Maximally Resilient Replacement Paths for a Family of Product Graphs. - Mahmoud Parham; Klaus-Tycho Foerster; Petar Kosic; Stefan Schmid 001 (OPODIS, 2020)

Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph Partitioning. - Maciej Pacut; Mahmoud Parham; Stefan Schmid 001 (PODC, 2020)

Traffic engineering with joint link weight and segment optimization. - Mahmoud Parham; Thomas Fenz; Nikolaus Süss; Klaus-Tycho Foerster; Stefan Schmid 001 (CoNEXT, 2021)

Optimal Online Balanced Graph Partitioning. - Maciej Pacut; Mahmoud Parham; Stefan Schmid 001 (INFOCOM, 2021)

Locality in Online Algorithms. - Maciej Pacut; Mahmoud Parham; Joel Rybicki; Stefan Schmid 001; Jukka Suomela; Aleksandr Tereshchenko (CoRR, 2021)

Brief Announcement: Temporal Locality in Online Algorithms. - Maciej Pacut; Mahmoud Parham; Joel Rybicki; Stefan Schmid 001; Jukka Suomela; Aleksandr Tereshchenko (DISC, 2022)