Talks
- Universität Hamburg. (2025) (Strong) Isometric path complexity of graphs: asymptotic minors, restricted holes, and graph operations
- Algorithmic Aspects of Temporal Graphs VII (2024). Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic? [Slides, Video].
- SICGT 2023. Isometric path complexity of graphs
- WG 2022. s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs.
- Graphs@Lyon, 2022 & WALCOM 2022. Finding Geometric Representations of Apex Graphs is NP-Hard. [Slides].
- Metric Graph Theory, 2021. Recent advances on algorithms for geodetic sets. [Slides.]
- International Conference on Emerging Trends in Mathematical Sciences & Computing, 2020 , On geodetic sets of graphs. [Slides].
- CALDAM, 2019 , On rectangle intersection graphs with stab number at most two. [Slides].
- ICGT, 2018. Triangle-free projective planar graphs with diameter 2: domination and characterization. [Slides].
- COCOA, 2016 , On Local Structures of Cubicity 2 Graphs. [Slides].
- CALDAM, 2015 , On a Special Class of Boxicity 2 Graphs.