Nadym Mallek
Former Researcher
Research Interests
My research interests rely mainly around Parametrized complexity and Approximation algorithms.
I like to play around with particular classes of graphs to exploit some structural properties to make a hard problem solvable in reasonable time.
So far, I have been working with bounded treewidth graphs on the Multicut-Problem and it has been fun.
If you need anything or wish to work together, do not hesitate to reach out.
Education
| Since 11/2021 | Ph.D. student at the chair for Algorithm Engineering, Hasso Plattner Institute |
| 2019 - 2021 | Master's Degree in Computer Science with a focus on AI and Compexity Theory. Sorbonne Université (Paris 6) Paris, France |
| 2016 - 2019 | Two Bachelors degrees in the special program "PIMA" (Double Major Mathematics and Computer Science) Sorbonne Université (Paris 6) Paris, France |
Publications
2023
Friedrich, Tobias; Issac, Davis; Kumar, Nikhil; Mallek, Nadym; Zeif, Ziena Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded TreewidthSymposium Theory of Computing (STOC) 2023: 1325–1334
2022