Jasine Babu

Ajay Saju Jacob

R. Krithika

Sreejith K. Pallathumadam

J. Comput. Syst. Sci., 2024

Arborescences and Shortest Path Trees when Colors Matter.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Improved bounds for the oriented radius of mixed multigraphs.

[BibT_eX]

[DOI]

Deepu Benson

J. Graph Theory, August, 2023

2022

A new lower bound for the eternal vertex cover number of graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

On graphs whose eternal vertex cover number and vertex cover number coincide.

[BibT_eX]

[DOI]

J. Nandini Warrier

Discret. Appl. Math., 2022

Eternal vertex cover number of maximal outerplanar graphs.

[BibT_eX]

[DOI]

CoRR, 2022

Computing Eternal Vertex Cover Number on Maximal Outerplanar Graphs in Linear Time.

[BibT_eX]

[DOI]

Karunakaran Murali Krishnan

Nandini J. Warrier

Proceedings of the 23rd Italian Conference on Theoretical Computer Science, 2022

Packing Arc-Disjoint 4-Cycles in Oriented Graphs.

[BibT_eX]

[DOI]

R. Krithika

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Eternal Vertex Cover on Bipartite Graphs.

[BibT_eX]

[DOI]

Neeldhara Misra

Saraswati Nanoti

Proceedings of the Computer Science - Theory and Applications, 2022

2021

A substructure based lower bound for eternal vertex cover number.

[BibT_eX]

[DOI]

Arko Sharma

Theor. Comput. Sci., 2021

An improvement to Chvátal and Thomassen's upper bound for oriented diameter.

[BibT_eX]

[DOI]

Deepu Benson

Sai Nishant Vaka

Discret. Appl. Math., 2021

2020

A local characterization for perfect plane near-triangulations.

[BibT_eX]

[DOI]

Sameera Muhamed Salam

K. Murali Krishnan

Theor. Comput. Sci., 2020

A Linear Time Algorithm for Computing the Eternal Vertex Cover Number of Cactus Graphs.

[BibT_eX]

[DOI]

Arko Sharma

CoRR, 2020

A Note on Arc-Disjoint Cycles in Bipartite Tournaments.

[BibT_eX]

[DOI]

Ajay Saju Jacob

R. Krithika

CoRR, 2020

2019

On induced colourful paths in triangle-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

A new lower bound for eternal vertex cover number.

[BibT_eX]

[DOI]

CoRR, 2019

A Fix-Point Characterization of Herbrand Equivalence of Expressions in Data Flow Frameworks.

[BibT_eX]

[DOI]

Karunakaran Murali Krishnan

Vineeth Paleri

Proceedings of the Logic and Its Applications - 8th Indian Conference, 2019

On Graphs with Minimal Eternal Vertex Cover Number.

[BibT_eX]

[DOI]

J. Nandini Warrier

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018

Sublinear approximation algorithms for boxicity and related problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

2016

Every Property of Outerplanar Graphs is Testable.

[BibT_eX]

[DOI]

Areej Khoury

Ilan Newman

Proceedings of the Approximation, 2016

2015

Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2015

Rainbow matchings in strongly edge-colored graphs.

[BibT_eX]

[DOI]

Krishna Vaidyanathan

Discret. Math., 2015

2014

Fixed-orientation equilateral triangle matching of point sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

2-Connecting outerplanar graphs without blowing up the pathwidth.

[BibT_eX]

[DOI]

Manu Basavaraju

Theor. Comput. Sci., 2014

A constant factor approximation algorithm for boxicity of circular arc graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Approximating the Cubicity of Trees.

[BibT_eX]

[DOI]

Manu Basavaraju

Naveen Sivadasan

CoRR, 2014

2012

Parameterized and Approximation Algorithms for Boxicity

[BibT_eX]

[DOI]

CoRR, 2012

Polynomial Time and Parameterized Approximation Algorithms for Boxicity.

[BibT_eX]

[DOI]