Publications

• Algorithms and Lower Bounds for the Maximum Overlap of Two Polygons Under Translation

(with M. Abrahamsen, M. Buchin, J. Conradi, C. Jin, A. Nusser, C. Rehs).  

• • Conference version - ACM-SIAM Symposium on Discrete Algorithms (SODA 2026); to appear.

  • arXiv version - [PO-ABBCJNR].

• On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects

(with B. Esmer, D. Marx, K. Wegrzycki).  

• • Conference version - Under submission. 

  • arXiv version - [ST-BEMW].

• Sublinear Sketches for Approximate Nearest Neighbor and Kernel Density Estimation

(with V. Danait, S. Das).  

• • Conference version - Under submission. 

  • arXiv version - [ANN:DDB].

• Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: 

Piercing, Independent Set, Vertex Cover, Matching 

(with T. M. Chan).  

• • Conference version - ACM-SIAM Symposium on Discrete Algorithms (SODA 2025); [DOI].

  • arXiv version - [PIVM: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 - ACM-SIAM Symposium on Discrete Algorithms (SODA 2025); [DOI].

  • arXiv version - [SPD-BKKLLPD].  

• Sparse Bounded-Hop Spanners for Geometric Intersection Graphs. 

(with T. M. Chan, Z. Huang, S. Smorodinsky, C. D. Tóth).

• Conference version - International Symposium on Computational Geometry (SoCG 2025); [DOI].

• arXiv version - [SHSGIG-BCHST].  

• Light Spanners with Small Hop-Diameter. 

    (with L. Milenkovic).

• • Conference version - EATCS International Colloquium on Automata, Languages and Programming (ICALP 2025); [DOI].

  • arXiv version - [LSD:BM].

• Dynamic Independent Set of Disks (and Hypercubes) Made Easier. 

(with T. M. Chan).  

• • Conference version - SIAM Symposium on Simplicity in Algorithms (SOSA 2025); [DOI].

• Online Epsilon-Net and Piercing Set for Geometric Concepts. 

    (with D. Dey, S. Singh).

• • Conference version - International Conference on Learning Representations (ICLR 2025); [DOI]. 

  • arXiv version - [ENP-BDS]. 

• Coreset Strikes Back: Improved Parameterized Approximation Schemes for (Constrained) k-Median/Means. 

    (with A. Gadekar, T. Inamdar).

• • Conference version - Under submission. 

  • arXiv version - [CSB-GI]. 

• Event Driven CBBA with Reduced Communication. 

    (with V. Sao, T. D. Ho, P.B. Sujit).

• • Conference version - International Conference on Unmanned Aircraft Systems (ICUAS 2025); [DOI]. 

  • arXiv version - [EDCRC-SHBS].

• Heterogeneous Multi-Robot Decentralized Task Allocation With Limited Fuel.

    (with V. Sao, A. Sinha, T. Dzmitry, P.B. Sujit).

• • Conference version - IEEE International Symposium on Multi-Robot and Multi-Agent Systems (MRS 2025). 

• 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].  

  • Selected for presentation at the Highlights of Algorithms (HALG 2024).

  • 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).  

• • Conference version - International Symposium on Computational Geometry (SoCG 2024); [DOI]. 

  • Journal version - Discrete and Computational Geometry (DCG 2025) (Invited to the special issue of SoCG 2024); [DOI]. 

  • Extended abstract - European Workshop on Computational Geometry (EuroCG 2024); [DOI]. 

  • arXiv version - [DmIS:BNTW].

• Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects 

(with P. Acharya, A. Gupta, A. Khan, B. Mondal, A. Wiese).  

• • Conference version - EATCS International Colloquium on Automata, Languages and Programming  (ICALP 2024); [DOI]. 

  • arXiv version - [GP-ABGKMW]. 

• Geometric Bipartite Matching is in NC 

(with S. Equbal, R. Gurjar).  

• • Conference version - IARCS Annual Conference on Foundations of Software Technology and 

Theoretical Computer Science (FSTTCS 2024); [DOI]. 

• • arXiv version - [MPM-BEG].

• Fully Dynamic Geometric Vertex Cover and Matching 

(with T. M. Chan).  

• • arXiv version - [D-VcM:BC].

• Multi-Robot Searching with Limited Sensing Range for Static and Mobile Intruders. 

    (with S. Agrawal, J. SB. Mitchell, P.B. Sujit, A. Gohil).

• • arXiv version - [MRS-ABMSG]

• Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable 

