Author of the publication

A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs.

, , and . WADS, volume 6844 of Lecture Notes in Computer Science, page 13-24. Springer, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Eternal Vertex Cover on Bipartite Graphs., , and . CSR, volume 13296 of Lecture Notes in Computer Science, page 64-76. Springer, (2022)2-connecting Outerplanar Graphs without Blowing Up the Pathwidth., , , and . COCOON, volume 7936 of Lecture Notes in Computer Science, page 626-637. Springer, (2013)Packing Arc-Disjoint 4-Cycles in Oriented Graphs., , and . FSTTCS, volume 250 of LIPIcs, page 5:1-5:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A constant factor approximation algorithm for boxicity of circular arc graphs., , and . Discret. Appl. Math., (2014)An Improvement to Chvátal and Thomassen's Upper Bound for Oriented Diameter., , , and . CSR, volume 12159 of Lecture Notes in Computer Science, page 117-129. Springer, (2020)2-connecting Outerplanar Graphs without Blowing Up the Pathwidth, , , and . CoRR, (2012)Sublinear approximation algorithms for boxicity and related problems., , and . Discret. Appl. Math., (2018)Arborescences and Shortest Path Trees when Colors Matter., , , , , and . CoRR, (2024)A local characterization for perfect plane near-triangulations., , and . Theor. Comput. Sci., (2020)A fix-point characterization of Herbrand equivalence of expressions in data flow frameworks., , and . CoRR, (2017)