Nadym Mallek

According to our database, Nadym Mallek authored at least 5 papers between 2022 and 2025.

Collaborative distances:

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

2025

Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes.

Nadym Mallek, Kirill Simonov

CoRR, May, 2025

A Parameterized Study of Secluded Structures in Directed Graphs.

Jonas Schmidt, Shaily Verma, Nadym Mallek

Proceedings of the 36th International Symposium on Algorithms and Computation, 2025

2024

Optimal Padded Decomposition For Bounded Treewidth Graphs.

Arnold Filtser, Tobias Friedrich, Davis Issac, Nikhil Kumar, Hung Le, Nadym Mallek, Ziena Zeif

CoRR, 2024

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