(with R. Ganian, L. Khazaliya, F. Montecchiani, M. Nöllenburg).  

• • Conference version -  International Symposium on Computational Geometry (SoCG 2023); [DOI].

  • Journal version - Journal of Computational Geometry (JoCG 2025) (Invited to the special issue); to appear. 

  • Extended abstract - European Workshop on Computational Geometry (EuroCG 2023); [DOI].

  • Selected for presentation at the Highlights of Algorithms (HALG 2023).

  • arXiv version - [EoPGD:BGKMN].

• Dynamic Schnyder Woods 

(with P. Bose, P. Cano, J. Cardinal, J. Iacono).

• • Conference version - Canadian Conference in Computational Geometry (CCCG 2023); [DOI].

  • arXiv version - [DSW:BBCCI].

• Dynamic Euclidean Bottleneck Matching 

(with K. Abu-Affash, P. Carmi).  

• • Journal version - Theoretical Computer Science (TCS); [DOI]. 

  • arXiv version - [DeBM:ABC].

• Online Spanners in Metric Spaces 

(with A . Filtser, H. Khodabandeh, C. D. Tóth). 

• • Journal version - SIAM Journal of Discrete Mathematics (SIDMA), [DOI].

  • Conference version - Annual European Symposium on Algorithms (ESA 2022); [DOI].

  • arXiv version - [OSMs-BFKT].

• Euclidean Steiner Spanners: Light and Sparse 

(with C. D. Tóth). 

• • Journal version - SIAM Journal of Discrete Mathematics (SIDMA); [DOI].

  • Selected for presentation at the Highlights of Algorithms (HALG 2022).

  • arXiv version - [Ess:LS-BT].

• Online Euclidean Spanners 

(with C. D. Tóth). 

• • Journal version - ACM Transactions on Algorithms (TALG); [DOI]. 

  • Conference version - Annual European Symposium on Algorithms (ESA 2021); [DOI].

  • arXiv version - [OES-BT].

• Minimum Link Fencing 

(with F. Klute, M. Löffler, S. Nickel, M. Nöllenburg, A. Villedieu). 

• • Conference version - International Symposium on Algorithms and Computation (ISAAC 2022); [DOI].

  • Extended abstract in the proceedings of the 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). 

• • Conference version - Workshop on Approximation and Online Algorithms (WAOA 2022); [DOI].

  • arXiv version - [SaGIS-BKO].

• 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 - 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). 

• • Journal version - Algorithmica; [DOI]. 

  • Conference version - International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2021); [DOI].

  • arXiv version - [FCH:BBB]. 

• Space-Efficient Algorithms for Reachability in Directed Geometric Graphs 

(with R. Jain).  

• • Journal version - Theoretical Computer Science (TCS); [DOI]. 

  • Conference version - International Symposium on Algorithms and Computation (ISAAC 2021); [DOI].

  • arXiv version - [SeAR-BJ].

• Light Euclidean Steiner Spanners in the Plane 

(with C. D. Tóth). 

• • Conference version - International Symposium on Computational Geometry (SoCG 2021); [DOI].

  • arXiv version - [LESS-BT].

• On Euclidean Steiner (1+ε)-Spanners 

(with C. D. Tóth). 

• • Conference version - Symposium on Theoretical Aspects of Computer Science (STACS 2021); [DOI]. 

  • arXiv version - [ESs-BT].

• On the Upward Book Thickness Problem: Combinatorial and Complexity Results 

(with G. Lozzo, F. Montecchiani, M. Nöllenburg).  

• • Journal version - European Journal of Combinatorics (Eur. J. Comb.); [DOI]. 

  • Conference version - International Symposium on Graph Drawing and Network Visualization (GD 2021); [DOI].

  • arXiv version - [UBT-BLMN].

• 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 - International Symposium on Algorithms and Computation (ISAAC 2021); [DOI].

  • Extended abstract in the proceedings of the 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).

• • Conference version - International Symposium on Graph Drawing and Network Visualization (GD 2021); [DOI].

  • Extended abstract: European Workshop on Computational Geometry (EuroCG 2021). 

  • arXiv version - [UGDe-BLNN].

• Balanced Independent and Dominating Sets on Colored Interval Graphs 

(with J-H. Haunert, F. Klute, G. Li, M. Nöllenburg). 

• • Conference version - International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2021); [DOI]. 

  • Extended abstract: European Workshop on Computational Geometry (EuroCG 2020).

  • arXiv version - [BID-BHFLN].

