N. S. Narayanaswamy

ORCID

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 44

Top Venues

Publications

Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane
Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage. CoRR (2024)
Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane
Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage. SWAT (2024)
Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane
Succinct data structure for path graphs. Inf. Comput. 296 (2024)
Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo, N. S. Narayanaswamy, Kunihiko Sadakane
Succinct Data Structure for Graphs with d-Dimensional t-Representation. DCC (2024)
David G. Harris, N. S. Narayanaswamy
A Faster Algorithm for Vertex Cover Parameterized by Solution Size. STACS (2024)
Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi
Parameterized Complexity of Minimum Membership Dominating Set. Algorithmica 85 (11) (2023)
S. M. Dhannya, N. S. Narayanaswamy, K. K. Nisha
Exactly Hittable Interval Graphs. CoRR (2023)
Manas Jyoti Kashyop, N. S. Narayanaswamy, Meghana Nasre, Sai Mohith Potluri
Trade-Offs in Dynamic Coloring for Bipartite and General Graphs. Algorithmica 85 (4) (2023)
Rajesh Pandian Muniasamy, Somesh Singh, Rupesh Nasre, N. S. Narayanaswamy
Effective Parallelization of the Vehicle Routing Problem. GECCO (2023)
Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo, N. S. Narayanaswamy, Kunihiko Sadakane
Succinct Data Structure for Graphs with d-Dimensional t-Representation. CoRR (2023)
Girish Balakrishnan, N. S. Narayanaswamy, Sankardeep Chakraborty, Kunihiko Sadakane
Succinct Data Structure for Path Graphs. DCC (2022)
Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi
Parameterized Complexity of Minimum Membership Dominating Set. WALCOM (2022)
Rajesh Pandian Muniasamy, Rupesh Nasre, N. S. Narayanaswamy
Accelerating Computation of Steiner Trees on GPUs. Int. J. Parallel Program. 50 (1) (2022)
David G. Harris, N. S. Narayanaswamy
A faster algorithm for Vertex Cover parameterized by solution size. CoRR (2022)
Keerti Choudhary, Avi Cohen, N. S. Narayanaswamy, David Peleg, R. Vijayaragunathan
Budgeted Dominating Sets in Uncertain Graphs. CoRR (2021)
Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane
Succinct Data Structure for Path Graphs. CoRR (2021)
Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi
Parameterized Complexity of Minimum Membership Dominating Set. CoRR (2021)
Keerti Choudhary, Avi Cohen, N. S. Narayanaswamy, David Peleg, R. Vijayaragunathan
Budgeted Dominating Sets in Uncertain Graphs. MFCS (2021)
Adarsh Srinivasan, N. S. Narayanaswamy
The Connected Domination Number of Grids. CALDAM (2021)
Sugyani Mahapatra, Manikandan Narayanan, N. S. Narayanaswamy, Vijayaragunathan Ramamoorthi
Parameterized Algorithms for the Steiner Tree Problem on a Directed Hypercube. CoRR (2021)
S. Anil Kumar, N. S. Narayanaswamy
A polynomial time 12-approximation algorithm for restricted Santa Claus problem {\em (Subsequently a 4-Approximation Algorithm). CoRR (2020)
Nirav Patel, N. S. Narayanaswamy, Alok Joshi
Hybrid genetic algorithm for ridesharing with timing constraints: efficiency analysis with real-world data. GECCO (2020)
N. S. Narayanaswamy, R. Vijayaragunathan
Parameterized Optimization in Uncertain Graphs - A Survey and Some Results. Algorithms 13 (1) (2020)
Girish Raguvir J, Manas Jyoti Kashyop, N. S. Narayanaswamy
Dynamic data structures for interval coloring. Theor. Comput. Sci. 838 (2020)
Adarsh Srinivasan, N. S. Narayanaswamy
The Connected Domination Number of Grids. CoRR (2020)
Daya Ram Gaur, N. S. Narayanaswamy
Preface: CALDAM 2017. Discret. Appl. Math. 286 (2020)
Manas Jyoti Kashyop, N. S. Narayanaswamy
Lazy or eager dynamic matching may not be fast. Inf. Process. Lett. 162 (2020)
S. M. Dhannya, N. S. Narayanaswamy
Perfect Resolution of Conflict-Free Colouring of Interval Hypergraphs. STACS (2020)
Girish Raguvir J, Manas Jyoti Kashyop, N. S. Narayanaswamy
Fully Dynamic Data Structures for Interval Coloring. CoRR (2019)
Manas Jyoti Kashyop, N. S. Narayanaswamy, Meghana Nasre, Sai Mohith Potluri
Dynamic coloring for Bipartite and General Graphs. CoRR (2019)
Girish Raguvir J, Manas Jyoti Kashyop, N. S. Narayanaswamy
Data Structures for Incremental Interval Coloring. COCOON (2019)
Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
On the Complexity Landscape of Connected f-Factor Problems. Algorithmica 81 (6) (2019)
S. M. Dhannya, N. S. Narayanaswamy
Conflict-Free Colouring using Maximum Independent Set and Minimum Colouring. CoRR (2018)
Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul, Marten Waanders
Approximation Algorithms for Connected Graph Factors of Minimum Weight. Theory Comput. Syst. 62 (2) (2018)
N. S. Narayanaswamy, Meghana Nasre, R. Vijayaragunathan
Facility Location on Planar Graphs with Unreliable Links. CSR (2018)
Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman
Approximability of Clique Transversal in Perfect Graphs. Algorithmica 80 (8) (2018)
Sundar Annamalai, N. S. Narayanaswamy
Exact Algorithms for Allocation Problems. FAW (2018)
N. S. Narayanaswamy, S. M. Dhannya, C. Ramya
Minimum Membership Hitting Sets of Axis Parallel Segments. COCOON (2018)
Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
On the Complexity Landscape of Connected f -Factor Problems. CoRR (2018)
Manas Jyoti Kashyop, N. S. Narayanaswamy
Fully dynamic 3/2 approximate maximum cardinality matching in O(sqrt{n}) update time. CoRR (2018)
Karl Bringmann, László Kozma, Shay Moran, N. S. Narayanaswamy
Hitting Set for Hypergraphs of Low VC-dimension. ESA (2016)
Astha Chauhan, N. S. Narayanaswamy
A Refined Analysis of Online Path Coloring in Trees. WAOA (2016)
Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
On the Complexity Landscape of Connected f-Factor Problems. MFCS (2016)
N. S. Narayanaswamy, C. S. Rahul
A Characterization for the Existence of Connected $f$-Factors of $\textit{ Large}$ Minimum Degree. CoRR (2016)
N. S. Narayanaswamy, G. Ramakrishna
Tree t-spanners in outerplanar graphs via supply demand partition. Discret. Appl. Math. 195 (2015)
Karl Bringmann, László Kozma, Shay Moran, N. S. Narayanaswamy
Hitting Set in hypergraphs of low VC-dimension. CoRR (2015)
N. S. Narayanaswamy, Anju Srinivasan
Tree Path Labeling of Hypergraphs - A Generalization of the Consecutive Ones Property. CALDAM (2015)
N. S. Narayanaswamy, R. Subashini
Obtaining Matrices with the Consecutive Ones Property by Row Deletions. Algorithmica 71 (3) (2015)
N. S. Narayanaswamy, Swapnoneel Roy
Block Sorting Is APX-Hard. CIAC (2015)
N. S. Narayanaswamy, C. S. Rahul
Approximation and Exact Algorithms for Special Cases of Connected f-Factors. CSR (2015)
N. S. Narayanaswamy, G. Ramakrishna
Characterization of minimum cycle basis in weighted partial 2-trees. Discret. Appl. Math. 192 (2015)
Gaurav Singh, N. S. Narayanaswamy, G. Ramakrishna
Approximate Distance Oracle in O(n 2) Time and O(n) Space for Chordal Graphs. WALCOM (2015)
N. S. Narayanaswamy, C. S. Rahul
A Classification of Connected f -factor Problems inside NP. CoRR (2015)
N. S. Narayanaswamy, N. Sadagopan
Connected (s, t)-Vertex Separator Parameterized by Chordality. J. Graph Algorithms Appl. 19 (1) (2015)
N. S. Narayanaswamy, G. Ramakrishna
On minimum average stretch spanning trees in polygonal 2-trees. Theor. Comput. Sci. 575 (2015)
Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
Faster Parameterized Algorithms Using Linear Programming. ACM Trans. Algorithms 11 (2) (2014)
Anup Joshi, N. S. Narayanaswamy
Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments. SWAT (2014)
Arjun Bhardwaj, N. S. Narayanaswamy
An Intuitive Procedure for Converting PDA to CFG, by Construction of Single State PDA. CoRR (2014)
Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman
LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs. ESA (2014)
N. S. Narayanaswamy, G. Ramakrishna
On Minimum Average Stretch Spanning Trees in Polygonal 2-trees. CoRR (2014)
N. S. Narayanaswamy, G. Ramakrishna
On Minimum Average Stretch Spanning Trees in Polygonal 2-Trees. WALCOM (2014)
N. S. Narayanaswamy, R. Subashini
d-COS-R is FPT via Interval Deletion CoRR (2013)
R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan
-chordal graphs. Discret. Math. 313 (24) (2013)
N. S. Narayanaswamy, R. Subashini
FPT Algorithms for Consecutive Ones Submatrix Problems. IPEC (2013)
N. S. Narayanaswamy, N. Sadagopan
A Unified Framework for Bi(Tri)Connectivity and Chordal Augmentation. Int. J. Found. Comput. Sci. 24 (1) (2013)
N. S. Narayanaswamy, G. Ramakrishna
Characterization of Minimum Cycle Basis in Weighted Partial 2-trees CoRR (2013)
R. Krithika, N. S. Narayanaswamy
Another disjoint compression algorithm for odd cycle transversal. Inf. Process. Lett. 113 (22-24) (2013)
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar
Solving min ones 2-sat as fast as vertex cover. Theor. Comput. Sci. 506 (2013)
Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul
Approximability of Connected Factors. WAOA (2013)
Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul
Approximability of Connected Factors. CoRR (2013)
R. Krithika, N. S. Narayanaswamy
Another Disjoint Compression Algorithm for OCT CoRR (2013)
R. Krithika, N. S. Narayanaswamy
Parameterized Algorithms for (r, l)-Partization. J. Graph Algorithms Appl. 17 (2) (2013)
N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
LP can be a cure for Parameterized Problems. STACS (2012)
N. S. Narayanaswamy, G. Ramakrishna
Linear Time Algorithm for Tree t-spanner in Outerplanar Graphs via Supply-Demand Partition in Trees CoRR (2012)
R. Krithika, N. S. Narayanaswamy
Generalized Above Guarantee Vertex Cover and r-Partization. WALCOM (2012)
Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
Faster Parameterized Algorithms using Linear Programming CoRR (2012)
N. S. Narayanaswamy, G. Ramakrishna
Characterization of Minimum Cycle Basis in Weighted Partial 2-trees. CTW (2012)
R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan
A Dirac-type Characterization of k-chordal Graphs CoRR (2012)
Anand Kumar, I. Murugeswari, Deepak Khemani, N. S. Narayanaswamy
Planning for the Convoy Movement Problem. ICAART (1) (2012)
Esha Ghosh, N. S. Narayanaswamy, C. Pandu Rangan
A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs. WALCOM (2011)
N. S. Narayanaswamy, C. R. Subramanian
Dominating set based exact algorithms for 3-coloring. Inf. Process. Lett. 111 (6) (2011)
S. Kanthi Kiran, N. S. Narayanaswamy
Hardness of subgraph and supergraph problems in c-tournaments. Theor. Comput. Sci. 412 (35) (2011)
N. S. Narayanaswamy, N. Sadagopan
A Novel Data Structure for Biconnectivity, Triconnectivity, and k-Tree Augmentation. CATS (2011)
N. S. Narayanaswamy, Swapnoneel Roy
On Approximability of Block Sorting CoRR (2011)
N. S. Narayanaswamy, N. Sadagopan
On the Complexity of Connected (s, t)-Vertex Separator CoRR (2011)
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar
Solving minones-2-sat as Fast as vertex cover. MFCS (2010)
Rakesh Mohanty, N. S. Narayanaswamy
Online Algorithms for Self-Organizing Sequential Search - A Survey CoRR (2009)
Ram Gopalan, N. S. Narayanaswamy
Analysis of algorithms for an online version of the convoy movement problem. J. Oper. Res. Soc. 60 (9) (2009)
Rakesh Mohanty, N. S. Narayanaswamy
Online Algorithms for Self-Organizing Sequential Search - A Survey. Electron. Colloquium Comput. Complex. 16 (2009)
I. Murugeswari, N. S. Narayanaswamy
Tuning Search Heuristics for Classical Planning with Macro Actions. FLAIRS Conference (2009)
N. S. Narayanaswamy, N. Sadagopan, L. Sunil Chandran
-trees. Graphs Comb. 25 (4) (2009)
N. S. Narayanaswamy, N. Sadagopan
On the Structure of Contractible Vertex Pairs in Chordal Graphs. Electron. Notes Discret. Math. 33 (2009)
Saurabh Kejriwal, N. S. Narayanaswamy
TRANS: Schema-Aware Mapping of OWL Ontologies into Relational Databases. COMAD (2009)
N. S. Narayanaswamy, N. Sadagopan, Apoorve Dubey
A Note on Contractible Edges in Chordal Graphs CoRR (2009)
L. Sunil Chandran, N. S. Narayanaswamy
On the Arrangement of Cliques in Chordal Graphs with respect to the Cuts. Ars Comb. 92 (2009)
N. S. Narayanaswamy, R. Subashini
A new characterization of matrices with the consecutive ones property. Discret. Appl. Math. 157 (18) (2009)
N. S. Narayanaswamy, R. Subhash Babu
A Note on First-Fit Coloring of Interval Graphs. Order 25 (1) (2008)
N. S. Narayanaswamy, Naveen Belkale, L. Sunil Chandran, Naveen Sivadasan
A note on the Hadwiger number of circular arc graphs. Inf. Process. Lett. 104 (1) (2007)
Zvi Lotker, Debapriyo Majumdar, N. S. Narayanaswamy, Ingmar Weber
-Trees. COCOON (2006)
Yossi Azar, Amos Fiat, Meital Levy, N. S. Narayanaswamy
An improved algorithm for online coloring of intervals with bandwidth. Theor. Comput. Sci. 363 (1) (2006)

N. S. Narayanaswamy.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

N. S. Narayanaswamy