Nadym Mallek

Orcid: 0000-0002-4370-5145

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes.
CoRR, May, 2025

A Parameterized Study of Secluded Structures in Directed Graphs.
Proceedings of the 36th International Symposium on Algorithms and Computation, 2025

2024
Optimal Padded Decomposition For Bounded Treewidth Graphs.
CoRR, 2024

2023
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth.
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.
Proceedings of the Approximation, 2022


  Loading...