## Photography

I still take photographs but in an unorganised fashion. I hope in the distant future I will have a nicer photography page. Until then, enjoy my Instagram page. Thanks for stopping by.

I still take photographs but in an unorganised fashion. I hope in the distant future I will have a nicer photography page. Until then, enjoy my Instagram page. Thanks for stopping by.

Published in *Proceedings of International Conference on Combinatorial Optimization and Applications*, 2015

We present two approximation algorithms for the maximum independent set problem over the class of B1-VPG graphs. We also showed NP-completeness of the decision version restricted to unit length equilateral B1-VPG graphs.

Download __here__

Published in *Discrete Applied Mathematics*, 2016

We prove that if G is a Halin graph then VPG bend-number is 1 and EPG bend-number is 2 and the bound is tight.

Download __here__

Published in *Discrete Mathematics & Theoretical Computer Science*, 2017

We show the circular separation dimension of 2-outerplanar graphs and series-parallel graphs is 2.

Download __here__

Published in *Discrete Applied Mathematics*, 2020

We show a bunch of problems are APX-hard on L-EPG graphs.

Download __here__

Published in *Discrete Applied Mathematics*, 2021

We show an 8/5 algorithm for the maximum edge 2-colouring problem when the underlying graph is triangle-free and has a perfect matching. We also show that this algorithm cannot achieve an approximation ratio better than 58/37 on a triangle-free graph that has a perfect matching.

Download __here__

Published in *Proceedings of European Conference on Combinatorics, Graph Theory and Applications, EuroComb*, 2021

We study this chromatic number for the family of sparse graphs, partial 2-trees, graphs with bounded maximum degree and degeneracy.

Download __here__

Published in *Proceedings of 29th Annual European Symposium on Algorithms, ESA*, 2021

We give polynomial-time approximation schemes for monotone maximization problems expressible in terms of distances.

Download __here__

Published in *Proceedings of 5th Symposium on Simplicity in Algorithms, SOSA*, 2022

We show that the number of distinct discrete derivatives, as opposed to the input size, is a better input parameter to express the complexity of convexity testing. We present a nonadaptive convexity tester with query complexity O(log s/epsilon) and complement it with a nearly matching lower bound.

Download __here__

Published in *Proceedings of 36th AAAI Conference on Artificial Intelligence, AAAI*, 2022

We show that shortest path reconfiguration problem is intractable, even for relaxed variants. We present efficient algorithms for a few restricted variants. We also generalize the problem to when at most k (for a fixed integer k greater than 2) contiguous vertices on a shortest path can be changed at a time.

Download __here__

Published in *Proceedings of 38th International Symposium on Computational Geometry, SoCG*, 2022

We show that proper minor-closed classes have bounded comparable box dimensions and explore further properties of this notion.

Download __here__

Published in *Random Structures and Algorithms*, 2022

We obtain sufficient conditions for the emergence of spanning and almost-spanning bounded-degree rainbow trees in various host graphs, having their edges colored independently and uniformly at random, using a predetermined palette.

Download __here__

Published in *Computational Geometry: Theory and Applications*, 2023

We present two principal results, both involving local-search PTASs for geometric covering problems. The first is an approximation to the minimum-sized dominating set for a set of convex homothets, and the second is an approximation to the minimum-sized set cover, where the sets are based on convex pseudodisks.

Download __here__

Published in *Proceedings of 22nd International Conference on Autonomous Agents and Multiagent Systems, AAMAS*, 2023

We studied variants of the problem with some additional restrictions on solutions, that place limits on the efficacy of possible gerrymandering strategies.

Download __here__

Published in *Proceedings of 49th International Workshop on Graph-Theoretic Concepts in Computer Science, WG*, 2023

We show the problem is NP-hard even when restricted to the class of apex-graphs and show PTAS for minor-free graphs.

Download __here__

Published in *Proceedings of Workshop on Approximation and Online Algorithms - 21st International Workshop (To appear)*, 2023

Coauthors are Lukas Drexler, Annika Hennes, Melanie Schmidt and Julian Wargalla.

Download __here__

** Published:**

** Published:**

Here is the link to the talk.

** Published:**

Here is a link to the talk announcement.

** Published:**

** Published:**

Graduate Course, *Indian Institute of Science, Department of Computer Science and Automation*, 2015

I was a teaching assistant for the Design and Analysis of Algorithms course. The responsibilities include grading homework and final test.

Undergraduate Course, *Charles University, Faculty of Mathematics and Physics*, 2022

I was a tutor for this course. Details of the course can be found here.

Master's Degree Course, *Heinrich Heine University Düsseldorf, Faculty of Mathematics and Natural Sciences*, 2022

Details of the course can be found here.

Master's Degree Course, *Heinrich Heine University Düsseldorf, Faculty of Mathematics and Natural Sciences*, 2023

Details of the course can be found here.