Home

Academic Activities

Workshops

  • Fine-grained and parameterized computational geometry, Lorentz workshop 2025
  • Solving Problems on Graphs: from structure to algorithms, Dagstuhl Seminar 2025
  • Vertex Partitioning in Graphs: From structure to algorithms, Dagstuhl Seminar 2022
  • Graph decompositions: Small Width, big challenges, Lorentz Workshop 2022

Talks

  • International Workshop on Combinatorial Algorithms, 2024
    Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem
  • Scandinavian Symposium on Algorithm Theory, 2024
    Edge Multiway Cut and Node Multiway Cut are NP-hard.
  • Future Research In Combinatorial Optimization, 2023
    Complexity of problems tractable on bounded treewidth or subcubic graphs
  • Dagstuhl Seminar 2022, Complexity of problems efficiently computable on subcubic graphs
  • Dutch Day of Combinatorics, 2022
    Complexity of problems efficiently computable on subcubic graphs (Lightning talk)
  • Highlights of Algorithms, LSE 2022
    Planar Multiway Cut with terminals on few faces (Poster Presentation)
  • Symposium On Discrete Algorithms, 2022
    Planar Multiway Cut with terminals on few faces

Reviews

I review articles for ACM Mathematical Reviews. Besides, I have reviewed articles for journals like Discrete Applied Mathematics, Journal of Computer and System Sciences, and conference proceedings of LATIN’26, ICALP’25, MFCS’24, ESA’23, WG’23.