The following pages link to Abhiruk Lahiri (Q323043):
Displayed 12 items.
- VPG and EPG bend-numbers of Halin graphs (Q323044) (← links)
- Improved approximation for maximum edge colouring problem (Q2161229) (← links)
- Hardness and approximation for L-EPG and \(B_1\)-EPG graphs (Q2184686) (← links)
- Maximum Independent Set on $$B_1$$ B 1 -VPG Graphs (Q3467876) (← links)
- Circular Separation Dimension of a Subclass of Planar Graphs (Q4560209) (← links)
- On approximating MIS over B1-VPG graphs* (Q5057743) (← links)
- Rainbow trees in uniformly edge‐colored graphs (Q6074865) (← links)
- Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs. (Q6075929) (← links)
- Geometric dominating-set and set-cover via local-search (Q6114477) (← links)
- On Comparable Box Dimension (Q6393719) (← links)
- Square roots of nearly planar graphs (Q6400150) (← links)
- Maximum edge colouring problem on graphs that exclude a fixed minor (Q6442704) (← links)