default search action
N. S. Narayanaswamy
Person information
- affiliation: ERNET, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j33]Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct data structure for path graphs. Inf. Comput. 296: 105124 (2024) - [c45]Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct Data Structure for Graphs with d-Dimensional t-Representation. DCC 2024: 546 - [c44]David G. Harris, N. S. Narayanaswamy:
A Faster Algorithm for Vertex Cover Parameterized by Solution Size. STACS 2024: 40:1-40:18 - [c43]Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage. SWAT 2024: 4:1-4:16 - [i33]Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage. CoRR abs/2402.03748 (2024) - 2023
- [j32]Manas Jyoti Kashyop
, N. S. Narayanaswamy, Meghana Nasre, Sai Mohith Potluri:
Trade-Offs in Dynamic Coloring for Bipartite and General Graphs. Algorithmica 85(4): 854-878 (2023) - [j31]Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi:
Parameterized Complexity of Minimum Membership Dominating Set. Algorithmica 85(11): 3430-3452 (2023) - [c42]Rajesh Pandian Muniasamy
Effective Parallelization of the Vehicle Routing Problem. GECCO 2023: 1036-1044 - [i32]S. M. Dhannya, N. S. Narayanaswamy, K. K. Nisha:
Exactly Hittable Interval Graphs. CoRR abs/2301.00387 (2023) - [i31]Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct Data Structure for Graphs with d-Dimensional t-Representation. CoRR abs/2311.02427 (2023) - 2022
- [j30]Rajesh Pandian Muniasamy
Accelerating Computation of Steiner Trees on GPUs. Int. J. Parallel Program. 50(1): 152-185 (2022) - [c41]Girish Balakrishnan, N. S. Narayanaswamy, Sankardeep Chakraborty, Kunihiko Sadakane
Succinct Data Structure for Path Graphs. DCC 2022: 262-271 - [c40]Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi:
Parameterized Complexity of Minimum Membership Dominating Set. WALCOM 2022: 288-299 - [i30]David G. Harris, N. S. Narayanaswamy:
A faster algorithm for Vertex Cover parameterized by solution size. CoRR abs/2205.08022 (2022) - 2021
- [c39]Adarsh Srinivasan
The Connected Domination Number of Grids. CALDAM 2021: 247-258 - [c38]Keerti Choudhary, Avi Cohen, N. S. Narayanaswamy, David Peleg, R. Vijayaragunathan:
Budgeted Dominating Sets in Uncertain Graphs. MFCS 2021: 32:1-32:22 - [i29]Keerti Choudhary, Avi Cohen, N. S. Narayanaswamy, David Peleg, R. Vijayaragunathan:
Budgeted Dominating Sets in Uncertain Graphs. CoRR abs/2107.03020 (2021) - [i28]Sugyani Mahapatra, Manikandan Narayanan, N. S. Narayanaswamy, Vijayaragunathan Ramamoorthi:
Parameterized Algorithms for the Steiner Tree Problem on a Directed Hypercube. CoRR abs/2110.02830 (2021) - [i27]Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi:
Parameterized Complexity of Minimum Membership Dominating Set. CoRR abs/2110.06656 (2021) - [i26]Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct Data Structure for Path Graphs. CoRR abs/2111.04332 (2021) - 2020
- [j29]N. S. Narayanaswamy
Parameterized Optimization in Uncertain Graphs - A Survey and Some Results. Algorithms 13(1): 3 (2020) - [j28]Daya Ram Gaur
Preface: CALDAM 2017. Discret. Appl. Math. 286: 1-2 (2020) - [j27]Manas Jyoti Kashyop, N. S. Narayanaswamy:
Lazy or eager dynamic matching may not be fast. Inf. Process. Lett. 162: 105982 (2020) - [j26]Girish Raguvir J, Manas Jyoti Kashyop
Dynamic data structures for interval coloring. Theor. Comput. Sci. 838: 126-142 (2020) - [c37]Nirav Patel, N. S. Narayanaswamy, Alok Joshi:
Hybrid genetic algorithm for ridesharing with timing constraints: efficiency analysis with real-world data. GECCO 2020: 1159-1167 - [c36]S. M. Dhannya, N. S. Narayanaswamy:
Perfect Resolution of Conflict-Free Colouring of Interval Hypergraphs. STACS 2020: 52:1-52:16 - [i25]S. Anil Kumar, N. S. Narayanaswamy:
A polynomial time 12-approximation algorithm for restricted Santa Claus problem {\em (Subsequently a 4-Approximation Algorithm). CoRR abs/2007.09849 (2020) - [i24]Adarsh Srinivasan, N. S. Narayanaswamy:
The Connected Domination Number of Grids. CoRR abs/2011.11328 (2020)
2010 – 2019
- 2019
- [j25]Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak
On the Complexity Landscape of Connected f-Factor Problems. Algorithmica 81(6): 2606-2632 (2019) - [c35]Girish Raguvir J, Manas Jyoti Kashyop, N. S. Narayanaswamy:
Data Structures for Incremental Interval Coloring. COCOON 2019: 478-489 - [i23]Girish Raguvir J, Manas Jyoti Kashyop, N. S. Narayanaswamy:
Fully Dynamic Data Structures for Interval Coloring. CoRR abs/1904.00692 (2019) - [i22]Manas Jyoti Kashyop, N. S. Narayanaswamy, Meghana Nasre, Sai Mohith Potluri:
Dynamic coloring for Bipartite and General Graphs. CoRR abs/1909.07854 (2019) - 2018
- [j24]Samuel Fiorini, R. Krithika
Approximability of Clique Transversal in Perfect Graphs. Algorithmica 80(8): 2221-2239 (2018) - [j23]Kamiel Cornelissen, Ruben Hoeksma
Approximation Algorithms for Connected Graph Factors of Minimum Weight. Theory Comput. Syst. 62(2): 441-464 (2018) - [c34]N. S. Narayanaswamy, S. M. Dhannya, C. Ramya:
Minimum Membership Hitting Sets of Axis Parallel Segments. COCOON 2018: 638-649 - [c33]N. S. Narayanaswamy, Meghana Nasre, R. Vijayaragunathan
Facility Location on Planar Graphs with Unreliable Links. CSR 2018: 269-281 - [c32]Sundar Annamalai
Exact Algorithms for Allocation Problems. FAW 2018: 251-262 - [i21]Manas Jyoti Kashyop, N. S. Narayanaswamy:
Fully dynamic 3/2 approximate maximum cardinality matching in O(sqrt{n}) update time. CoRR abs/1810.01073 (2018) - [i20]S. M. Dhannya, N. S. Narayanaswamy:
Conflict-Free Colouring using Maximum Independent Set and Minimum Colouring. CoRR abs/1812.01459 (2018) - [i19]Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan:
On the Complexity Landscape of Connected f -Factor Problems. CoRR abs/1812.02037 (2018) - 2017
- [e1]Daya Ram Gaur, N. S. Narayanaswamy:
Algorithms and Discrete Applied Mathematics - Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings. Lecture Notes in Computer Science 10156, Springer 2017, ISBN 978-3-319-53006-2 [contents] - 2016
- [c31]Karl Bringmann, László Kozma
Hitting Set for Hypergraphs of Low VC-dimension. ESA 2016: 23:1-23:18 - [c30]Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak
On the Complexity Landscape of Connected f-Factor Problems. MFCS 2016: 41:1-41:14 - [c29]Astha Chauhan, N. S. Narayanaswamy:
A Refined Analysis of Online Path Coloring in Trees. WAOA 2016: 142-154 - [i18]N. S. Narayanaswamy, C. S. Rahul:
A Characterization for the Existence of Connected $f$-Factors of $\textit{ Large}$ Minimum Degree. CoRR abs/1601.06291 (2016) - 2015
- [j22]N. S. Narayanaswamy, R. Subashini
Obtaining Matrices with the Consecutive Ones Property by Row Deletions. Algorithmica 71(3): 758-773 (2015) - [j21]N. S. Narayanaswamy, G. Ramakrishna
Characterization of minimum cycle basis in weighted partial 2-trees. Discret. Appl. Math. 192: 77-81 (2015) - [j20]N. S. Narayanaswamy, G. Ramakrishna
Tree t-spanners in outerplanar graphs via supply demand partition. Discret. Appl. Math. 195: 104-109 (2015) - [j19]N. S. Narayanaswamy, N. Sadagopan:
Connected (s, t)-Vertex Separator Parameterized by Chordality. J. Graph Algorithms Appl. 19(1): 549-565 (2015) - [j18]N. S. Narayanaswamy, G. Ramakrishna
On minimum average stretch spanning trees in polygonal 2-trees. Theor. Comput. Sci. 575: 56-70 (2015) - [c28]N. S. Narayanaswamy, Anju Srinivasan:
Tree Path Labeling of Hypergraphs - A Generalization of the Consecutive Ones Property. CALDAM 2015: 150-156 - [c27]N. S. Narayanaswamy, Swapnoneel Roy:
Block Sorting Is APX-Hard. CIAC 2015: 377-389 - [c26]N. S. Narayanaswamy, C. S. Rahul:
Approximation and Exact Algorithms for Special Cases of Connected f-Factors. CSR 2015: 350-363 - [c25]Gaurav Singh, N. S. Narayanaswamy, G. Ramakrishna:
Approximate Distance Oracle in O(n 2) Time and O(n) Space for Chordal Graphs. WALCOM 2015: 89-100 - [i17]N. S. Narayanaswamy, C. S. Rahul:
A Classification of Connected f -factor Problems inside NP. CoRR abs/1507.07856 (2015) - [i16]Karl Bringmann, László Kozma, Shay Moran, N. S. Narayanaswamy:
Hitting Set in hypergraphs of low VC-dimension. CoRR abs/1512.00481 (2015) - 2014
- [j17]Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
Faster Parameterized Algorithms Using Linear Programming. ACM Trans. Algorithms 11(2): 15:1-15:31 (2014) - [c24]Samuel Fiorini, R. Krithika
LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs. ESA 2014: 430-442 - [c23]Anup Joshi, N. S. Narayanaswamy:
Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments. SWAT 2014: 357-367 - [c22]N. S. Narayanaswamy, G. Ramakrishna:
On Minimum Average Stretch Spanning Trees in Polygonal 2-Trees. WALCOM 2014: 310-321 - [i15]N. S. Narayanaswamy, G. Ramakrishna:
On Minimum Average Stretch Spanning Trees in Polygonal 2-trees. CoRR abs/1401.0432 (2014) - [i14]Arjun Bhardwaj, N. S. Narayanaswamy:
An Intuitive Procedure for Converting PDA to CFG, by Construction of Single State PDA. CoRR abs/1411.0813 (2014) - 2013
- [j16]R. Krithika
A Dirac-type characterization of k-chordal graphs. Discret. Math. 313(24): 2865-2867 (2013) - [j15]N. S. Narayanaswamy, N. Sadagopan:
A Unified Framework for Bi(Tri)Connectivity and Chordal Augmentation. Int. J. Found. Comput. Sci. 24(1): 67-94 (2013) - [j14]R. Krithika
Another disjoint compression algorithm for odd cycle transversal. Inf. Process. Lett. 113(22-24): 849-851 (2013) - [j13]R. Krithika
Parameterized Algorithms for (r, l)-Partization. J. Graph Algorithms Appl. 17(2): 129-146 (2013) - [j12]Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar:
Solving min ones 2-sat as fast as vertex cover. Theor. Comput. Sci. 506: 115-121 (2013) - [c21]N. S. Narayanaswamy, R. Subashini
FPT Algorithms for Consecutive Ones Submatrix Problems. IPEC 2013: 295-307 - [c20]Kamiel Cornelissen, Ruben Hoeksma
Approximability of Connected Factors. WAOA 2013: 120-131 - [i13]N. S. Narayanaswamy, G. Ramakrishna:
Characterization of Minimum Cycle Basis in Weighted Partial 2-trees. CoRR abs/1302.5889 (2013) - [i12]N. S. Narayanaswamy, R. Subashini:
d-COS-R is FPT via Interval Deletion. CoRR abs/1303.1643 (2013) - [i11]R. Krithika, N. S. Narayanaswamy:
Another Disjoint Compression Algorithm for OCT. CoRR abs/1303.1671 (2013) - [i10]Kamiel Cornelissen, Ruben Hoeksma
Approximability of Connected Factors. CoRR abs/1310.2387 (2013) - 2012
- [c19]N. S. Narayanaswamy, G. Ramakrishna:
Characterization of Minimum Cycle Basis in Weighted Partial 2-trees. CTW 2012: 193-196 - [c18]Anand Kumar, I. Murugeswari, Deepak Khemani, N. S. Narayanaswamy:
Planning for the Convoy Movement Problem. ICAART (1) 2012: 495-498 - [c17]N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
LP can be a cure for Parameterized Problems. STACS 2012: 338-349 - [c16]R. Krithika
Generalized Above Guarantee Vertex Cover and r-Partization. WALCOM 2012: 17-27 - [i9]Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
Faster Parameterized Algorithms using Linear Programming. CoRR abs/1203.0833 (2012) - [i8]R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan:
A Dirac-type Characterization of k-chordal Graphs. CoRR abs/1206.5397 (2012) - [i7]N. S. Narayanaswamy, G. Ramakrishna:
Linear Time Algorithm for Tree t-spanner in Outerplanar Graphs via Supply-Demand Partition in Trees. CoRR abs/1210.7919 (2012) - 2011
- [j11]N. S. Narayanaswamy, C. R. Subramanian:
Dominating set based exact algorithms for 3-coloring. Inf. Process. Lett. 111(6): 251-255 (2011) - [j10]S. Kanthi Kiran, N. S. Narayanaswamy:
Hardness of subgraph and supergraph problems in c-tournaments. Theor. Comput. Sci. 412(35): 4629-4635 (2011) - [c15]N. S. Narayanaswamy, N. Sadagopan:
A Novel Data Structure for Biconnectivity, Triconnectivity, and k-Tree Augmentation. CATS 2011: 45-54 - [c14]Esha Ghosh, N. S. Narayanaswamy, C. Pandu Rangan:
A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs. WALCOM 2011: 191-201 - [i6]N. S. Narayanaswamy, Swapnoneel Roy:
On Approximability of Block Sorting. CoRR abs/1110.0892 (2011) - [i5]N. S. Narayanaswamy, N. Sadagopan:
On the Complexity of Connected (s, t)-Vertex Separator. CoRR abs/1111.1814 (2011) - 2010
- [c13]Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar:
Solving minones-2-sat as Fast as vertex cover. MFCS 2010: 549-555
2000 – 2009
- 2009
- [j9]L. Sunil Chandran, N. S. Narayanaswamy:
On the Arrangement of Cliques in Chordal Graphs with respect to the Cuts. Ars Comb. 92 (2009) - [j8]N. S. Narayanaswamy, R. Subashini
A new characterization of matrices with the consecutive ones property. Discret. Appl. Math. 157(18): 3721-3727 (2009) - [j7]N. S. Narayanaswamy, N. Sadagopan:
On the Structure of Contractible Vertex Pairs in Chordal Graphs. Electron. Notes Discret. Math. 33: 29-36 (2009) - [j6]N. S. Narayanaswamy, N. Sadagopan, L. Sunil Chandran:
On the Structure of Contractible Edges in k-connected Partial k-trees. Graphs Comb. 25(4): 557-569 (2009) - [j5]Ram Gopalan, N. S. Narayanaswamy:
Analysis of algorithms for an online version of the convoy movement problem. J. Oper. Res. Soc. 60(9): 1230-1236 (2009) - [c12]Saurabh Kejriwal, N. S. Narayanaswamy:
TRANS: Schema-Aware Mapping of OWL Ontologies into Relational Databases. COMAD 2009 - [c11]I. Murugeswari, N. S. Narayanaswamy:
Tuning Search Heuristics for Classical Planning with Macro Actions. FLAIRS 2009 - [i4]N. S. Narayanaswamy, N. Sadagopan, Apoorve Dubey:
A Note on Contractible Edges in Chordal Graphs. CoRR abs/0902.1364 (2009) - [i3]Rakesh Mohanty, N. S. Narayanaswamy:
Online Algorithms for Self-Organizing Sequential Search - A Survey. CoRR abs/0909.0095 (2009) - [i2]Rakesh Mohanty, N. S. Narayanaswamy:
Online Algorithms for Self-Organizing Sequential Search - A Survey. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j4]N. S. Narayanaswamy, R. Subhash Babu:
A Note on First-Fit Coloring of Interval Graphs. Order 25(1): 49-53 (2008) - 2007
- [j3]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): 10-13 (2007) - 2006
- [j2]Yossi Azar
An improved algorithm for online coloring of intervals with bandwidth. Theor. Comput. Sci. 363(1): 18-27 (2006) - [c10]Zvi Lotker, Debapriyo Majumdar, N. S. Narayanaswamy, Ingmar Weber:
Sequences Characterizing k-Trees. COCOON 2006: 216-225 - 2004
- [c9]L. Sunil Chandran, N. S. Narayanaswamy:
On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts. COCOON 2004: 151-160 - [c8]N. S. Narayanaswamy:
Dynamic Storage Allocation and On-Line Colouring Interval Graphs. COCOON 2004: 329-338 - [c7]Ravi Gummadi, N. S. Narayanaswamy, Venkatakrishnan Ramaswamy:
Algorithms for Satisfiability using Independent Sets of Variables. SAT 2004 - [c6]Ravi Gummadi, N. S. Narayanaswamy, Venkatakrishnan Ramaswamy:
Algorithms for Satisfiability Using Independent Sets of Variables. SAT (Selected Papers 2004: 133-144 - 2002
- [j1]Rolf Backofen, N. S. Narayanaswamy, Firas Swidan:
Protein similarity search under mRNA structural constraints: application to selenocysteine incorporation. Silico Biol. 2(3): 275-290 (2002) - [c5]Jan Johannsen, N. S. Narayanaswamy:
An Optimal Lower Bound for Resolution with 2-Conjunctions. MFCS 2002: 387-398 - [c4]Rolf Backofen, N. S. Narayanaswamy, Firas Swidan:
On the Complexity of Protein Similarity Search under mRNA Structure Constraints. STACS 2002: 274-286 - 2001
- [c3]N. S. Narayanaswamy, C. E. Veni Madhavan:
On Assigning Prefix Free Codes to the Vertices of a Graph. COCOON 2001: 328-337 - [c2]Rolf Backofen, N. S. Narayanaswamy, Firas Swidan:
Protein similarity search under mRNA structural constraints: application to selenocysteine incorporation. German Conference on Bioinformatics 2001: 135-140 - [i1]N. S. Narayanaswamy, C. E. Veni Madhavan:
Lower Bounds for OBDDs and Nisan's pseudorandom generator. Electron. Colloquium Comput. Complex. TR01 (2001)
1990 – 1999
- 1997
- [c1]K. Cirino, S. Muthukrishnan, N. S. Narayanaswamy, H. Ramesh:
Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic Bounds. FSTTCS 1997: 37-53
Coauthor Index
R. Vijayaragunathan
aka: Vijayaragunathan Ramamoorthi
aka: Vijayaragunathan Ramamoorthi
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: