N. S. Narayanaswamy

Kunihiko Sadakane

Inf. Comput., January, 2024

Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage.

[BibT_eX]

[DOI]

Girish Balakrishnan

Sankardeep Chakraborty

Kunihiko Sadakane

CoRR, 2024

A Faster Algorithm for Vertex Cover Parameterized by Solution Size.

[BibT_eX]

[DOI]

David G. Harris

Vijayaragunathan Ramamoorthi

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2023

Parameterized Complexity of Minimum Membership Dominating Set.

[BibT_eX]

[DOI]

Algorithmica, November, 2023

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

[BibT_eX]

[DOI]

Algorithmica, April, 2023

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

[BibT_eX]

[DOI]

Girish Balakrishnan

Sankardeep Chakraborty

Seungbum Jo

Kunihiko Sadakane

CoRR, 2023

Exactly Hittable Interval Graphs.

[BibT_eX]

[DOI]

K. K. Nisha

CoRR, 2023

Effective Parallelization of the Vehicle Routing Problem.

[BibT_eX]

[DOI]

Rajesh Pandian Muniasamy

Somesh Singh

Rupesh Nasre

Proceedings of the Genetic and Evolutionary Computation Conference, 2023

2022

Accelerating Computation of Steiner Trees on GPUs.

[BibT_eX]

[DOI]

Rajesh Pandian Muniasamy

Rupesh Nasre

Int. J. Parallel Program., 2022

2021

Parameterized Algorithms for the Steiner Tree Problem on a Directed Hypercube.

[BibT_eX]

[DOI]

Sugyani Mahapatra

Manikandan Narayanan

Vijayaragunathan Ramamoorthi

CoRR, 2021

Budgeted Dominating Sets in Uncertain Graphs.

[BibT_eX]

[DOI]

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

The Connected Domination Number of Grids.

[BibT_eX]

[DOI]

Adarsh Srinivasan

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020

Dynamic data structures for interval coloring.

[BibT_eX]

[DOI]

Girish Raguvir J

Theor. Comput. Sci., 2020

Lazy or eager dynamic matching may not be fast.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

Preface: CALDAM 2017.

[BibT_eX]

[DOI]

Daya Ram Gaur

Discret. Appl. Math., 2020

A polynomial time 12-approximation algorithm for restricted Santa Claus problem {\em (Subsequently a 4-Approximation Algorithm).

[BibT_eX]

[DOI]

S. Anil Kumar

CoRR, 2020

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

[BibT_eX]

[DOI]

R. Vijayaragunathan

Algorithms, 2020

Perfect Resolution of Conflict-Free Colouring of Interval Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

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

[BibT_eX]

[DOI]

Nirav Patel

Alok Joshi

Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

2019

Dynamic coloring for Bipartite and General Graphs.

[BibT_eX]

[DOI]

CoRR, 2019

Fully Dynamic Data Structures for Interval Coloring.

[BibT_eX]

[DOI]

Girish Raguvir J

CoRR, 2019

On the Complexity Landscape of Connected f-Factor Problems.

[BibT_eX]

[DOI]

Algorithmica, 2019

Data Structures for Incremental Interval Coloring.

[BibT_eX]

[DOI]

Girish Raguvir J

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018

Approximation Algorithms for Connected Graph Factors of Minimum Weight.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

Conflict-Free Colouring using Maximum Independent Set and Minimum Colouring.

[BibT_eX]

[DOI]

CoRR, 2018

Fully dynamic 3/2 approximate maximum cardinality matching in O(sqrt{n}) update time.

[BibT_eX]

[DOI]

CoRR, 2018

Approximability of Clique Transversal in Perfect Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2018

Exact Algorithms for Allocation Problems.

[BibT_eX]

[DOI]

Sundar Annamalai

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

Facility Location on Planar Graphs with Unreliable Links.

[BibT_eX]

[DOI]

Meghana Nasre

R. Vijayaragunathan

Proceedings of the Computer Science - Theory and Applications, 2018

Minimum Membership Hitting Sets of Axis Parallel Segments.

[BibT_eX]

[DOI]

C. Ramya

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2016

A Characterization for the Existence of Connected $f$-Factors of $\textit{ Large}$ Minimum Degree.

[BibT_eX]

[DOI]

C. S. Rahul

CoRR, 2016

A Refined Analysis of Online Path Coloring in Trees.

[BibT_eX]

[DOI]

Astha Chauhan

Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

Hitting Set for Hypergraphs of Low VC-dimension.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

On minimum average stretch spanning trees in polygonal 2-trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Connected (s, t)-Vertex Separator Parameterized by Chordality.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Characterization of minimum cycle basis in weighted partial 2-trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

A Classification of Connected f -factor Problems inside NP.

[BibT_eX]

[DOI]

C. S. Rahul

CoRR, 2015

Obtaining Matrices with the Consecutive Ones Property by Row Deletions.

[BibT_eX]

[DOI]

Algorithmica, 2015

Approximate Distance Oracle in O(n 2) Time and O(n) Space for Chordal Graphs.

[BibT_eX]

[DOI]

Gaurav Singh

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

Approximation and Exact Algorithms for Special Cases of Connected f-Factors.

[BibT_eX]

[DOI]

C. S. Rahul

Proceedings of the Computer Science - Theory and Applications, 2015

Block Sorting Is APX-Hard.

[BibT_eX]

[DOI]

Swapnoneel Roy

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

Tree Path Labeling of Hypergraphs - A Generalization of the Consecutive Ones Property.

[BibT_eX]

[DOI]

Anju Srinivasan

Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

2014

Faster Parameterized Algorithms Using Linear Programming.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2014

An Intuitive Procedure for Converting PDA to CFG, by Construction of Single State PDA.

[BibT_eX]

[DOI]

Arjun Bhardwaj

CoRR, 2014

Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments.

[BibT_eX]

[DOI]

Anup Joshi

Proceedings of the Algorithm Theory - SWAT 2014, 2014

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

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2014, 2014

2013

Solving min ones 2-sat as fast as vertex cover.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Parameterized Algorithms for (r, l)-Partization.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2013

Another disjoint compression algorithm for odd cycle transversal.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

A Unified Framework for Bi(Tri)Connectivity and Chordal Augmentation.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2013

A Dirac-type characterization of k-chordal graphs.

[BibT_eX]

[DOI]

Discret. Math., 2013

Another Disjoint Compression Algorithm for OCT

[BibT_eX]

[DOI]

CoRR, 2013

d-COS-R is FPT via Interval Deletion

[BibT_eX]

[DOI]

CoRR, 2013

Approximability of Connected Factors.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 11th International Workshop, 2013

FPT Algorithms for Consecutive Ones Submatrix Problems.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

2012

Linear Time Algorithm for Tree t-spanner in Outerplanar Graphs via Supply-Demand Partition in Trees

[BibT_eX]

[DOI]

CoRR, 2012

A Dirac-type Characterization of k-chordal Graphs

[BibT_eX]

[DOI]

CoRR, 2012

Generalized Above Guarantee Vertex Cover and r-Partization.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

LP can be a cure for Parameterized Problems.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Planning for the Convoy Movement Problem.

[BibT_eX]

Proceedings of the ICAART 2012 - Proceedings of the 4th International Conference on Agents and Artificial Intelligence, Volume 1, 2012

2011

Hardness of subgraph and supergraph problems in c-tournaments.

[BibT_eX]

[DOI]

S. Kanthi Kiran

Theor. Comput. Sci., 2011

Dominating set based exact algorithms for 3-coloring.

[BibT_eX]

[DOI]

C. R. Subramanian

Inf. Process. Lett., 2011

On the Complexity of Connected (s, t)-Vertex Separator

[BibT_eX]

[DOI]

CoRR, 2011

On Approximability of Block Sorting

[BibT_eX]

[DOI]

Swapnoneel Roy

CoRR, 2011

A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs.

[BibT_eX]

[DOI]

Esha Ghosh

C. Pandu Rangan

Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

A Novel Data Structure for Biconnectivity, Triconnectivity, and k-Tree Augmentation.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2010

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

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009

Analysis of algorithms for an online version of the convoy movement problem.

[BibT_eX]

[DOI]

Ram Gopalan

J. Oper. Res. Soc., 2009

On the Structure of Contractible Edges in k-connected Partial k-trees.

[BibT_eX]

[DOI]

L. Sunil Chandran

Graphs Comb., 2009

On the Structure of Contractible Vertex Pairs in Chordal Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Online Algorithms for Self-Organizing Sequential Search - A Survey.

[BibT_eX]

[DOI]

Rakesh Mohanty

Electron. Colloquium Comput. Complex., 2009

A new characterization of matrices with the consecutive ones property.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

A Note on Contractible Edges in Chordal Graphs

[BibT_eX]

[DOI]

Apoorve Dubey

CoRR, 2009

On the Arrangement of Cliques in Chordal Graphs with respect to the Cuts.

[BibT_eX]

L. Sunil Chandran

Ars Comb., 2009

Tuning Search Heuristics for Classical Planning with Macro Actions.

[BibT_eX]

[DOI]

I. Murugeswari

Proceedings of the Twenty-Second International Florida Artificial Intelligence Research Society Conference, 2009

TRANS: Schema-Aware Mapping of OWL Ontologies into Relational Databases.

[BibT_eX]

[DOI]

Saurabh Kejriwal

Proceedings of the 15th International Conference on Management of Data, 2009

2008

A Note on First-Fit Coloring of Interval Graphs.

[BibT_eX]

[DOI]

R. Subhash Babu

Order, 2008

2007

A note on the Hadwiger number of circular arc graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

2006

An improved algorithm for online coloring of intervals with bandwidth.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Sequences Characterizing k-Trees.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2004

Algorithms for Satisfiability using Independent Sets of Variables.

[BibT_eX]

[DOI]

Ravi Gummadi

Venkatakrishnan Ramaswamy

Proceedings of the SAT 2004, 2004

Dynamic Storage Allocation and On-Line Colouring Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2002

Protein similarity search under mRNA structural constraints: application to selenocysteine incorporation.

[BibT_eX]

[DOI]

Rolf Backofen

Firas Swidan

Silico Biol., 2002

On the Complexity of Protein Similarity Search under mRNA Structure Constraints.

[BibT_eX]

[DOI]

Rolf Backofen

Firas Swidan

Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

An Optimal Lower Bound for Resolution with 2-Conjunctions.

[BibT_eX]

[DOI]

Jan Johannsen

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2001

Lower Bounds for OBDDs and Nisan's pseudorandom generator.

[BibT_eX]

[DOI]

C. E. Veni Madhavan

Electron. Colloquium Comput. Complex., 2001

On Assigning Prefix Free Codes to the Vertices of a Graph.

[BibT_eX]

[DOI]