Publications by the members of CSE Department :

Filters Type : Member : Area : Lab:

- On the Complexity Landscape of Connected f-Factor Problems.

Robert Ganian, N.S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan

Appeared in*Algorithmica*, Vol 81, pp.2606-2632, 2019. - Minimum Membership Hitting Sets of Axis Parallel Segments.

N.S. Narayanaswamy, Dhannya S M, Ramya C

Appeared in*Computing and Combinatorics - 24th International Conference, COCOON 2018, Qing Dao, China, July 2-4, 2018, Proceedings (COCOON 2018)*, Lecture Notes in Computer Science, Vol 10976, pp.638-649, Jul 2018. - Facility Location on Planar Graphs with Unreliable Links.

N.S. Narayanaswamy, Meghana Nasre, Vijayaragunathan

Appeared in*Computer Science - Theory and Applications - 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6-10, 2018, Proceedings (CSR 2018)*, Lecture Notes in Computer Science, Vol 10846, pp.269-281, Jun 2018. - Exact Algorithms for Allocation Problems.

Sundar Annamalai, N.S. Narayanaswamy

Appeared in*Frontiers in Algorithmics - 12th International Workshop, FAW 2018, Guangzhou, China, May 8-10, 2018, Proceedings (FAW 2018)*, Lecture Notes in Computer Science, Vol 10823, pp.251-262, May 2018. - Approximability of Clique Transversal in Perfect Graphs.

Samuel Fiorini, R. Krithika, N.S. Narayanaswamy, Venkatesh Raman

Appeared in*Algorithmica*, Vol 80, pp.2221-2239, 2018. - Approximation Algorithms for Connected Graph Factors of Minimum Weight.

Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N.S. Narayanaswamy, C. S. Rahul, Marten Waanders

Appeared in*Theory Comput. Syst.*, Vol 62, pp.441-464, 2018. - A Refined Analysis of Online Path Coloring in Trees.

Astha Chauhan, N.S. Narayanaswamy

Appeared in*Approximation and Online Algorithms - 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected Papers (WAOA 2016)*, Lecture Notes in Computer Science, Vol 10138, pp.142-154, Aug 2016. - Hitting Set for Hypergraphs of Low VC-dimension.

Karl Bringmann, Laszlo Kozma, Shay Moran, N.S. Narayanaswamy

Appeared in*24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark (ESA 2016)*, LIPIcs, Vol 57, pp.23:1-23:18, Aug 2016. - On the Complexity Landscape of Connected f-Factor Problems.

Robert Ganian, N.S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan

Appeared in*41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Krakw, Poland (MFCS 2016)*, LIPIcs, Vol 58, pp.41:1-41:14, Aug 2016. - Approximation and Exact Algorithms for Special Cases of Connected f-Factors.

N.S. Narayanaswamy, C. S. Rahul

Appeared in*Computer Science - Theory and Applications - 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings (CSR 2015)*, Lecture Notes in Computer Science, Vol 9139, pp.350-363, Jul 2015. - Block Sorting Is APX-Hard.

N.S. Narayanaswamy, Swapnoneel Roy

Appeared in*Algorithms and Complexity - 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings (CIAC 2015)*, Lecture Notes in Computer Science, Vol 9079, pp.377-389, May 2015. - Approximate Distance Oracle in O(n 2) Time and O(n) Space for Chordal Graphs.

Gaurav Singh, N.S. Narayanaswamy, G. Ramakrishna

Appeared in*WALCOM: Algorithms and Computation - 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015. Proceedings (WALCOM 2015)*, Lecture Notes in Computer Science, Vol 8973, pp.89-100, Feb 2015. - Tree Path Labeling of Hypergraphs - A Generalization of the Consecutive Ones Property.

N.S. Narayanaswamy, Anju Srinivasan

