Abhiruk Lahiri

35 papers A* 2A 3B 3C 1Journal 25Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	On Small Pair Decompositions for Point Sets. CoRR Kevin Buchin, Jacobus Conradi, Sariel Har-Peled, Antonia Kalb, Abhiruk Lahiri, Lukas Plätz, Carolin Rehs
2025	A	`conf`	Eliminating Majority Illusion. AAMAS Foivos Fioravantes, Abhiruk Lahiri, Antonio Lauerbach, Lluís Sabater, Marie Diana Sieper, Samuel Wolf
2025	J	`jnl`	Eliminating Majority Illusions. CoRR Foivos Fioravantes, Abhiruk Lahiri, Antonio Lauerbach, Lluís Sabater, Marie Diana Sieper, Samuel Wolf
2024	J	`jnl`	On (n,m)-chromatic numbers of graphs with bounded sparsity parameters. Discret. Appl. Math. Sandip Das, Abhiruk Lahiri, Soumen Nandi, Sagnik Sen, S. Taruni
2024	B	`conf`	Parameterized Shortest Path Reconfiguration. IPEC Nicolas Bousquet, Kshitij Gajjar, Abhiruk Lahiri, Amer E. Mouawad
2024	J	`jnl`	Parameterized Shortest Path Reconfiguration. CoRR Nicolas Bousquet, Kshitij Gajjar, Abhiruk Lahiri, Amer E. Mouawad
2024	J	`jnl`	Reconfiguring Shortest Paths in Graphs. Algorithmica Kshitij Gajjar, Agastya Vibhuti Jha, Manish Kumar, Abhiruk Lahiri
2023	J	`jnl`	An update on (n, m)-chromatic numbers. CoRR Sandip Das, Abhiruk Lahiri, Soumen Nandi, Sagnik Sen, S. Taruni
2023	B	`conf`	Approximating Fair k-Min-Sum-Radii in Euclidean Space. WAOA Lukas Drexler, Annika Hennes, Abhiruk Lahiri, Melanie Schmidt, Julian Wargalla
2023	J	`jnl`	Approximating Fair k-Min-Sum-Radii in R CoRR Lukas Drexler, Annika Hennes, Abhiruk Lahiri, Melanie Schmidt, Julian Wargalla
2023	J	`jnl`	Geometric dominating-set and set-cover via local-search. Comput. Geom. Minati De, Abhiruk Lahiri
2023	A	`conf`	How Does Fairness Affect the Complexity of Gerrymandering? AAMAS Sandip Banerjee, Rajesh Chitnis, Abhiruk Lahiri
2023	B	`conf`	Maximum Edge Colouring Problem On Graphs That Exclude a Fixed Minor. WG Zdenek Dvorák, Abhiruk Lahiri
2023	J	`jnl`	Maximum edge colouring problem on graphs that exclude a fixed minor. CoRR Zdenek Dvorák, Abhiruk Lahiri
2023	J	`jnl`	Rainbow trees in uniformly edge-colored graphs. Random Struct. Algorithms Elad Aigner-Horev, Dan Hefetz, Abhiruk Lahiri
2022	J	`jnl`	Improved approximation for maximum edge colouring problem. Discret. Appl. Math. L. Sunil Chandran, Abhiruk Lahiri, Nitin Singh
2022	A*	`conf`	On Comparable Box Dimension. SoCG Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt
2022	J	`jnl`	On Comparable Box Dimension. CoRR Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt
2022	J	`jnl`	On approximating MIS over B1-VPG graphs*. Discret. Math. Algorithms Appl. Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian
2022	—	`conf`	Parameterized Convexity Testing. SOSA Abhiruk Lahiri, Ilan Newman, Nithin Varma
2022	A*	`conf`	Reconfiguring Shortest Paths in Graphs. AAAI Kshitij Gajjar, Agastya Vibhuti Jha, Manish Kumar, Abhiruk Lahiri
2022	J	`jnl`	Square roots of nearly planar graphs. CoRR Zdenek Dvorák, Benjamin R. Moore, Abhiruk Lahiri
2021	A	`conf`	Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs. ESA Zdenek Dvorák, Abhiruk Lahiri
2021	J	`jnl`	Approximation schemes for bounded distance problems on fractionally treewidth-fragile graphs. CoRR Zdenek Dvorák, Abhiruk Lahiri
2021	J	`jnl`	Parameterized Convexity Testing. CoRR Abhiruk Lahiri, Ilan Newman, Nithin Varma
2021	J	`jnl`	Reconfiguring Shortest Paths in Graphs. CoRR Kshitij Gajjar, Agastya Vibhuti Jha, Manish Kumar, Abhiruk Lahiri
2020	J	`jnl`	Hardness and approximation for L-EPG and B1-EPG graphs. Discret. Appl. Math. Dror Epstein, Martin Charles Golumbic, Abhiruk Lahiri, Gila Morgenstern
2019	J	`jnl`	Approximating MIS over equilateral B CoRR Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian
2019	J	`jnl`	Improved Approximation for Maximum Edge Colouring Problem. CoRR L. Sunil Chandran, Abhiruk Lahiri, Nitin Singh
2017	J	`jnl`	Circular Separation Dimension of a Subclass of Planar Graphs. Discret. Math. Theor. Comput. Sci. Arpitha P. Bharathi, Minati De, Abhiruk Lahiri
2016	J	`jnl`	Circular Separation Dimension of a Subclass of Planar Graphs. CoRR Arpitha P. Bharathi, Minati De, Abhiruk Lahiri
2016	J	`jnl`	Geometric Dominating Set and Set Cover via Local Search. CoRR Minati De, Abhiruk Lahiri
2016	J	`jnl`	VPG and EPG bend-numbers of Halin graphs. Discret. Appl. Math. Mathew C. Francis, Abhiruk Lahiri
2015	C	`conf`	Maximum Independent Set on B_1 B 1 -VPG Graphs. COCOA Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian
2015	J	`jnl`	VPG and EPG bend-numbers of Halin Graphs. CoRR Mathew C. Francis, Abhiruk Lahiri