( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem.

, , , , , и . GD (2), том 14466 из Lecture Notes in Computer Science, стр. 189-202. Springer, (2023)

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.

Tanmay Chakradeo

Tanmay Bharat

Mohan Mohadeo Inamdar

 

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

Algorithms for covering multiple submodular constraints and applications., , , , и . J. Comb. Optim., 44 (2): 979-1010 (2022)On Partial Covering For Geometric Set Systems., и . SoCG, том 99 из LIPIcs, стр. 47:1-47:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less., , , , и . FSTTCS, том 284 из LIPIcs, стр. 28:1-28:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)The Modal Logic of Inner Models., и . J. Symb. Log., 81 (1): 225-236 (2016)Near-optimal clustering in the k-machine model., , , и . Theor. Comput. Sci., (2022)Clustering What Matters: Optimal Approximation for Clustering with Outliers., , , и . CoRR, (2022)Non-Uniform k-Center and Greedy Clustering., и . CoRR, (2021)Capacitated Sum-Of-Radii Clustering: An FPT Approximation., и . ESA, том 173 из LIPIcs, стр. 62:1-62:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Kernelization for Spreading Points., , , , и . ESA, том 274 из LIPIcs, стр. 48:1-48:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Proportionally Fair Matching with Multiple Groups., , , и . WG, том 14093 из Lecture Notes in Computer Science, стр. 1-15. Springer, (2023)