( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On approximating four covering and packing problems.

, , , , , и . J. Comput. Syst. Sci., 75 (5): 287-302 (2009)

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.

Shivaji Dasgupta

Bhaskar Mehta

Shyamal Dasgupta

Bhaskar Saha

Subho Dasgupta

 

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

On a connection between small set expansions and modularity clustering., и . Inf. Process. Lett., 114 (7): 349-352 (2014)On analyzing and evaluating privacy measures for social networks under active attack., , и . CoRR, (2018)Effect of Gromov-Hyperbolicity Parameter on Cuts and Expansions in Graphs and Some Algorithmic Implications., , , и . Algorithmica, 80 (2): 772-800 (2018)On the complexity and approximation of syntenic distance., , , , и . RECOMB, стр. 99-108. ACM, (1997)Tight Approximability Results for Test Set Problems in Bioinformatics., , и . SWAT, том 3111 из Lecture Notes in Computer Science, стр. 39-50. Springer, (2004)On partisan bias in redistricting: computational complexity meets the science of gerrymandering., и . CoRR, (2019)Cooperative motion planning of redundant rover manipulators on uneven terrains., , и . ICAR, стр. 99-105. IEEE, (2017)A comparative study of Dirichlet and Neumann conditions for path planning through harmonic functions., , и . Future Gener. Comput. Syst., 20 (3): 441-452 (2004)Algorithmic and complexity results for decompositions of biological networks into monotone subsystems., , , и . Biosyst., 90 (1): 161-178 (2007)Foreword., , и . J. Bioinform. Comput. Biol., (2014)