Nadym Mallek

According to our database, Nadym Mallek authored at least 2 papers between 2022 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth.

Tobias Friedrich, Davis Issac, Nikhil Kumar, Nadym Mallek, Ziena Zeif

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022

A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs.

Tobias Friedrich, Davis Issac, Nikhil Kumar, Nadym Mallek, Ziena Zeif

Proceedings of the Approximation, 2022