Maximum Independent Set on B_1 B 1 -VPG Graphs. - Abhiruk Lahiri; Joydeep Mukherjee; C. R. Subramanian 001 (COCOA, 2015)

VPG and EPG bend-numbers of Halin graphs. - Mathew C. Francis; Abhiruk Lahiri (Discret. Appl. Math., 2016)

Circular Separation Dimension of a Subclass of Planar Graphs. - Arpitha P. Bharathi; Minati De; Abhiruk Lahiri (Discret. Math. Theor. Comput. Sci., 2017)

Approximating MIS over equilateral B1-VPG graphs. - Abhiruk Lahiri; Joydeep Mukherjee; C. R. Subramanian 001 (CoRR, 2019)

Hardness and approximation for L-EPG and B1-EPG graphs. - Dror Epstein; Martin Charles Golumbic; Abhiruk Lahiri; Gila Morgenstern (Discret. Appl. Math., 2020)

Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs. - Zdenek Dvorák 001; Abhiruk Lahiri (ESA, 2021)

On Comparable Box Dimension. - Zdenek Dvorák 001; Daniel Gonçalves 001; Abhiruk Lahiri; Jane Tan; Torsten Ueckerdt (SoCG, 2022)

Parameterized Convexity Testing. - Abhiruk Lahiri; Ilan Newman; Nithin Varma 001 (SOSA, 2022)

Square roots of nearly planar graphs. - Zdenek Dvorák 001; Benjamin R. Moore; Abhiruk Lahiri (CoRR, 2022)

Improved approximation for maximum edge colouring problem. - L. Sunil Chandran; Abhiruk Lahiri; Nitin Singh (Discret. Appl. Math., 2022)

On approximating MIS over B1-VPG graphs*. - Abhiruk Lahiri; Joydeep Mukherjee; C. R. Subramanian 001 (Discret. Math. Algorithms Appl., 2022)

How Does Fairness Affect the Complexity of Gerrymandering? - Sandip Banerjee; Rajesh Chitnis; Abhiruk Lahiri (AAMAS, 2023)

Approximating Fair k-Min-Sum-Radii in Euclidean Space. - Lukas Drexler; Annika Hennes; Abhiruk Lahiri; Melanie Schmidt 001; Julian Wargalla (WAOA, 2023)

Maximum Edge Colouring Problem On Graphs That Exclude a Fixed Minor. - Zdenek Dvorák 001; Abhiruk Lahiri (WG, 2023)

An update on (n, m)-chromatic numbers. - Sandip Das 001; Abhiruk Lahiri; Soumen Nandi; Sagnik Sen 001; S. Taruni (CoRR, 2023)

Approximating Fair k-Min-Sum-Radii in Rd. - Lukas Drexler; Annika Hennes; Abhiruk Lahiri; Melanie Schmidt 001; Julian Wargalla (CoRR, 2023)

Rainbow trees in uniformly edge-colored graphs. - Elad Aigner-Horev; Dan Hefetz; Abhiruk Lahiri (Random Struct. Algorithms, 2023)

Geometric dominating-set and set-cover via local-search. - Minati De; Abhiruk Lahiri (Comput. Geom., 2023)

Parameterized Shortest Path Reconfiguration. - Nicolas Bousquet 001; Kshitij Gajjar; Abhiruk Lahiri; Amer E. Mouawad (IPEC, 2024)

On (n,m)-chromatic numbers of graphs with bounded sparsity parameters. - Sandip Das 001; Abhiruk Lahiri; Soumen Nandi; Sagnik Sen 001; S. Taruni (Discret. Appl. Math., 2024)

Reconfiguring Shortest Paths in Graphs. - Kshitij Gajjar; Agastya Vibhuti Jha; Manish Kumar 011; Abhiruk Lahiri (Algorithmica, 2024)

Eliminating Majority Illusion. - Foivos Fioravantes; Abhiruk Lahiri; Antonio Lauerbach; Lluís Sabater; Marie Diana Sieper; Samuel Wolf (AAMAS, 2025)

Eliminating Majority Illusions. - Foivos Fioravantes; Abhiruk Lahiri; Antonio Lauerbach; Lluís Sabater; Marie Diana Sieper; Samuel Wolf (CoRR, 2025)