Abhiruk Lahiri

According to our database, Abhiruk Lahiri authored at least 21 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Reconfiguring Shortest Paths in Graphs.

Kshitij Gajjar, Agastya Vibhuti Jha, Manish Kumar, Abhiruk Lahiri

Algorithmica, October, 2024

On (n,m)-chromatic numbers of graphs with bounded sparsity parameters.

Sandip Das, Abhiruk Lahiri, Soumen Nandi, Sagnik Sen, S. Taruni

Discret. Appl. Math., 2024

Parameterized Shortest Path Reconfiguration.

Nicolas Bousquet, Kshitij Gajjar, Abhiruk Lahiri, Amer E. Mouawad

Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

2023

Geometric dominating-set and set-cover via local-search.

Minati De, Abhiruk Lahiri

Comput. Geom., August, 2023

Rainbow trees in uniformly edge-colored graphs.

Elad Aigner-Horev, Dan Hefetz, Abhiruk Lahiri

Random Struct. Algorithms, March, 2023

Approximating Fair k-Min-Sum-Radii in R^d.

Lukas Drexler, Annika Hennes, Abhiruk Lahiri, Melanie Schmidt, Julian Wargalla

CoRR, 2023

An update on (n, m)-chromatic numbers.

Sandip Das, Abhiruk Lahiri, Soumen Nandi, Sagnik Sen, S. Taruni

CoRR, 2023

Maximum Edge Colouring Problem On Graphs That Exclude a Fixed Minor.

Zdenek Dvorák, Abhiruk Lahiri

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Approximating Fair k-Min-Sum-Radii in Euclidean Space.

Lukas Drexler, Annika Hennes, Abhiruk Lahiri, Melanie Schmidt, Julian Wargalla

Proceedings of the Approximation and Online Algorithms - 21st International Workshop, 2023

How Does Fairness Affect the Complexity of Gerrymandering?

Sandip Banerjee, Rajesh Chitnis, Abhiruk Lahiri

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022

On approximating MIS over B1-VPG graphs*.

Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian

Discret. Math. Algorithms Appl., 2022

Improved approximation for maximum edge colouring problem.

L. Sunil Chandran, Abhiruk Lahiri, Nitin Singh

Discret. Appl. Math., 2022

Square roots of nearly planar graphs.

Zdenek Dvorák, Benjamin R. Moore, Abhiruk Lahiri

CoRR, 2022

Parameterized Convexity Testing.

Abhiruk Lahiri, Ilan Newman, Nithin Varma

Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

On Comparable Box Dimension.

Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs.

Zdenek Dvorák, Abhiruk Lahiri

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

Hardness and approximation for L-EPG and B1-EPG graphs.

Dror Epstein, Martin Charles Golumbic, Abhiruk Lahiri, Gila Morgenstern

Discret. Appl. Math., 2020

2019

Approximating MIS over equilateral B₁-VPG graphs.

Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian

CoRR, 2019

2017

Circular Separation Dimension of a Subclass of Planar Graphs.

Arpitha P. Bharathi, Minati De, Abhiruk Lahiri

Discret. Math. Theor. Comput. Sci., 2017

2016

VPG and EPG bend-numbers of Halin graphs.

Mathew C. Francis, Abhiruk Lahiri

Discret. Appl. Math., 2016

2015

Maximum Independent Set on B_1 B 1 -VPG Graphs.

Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian

Proceedings of the Combinatorial Optimization and Applications, 2015