Abhiruk Lahiri

Available identifiers

Publication	Date of Publication	Type
Reconfiguring shortest paths in graphs	2024-10-24	Paper
On $( n , m )$-chromatic numbers of graphs with bounded sparsity parameters	2024-09-26	Paper
Approximating fair $k$-min-sum-radii in Euclidean space	2024-07-19	Paper
Parameterized convexity testing	2024-05-14	Paper
Rainbow trees in uniformly edge‐colored graphs	2023-10-19	Paper
Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs.	2023-09-20	Paper
Geometric dominating-set and set-cover via local-search	2023-07-12	Paper
Maximum edge colouring problem on graphs that exclude a fixed minor	2023-07-05	Paper
On approximating MIS over B1-VPG graphs*	2022-12-19	Paper
Improved approximation for maximum edge colouring problem	2022-08-04	Paper
Square roots of nearly planar graphs	2022-05-25	Paper
On Comparable Box Dimension	2022-03-15	Paper
Hardness and approximation for L-EPG and $B_1$-EPG graphs	2020-05-29	Paper
Circular Separation Dimension of a Subclass of Planar Graphs	2018-12-10	Paper
VPG and EPG bend-numbers of Halin graphs	2016-10-07	Paper
Maximum Independent Set on $$B_1$$ B 1 -VPG Graphs	2016-02-05	Paper
On $(n,m)$-chromatic numbers of graphs having bounded sparsity parameters	N/A	Paper

This page was built for person: Abhiruk Lahiri