Παρακολούθηση
Narayanaswamy N S
Narayanaswamy N S
IIT Madras
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα cse.iitm.ac.in - Αρχική σελίδα
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
Faster parameterized algorithms using linear programming
D Loksthanov, NS Narayanaswamy, V Raman, MS Ramanujan, ...
arXiv preprint arXiv:1203.0833, 2012
2012012
A note on first-fit coloring of interval graphs
NS Narayanaswamy, RS Babu
Order 25 (1), 49-53, 2008
582008
LP can be a cure for parameterized problems
NS Narayanaswamy, V Raman, MS Ramanujan, S Saurabh
29th International Symposium on Theoretical Aspects of Computer Science …, 2012
512012
Hitting set for hypergraphs of low VC-dimension
K Bringmann, L Kozma, S Moran, NS Narayanaswamy
arXiv preprint arXiv:1512.00481, 2015
272015
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
202006
Dynamic storage allocation and on-line colouring interval graphs
N Narayanaswamy
Computing and Combinatorics, 329-338, 2004
202004
A Dirac-type characterization of k-chordal graphs
R Krithika, R Mathew, NS Narayanaswamy, N Sadagopan
Discrete Mathematics 313 (24), 2865-2867, 2013
162013
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
162009
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
152013
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
151997
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
142002
A new characterization of matrices with the consecutive ones property
NS Narayanaswamy, R Subashini
Discrete applied mathematics 157 (18), 3721-3727, 2009
132009
A faster algorithm for vertex cover parameterized by solution size
DG Harris, NS Narayanaswamy
arXiv preprint arXiv:2205.08022, 2022
122022
On the complexity of protein similarity search under mRNA structure constraints
R Backofen, NS Narayanaswamy, F Swidan
STACS 2002, 735-735, 2002
122002
Parameterized Algorithms for (г, l)-Partization
R Krithika, NS Narayanaswamy
12
Approximability of connected factors
K Cornelissen, R Hoeksma, B Manthey, NS Narayanaswamy, CS Rahul
Approximation and Online Algorithms: 11th International Workshop, WAOA 2013 …, 2014
102014
Connected (s, t)-vertex separator parameterized by chordality
N Narayanaswamy, N Sadagopan
Journal of Graph Algorithms and Applications 19 (1), 549-565, 2015
92015
Online algorithms for self-organizing sequential search-a survey
R Mohanty, NS Narayanaswamy
arXiv preprint arXiv:0909.0095, 2009
92009
An optimal lower bound for resolution with 2-conjunctions
J Johannsen, N Narayanaswamy
Mathematical Foundations of Computer Science 2002, 387-398, 2002
92002
Block sorting is apx-hard
NS Narayanaswamy, S Roy
International Conference on Algorithms and Complexity, 377-389, 2015
82015
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20