N. S. Narayanaswamy

118 papers A 9B 14C 2Misc 11Journal 71Unranked 10
YearRankTypeTitle / Venue / Authors
2026 — conf
Parameterized Hardness Results for the Restricted Santa Claus Problem.
CALDAM
S. Anil Kumar, N. S. Narayanaswamy
2025 J jnl
A Geometric Programming Approach to Solve the Restricted Assignment Case of the Santa Claus Problem.
Theory Comput. Syst.
S. Anil Kumar, N. S. Narayanaswamy
2025 J jnl
Parameterized algorithms for the Steiner arborescence problem on a hypercube.
Acta Informatica
Sugyani Mahapatra, Manikandan Narayanan, N. S. Narayanaswamy
2025 J jnl
Perfect Resolution of Strong Conflict-Free Colouring of Interval Hypergraphs.
ACM Trans. Algorithms
N. S. Narayanaswamy, S. M. Dhannya
2025 J jnl
TallyGuard: Privacy Preserving Tallied-as-cast Guarantee.
IACR Cryptol. ePrint Arch.
Athish Pranav Dharmalingam, Sai Venkata Krishnan, K. R. Sivaramakrishnan, N. S. Narayanaswamy
2024 A conf
A Faster Algorithm for Vertex Cover Parameterized by Solution Size.
STACS
David G. Harris, N. S. Narayanaswamy
2024 — conf
Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage.
SWAT
Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane
2024 J jnl
Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage.
CoRR
Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane
2024 B conf
Succinct Data Structure for Graphs with d-Dimensional t-Representation.
DCC
Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo, N. S. Narayanaswamy, Kunihiko Sadakane
2024 J jnl
Succinct data structure for path graphs.
Inf. Comput.
Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane
2023 A conf
Effective Parallelization of the Vehicle Routing Problem.
GECCO
Rajesh Pandian Muniasamy, Somesh Singh, Rupesh Nasre, N. S. Narayanaswamy
2023 J jnl
Exactly Hittable Interval Graphs.
CoRR
S. M. Dhannya, N. S. Narayanaswamy, K. K. Nisha
2023 J jnl
Exactly Hittable Interval Graphs.
Discret. Math. Theor. Comput. Sci.
S. M. Dhannya, N. S. Narayanaswamy, K. K. Nisha
2023 J jnl
Parameterized Complexity of Minimum Membership Dominating Set.
Algorithmica
Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi
2023 J jnl
Succinct Data Structure for Graphs with d-Dimensional t-Representation.
CoRR
Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo, N. S. Narayanaswamy, Kunihiko Sadakane
2023 J jnl
Trade-Offs in Dynamic Coloring for Bipartite and General Graphs.
Algorithmica
Manas Jyoti Kashyop, N. S. Narayanaswamy, Meghana Nasre, Sai Mohith Potluri
2022 J jnl
A faster algorithm for Vertex Cover parameterized by solution size.
CoRR
David G. Harris, N. S. Narayanaswamy
2022 J jnl
Accelerating Computation of Steiner Trees on GPUs.
Int. J. Parallel Program.
Rajesh Pandian Muniasamy, Rupesh Nasre, N. S. Narayanaswamy
2022 B conf
Parameterized Complexity of Minimum Membership Dominating Set.
WALCOM
Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi
2022 B conf
Succinct Data Structure for Path Graphs.
DCC
Girish Balakrishnan, N. S. Narayanaswamy, Sankardeep Chakraborty, Kunihiko Sadakane
2021 B conf
Budgeted Dominating Sets in Uncertain Graphs.
MFCS
Keerti Choudhary, Avi Cohen, N. S. Narayanaswamy, David Peleg, R. Vijayaragunathan
2021 J jnl
Budgeted Dominating Sets in Uncertain Graphs.
CoRR
Keerti Choudhary, Avi Cohen, N. S. Narayanaswamy, David Peleg, R. Vijayaragunathan
2021 J jnl
Parameterized Algorithms for the Steiner Tree Problem on a Directed Hypercube.
CoRR
Sugyani Mahapatra, Manikandan Narayanan, N. S. Narayanaswamy, Vijayaragunathan Ramamoorthi
2021 J jnl
Parameterized Complexity of Minimum Membership Dominating Set.
CoRR
Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi
2021 J jnl
Succinct Data Structure for Path Graphs.
CoRR
Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane
2021 — conf
The Connected Domination Number of Grids.
CALDAM
Adarsh Srinivasan, N. S. Narayanaswamy
2020 J jnl
A polynomial time 12-approximation algorithm for restricted Santa Claus problem {\em (Subsequently a 4-Approximation Algorithm).
CoRR
S. Anil Kumar, N. S. Narayanaswamy
2020 J jnl
Dynamic data structures for interval coloring.
Theor. Comput. Sci.
Girish Raguvir J, Manas Jyoti Kashyop, N. S. Narayanaswamy
2020 A conf
Hybrid genetic algorithm for ridesharing with timing constraints: efficiency analysis with real-world data.
GECCO
Nirav Patel, N. S. Narayanaswamy, Alok Joshi
2020 J jnl
Lazy or eager dynamic matching may not be fast.
Inf. Process. Lett.
Manas Jyoti Kashyop, N. S. Narayanaswamy
2020 J jnl
Parameterized Optimization in Uncertain Graphs - A Survey and Some Results.
Algorithms
N. S. Narayanaswamy, R. Vijayaragunathan
2020 A conf
Perfect Resolution of Conflict-Free Colouring of Interval Hypergraphs.
STACS
S. M. Dhannya, N. S. Narayanaswamy
2020 J jnl
Preface: CALDAM 2017.
Discret. Appl. Math.
Daya Ram Gaur, N. S. Narayanaswamy
2020 J jnl
The Connected Domination Number of Grids.
CoRR
Adarsh Srinivasan, N. S. Narayanaswamy
2019 Misc conf
Data Structures for Incremental Interval Coloring.
COCOON
Girish Raguvir J, Manas Jyoti Kashyop, N. S. Narayanaswamy
2019 J jnl
Dynamic coloring for Bipartite and General Graphs.
CoRR
Manas Jyoti Kashyop, N. S. Narayanaswamy, Meghana Nasre, Sai Mohith Potluri
2019 J jnl
Fully Dynamic Data Structures for Interval Coloring.
CoRR
Girish Raguvir J, Manas Jyoti Kashyop, N. S. Narayanaswamy
2019 J jnl
On the Complexity Landscape of Connected f-Factor Problems.
Algorithmica
Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
2018 J jnl
Approximability of Clique Transversal in Perfect Graphs.
Algorithmica
Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman
2018 J jnl
Approximation Algorithms for Connected Graph Factors of Minimum Weight.
Theory Comput. Syst.
Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul, Marten Waanders
2018 J jnl
Conflict-Free Colouring using Maximum Independent Set and Minimum Colouring.
CoRR
S. M. Dhannya, N. S. Narayanaswamy
2018 Misc conf
Exact Algorithms for Allocation Problems.
FAW
Sundar Annamalai, N. S. Narayanaswamy
2018 Misc conf
Facility Location on Planar Graphs with Unreliable Links.
CSR
N. S. Narayanaswamy, Meghana Nasre, R. Vijayaragunathan
2018 J jnl
Fully dynamic 3/2 approximate maximum cardinality matching in O(sqrt{n}) update time.
CoRR
Manas Jyoti Kashyop, N. S. Narayanaswamy
2018 Misc conf
Minimum Membership Hitting Sets of Axis Parallel Segments.
COCOON
N. S. Narayanaswamy, S. M. Dhannya, C. Ramya
2018 J jnl
On the Complexity Landscape of Connected f -Factor Problems.
CoRR
Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
2017 — ed.
Algorithms and Discrete Applied Mathematics - Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings
CALDAM
Daya Ram Gaur, N. S. Narayanaswamy
2016 J jnl
A Characterization for the Existence of Connected $f$-Factors of $\textit{ Large}$ Minimum Degree.
CoRR
N. S. Narayanaswamy, C. S. Rahul
2016 B conf
A Refined Analysis of Online Path Coloring in Trees.
WAOA
Astha Chauhan, N. S. Narayanaswamy
2016 A conf
Hitting Set for Hypergraphs of Low VC-dimension.
ESA
Karl Bringmann, László Kozma, Shay Moran, N. S. Narayanaswamy
2016 B conf
On the Complexity Landscape of Connected f-Factor Problems.
MFCS
Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
2015 J jnl
A Classification of Connected f -factor Problems inside NP.
CoRR
N. S. Narayanaswamy, C. S. Rahul
2015 B conf
Approximate Distance Oracle in O(n 2) Time and O(n) Space for Chordal Graphs.
WALCOM
Gaurav Singh, N. S. Narayanaswamy, G. Ramakrishna
2015 Misc conf
Approximation and Exact Algorithms for Special Cases of Connected f-Factors.
CSR
N. S. Narayanaswamy, C. S. Rahul
2015 C conf
Block Sorting Is APX-Hard.
CIAC
N. S. Narayanaswamy, Swapnoneel Roy
2015 J jnl
Characterization of minimum cycle basis in weighted partial 2-trees.
Discret. Appl. Math.
N. S. Narayanaswamy, G. Ramakrishna
2015 J jnl
Connected (s, t)-Vertex Separator Parameterized by Chordality.
J. Graph Algorithms Appl.
N. S. Narayanaswamy, N. Sadagopan
2015 J jnl
Hitting Set in hypergraphs of low VC-dimension.
CoRR
Karl Bringmann, László Kozma, Shay Moran, N. S. Narayanaswamy
2015 J jnl
Obtaining Matrices with the Consecutive Ones Property by Row Deletions.
Algorithmica
N. S. Narayanaswamy, R. Subashini
2015 J jnl
On minimum average stretch spanning trees in polygonal 2-trees.
Theor. Comput. Sci.
N. S. Narayanaswamy, G. Ramakrishna
2015 — conf
Tree Path Labeling of Hypergraphs - A Generalization of the Consecutive Ones Property.
CALDAM
N. S. Narayanaswamy, Anju Srinivasan
2015 J jnl
Tree t-spanners in outerplanar graphs via supply demand partition.
Discret. Appl. Math.
N. S. Narayanaswamy, G. Ramakrishna
2014 J jnl
An Intuitive Procedure for Converting PDA to CFG, by Construction of Single State PDA.
CoRR
Arjun Bhardwaj, N. S. Narayanaswamy
2014 — conf
Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments.
SWAT
Anup Joshi, N. S. Narayanaswamy
2014 J jnl
Faster Parameterized Algorithms Using Linear Programming.
ACM Trans. Algorithms
Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2014 A conf
LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs.
ESA
Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman
2014 B conf
On Minimum Average Stretch Spanning Trees in Polygonal 2-Trees.
WALCOM
N. S. Narayanaswamy, G. Ramakrishna
2014 J jnl
On Minimum Average Stretch Spanning Trees in Polygonal 2-trees.
CoRR
N. S. Narayanaswamy, G. Ramakrishna
2013 J jnl
A Dirac-type characterization of
Discret. Math.
R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan
2013 J jnl
A Unified Framework for Bi(Tri)Connectivity and Chordal Augmentation.
Int. J. Found. Comput. Sci.
N. S. Narayanaswamy, N. Sadagopan
2013 J jnl
Another Disjoint Compression Algorithm for OCT
CoRR
R. Krithika, N. S. Narayanaswamy
2013 J jnl
Another disjoint compression algorithm for odd cycle transversal.
Inf. Process. Lett.
R. Krithika, N. S. Narayanaswamy
2013 B conf
Approximability of Connected Factors.
WAOA
Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul
2013 J jnl
Approximability of Connected Factors.
CoRR
Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul
2013 J jnl
Characterization of Minimum Cycle Basis in Weighted Partial 2-trees
CoRR
N. S. Narayanaswamy, G. Ramakrishna
2013 B conf
FPT Algorithms for Consecutive Ones Submatrix Problems.
IPEC
N. S. Narayanaswamy, R. Subashini
2013 J jnl
Parameterized Algorithms for (r, l)-Partization.
J. Graph Algorithms Appl.
R. Krithika, N. S. Narayanaswamy
2013 J jnl
Solving min ones 2-sat as fast as vertex cover.
Theor. Comput. Sci.
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar
2013 J jnl
d-COS-R is FPT via Interval Deletion
CoRR
N. S. Narayanaswamy, R. Subashini
2012 J jnl
A Dirac-type Characterization of k-chordal Graphs
CoRR
R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan
2012 C conf
Characterization of Minimum Cycle Basis in Weighted Partial 2-trees.
CTW
N. S. Narayanaswamy, G. Ramakrishna
2012 J jnl
Faster Parameterized Algorithms using Linear Programming
CoRR
Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2012 B conf
Generalized Above Guarantee Vertex Cover and r-Partization.
WALCOM
R. Krithika, N. S. Narayanaswamy
2012 A conf
LP can be a cure for Parameterized Problems.
STACS
N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2012 J jnl
Linear Time Algorithm for Tree t-spanner in Outerplanar Graphs via Supply-Demand Partition in Trees
CoRR
N. S. Narayanaswamy, G. Ramakrishna
2012 — conf
Planning for the Convoy Movement Problem.
ICAART (1)
Anand Kumar, I. Murugeswari, Deepak Khemani, N. S. Narayanaswamy
2011 — conf
A Novel Data Structure for Biconnectivity, Triconnectivity, and k-Tree Augmentation.
CATS
N. S. Narayanaswamy, N. Sadagopan
2011 B conf
A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs.
WALCOM
Esha Ghosh, N. S. Narayanaswamy, C. Pandu Rangan
2011 J jnl
Dominating set based exact algorithms for 3-coloring.
Inf. Process. Lett.
N. S. Narayanaswamy, C. R. Subramanian
2011 J jnl
Hardness of subgraph and supergraph problems in c-tournaments.
Theor. Comput. Sci.
S. Kanthi Kiran, N. S. Narayanaswamy
2011 J jnl
On Approximability of Block Sorting
CoRR
N. S. Narayanaswamy, Swapnoneel Roy
2011 J jnl
On the Complexity of Connected (s, t)-Vertex Separator
CoRR
N. S. Narayanaswamy, N. Sadagopan
2010 B conf
Solving minones-2-sat as Fast as vertex cover.
MFCS
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar
2009 J jnl
A Note on Contractible Edges in Chordal Graphs
CoRR
N. S. Narayanaswamy, N. Sadagopan, Apoorve Dubey
2009 J jnl
A new characterization of matrices with the consecutive ones property.
Discret. Appl. Math.
N. S. Narayanaswamy, R. Subashini
2009 J jnl
Analysis of algorithms for an online version of the convoy movement problem.
J. Oper. Res. Soc.
Ram Gopalan, N. S. Narayanaswamy
2009 J jnl
On the Arrangement of Cliques in Chordal Graphs with respect to the Cuts.
Ars Comb.
L. Sunil Chandran, N. S. Narayanaswamy
2009 J jnl
On the Structure of Contractible Edges in
Graphs Comb.
N. S. Narayanaswamy, N. Sadagopan, L. Sunil Chandran
2009 J jnl
On the Structure of Contractible Vertex Pairs in Chordal Graphs.
Electron. Notes Discret. Math.
N. S. Narayanaswamy, N. Sadagopan
2009 J jnl
Online Algorithms for Self-Organizing Sequential Search - A Survey
CoRR
Rakesh Mohanty, N. S. Narayanaswamy
2009 J jnl
Online Algorithms for Self-Organizing Sequential Search - A Survey.
Electron. Colloquium Comput. Complex.
Rakesh Mohanty, N. S. Narayanaswamy
2009 Misc conf
TRANS: Schema-Aware Mapping of OWL Ontologies into Relational Databases.
COMAD
Saurabh Kejriwal, N. S. Narayanaswamy
2009 Misc conf
Tuning Search Heuristics for Classical Planning with Macro Actions.
FLAIRS
I. Murugeswari, N. S. Narayanaswamy
2008 J jnl
A Note on First-Fit Coloring of Interval Graphs.
Order
N. S. Narayanaswamy, R. Subhash Babu
2007 J jnl
A note on the Hadwiger number of circular arc graphs.
Inf. Process. Lett.
N. S. Narayanaswamy, Naveen Belkale, L. Sunil Chandran, Naveen Sivadasan
2006 J jnl
An improved algorithm for online coloring of intervals with bandwidth.
Theor. Comput. Sci.
Yossi Azar, Amos Fiat, Meital Levy, N. S. Narayanaswamy
2006 Misc conf
Sequences Characterizing
COCOON
Zvi Lotker, Debapriyo Majumdar, N. S. Narayanaswamy, Ingmar Weber
2004 — conf
Algorithms for Satisfiability Using Independent Sets of Variables.
SAT (Selected Papers
Ravi Gummadi, N. S. Narayanaswamy, Venkatakrishnan Ramaswamy
2004 A conf
Algorithms for Satisfiability using Independent Sets of Variables.
SAT
Ravi Gummadi, N. S. Narayanaswamy, Venkatakrishnan Ramaswamy
2004 Misc conf
Dynamic Storage Allocation and On-Line Colouring Interval Graphs.
COCOON
N. S. Narayanaswamy
2004 Misc conf
On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts.
COCOON
L. Sunil Chandran, N. S. Narayanaswamy
2002 B conf
An Optimal Lower Bound for Resolution with 2-Conjunctions.
MFCS
Jan Johannsen, N. S. Narayanaswamy
2002 A conf
On the Complexity of Protein Similarity Search under mRNA Structure Constraints.
STACS
Rolf Backofen, N. S. Narayanaswamy, Firas Swidan
2002 J jnl
Protein similarity search under mRNA structural constraints: application to selenocysteine incorporation.
Silico Biol.
Rolf Backofen, N. S. Narayanaswamy, Firas Swidan
2001 J jnl
Lower Bounds for OBDDs and Nisan's pseudorandom generator.
Electron. Colloquium Comput. Complex.
N. S. Narayanaswamy, C. E. Veni Madhavan
2001 Misc conf
On Assigning Prefix Free Codes to the Vertices of a Graph.
COCOON
N. S. Narayanaswamy, C. E. Veni Madhavan
2001 — conf
Protein similarity search under mRNA structural constraints: application to selenocysteine incorporation.
German Conference on Bioinformatics
Rolf Backofen, N. S. Narayanaswamy, Firas Swidan
1997 — conf
Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic Bounds.
FSTTCS
K. Cirino, S. Muthukrishnan, N. S. Narayanaswamy, H. Ramesh