Author of the publication

Polynomial Time and Parameterized Approximation Algorithms for Boxicity.

, , and . IPEC, volume 7535 of Lecture Notes in Computer Science, page 135-146. Springer, (2012)

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

The stable set problem and the thinness of a graph., , , and . Oper. Res. Lett., 35 (1): 1-9 (2007)A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph.. COCOON, volume 2108 of Lecture Notes in Computer Science, page 308-317. Springer, (2001)Edge Connectivity vs Vertex Connectivity in Chordal Graphs.. COCOON, volume 2108 of Lecture Notes in Computer Science, page 384-389. Springer, (2001)Boxicity of Circular Arc Graphs., and . Graphs Comb., 27 (6): 769-783 (2011)Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs., and . FSTTCS, volume 4337 of Lecture Notes in Computer Science, page 69-80. Springer, (2006)Boxicity and Cubicity of Product Graphs, , , and . CoRR, (2013)Separation Dimension of Bounded Degree Graphs., , , , and . SIAM J. Discret. Math., 29 (1): 59-64 (2015)Rainbow colouring of split graphs., , and . Discret. Appl. Math., (2017)A constant factor approximation algorithm for boxicity of circular arc graphs., , and . Discret. Appl. Math., (2014)Boxicity and Separation Dimension., , , , and . WG, volume 8747 of Lecture Notes in Computer Science, page 81-92. Springer, (2014)