| Lazy or eager dynamic matching may not be fast MJ Kashyop, NS Narayanaswamy Information Processing Letters 162, 105982, 2020 | 3 | 2020 |
| Faster algorithms for shortest path and network flow based on graph decomposition. MJ Kashyop, T Nagayama, K Sadakane J. Graph Algorithms Appl. 23 (5), 781-813, 2019 | 3 | 2019 |
| Trade-offs in dynamic coloring for bipartite and general graphs MJ Kashyop, NS Narayanaswamy, M Nasre, SM Potluri Algorithmica 85 (4), 854-878, 2023 | 2 | 2023 |
| Online Drone Scheduling for Last-mile Delivery S Jana, GF Italiano, MJ Kashyop, AL Konstantinidis, E Kosinas, ... arXiv preprint arXiv:2402.16085, 2024 | | 2024 |
| An Invitation to Dynamic Graph Problems: Lower Bounds—III MJ Kashyop, NS Narayanaswamy Resonance 27 (10), 1777-1787, 2022 | | 2022 |
| An Invitation to Dynamic Graph Problems: Upper Bounds—II MJ Kashyop, NS Narayanaswamy Resonance 27 (9), 1607-1624, 2022 | | 2022 |
| An Invitation to Dynamic Graph Problems: Basics—I MJ Kashyop, NS Narayanaswamy Resonance 27 (8), 1443-1451, 2022 | | 2022 |
| Dynamic data structures for interval coloring MJ Kashyop, NS Narayanaswamy Theoretical Computer Science 838, 126-142, 2020 | | 2020 |
| Dynamic Data Structures for Interval Coloring J Girish Raguvir, MJ Kashyop, NS Narayanaswamy | | 2020 |
| Data Structures for Incremental Interval Coloring JG Raguvir, MJ Kashyop, NS Narayanaswamy Computing and Combinatorics: 25th International Conference, COCOON 2019, Xi …, 2019 | | 2019 |
| Fully dynamic approximate maximum cardinality matching in update time MJ Kashyop, NS Narayanaswamy arXiv preprint arXiv:1810.01073, 2018 | | 2018 |
| Faster Network Algorithms Based on Graph Decomposition MJ Kashyop, T Nagayama, K Sadakane WALCOM: Algorithms and Computation: 12th International Conference, WALCOM …, 2018 | | 2018 |
| Novel lower bounds and upper bounds in dynamic coloring and dynamic matching MJ Kashyop Chennai, 0 | | |
Narayanaswamy N SIIT MadrasVerified email at cse.iitm.ac.in
