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

1

Knapsack: Connectedness, Path, and Shortest-Path:

, In: Lecture Notes in Computer Science; LATIN 2024: Theoretical Informatics,

Dey, Palash ; Kolay, Sudeshna ; Singh, Sipra - p. 162-176 , 2024

Link: https://doi.org/10.1007/..

2

Small Vertex Cover Helps in Fixed-Parameter Tractability of..:

Bishnu, Arijit ; Ghosh, Arijit ; Kolay, Sudeshna..
Theory of Computing Systems. 67 (2023) 6 - p. 1241-1267 , 2023

Link: https://doi.org/10.1007/..

3

Almost optimal query algorithm for hitting set using a subs..:

Bishnu, Arijit ; Ghosh, Arijit ; Kolay, Sudeshna..
Journal of Computer and System Sciences. 137 (2023) - p. 50-65 , 2023

Link: https://doi.org/10.1016/..

4

An ETH-Tight Exact Algorithm for Euclidean TSP:

de Berg, Mark ; Bodlaender, Hans L. ; Kisfaludi-Bak, Sándor.
SIAM Journal on Computing. 52 (2023) 3 - p. 740-760 , 2023

Link: https://doi.org/10.1137/..

5

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..

6

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..

7

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..

8

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/..

9

Parameterized Study of Steiner Tree on Unit Disk Graphs:

Bhore, Sujoy ; Carmi, Paz ; Kolay, Sudeshna.
Algorithmica. 85 (2022) 1 - p. 133-152 , 2022

Link: https://doi.org/10.1007/..

10

Parameter Analysis for Guarding Terrains:

Agrawal, Akanksha ; Kolay, Sudeshna ; Zehavi, Meirav
Algorithmica. 84 (2022) 4 - p. 961-981 , 2022

Link: https://doi.org/10.1007/..

11

Exact Multi-Covering Problems with Geometric Sets:

Ashok, Pradeesha ; Kolay, Sudeshna ; Misra, Neeldhara.
Theory of Computing Systems. 66 (2021) 1 - p. 89-113 , 2021

Link: https://doi.org/10.1007/..

12

Parameterized Complexity of Conflict-Free Graph Coloring:

Bodlaender, Hans L. ; Kolay, Sudeshna ; Pieterse, Astrid
SIAM Journal on Discrete Mathematics. 35 (2021) 3 - p. 2003-2038 , 2021

Link: https://doi.org/10.1137/..

13

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..

14

Fixed Parameter Tractability of Graph Deletion Problems ove..:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,

Bishnu, Arijit ; Ghosh, Arijit ; Kolay, Sudeshna.. - p. 652-663 , 2020

Link: https://doi.org/10.1007/..

15

Subexponential Algorithms for Rectilinear Steiner Tree and ..:

Fomin, Fedor V. ; Lokshtanov, Daniel ; Kolay, Sudeshna..
ACM Transactions on Algorithms. 16 (2020) 2 - p. 1-37 , 2020

Link: https://doi.org/10.1145/..