Research

🥼 Academic Experience

I began my research in Computational Geometry, particularly studying the problem of separability of points on the plane using rectilinear convex hulls. I have also studied the tractability and intractability of variants of job scheduling problems. Currently, my research is focused on the intractability of graph modification problems (in particular edge modification; also graph edit distance) restricted to geometric intersection graphs and geometric edit operations.

Interests: Problems related to computational geometry, geometric intersection graphs, parameterised complexity, geometric optimisation, separability, coverage

Keywords: Graph Modification, Computational Geometry, Graph Theory, Geometric Intersection Graphs, Optimisation, Rectilinear Convex Hulls, Task Scheduling, NP-completeness


🗞️ Publications

🌏📝 International Conferences (proceedings)

🌏📄 International Conferences (no proceedings)

🏠 Domestic Conferences & Workshops

🖍️ Seminars

🎒 Other Participations