A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs. - Tobias Friedrich 001; Davis Issac; Nikhil Kumar 001; Nadym Mallek; Ziena Zeif (APPROX/RANDOM, 2022)

Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth. - Tobias Friedrich 001; Davis Issac; Nikhil Kumar 001; Nadym Mallek; Ziena Zeif (STOC, 2023)

Optimal Padded Decomposition For Bounded Treewidth Graphs. - Arnold Filtser; Tobias Friedrich 001; Davis Issac; Nikhil Kumar 001; Hung Le 001; Nadym Mallek; Ziena Zeif (CoRR, 2024)

A Parameterized Study of Secluded Structures in Directed Graphs. - Nadym Mallek; Jonas Schmidt 002; Shaily Verma (CoRR, 2025)

Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes. - Nadym Mallek; Kirill Simonov (CoRR, 2025)