( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Bottleneck Bichromatic Full Steiner Trees.

, , , и . CCCG, стр. 13-18. (2017)

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.

Sourav Chakraborty

Anirban Chakraborty

Dipanjan Chakraborty

Asok Chakraborty

Diptangshu Chakraborty

 

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

Recognizing Geometric Intersection Graphs Stabbed by a Line., , и . CoRR, (2022)Duplicate open page removal from video stream of book flipping., , , и . NCVPRIPG, стр. 1-4. IEEE, (2013)Twin-Width VIII: Delineation and Win-Wins., , , , , и . IPEC, том 249 из LIPIcs, стр. 9:1-9:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Covering and Partitioning of Split, Chain and Cographs with Isometric Paths., , , , и . MFCS, том 306 из LIPIcs, стр. 39:1-39:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)On Local Structures of Cubicity 2 Graphs., , , и . COCOA, том 10043 из Lecture Notes in Computer Science, стр. 254-269. Springer, (2016)Approximating Minimum Dominating Set on String Graphs., , и . WG, том 11789 из Lecture Notes in Computer Science, стр. 232-243. Springer, (2019)Cutting Barnette Graphs Perfectly is Hard., , и . WG, том 14093 из Lecture Notes in Computer Science, стр. 116-129. Springer, (2023)On the Stab Number of Rectangle Intersection Graphs., и . Theory Comput. Syst., 64 (5): 681-734 (2020)Cutting Barnette graphs perfectly is hard., , и . Theor. Comput. Sci., (2024)Finding Geometric Representations of Apex Graphs is NP-Hard., и . WALCOM, том 13174 из Lecture Notes in Computer Science, стр. 161-174. Springer, (2022)