Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Kolay, Sudeshna
74  Ergebnisse:
Personensuche X
?
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

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

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

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

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

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

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

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

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

Subexponential Algorithms for Rectilinear Steiner Tree and ..:

Fomin, Fedor V. ; Lokshtanov, Daniel ; Kolay, Sudeshna..
ACM Transactions on Algorithms (TALG).  16 (2020)  2 - p. 1-37 , 2020
Link: https://dl.acm.org/doi/1..
 
?
12

Faster Graph bipartization:

Kolay, Sudeshna ; Misra, Pranabendu ; Ramanujan, M.S..
Journal of Computer and System Sciences.  109 (2020)  - p. 45-55 , 2020
Link: https://doi.org/10.1016/..
 
?
13

Communication Complexity and Graph Families:

Kolay, Sudeshna ; Panolan, Fahad ; Saurabh, Saket
ACM Transactions on Computation Theory (TOCT).  11 (2019)  2 - p. 1-28 , 2019
Link: https://dl.acm.org/doi/1..
 
?
14

Communication Complexity and Graph Families:

Kolay, Sudeshna ; Panolan, Fahad ; Saurabh, Saket
ACM Transactions on Computation Theory.  11 (2019)  2 - p. 1-28 , 2019
Link: https://doi.org/10.1145/..
 
?
15

FPT Algorithms for Embedding into Low-Complexity Graphic Me..:

Ghosh, Arijit ; Kolay, Sudeshna ; Mishra, Gopinath
ACM Transactions on Computation Theory.  12 (2019)  1 - p. 1-41 , 2019
Link: https://doi.org/10.1145/..
 
1-15