Research Publications -@ CSE-IITM

Publications by the members of CSE Department :

Page: 1 of 2 » Prev 1 2 Next page : items per page :

Filters Type : Member : Area : Lab:

Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage.

Girish Balakrishnan, Sankardeep Chakraborty, N.S. Narayanaswamy, Kunihiko Sadakane
Appeared in 19th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2024, June 12-14, 2024, Helsinki, Finland (SWAT 2024), LIPIcs, Vol 294, pp.4:1-4:16, Jun 2024.

A Faster Algorithm for Vertex Cover Parameterized by Solution Size.

David G. Harris , N.S. Narayanaswamy
Appeared in 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France (STACS 2024), LIPIcs, Vol 289, pp.40:1-40:18, Mar 2024.

Succinct Data Structure for Graphs with d-Dimensional t-Representation.

Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo, N.S. Narayanaswamy, Kunihiko Sadakane
Appeared in Data Compression Conference, DCC 2024, Snowbird, UT, USA, March 19-22, 2024 (DCC 2024), pp.546, Mar 2024.

Succinct data structure for path graphs.

Girish Balakrishnan, Sankardeep Chakraborty, N.S. Narayanaswamy, Kunihiko Sadakane
Appeared in Inf. Comput., Vol 296, pp.105124, 2024.

Effective Parallelization of the Vehicle Routing Problem.

Rajesh Pandian M, Somesh Singh, Rupesh Nasre, N.S. Narayanaswamy
Appeared in Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2023, Lisbon, Portugal, July 15-19, 2023 (GECCO 2023), pp.1036-1044, Jul 2023.

Parameterized Complexity of Minimum Membership Dominating Set.

Akanksha Agrawal, Pratibha Choudhary, N.S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi
Appeared in Algorithmica, Vol 85, pp.3430-3452, 2023.

Trade-Offs in Dynamic Coloring for Bipartite and General Graphs.

Manas Jyoti Kashyop, N.S. Narayanaswamy, Meghana Nasre, Sai Mohith Potluri
Appeared in Algorithmica, Vol 85, pp.854-878, 2023.

Succinct Data Structure for Path Graphs.

Girish Balakrishnan, N.S. Narayanaswamy, Sankardeep Chakraborty, Kunihiko Sadakane
Appeared in Data Compression Conference, DCC 2022, Snowbird, UT, USA, March 22-25, 2022 (DCC 2022), pp.262-271, Mar 2022.

Parameterized Complexity of Minimum Membership Dominating Set.

Akanksha Agrawal, Pratibha Choudhary, N.S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi
Appeared in WALCOM: Algorithms and Computation - 16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24-26, 2022, Proceedings (WALCOM 2022), Lecture Notes in Computer Science, Vol 13174, pp.288-299, Mar 2022.

Accelerating Computation of Steiner Trees on GPUs.

Rajesh Pandian Muniasamy, Rupesh Nasre, N.S. Narayanaswamy
Appeared in Int. J. Parallel Program., Vol 50, pp.152-185, 2022.

Budgeted Dominating Sets in Uncertain Graphs.

Keerti Choudhary, Avi Cohen, N.S. Narayanaswamy, David Peleg, Vijayaragunathan
Appeared in 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia. (MFCS 2021), LIPIcs, Vol 202, pp.32:1-32:22, Aug 2021.

The Connected Domination Number of Grids.

Adarsh Srinivasan, N.S. Narayanaswamy
Appeared in Algorithms and Discrete Applied Mathematics - 7th International Conference, CALDAM 2021, Rupnagar, India, February 11-13, 2021, Proceedings (CALDAM 2021), Lecture Notes in Computer Science, Vol 12601, pp.247-258, Feb 2021.

Hybrid genetic algorithm for ridesharing with timing constraints: efficiency analysis with real-world data.

Nirav Patel, N.S. Narayanaswamy, Alok Joshi
Appeared in GECCO '20: Genetic and Evolutionary Computation Conference, Cancn Mexico, July 8-12, 2020, pp.1159-1167, Jul 2020.

Perfect Resolution of Conflict-Free Colouring of Interval Hypergraphs.

Dhannya S M, N.S. Narayanaswamy
Appeared in 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France. (STACS 2020), LIPIcs, Vol 154, pp.52:1-52:16, Mar 2020.

Lazy or eager dynamic matching may not be fast.

Manas Jyoti Kashyop, N.S. Narayanaswamy
Appeared in Inf. Process. Lett., Vol 162, pp.105982, 2020.

Preface: CALDAM 2017.

Daya Ram Gaur, N.S. Narayanaswamy
Appeared in Discret. Appl. Math., Vol 286, pp.1-2, 2020.

Dynamic data structures for interval coloring.

Girish Raguvir J, Manas Jyoti Kashyop, N.S. Narayanaswamy
Appeared in Theor. Comput. Sci., Vol 838, pp.126-142, 2020.

Parameterized Optimization in Uncertain Graphs - A Survey and Some Results.

N.S. Narayanaswamy, Vijayaragunathan
Appeared in Algorithms, Vol 13, pp.3, 2020.

Data Structures for Incremental Interval Coloring.

Girish Raguvir J, Manas Jyoti Kashyop, N.S. Narayanaswamy
Appeared in Computing and Combinatorics - 25th International Conference, COCOON 2019, Xi'an, China, July 29-31, 2019, Proceedings (COCOON 2019), Lecture Notes in Computer Science, Vol 11653, pp.478-489, Jul 2019.

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.

N.S. Narayanaswamy, N. Sadagopan
Appeared in J. Graph Algorithms Appl., Vol 19, pp.549-565, 2015.

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.

N.S. Narayanaswamy, G. Ramakrishna
Appeared in Theor. Comput. Sci., Vol 575, pp.56-70, 2015.

Obtaining Matrices with the Consecutive Ones Property by Row Deletions.

N.S. Narayanaswamy, R. Subashini
Appeared in Algorithmica, Vol 71, pp.758-773, 2015.

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.

N.S. Narayanaswamy, N. Sadagopan
Appeared in Int. J. Found. Comput. Sci., Vol 24, pp.67-94, 2013.

Parameterized Algorithms for (r, l)-Partization.

Krithika.R, N.S. Narayanaswamy
Appeared in J. Graph Algorithms Appl., Vol 17, pp.129-146, 2013.

Another disjoint compression algorithm for odd cycle transversal.

Krithika.R, N.S. Narayanaswamy
Appeared in Inf. Process. Lett., Vol 113, pp.849-851, 2013.

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.

Page: 1 of 2 » Prev 1 2 Next page : items per page :

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

Website Credits