E-LIB Suche - Ergebnisse für: Narayanaswamy, N.S.

1

Succinct data structure for path graphs:

Balakrishnan, Girish ; Chakraborty, Sankardeep ; Narayanaswamy, N.S..
Information and Computation. 296 (2024) - p. 105124 , 2024

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

2

Succinct Data Structure for Graphs with d-Dimensional t-Rep..:

, In: 2024 Data Compression Conference (DCC),

Balakrishnan, Girish ; Chakraborty, Sankardeep ; Jo, Seungbum.. - p. 546-546 , 2024

Link: https://doi.org/10.1109/..

3

Parameterized Complexity of Minimum Membership Dominating S..:

Agrawal, Akanksha ; Choudhary, Pratibha ; Narayanaswamy, N. S...
Algorithmica. 85 (2023) 11 - p. 3430-3452 , 2023

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

4

Effective Parallelization of the Vehicle Routing Problem:

, In: Proceedings of the Genetic and Evolutionary Computation Conference,

Muniasamy, Rajesh Pandian ; Singh, Somesh ; Nasre, Rupesh. - p. 1036-1044 , 2023

Link: https://dl.acm.org/doi/1..

5

Parameterized Complexity of Minimum Membership Dominating S..:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,

Agrawal, Akanksha ; Choudhary, Pratibha ; Narayanaswamy, N. S... - p. 288-299 , 2022

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

6

An Invitation to Dynamic Graph Problems: Lower Bounds — III:

Kashyop, Manas Jyoti ; Narayanaswamy, N. S.
Resonance. 27 (2022) 10 - p. 1777-1787 , 2022

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

7

An Invitation to Dynamic Graph Problems: Upper Bounds — II:

Kashyop, Manas Jyoti ; Narayanaswamy, N. S.
Resonance. 27 (2022) 9 - p. 1607-1624 , 2022

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

8

Succinct Data Structure for Path Graphs:

, In: 2022 Data Compression Conference (DCC),

Balakrishnan, Girish ; Narayanaswamy, N S ; Chakraborty, Sankardeep. - p. 262-271 , 2022

Link: https://doi.org/10.1109/..

9

An Invitation to Dynamic Graph Problems: Basics — I:

Kashyop, Manas Jyoti ; Narayanaswamy, N. S.
Resonance. 27 (2022) 8 - p. 1443-1451 , 2022

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

10

Trade-Offs in Dynamic Coloring for Bipartite and General Gr..:

Kashyop, Manas Jyoti ; Narayanaswamy, N. S. ; Nasre, Meghana.
Algorithmica. 85 (2022) 4 - p. 854-878 , 2022

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

11

The Connected Domination Number of Grids:

, In: Algorithms and Discrete Applied Mathematics; Lecture Notes in Computer Science,

Srinivasan, Adarsh ; Narayanaswamy, N. S. - p. 247-258 , 2021

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

12

Accelerating Computation of Steiner Trees on GPUs:

Muniasamy, Rajesh Pandian ; Nasre, Rupesh ; Narayanaswamy, N. S.
International Journal of Parallel Programming. 50 (2021) 1 - p. 152-185 , 2021

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

13

Hybrid genetic algorithm for ridesharing with timing constr..:

, In: Proceedings of the 2020 Genetic and Evolutionary Computation Conference,

Patel, Nirav ; Narayanaswamy, N. S. ; Joshi, Alok - p. 1159-1167 , 2020

Link: https://dl.acm.org/doi/1..

14

Preface: CALDAM 2017:

Gaur, Daya Ram ; Narayanaswamy, N.S.
Discrete Applied Mathematics. 286 (2020) - p. 1-2 , 2020

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

15

Dynamic data structures for interval coloring:

J., Girish Raguvir ; Kashyop, Manas Jyoti ; Narayanaswamy, N.S.
Theoretical Computer Science. 838 (2020) - p. 126-142 , 2020

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