N. S. Narayanaswamy

Publications

341

Citations

H-Index

2006

Active since

Affiliations

Indian Institute of Technology Madras(Current)

Institute of Mathematical Sciences

University of California San Diego

N. S. Narayanaswamy is an author at Indian Institute of Technology Madras specializing in discrete mathematics, graph theory, and combinatorial optimization.

Top concepts

Discrete MathematicsEngineeringGraph TheoryCombinatorial OptimizationComputer ScienceApproximation TheoryComputational GeometryComputational ComplexityMathematical ProgrammingComputer Engineering

Publications per year

2006–2014

Publications

Faster Parameterized Algorithms Using Linear Programming

Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman et al. · ACM Transactions on Algorithms · 2014 · 178 citations

Mathematical Programming, Engineering, Computational Complexity +16

A Note on First-Fit Coloring of Interval Graphs

N. S. Narayanaswamy, R. Subhash Babu · Order · 2008 · 46 citations

Mathematical Programming, Geometric Graph Theory, Engineering +6

LP can be a cure for Parameterized Problems

N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2012 · 43 citations · Full text

An improved algorithm for online coloring of intervals with bandwidth

Yossi Azar, Amos Fiat, Meital Levy et al. · Theoretical Computer Science · 2006 · 19 citations

Engineering, Color Reproduction, Online Coloring +8

Faster Parameterized Algorithms using Linear Programming

Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman et al. · arXiv (Cornell University) · 2012 · 19 citations · Full text

Mathematical Programming, Engineering, Computational Complexity +16

Rows per page

1–5 of 8