Narayanaswamy N S
Narayanaswamy N S
Verified email at - Homepage
Cited by
Cited by
Faster parameterized algorithms using linear programming
D Loksthanov, NS Narayanaswamy, V Raman, MS Ramanujan, ...
arXiv preprint arXiv:1203.0833, 2012
A note on first-fit coloring of interval graphs
NS Narayanaswamy, RS Babu
Order 25 (1), 49-53, 2008
LP can be a cure for parameterized problems
NS Narayanaswamy, V Raman, MS Ramanujan, S Saurabh
STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) 14, 338-349, 2012
Dynamic storage allocation and on-line colouring interval graphs
N Narayanaswamy
Computing and Combinatorics, 329-338, 2004
An improved algorithm for online coloring of intervals with bandwidth
Y Azar, A Fiat, M Levy, NS Narayanaswamy
Theoretical Computer Science 363 (1), 18-27, 2006
Hitting set for hypergraphs of low VC-dimension
K Bringmann, L Kozma, S Moran, NS Narayanaswamy
arXiv preprint arXiv:1512.00481, 2015
Graph editing to bipartite interval graphs: exact and asymptotic bounds
K Cirino, S Muthukrishnan, N Narayanaswamy, H Ramesh
Foundations of Software Technology and Theoretical Computer Science, 37-53, 1997
Analysis of algorithms for an online version of the convoy movement problem
R Gopalan, NS Narayanaswamy
Journal of the Operational Research Society 60 (9), 1230-1236, 2009
A new characterization of matrices with the consecutive ones property
NS Narayanaswamy, R Subashini
Discrete applied mathematics 157 (18), 3721-3727, 2009
Protein similarity search under mRNA structural constraints: application to targeted selenocysteine insertion
R Backofen, NS Narayanaswamy, F Swidan
In Silico Biology 2 (3), 275-290, 2002
On the complexity of protein similarity search under mRNA structure constraints
R Backofen, NS Narayanaswamy, F Swidan
STACS 2002, 735-735, 2002
A Dirac-type characterization of k-chordal graphs
R Krithika, R Mathew, NS Narayanaswamy, N Sadagopan
Discrete Mathematics 313 (24), 2865-2867, 2013
Solving min ones 2-sat as fast as vertex cover
N Misra, NS Narayanaswamy, V Raman, BS Shankar
Theoretical Computer Science 506, 115-121, 2013
Approximability of connected factors
K Cornelissen, R Hoeksma, B Manthey, NS Narayanaswamy, CS Rahul
International Workshop on Approximation and Online Algorithms, 120-131, 2013
Parameterized Algorithms for (г, l)-Partization
R Krithika, NS Narayanaswamy
Online algorithms for self-organizing sequential search-a survey
R Mohanty, NS Narayanaswamy
arXiv preprint arXiv:0909.0095, 2009
Connected (s, t)-Vertex Separator Parameterized by Chordality.
NS Narayanaswamy, N Sadagopan
J. Graph Algorithms Appl. 19 (1), 549-565, 2015
An optimal lower bound for resolution with 2-conjunctions
J Johannsen, N Narayanaswamy
Mathematical Foundations of Computer Science 2002, 387-398, 2002
Solving minones-2-sat as fast as vertex cover
N Misra, N Narayanaswamy, V Raman, B Shankar
Mathematical Foundations of Computer Science 2010, 549-555, 2010
Approximation algorithms for connected graph factors of minimum weight
K Cornelissen, R Hoeksma, B Manthey, NS Narayanaswamy, C S Rahul, ...
Theory of computing systems 62 (2), 441-464, 2018
The system can't perform the operation now. Try again later.
Articles 1–20