• Disjoint Box Covering in a Rectilinear Polygon 

(with G. Li, M. Nöllenburg, J. Wulms). 

• • Extended abstract: European Workshop on Computational Geometry (EuroCG 2021).

• Dynamic Geometric Independent Sets 

(with J. Cardinal, J. Iacono, G. Koumoutsos). 

• • Conference version - 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 - 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 - 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). 

• • Journal version - Journal of Graph Algorithms and Applications (JGAA); [DOI]. (Invited to the special issue). 

  • Conference version - International Symposium on Graph Drawing and Network Visualization (GD 2020); [DOI].

  • arXiv version - [PaQL-BGMN].

• An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling 

(with G. Li and M. Nöllenburg).

• • Journal version - ACM Journal of Experimental Algorithms (JEA); [DOI].

  • Conference version - Annual European Symposium on Algorithms (ESA 2020); [DOI].

  • arXiv version - [DiML-BLN].

• Geometric Planar Networks on Bichromatic Points 

(with S. Bandyapadhyay, A. Banik, M. Nöllenburg).

• • Journal Version - Theoretical Computer Science (TCS); [DOI].

  • Conference version - Annual International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2020); [DOI].

  • arXiv version - [GPNB-BBBN].

• On Erdős–Szekeres-type problems for k-convex point sets  

(with M. Balko, L. Martínez-Sandoval, and P. Valtr).

• • Journal version - European Journal of Combinatorics (Eur. J. Comb.) 2020; [DOI].

  • Conference version - International Workshop on Combinatorial Algorithms (IWOCA 2019), Lecture Notes in Computer Science, vol 11638. Springer, Cham, 2019, [DOI].

• Parameterized Algorithms for Book Embedding Problems 

(with R. Ganian, F. Montecchiani, and M.  Nöllenburg).

• • Journal Version - Journal of Graph Algorithms and Applications (JGAA) 2020, [DOI]. (Invited to the special issue). 

  • Conference version - International Symposium on Graph Drawing & Network Visualization (GD 2019); [DOI]. 

  • arXiv version - [PaBE-BGMN].

• Algorithms and Hardness on Liar's Dominating Set and k-tuple Dominating Set 

(with S. Banerjee). 

• • Conference version - International Workshop on Combinatorial Algorithms (IWOCA 2019), Lecture Notes in Computer Science, vol 11638. Springer, Cham, 2019, [DOI].

  • arXiv version - [LDkD-BB].

• Balanced Connected Subgraph Problem in Geometric Intersection graphs 

(with S. Jana, S. Pandit, and S. Roy).

• • Journal version - Theoretical Computer Science (TCS); [DOI].

  • Conference version - International Conference on Combinatorial Optimization and Applications (COCOA 2019); [DOI]. 

  • arXiv version - [BCS-BJPR].

• 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 - 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: 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 - Latin American Theoretical Informatics (LATIN 2018); [DOI].

• The Balanced Connected Subgraph Problem 

(with S. Chakraborty, S. Jana, J.  Mitchell, S. Pandit, S. Roy).

• • Journal version - Discrete Applied Mathematics (DAM); [DOI].  

  • Conference version - International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2019); [DOI]. 

  • arXiv version - [BCS-BCJPR].    

• Monochromatic Plane Matchings in Bicolored Point Set 

(with A. K. A-Affash, P. Carmi).

• • Journal version - Information Processing Letters (IPL), 2020 [DOI].

  • Conference version - 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 - Canadian Conference in Computational Geometry (CCCG 2017); [proceedings].  

  • Extended abstract: European Workshop on Computational Geometry (EuroCG 2017).

• On local structures of cubicity 2 graphs 

(with D. Chakraborty, S. Das, S. Sen). 

• • Conference version - International Conference on Combinatorial Optimization and Applications (COCOA 2016); [DOI].

  • arXiv version - [C2G-BCDS]. 

• On special classes of Boxicity 2 graphs 

(with D. Chakraborty, S. Das, S. Sen). 

• • Conference version - International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2015); [DOI].

  • Selected for presentation at the Haifa Workshop on Interdisciplinary Applications of Graphs, Combinatorics and Algorithms. 

  • arXiv version - [B2G-BCDS]. 

Ph.D. Thesis 

• Geometric Optimization Problems on Colored Point Sets.

Master's Thesis 

• Characterizations of Square Intersection Graphs. 

My Erdős Number is 2. 

Online links:                                                                           

• Google Scholar.

• DBLP.