( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A constant factor approximation algorithm for boxicity of circular arc graphs.

, , и . Discret. Appl. Math., (2014)

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.

Chandran Vijayendran

C Sunil Kumar

Manjari Chandran

Sunil Kumar

Sunil Thakur

 

Другие публикации лиц с тем же именем

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