Appeared in*Algorithms and Discrete Applied Mathematics - First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings (CALDAM 2015)*, Lecture Notes in Computer Science, Vol 8959, pp.150-156, Feb 2015. - Connected (s, t)-Vertex Separator Parameterized by Chordality.

- Tree t-spanners in outerplanar graphs via supply demand partition.

N.S. Narayanaswamy, G. Ramakrishna

Appeared in*Discrete Applied Mathematics*, Vol 195, pp.104-109, 2015. - Characterization of minimum cycle basis in weighted partial 2-trees.

N.S. Narayanaswamy, G. Ramakrishna

Appeared in*Discrete Applied Mathematics*, Vol 192, pp.77-81, 2015. - On minimum average stretch spanning trees in polygonal 2-trees.

- Obtaining Matrices with the Consecutive Ones Property by Row Deletions.

- LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs.

Samuel Fiorini, Krithika.R, N.S. Narayanaswamy, Venkatesh Raman

Appeared in*Algorithms - ESA 2014 - 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings (ESA 2014)*, Lecture Notes in Computer Science, Vol 8737, pp.430-442, Sep 2014. - Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments.

Joshi anup Shirish, N.S. Narayanaswamy

Appeared in*Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings (SWAT 2014)*, Lecture Notes in Computer Science, Vol 8503, pp.357-367, Jul 2014. - On Minimum Average Stretch Spanning Trees in Polygonal 2-Trees.

N.S. Narayanaswamy, G. Ramakrishna

Appeared in*Algorithms and Computation - 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings (WALCOM 2014)*, Lecture Notes in Computer Science, Vol 8344, pp.310-321, Feb 2014. - Faster Parameterized Algorithms Using Linear Programming.

Daniel Lokshtanov, N.S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh

Appeared in*ACM Transactions on Algorithms*, Vol 11, pp.15:1-15:31, 2014. - FPT Algorithms for Consecutive Ones Submatrix Problems.

N.S. Narayanaswamy, R. Subashini

Appeared in*Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers (IPEC 2013)*, Lecture Notes in Computer Science, Vol 8246, pp.295-307, Sep 2013. - Approximability of Connected Factors.

Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N.S. Narayanaswamy, C. S. Rahul

Appeared in*Approximation and Online Algorithms - 11th International Workshop, WAOA 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers (WAOA 2013)*, Lecture Notes in Computer Science, Vol 8447, pp.120-131, Sep 2013. - A Dirac-type characterization ofk-chordal graphs.

Krithika.R, Rogers Mathew, N.S. Narayanaswamy, N. Sadagopan

Appeared in*Discrete Mathematics*, Vol 313, pp.2865-2867, 2013. - Solving min ones 2-sat as fast as vertex cover.

Neeldhara Misra, N.S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar

Appeared in*Theor. Comput. Sci.*, Vol 506, pp.115-121, 2013. - A Unified Framework for Bi(Tri)Connectivity and Chordal Augmentation.

- Parameterized Algorithms for (r, l)-Partization.

- Another disjoint compression algorithm for odd cycle transversal.

- Characterization of Minimum Cycle Basis in Weighted Partial 2-trees.

N.S. Narayanaswamy, G. Ramakrishna

Appeared in*11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Munich, Germany, May 29-31, 2012. Extended Abstracts.*, pp.193-196, May 2012. - Generalized Above Guarantee Vertex Cover and r-Partization.

Krithika.R, N.S. Narayanaswamy

Appeared in*WALCOM: Algorithms and Computation - 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012. Proceedings (WALCOM 2012)*, Lecture Notes in Computer Science, Vol 7157, pp.17-27, Feb 2012. - LP can be a cure for Parameterized Problems.

N.S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh

Appeared in*29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France (STACS 2012)*, LIPIcs, Vol 14, pp.338-349, Feb 2012. - Planning for the Convoy Movement Problem.

Anand Kumar, I. Murugeswari, Deepak Khemani, N.S. Narayanaswamy

