Narayanaswamy N S
Indian Institute of Technology Madras
H-index: 12
Asia-India
Top articles of Narayanaswamy N S
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Succinct data structure for path graphs | Information and Computation | Girish Balakrishnan Sankardeep Chakraborty NS Narayanaswamy Kunihiko Sadakane | 2024/1/1 |
Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage | arXiv preprint arXiv:2402.03748 | Girish Balakrishnan Sankardeep Chakraborty NS Narayanaswamy Kunihiko Sadakane | 2024/2/6 |
Trade-offs in dynamic coloring for bipartite and general graphs | Algorithmica | Manas Jyoti Kashyop NS Narayanaswamy Meghana Nasre Sai Mohith Potluri | 2023/4 |
Exactly Hittable Interval Graphs | arXiv preprint arXiv:2301.00387 | SM Dhannya NS Narayanaswamy KK Nisha | 2023/1/1 |
Succinct Data Structure for Graphs with -Dimensional -Representation | arXiv preprint arXiv:2311.02427 | Girish Balakrishnan Sankardeep Chakraborty Seungbum Jo NS Narayanaswamy Kunihiko Sadakane | 2023/11/4 |
Parameterized complexity of minimum membership dominating set | Akanksha Agrawal Pratibha Choudhary NS Narayanaswamy KK Nisha Vijayaragunathan Ramamoorthi | 2022/3/24 | |
Effective parallelization of the vehicle routing problem | Rajesh Pandian Muniasamy Somesh Singh Rupesh Nasre NS Narayanaswamy | 2023/7/15 | |
An Invitation to Dynamic Graph Problems: Upper Bounds—II | Manas Jyoti Kashyop NS Narayanaswamy | 2022/9 | |
An Invitation to Dynamic Graph Problems: Basics—I | Resonance | Manas Jyoti Kashyop NS Narayanaswamy | 2022/8 |
A faster algorithm for vertex cover parameterized by solution size | arXiv preprint arXiv:2205.08022 | David G Harris NS Narayanaswamy | 2022/5/16 |
Accelerating computation of steiner trees on gpus | International Journal of Parallel Programming | Rajesh Pandian Muniasamy Rupesh Nasre NS Narayanaswamy | 2022/2 |
Parameterized and Approximation Algorithms for the Steiner Arborescence Problem on a Hypercube | Walter Didimo Fedor V Fomin Petr A Golovach Tanmay Inamdar Stephen Kobourov | 2023/9/20 | |
Budgeted Dominating Sets in Uncertain Graphs | arXiv preprint arXiv:2107.03020 | Keerti Choudhary Avi Cohen NS Narayanaswamy David Peleg R Vijayaragunathan | 2021/7/7 |
The connected domination number of grids | Adarsh Srinivasan NS Narayanaswamy | 2021 | |
A polynomial time 12-approximation algorithm for restricted Santa Claus problem | arXiv preprint arXiv:2007.09849 | S Anil Kumar NS Narayanaswamy | 2020/7/20 |
Hybrid genetic algorithm for ridesharing with timing constraints: efficiency analysis with real-world data | Nirav Patel NS Narayanaswamy Alok Joshi | 2020/6/25 | |
Perfect Resolution of Conflict-Free Colouring of Interval Hypergraphs | SM Dhannya NS Narayanaswamy | 2020 | |
Preface: CALDAM 2017 | Daya Ram Gaur NS Narayanaswamy | 2020/11/15 | |
Dynamic data structures for interval coloring | Theoretical Computer Science | Manas Jyoti Kashyop NS Narayanaswamy | 2020/10/24 |
Lazy or eager dynamic matching may not be fast | Information Processing Letters | Manas Jyoti Kashyop NS Narayanaswamy | 2020/10/1 |
Co-Authors
