Faster Parameterized Algorithms Using Linear Programming von Lokshtanov, Daniel, Narayanaswamy, N. S., Raman, Venkatesh, Ramanujan, M. S., Saurabh, Saket

Volltext

Another disjoint compression algorithm for odd cycle transversal von Krithika, R., Narayanaswamy, N.S.

Volltext

Trade-Offs in Dynamic Coloring for Bipartite and General Graphs von Kashyop, Manas Jyoti, Narayanaswamy, N. S., Nasre, Meghana, Potluri, Sai Mohith

Volltext

Hardness of subgraph and supergraph problems in c -tournaments von Kanthi Kiran, S., Narayanaswamy, N.S.

Volltext

Analysis of algorithms for an online version of the convoy movement problem von Gopalan, R, Narayanaswamy, N S

Volltext

Parameterized Complexity of Minimum Membership Dominating Set von Agrawal, Akanksha, Choudhary, Pratibha, Narayanaswamy, N. S., Nisha, K. K., Ramamoorthi, Vijayaragunathan

Volltext

An Invitation to Dynamic Graph Problems: Basics — I von Kashyop, Manas Jyoti, Narayanaswamy, N. S.

Volltext

An Invitation to Dynamic Graph Problems: Lower Bounds — III von Kashyop, Manas Jyoti, Narayanaswamy, N. S.

Volltext

An Invitation to Dynamic Graph Problems: Upper Bounds — II von Kashyop, Manas Jyoti, Narayanaswamy, N. S.

Volltext

Accelerating Computation of Steiner Trees on GPUs von Muniasamy, Rajesh Pandian, Nasre, Rupesh, Narayanaswamy, N. S.

Volltext

Exactly Hittable Interval Graphs von Dhannya, S. M., Narayanaswamy, N. S., Nisha, K. K.

Volltext

Dominating set based exact algorithms for 3-coloring von Narayanaswamy, N.S., Subramanian, C.R.

Volltext

Exactly Hittable Interval Graphs von Nisha, K K, Narayanaswamy, N S, Dhannya, S M

Volltext

Preface: CALDAM 2017 von Gaur, Daya Ram, Narayanaswamy, N.S.

Volltext

Approximability of Clique Transversal in Perfect Graphs von Fiorini, Samuel, Krithika, R., Narayanaswamy, N. S., Raman, Venkatesh

Volltext

On the Complexity Landscape of Connected f-Factor Problems von Ganian, R., Narayanaswamy, N. S., Ordyniak, S., Rahul, C. S., Ramanujan, M. S.

Volltext

Parameterized Algorithms for (r,l)-Partization von Krithika, R., Narayanaswamy, N. S.

Volltext

Approximation Algorithms for Connected Graph Factors of Minimum Weight von Cornelissen, Kamiel, Hoeksma, Ruben, Manthey, Bodo, Narayanaswamy, N. S., S. Rahul, C., Waanders, Marten

Volltext

A note on the Hadwiger number of circular arc graphs von Narayanaswamy, N.S., Belkale, N., Chandran, L.S., Sivadasan, N.

Volltext

Algorithms and Discrete Applied Mathematics: Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings von Gaur, Daya, Narayanaswamy, N. S

Volltext