Seguir
Abhiruk Lahiri
Abhiruk Lahiri
Email confirmado em hhu.de
Título
Citado por
Citado por
Ano
VPG and EPG bend-numbers of Halin graphs
MC Francis, A Lahiri
Discrete Applied Mathematics 215, 95-105, 2016
242016
Maximum Independent Set on -VPG Graphs
A Lahiri, J Mukherjee, CR Subramanian
Combinatorial Optimization and Applications: 9th International Conference …, 2015
222015
Reconfiguring shortest paths in graphs
K Gajjar, AV Jha, M Kumar, A Lahiri
Proceedings of the AAAI Conference on Artificial Intelligence 36 (9), 9758-9766, 2022
102022
On comparable box dimension
Z Dvorák, D Gonçalves, A Lahiri, J Tan, T Ueckerdt
arXiv preprint arXiv:2203.07686, 2022
102022
Geometric dominating set and set cover via local search
M De, A Lahiri
arXiv preprint arXiv:1605.02499, 2016
9*2016
Rainbow trees in uniformly edge‐colored graphs
E Aigner‐Horev, D Hefetz, A Lahiri
Random Structures & Algorithms 62 (2), 287-303, 2023
82023
Approximation schemes for bounded distance problems on fractionally treewidth-fragile graphs
Z Dvořák, A Lahiri
arXiv preprint arXiv:2105.01780, 2021
62021
Improved approximation for maximum edge colouring problem
LS Chandran, A Lahiri, N Singh
Discrete Applied Mathematics 319, 42-52, 2022
52022
On Chromatic Number of (nm)-graphs
A Lahiri, S Nandi, S Taruni, S Sen
Extended Abstracts EuroComb 2021: European Conference on Combinatorics …, 2021
42021
Circular separation dimension of a subclass of planar graphs
AP Bharathi, M De, A Lahiri
Discrete Mathematics & Theoretical Computer Science 19 (Graph Theory), 2017
32017
Hardness and approximation for L-EPG and B1-EPG graphs
D Epstein, MC Golumbic, A Lahiri, G Morgenstern
Discrete Applied Mathematics 281, 224-228, 2020
22020
Square roots of nearly planar graphs
Z Dvořák, B Moore, A Lahari
arXiv preprint arXiv:2205.12764, 2022
12022
Parameterized Convexity Testing∗
A Lahiri, I Newman, N Varma
Symposium on Simplicity in Algorithms (SOSA), 174-181, 2022
12022
Approximating Fair k-Min-Sum-Radii in Euclidean Space
L Drexler, A Hennes, A Lahiri, M Schmidt, J Wargalla
International Workshop on Approximation and Online Algorithms, 119-133, 2023
2023
Approximating Fair -Min-Sum-Radii in
L Drexler, A Hennes, A Lahiri, M Schmidt, J Wargalla
arXiv preprint arXiv:2309.00834, 2023
2023
Maximum edge colouring problem on graphs that exclude a fixed minor
Z Dvořák, A Lahiri
International Workshop on Graph-Theoretic Concepts in Computer Science, 291-304, 2023
2023
An update on -chromatic numbers
S Das, A Lahiri, S Nandi, S Sen, S Taruni
arXiv preprint arXiv:2306.08069, 2023
2023
How Does Fairness Affect the Complexity of Gerrymandering?
S Banerjee, R Chitnis, A Lahiri
AAMAS, 2869-2871, 2023
2023
On approximating MIS over -VPG graphs*
A Lahiri, J Mukherjee, CR Subramanian
Discrete Mathematics, Algorithms and Applications 14 (07), 2250035, 2022
2022
Problems on bend-number, circular separation dimension and maximum edge 2-colouring
A Lahiri
2021
O sistema não pode efectuar a operação agora. Tente mais tarde.
Artigos 1–20