Appeared in*ICAART 2012 - Proceedings of the 4th International Conference on Agents and Artificial Intelligence, Volume 1 - Artificial Intelligence, Vilamoura, Algarve, Portugal, 6-8 February, 2012 (ICAART 2012)*, pp.495-498, Feb 2012. - A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs.

Esha Ghosh, N.S. Narayanaswamy, C. Pandu Rangan

Appeared in*WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings (WALCOM 2011)*, Lecture Notes in Computer Science, Vol 6552, pp.191-201, Feb 2011. - A Novel Data Structure for Biconnectivity, Triconnectivity, and k-Tree Augmentation.

N.S. Narayanaswamy, N. Sadagopan

Appeared in*Seventeenth Computing: The Australasian Theory Symposium, CATS 2011, Perth, Australia, January 2011 (CATS 2011)*, CRPIT, Vol 119, pp.45-54, Jan 2011. - Hardness of subgraph and supergraph problems in c-tournaments.

- Dominating set based exact algorithms for 3-coloring.

- Solving minones-2-sat as Fast as vertex cover.

Neeldhara Misra, N.S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar

Appeared in*Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings (MFCS 2010)*, Lecture Notes in Computer Science, Vol 6281, pp.549-555, Aug 2010. - TRANS: Schema-Aware Mapping of OWL Ontologies into Relational Databases.

Saurabh Kejriwal, N.S. Narayanaswamy

Appeared in*Proceedings of the 15th International Conference on Management of Data, December 9-12, 2009, International School of Information Management, Mysore, India*, Dec 2009. - Tuning Search Heuristics for Classical Planning with Macro Actions.

I. Murugeswari, N.S. Narayanaswamy

Appeared in*Proceedings of the Twenty-Second International Florida Artificial Intelligence Research Society Conference, May 19-21, 2009, Sanibel Island, Florida, USA*, May 2009. - Analysis of algorithms for an online version of the convoy movement problem.

- On the Structure of Contractible Vertex Pairs in Chordal Graphs.

N.S. Narayanaswamy, N. Sadagopan

Appeared in*Electronic Notes in Discrete Mathematics*, Vol 33, pp.29-36, 2009. - A new characterization of matrices with the consecutive ones property.

N.S. Narayanaswamy, R. Subashini

Appeared in*Discrete Applied Mathematics*, Vol 157, pp.3721-3727, 2009. - On the Arrangement of Cliques in Chordal Graphs with respect to the Cuts.

- On the Structure of Contractible Edges ink-connected Partialk-trees.

N.S. Narayanaswamy, N. Sadagopan, L. Sunil Chandran

Appeared in*Graphs and Combinatorics*, Vol 25, pp.557-569, 2009. - A Note on First-Fit Coloring of Interval Graphs.

- A note on the Hadwiger number of circular arc graphs.

N.S. Narayanaswamy, Naveen Belkale, L. Sunil Chandran, Naveen Sivadasan

Appeared in*Inf. Process. Lett.*, Vol 104, pp.10-13, 2007. - Sequences Characterizingk-Trees.

Zvi Lotker, Debapriyo Majumdar, N.S. Narayanaswamy, Ingmar Weber

Appeared in*Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings (COCOON 2006)*, Lecture Notes in Computer Science, Vol 4112, pp.216-225, Aug 2006. - An improved algorithm for online coloring of intervals with bandwidth.

Yossi Azar, Amos Fiat, Meital Levy, N.S. Narayanaswamy

Appeared in*Theor. Comput. Sci.*, Vol 363, pp.18-27, 2006. - On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts.

L. Sunil Chandran, N.S. Narayanaswamy

Appeared in*Computing and Combinatorics, 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings (COCOON 2004)*, Lecture Notes in Computer Science, Vol 3106, pp.151-160, Aug 2004.

© 2016 - All Rights Reserved - Dept of CSE, IIT Madras