E-LIB Suche - Ergebnisse für: Kolay, Sudeshna

1

Knapsack: Connectedness, Path, and Shortest-Path:

Dey, Palash ; Kolay, Sudeshna ; Singh, Sipra
http://arxiv.org/abs/2307.12547. , 2023

Link: http://arxiv.org/abs/230..

2

Efficient Algorithms for Euclidean Steiner Minimal Tree on ..:

Dhar, Anubhav ; Hait, Soumita ; Kolay, Sudeshna
http://arxiv.org/abs/2307.00254. , 2023

Link: http://arxiv.org/abs/230..

3

Efficient Algorithms for Euclidean Steiner Minimal Tree on ..:

Dhar, Anubhav ; Hait, Soumita ; Kolay, Sudeshna
Is Part Of LIPIcs, Volume 283, 34th International Symposium on Algorithms and Computation (ISAAC 2023). , 2023

Link: https://doi.org/10.4230/..

4

An ETH-Tight Exact Algorithm for Euclidean TSP:

de Berg, Mark ; Bodlaender, Hans L ; Kisfaludi-Bak, Sándor.
SIAM JOURNAL ON COMPUTING. , 2023

Link: https://aaltodoc.aalto.f..

5

Parameterized complexity of conflict-free graph coloring:

Bodlaender, Hans L ; Kolay, Sudeshna ; Pieterse, Astrid
https://dspace.library.uu.nl/handle/1874/413526. , 2021

Link: https://dspace.library.u..

6

Parameter Analysis for Guarding Terrains:

Agrawal, Akanksha ; Kolay, Sudeshna ; Zehavi, Meirav
doi:10.4230/LIPIcs.SWAT.2020.4. , 2020

Link: https://doi.org/10.4230/..

7

Parameterized Study of Steiner Tree on Unit Disk Graphs:

Bhore, Sujoy ; Carmi, Paz ; Kolay, Sudeshna.
doi:10.4230/LIPIcs.SWAT.2020.13. , 2020

Link: https://doi.org/10.4230/..

8

Parameterized Study of Steiner Tree on Unit Disk Graphs:

Bhore, Sujoy ; Carmi, Paz ; Kolay, Sudeshna.
http://arxiv.org/abs/2004.09220. , 2020

Link: http://arxiv.org/abs/200..

9

Subexponential Algorithms for Rectilinear Steiner Tree and ..:

Fomin, Fedor V ; Lokshtanov, Daniel ; Kolay, Sudeshna..
http://raiith.iith.ac.in/11343/1/ACM_Transactions_on_Algorithms.pdf. , 2020

Link: http://raiith.iith.ac.in..

10

Parameterized complexity of conflict-free graph coloring:

Bodlaender, Hans L ; Kolay, Sudeshna ; Pieterse, Astrid
0302-9743. , 2019

Link: https://dspace.library.u..

11

Parameterized complexity of conflict-free graph coloring:

Bodlaender, Hans L ; Kolay, Sudeshna ; Pieterse, Astrid
Bodlaender , H L , Kolay , S & Pieterse , A 2019 , ' Parameterized complexity of conflict-free graph coloring ' , arXiv .. , 2019

Link: https://research.tue.nl/..

12

Structural Parameterization for Graph Deletion Problems ove..:

Bishnu, Arijit ; Ghosh, Arijit ; Kolay, Sudeshna..
http://arxiv.org/abs/1906.05458. , 2019

Link: http://arxiv.org/abs/190..

13

Parameterized Complexity Classification of Deletion to List..:

Agrawal, Akanksha ; Kolay, Sudeshna ; Madathil, Jayakrishnan.
doi:10.4230/LIPIcs.ISAAC.2019.41. , 2019

Link: https://doi.org/10.4230/..

14

Parameterized complexity classification of deletion to list..:

Agrawal, Akanksha ; Kolay, Sudeshna ; Madathil, Jayakrishnan.
urn:issn:1868-8969. , 2019

Link: https://hdl.handle.net/1..

15

Parameterized Complexity of Conflict-free Graph Coloring:

Bodlaender, Hans L ; Kolay, Sudeshna ; Pieterse, Astrid
http://arxiv.org/abs/1905.00305. , 2019

Link: http://arxiv.org/abs/190..