( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Sublinear approximation algorithms for boxicity and related problems.

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

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.

Babu Halan

Babu Vijayanath

Harish Babu

Babu Chauhan

Babu Thaliath

 

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

Eternal Vertex Cover on Bipartite Graphs., , и . CSR, том 13296 из Lecture Notes in Computer Science, стр. 64-76. Springer, (2022)2-connecting Outerplanar Graphs without Blowing Up the Pathwidth., , , и . COCOON, том 7936 из Lecture Notes in Computer Science, стр. 626-637. Springer, (2013)A constant factor approximation algorithm for boxicity of circular arc graphs., , и . Discret. Appl. Math., (2014)Packing Arc-Disjoint 4-Cycles in Oriented Graphs., , и . FSTTCS, том 250 из LIPIcs, стр. 5:1-5:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)An Improvement to Chvátal and Thomassen's Upper Bound for Oriented Diameter., , , и . CSR, том 12159 из Lecture Notes in Computer Science, стр. 117-129. Springer, (2020)Improved Bounds for the Oriented Radius of Mixed Multigraphs., , и . CoRR, (2021)A fix-point characterization of Herbrand equivalence of expressions in data flow frameworks., , и . CoRR, (2017)A Fix-Point Characterization of Herbrand Equivalence of Expressions in Data Flow Frameworks., , и . ICLA, том 11600 из Lecture Notes in Computer Science, стр. 160-172. Springer, (2019)A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs., , и . WADS, том 6844 из Lecture Notes in Computer Science, стр. 13-24. Springer, (2011)Polynomial Time and Parameterized Approximation Algorithms for Boxicity., , и . IPEC, том 7535 из Lecture Notes in Computer Science, стр. 135-146. Springer, (2012)