Publications
Online duet between Metric Embeddings and Minimum-Weight Perfect Matchings
(with A. Filtser, C. D. Tóth).
Conference version - ACM-SIAM Symposium on Discrete Algorithms (SODA 2024); [DOI].
arXiv version - [OMe-PM:BFT].
Fully Dynamic Maximum Independent Set of Disks in Polylogarithmic Update Time
(with M. Nöllenburg, C. D. Tóth, J. Wulms).
Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects
(with P. Acharya, A. Gupta, A. Khan, B. Mondal, A. Wiese).
Conference version - 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP 2024); to appear.
arXiv version - [GP-ABGKMW].
Fully Dynamic Geometric Vertex Cover and Matching
(with T. M. Chan).
Conference version - In submission.
arXiv version - [D-VcM:BC].
Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
(with B. Keszegh, A. Kupavskii, H. Le, A. Louvet, D. Pálvölgyi, C. D. Tóth).
Conference version - In submission.
arXiv version - [SPD-BKKLLPD].
Geometric Bipartite Matching is in NC
(with S. Equbal, R. Gurjar).
Conference version - In submission.
Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable
(with R. Ganian, L. Khazaliya, F. Montecchiani, M. Nöllenburg).
Conference version - 39th International Symposium on Computational Geometry (SoCG 2023); [DOI].
Invited to the special issue of Journal of Computational Geometry (JoCG).
Extended abstract - 39th European Workshop on Computational Geometry (EuroCG 2023); [DOI].
Selected for presentation at the 8th Highlights of Algorithms (HALG 2023).
arXiv version - [EoPGD:BGKMN].
Dynamic Schnyder Woods
(with P. Bose, P. Cano, J. Cardinal, J. Iacono).
Dynamic Euclidean Bottleneck Matching
(with K. Abu-Affash, P. Carmi).
Conference version - In submission.
arXiv version - [DeBM:ABC].
Leader-Based Herding of Robot Swarm Amidst Obstacles
(with S. Agrawal, P.B. Sujit, M. Mishra).
Conference version - In submission.
Multi-robot Searching with Limited Sensing Range for Static and Mobile Intruders
(with S. Agrawal, J. Mitchell, P.B. Sujit, A. Gohil).
Conference version - In submission.
Online Spanners in Metric Spaces
(with A . Filtser, H. Khodabandeh, C. D. Tóth).
Euclidean Steiner Spanners: Light and Sparse
(with C. D. Tóth).
Minimum Link Fencing
(with F. Klute, M. Löffler, S. Nickel, M. Nöllenburg, A. Villedieu).
Conference version - 33rd International Symposium on Algorithms and Computation (ISAAC 2022); [DOI].
Extended abstract In the proceedings of the 37th European Workshop on Computational Geometry (EuroCG 2021).
arXiv version - [MLF-BKLNNV].
On Streaming Algorithms for Geometric Independent Set and Clique
(with F. Klute, J. Oostveen).
Worbel: Aggregating Point Labels into Word Clouds
(with R. Ganian, G. Li, M. Nöllenburg and J. Wulms).
Journal version - ACM Trans. Spatial Algorithms and Systems; [DOI].
Conference version in the proceedings of 29th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL 2021); [DOI].
arXiv version - [WAPl-BGLNW].
On Colorful Vertex and Edge Cover Problems
(with S. Bandyapadhyay, A. Banik).
Space-Efficient Algorithms for Reachability in Directed Geometric Graphs
(with R. Jain).
Light Euclidean Steiner Spanners in the Plane
(with C. D. Tóth).
Online Euclidean Spanners
(with C. D. Tóth).
On Euclidean Steiner (1+ε)-Spanners
(with C. D. Tóth).
On the Upward Book Thickness Problem: Combinatorial and Complexity Results
(with G. Lozzo, F. Montecchiani, M. Nöllenburg).
Untangling Circular Drawings: Algorithms and Complexity
(with G. Li, M. Nöllenburg, I. Rutter, H. Wu).
Journal version - Computational Geometry: Theory and Applications (CGTA); [DOI]. (Invited to the special issue).
Conference version in the proceedings of 32nd International Symposium on Algorithms and Computation (ISAAC 2021); [DOI].
Extended abstract In the proceedings of the 37th International Symposium on Computational Geometry - Young Researcher Forum (SoCG-YRF 2021).
arXiv version - [UCD-BLNRW].
Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs
(with M. Löffler, S. Nickel, M. Nöllenburg).
Balanced Independent and Dominating Sets on Colored Interval Graphs
(with J-H. Haunert, F. Klute, G. Li, M. Nöllenburg).
Disjoint Box Covering in a Rectilinear Polygon
(with G. Li, M. Nöllenburg, J. Wulms).
Extended abstract In the proceedings of the 37th European Workshop on Computational Geometry (EuroCG 2021).
Dynamic Geometric Independent Sets
(with J. Cardinal, J. Iacono, G. Koumoutsos).
Conference version in the proceedings of 23rd Thailand-Japan conference on Discrete and Computational Geometry, Graphs, and Games (TJDCG 2021).
arXiv version - [DGIS-BCIK].
Parameterized Study of Steiner Tree on Unit Disk Graphs
(with P. Carmi, S. Kolay and M. Zehavi).
Journal version - Algorithmica; [DOI].
Conference version in the proceedings of 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020); [DOI].
arXiv version - [PsUDG-BCKZ].
Planar Bichromatic Bottleneck Spanning Trees
(with A. K. A-Affash, P. Carmi, J.S.B. Mitchell).
Journal version - Journal of Computational Geometry (JoCG); [DOI].
Conference version in the proceedings of 28th Annual European Symposium on Algorithms (ESA 2020) [DOI].
arXiv version - [PBBST-ABCM].
Parameterized Algorithms for Queue Layouts
(with R. Ganian, F. Montecchiani , and M. Nöllenburg).
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
(with G. Li and M. Nöllenburg).
Geometric Planar Networks on Bichromatic Points
(with S. Bandyapadhyay, A. Banik, M. Nöllenburg).
On Erdős–Szekeres-type problems for k-convex point sets
(with M. Balko, L. Martínez-Sandoval, and P. Valtr).
Parameterized Algorithms for Book Embedding Problems
(with R. Ganian, F. Montecchiani, and M. Nöllenburg).
Algorithms and Hardness on Liar's Dominating Set and k-tuple Dominating Set
(with S. Banerjee).
Balanced Connected Subgraph Problem in Geometric Intersection graphs
(with S. Jana, S. Pandit, and S. Roy).
Geometric Systems of Unbiased Representatives
(with A. Banik, B. B. Bhattacharya, and L. Martínez-Sandoval).
Journal version - Information Processing Letters (IPL); [DOI].
Conference version in the proceedings of the 31st Canadian Conference in Computational Geometry (CCCG 2019); [proceedings].
arXiv version - [GSUR-BBBM].
Balanced Covering Problem in Bicolored point Sets
(with S. Pandit, S. Roy).
Extended abstract in 35th European Workshop on Computational Geometry (EuroCG 2019); [DOI].
Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets
(with S. Banerjee, R. Chitnis).
Conference version in the proceedings of the Latin American Theoretical Informatics (LATIN 2018); [DOI].
The Balanced Connected Subgraph Problem
(with S. Chakraborty, S. Jana, J. Mitchell, S. Pandit, S. Roy).
Monochromatic Plane Matchings in Bicolored Point Set
(with A. K. A-Affash, P. Carmi).
Journal version - Information Processing Letters (IPL), 2020 [DOI].
Conference version in the proceedings of the 29th Canadian Conference in Computational Geometry (CCCG 2017); [proceedings].
Bottleneck Bichromatic Full Steiner Trees
(with A. K. A-Affash, P. Carmi, D. Chakraborty).
Journal Version - Information Processing Letters (IPL), 2019. [DOI]
Conference version in the proceedings of the 29th Canadian Conference in Computational Geometry (CCCG 2017); [proceedings].
Extended abstract in 34th European Workshop on Computational Geometry (EuroCG 2017).
On local structures of cubicity 2 graphs
(with D. Chakraborty, S. Das, S. Sen).
On special classes of Boxicity 2 graphs
(with D. Chakraborty, S. Das, S. Sen).
Ph.D. Thesis
Geometric Optimization Problems on Colored Point Sets.
Master's Thesis
Characterizations of 2-Stab Unit Square Interval Graphs