Segui
Abhiruk Lahiri
Abhiruk Lahiri
Email verificata su hhu.de
Titolo
Citata da
Citata da
Anno
VPG and EPG bend-numbers of Halin graphs
MC Francis, A Lahiri
Discrete Applied Mathematics 215, 95-105, 2016
252016
Maximum Independent Set on -VPG Graphs
A Lahiri, J Mukherjee, CR Subramanian
Combinatorial Optimization and Applications: 9th International Conference …, 2015
252015
On comparable box dimension
Z Dvorák, D Gonçalves, A Lahiri, J Tan, T Ueckerdt
arXiv preprint arXiv:2203.07686, 2022
202022
Reconfiguring shortest paths in graphs
K Gajjar, AV Jha, M Kumar, A Lahiri
Algorithmica 86 (10), 3309-3338, 2024
162024
Geometric dominating-set and set-cover via local-search
M De, A Lahiri
Computational Geometry 113, 102007, 2023
10*2023
Approximation schemes for bounded distance problems on fractionally treewidth-fragile graphs
Z Dvořák, A Lahiri
arXiv preprint arXiv:2105.01780, 2021
92021
Rainbow trees in uniformly edge‐colored graphs
E Aigner‐Horev, D Hefetz, A Lahiri
Random Structures & Algorithms 62 (2), 287-303, 2023
82023
On (n, m)-chromatic numbers of graphs with bounded sparsity parameters
S Das, A Lahiri, S Nandi, S Sen, S Taruni
Discrete Applied Mathematics 358, 417-428, 2024
7*2024
Improved approximation for maximum edge colouring problem
LS Chandran, A Lahiri, N Singh
Discrete Applied Mathematics 319, 42-52, 2022
62022
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
32023
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
32020
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
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
22023
Square roots of nearly planar graphs
Z Dvořák, B Moore, A Lahiri
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
Parameterized Shortest Path Reconfiguration
N Bousquet, K Gajjar, A Lahiri, AE Mouawad
arXiv preprint arXiv:2406.12717, 2024
2024
Eliminating Majority Illusion
F Fioravantes, A Lahiri, A Lauerbach, MD Sieper, S Wolf
2024
On -chromatic numbers of graphs having bounded sparsity parameters
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
22nd International Conference on Autonomous Agents and Multiagent Systems …, 2023
2023
Problems on bend-number, circular separation dimension and maximum edge 2-colouring
A Lahiri
2021
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20