A. Lahiri

activity

20152026

most citedVPG and EPG bend-numbers of Halin Graphs

21 citations · 36 across the 14 of their papers we have counts for

collaborators

Showing 2023Show all

3 papers · 1 filter

cs.DS2023★ 1 cited

Approximating Fair $k$ -Min-Sum-Radii in Euclidean Space

Lukas Drexler, Annika Hennes, Abhiruk Lahiri +2

The $k$ -center problem is a classical clustering problem in which one is asked to find a partitioning of a point set $P$ into $k$ clusters such that the maximum radius of any clust…

cs.DM2023

Maximum edge colouring problem on graphs that exclude a fixed minor

Zdeněk Dvořák, Abhiruk Lahiri

The maximum edge colouring problem considers the maximum colour assignment to edges of a graph under the condition that every vertex has at most a fixed number of distinct coloured…

math.CO2023

On $(n, m)$ -chromatic numbers of graphs having bounded sparsity parameters

Sandip Das, Abhiruk Lahiri, Soumen Nandi +2

An $(n, m)$ -graph is characterised by having $n$ types of arcs and $m$ types of edges. A homomorphism of an $(n, m)$ -graph $G$ to an $(n, m)$ -graph $H$ , is a vertex mapping that prese…

Approximating Fair k-Min-Sum-Radii in Euclidean Space

Maximum edge colouring problem on graphs that exclude a fixed minor

On (n,m)-chromatic numbers of graphs having bounded sparsity parameters

Approximating Fair $k$ -Min-Sum-Radii in Euclidean Space

On $(n, m)$ -chromatic numbers of graphs having bounded sparsity parameters