Abhiruk Lahiri

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 29

Top Topics

Independent Set

Euclidean Space

Approximation Schemes

Top Venues

Discret. Appl. Math.

Publications

Sandip Das, Abhiruk Lahiri, Soumen Nandi, Sagnik Sen, S. Taruni
On (n,m)-chromatic numbers of graphs with bounded sparsity parameters. Discret. Appl. Math. 358 (2024)
Nicolas Bousquet, Kshitij Gajjar, Abhiruk Lahiri, Amer E. Mouawad
Parameterized Shortest Path Reconfiguration. CoRR (2024)
Minati De, Abhiruk Lahiri
Geometric dominating-set and set-cover via local-search. Comput. Geom. 113 (2023)
Zdenek Dvorák, Abhiruk Lahiri
Maximum Edge Colouring Problem On Graphs That Exclude a Fixed Minor. WG (2023)
Sandip Banerjee, Rajesh Chitnis, Abhiruk Lahiri
How Does Fairness Affect the Complexity of Gerrymandering? AAMAS (2023)
Elad Aigner-Horev, Dan Hefetz, Abhiruk Lahiri
Rainbow trees in uniformly edge-colored graphs. Random Struct. Algorithms 62 (2) (2023)
Sandip Das, Abhiruk Lahiri, Soumen Nandi, Sagnik Sen, S. Taruni
An update on (n, m)-chromatic numbers. CoRR (2023)
Zdenek Dvorák, Abhiruk Lahiri
Maximum edge colouring problem on graphs that exclude a fixed minor. CoRR (2023)
Lukas Drexler, Annika Hennes, Abhiruk Lahiri, Melanie Schmidt, Julian Wargalla
Approximating Fair k-Min-Sum-Radii in Euclidean Space. WAOA (2023)
Lukas Drexler, Annika Hennes, Abhiruk Lahiri, Melanie Schmidt, Julian Wargalla
. CoRR (2023)
Abhiruk Lahiri, Ilan Newman, Nithin Varma
Parameterized Convexity Testing. SOSA (2022)
Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian
On approximating MIS over B1-VPG graphs*. Discret. Math. Algorithms Appl. 14 (7) (2022)
Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt
On Comparable Box Dimension. CoRR (2022)
Kshitij Gajjar, Agastya Vibhuti Jha, Manish Kumar, Abhiruk Lahiri
Reconfiguring Shortest Paths in Graphs. AAAI (2022)
L. Sunil Chandran, Abhiruk Lahiri, Nitin Singh
Improved approximation for maximum edge colouring problem. Discret. Appl. Math. 319 (2022)
Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt
On Comparable Box Dimension. SoCG (2022)
Zdenek Dvorák, Abhiruk Lahiri
Approximation schemes for bounded distance problems on fractionally treewidth-fragile graphs. CoRR (2021)
Abhiruk Lahiri, Ilan Newman, Nithin Varma
Parameterized Convexity Testing. CoRR (2021)
Zdenek Dvorák, Abhiruk Lahiri
Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs. ESA (2021)
Kshitij Gajjar, Agastya Vibhuti Jha, Manish Kumar, Abhiruk Lahiri
Reconfiguring Shortest Paths in Graphs. CoRR (2021)
Dror Epstein, Martin Charles Golumbic, Abhiruk Lahiri, Gila Morgenstern
Hardness and approximation for L-EPG and B1-EPG graphs. Discret. Appl. Math. 281 (2020)
Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian
-VPG graphs. CoRR (2019)
L. Sunil Chandran, Abhiruk Lahiri, Nitin Singh
Improved Approximation for Maximum Edge Colouring Problem. CoRR (2019)
Arpitha P. Bharathi, Minati De, Abhiruk Lahiri
Circular Separation Dimension of a Subclass of Planar Graphs. Discret. Math. Theor. Comput. Sci. 19 (3) (2017)
Arpitha P. Bharathi, Minati De, Abhiruk Lahiri
Circular Separation Dimension of a Subclass of Planar Graphs. CoRR (2016)
Mathew C. Francis, Abhiruk Lahiri
VPG and EPG bend-numbers of Halin graphs. Discret. Appl. Math. 215 (2016)
Minati De, Abhiruk Lahiri
Geometric Dominating Set and Set Cover via Local Search. CoRR (2016)
Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian
Maximum Independent Set on B_1 B 1 -VPG Graphs. COCOA (2015)
Mathew C. Francis, Abhiruk Lahiri
VPG and EPG bend-numbers of Halin Graphs. CoRR (2015)