N. Narayanaswamy

Most-cited papers

Faster Parameterized Algorithms Using Linear Programming
D. Lokshtanov, N. Narayanaswamy, Venkatesh Raman, M. Ramanujan +1 more
2012ACM Trans. Algorithms215 citations Open access
Semantic Scholar
Evaluation of some Medicinal Plants for their Antioxidant Properties
N. Narayanaswamy, K. Balakrishnan
200391 citations
Semantic Scholar
A Note on First-Fit Coloring of Interval Graphs
N. Narayanaswamy, R. Babu
2008Order53 citations
Semantic Scholar
A faster algorithm for Vertex Cover parameterized by solution size
David G. Harris, N. Narayanaswamy
2022Symposium on Theoretical Aspects of Computer Science50 citations Open access
Semantic Scholar
LP can be a cure for Parameterized Problems
N. Narayanaswamy, Venkatesh Raman, M. Ramanujan, Saket Saurabh
2012Symposium on Theoretical Aspects of Computer Science48 citations
Semantic Scholar
Botanicals as sunscreens: Their role in the prevention of photoaging and skin cancer
K. Balakrishnan, N. Narayanaswamy
201130 citations
Semantic Scholar
Hitting Set for Hypergraphs of Low VC-dimension
K. Bringmann, L. Kozma, S. Moran, N. Narayanaswamy
2015Embedded Systems and Applications21 citations
Semantic Scholar
Dynamic Storage Allocation and On-Line Colouring Interval Graphs
N. Narayanaswamy
2004International Computing and Combinatorics Conference21 citations
Semantic Scholar
Evaluation Of Some Medicinal Plants For Their Dandruff Control Properties
K. Balakrishnan, N. Narayanaswamy, S. Mathews, K. Gurung
201120 citations
Semantic Scholar
TYROSINASE INHIBITION AND ANTI-OXIDANT PROPERTIES OF MUNTINGIA CALABURA EXTRACTS: IN VITRO STUDIES
N. Narayanaswamy, Arun Duraisamy, K. Balakrishnan
201120 citations
Semantic Scholar
Analysis of algorithms for an online version of the convoy movement problem
R. Gopalan, N. Narayanaswamy
2009Journal of the Operational Research Society15 citations
Semantic Scholar
An improved algorithm for online coloring of intervals with bandwidth
Y. Azar, A. Fiat, Meital Levy, N. Narayanaswamy
2006Theoretical Computer Science15 citations Open access
Semantic Scholar
A Dirac-type characterization of k-chordal graphs
R. Krithika, Rogers Mathew, N. Narayanaswamy, N. Sadagopan
2012Discrete Mathematics14 citations Open access
Semantic Scholar
Antibacterial Activity Of Certain Medicinal Plants Against Acne-Inducing Bacteria
K. Balakrishnan, N. Narayanaswamy, P. Subba, E. Poornima
201113 citations
Semantic Scholar
Solving min ones 2-sat as fast as vertex cover
Neeldhara Misra, N. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar
2013Theoretical Computer Science12 citations Open access
Semantic Scholar
Approximability of Connected Factors
Kamiel Cornelissen, R. Hoeksma, B. Manthey, N. Narayanaswamy +1 more
2013Workshop on Approximation and Online Algorithms11 citations Open access
Semantic Scholar
APPLICATION OF NATURAL PRODUCTS IN COSMETICS: A STUDY OF IXORA COCCINEA EXTRACTS FOR THEIR ANTITYROSINASE AND ANTIOXIDANT ACTIVITIES
S. Rohini, M. Shalini, N. Narayanaswamy, K. Balakrishnan
201211 citations
Semantic Scholar
A new characterization of matrices with the consecutive ones property
N. Narayanaswamy, R. Subashini
2009Discrete Applied Mathematics11 citations Open access
Semantic Scholar
Obtaining Matrices with the Consecutive Ones Property by Row Deletions
N. Narayanaswamy, R. Subashini
2015Algorithmica10 citations
Semantic Scholar
Online Algorithms for Self-Organizing Sequential Search - A Survey
Rakesh Mohanty, N. Narayanaswamy
2009Electron. Colloquium Comput. Complex.9 citations
Semantic Scholar
Connected (s, t)-Vertex Separator Parameterized by Chordality
N. Narayanaswamy, N. Sadagopan
2015J. Graph Algorithms Appl.8 citations Open access
Semantic Scholar
Sequences Characterizing k-Trees
Zvi Lotker, Debapriyo Majumdar, N. Narayanaswamy, Ingmar Weber
2006International Computing and Combinatorics Conference8 citations
Semantic Scholar
Block Sorting Is APX-Hard
N. Narayanaswamy, Swapnoneel Roy
2015International/Italian Conference on Algorithms and Complexity7 citations
Semantic Scholar
Another disjoint compression algorithm for odd cycle transversal
R. Krithika, N. Narayanaswamy
2013Information Processing Letters7 citations
Semantic Scholar
Solving minones-2-sat as Fast as vertex cover
Neeldhara Misra, N. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar
2010International Symposium on Mathematical Foundations of Computer Science7 citations
Semantic Scholar
Succinct Data Structure for Path Graphs
Girish Balakrishnan, N. Narayanaswamy, Sankardeep Chakraborty, K. Sadakane
2021Data Compression Conference6 citations
Semantic Scholar
Trade-Offs in Dynamic Coloring for Bipartite and General Graphs
Manas Jyoti Kashyop, N. Narayanaswamy, Meghana Nasre, Sai Mohith Potluri
2019Algorithmica6 citations Open access
Semantic Scholar
Facility Location on Planar Graphs with Unreliable Links
N. Narayanaswamy, Meghana Nasre, R. Vijayaragunathan
2018Computer Science Symposium in Russia6 citations
Semantic Scholar
Minimum Membership Hitting Sets of Axis Parallel Segments
N. Narayanaswamy, S. M. Dhannya, C. Ramya
2018International Computing and Combinatorics Conference6 citations
Semantic Scholar
Effective Parallelization of the Vehicle Routing Problem
Rajesh Pandian Muniasamy, Somesh Singh, R. Nasre, N. Narayanaswamy
2023Annual Conference on Genetic and Evolutionary Computation5 citations Open access
Semantic Scholar
Accelerating Computation of Steiner Trees on GPUs
Rajesh Pandian Muniasamy, R. Nasre, N. Narayanaswamy
2021International journal of parallel programming5 citations
Semantic Scholar
The Connected Domination Number of Grids
Adarsh Srinivasan, N. Narayanaswamy
2020International Conference on Algorithms and Discrete Applied Mathematics5 citations Open access
Semantic Scholar
Approximation Algorithms for Connected Graph Factors of Minimum Weight
Kamiel Cornelissen, R. Hoeksma, B. Manthey, N. Narayanaswamy +2 more
2016Theory of Computing Systems5 citations Open access
Semantic Scholar
Approximation and Exact Algorithms for Special Cases of Connected f-Factors
N. Narayanaswamy, C. Rahul
2015Computer Science Symposium in Russia5 citations
Semantic Scholar
FPT Algorithms for Consecutive Ones Submatrix Problems
N. Narayanaswamy, R. Subashini
2013International Symposium on Parameterized and Exact Computation5 citations
Semantic Scholar
Linear Time Algorithm for Tree t-spanner in Outerplanar Graphs via Supply-Demand Partition in Trees
N. Narayanaswamy, G. Ramakrishna
2012arXiv.org5 citations
Semantic Scholar
Experimental study on the effect of biogas diesel engines driven by silkworm larval litter, cyperus rotundus and cattle urine
N. Narayanaswamy, C. Ramesh, N. Bharath, P. B. K. Reddy +1 more
20214 citations
Semantic Scholar
Dynamic coloring for Bipartite and General Graphs
Manas Jyoti Kashyop, N. Narayanaswamy, Meghana Nasre, Sai Mohith Potluri
2019arXiv.org4 citations
Semantic Scholar
Parameterized Optimization in Uncertain Graphs - A Survey and Some Results
N. Narayanaswamy, R. Vijayaragunathan
2019Algorithms4 citations Open access
Semantic Scholar
Approximate Distance Oracle in O(n 2) Time and O(n) Space for Chordal Graphs
Gaurav Singh, N. Narayanaswamy, G. Ramakrishna
2015Workshop on Algorithms and Computation4 citations
Semantic Scholar
Bio-Inspired Bi-Plane Flapping Wing MAV
S. Baligidad, N. Narayanaswamy, N. Krishnamurthy
20154 citations
Semantic Scholar
On minimum average stretch spanning trees in polygonal 2-trees
N. Narayanaswamy, G. Ramakrishna
2014Theoretical Computer Science4 citations Open access
Semantic Scholar
A Unified Framework for Bi(Tri)Connectivity and Chordal Augmentation
N. Narayanaswamy, N. Sadagopan
2013International Journal of Foundations of Computer Science4 citations
Semantic Scholar
Planning for the Convoy Movement Problem
Anand Kumar, I. Murugeswari, D. Khemani, N. Narayanaswamy
2012International Conference on Agents and Artificial Intelligence4 citations Open access
Semantic Scholar
A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs
Esha Ghosh, N. Narayanaswamy, C. Rangan
2011Workshop on Algorithms and Computation4 citations
Semantic Scholar
Dominating set based exact algorithms for 3-coloring
N. Narayanaswamy, C. Subramanian
2011Information Processing Letters4 citations
Semantic Scholar
A note on the Hadwiger number of circular arc graphs
N. Narayanaswamy, Naveen Belkale, L. Chandran, Naveen Sivadasan
2007Information Processing Letters4 citations
Semantic Scholar
Algorithms for Satisfiability using Independent Sets of Variables
Ravi Gummadi, N. Narayanaswamy, Venkatakrishnan Ramaswamy
2004International Conference on Theory and Applications of Satisfiability Testing4 citations
Semantic Scholar
Parameterized Complexity of Minimum Membership Dominating Set
A. Agrawal, Pratibha Choudhary, N. Narayanaswamy, K. Nisha +1 more
2021Algorithmica3 citations
Semantic Scholar
Hybrid genetic algorithm for ridesharing with timing constraints: efficiency analysis with real-world data
Nirav J. Patel, N. Narayanaswamy, A. Joshi
2020Annual Conference on Genetic and Evolutionary Computation3 citations
Semantic Scholar