( en | de | ru )

 

Disambiguation of "Inamdar, Tanmay"

Author of the publication

copydeleteadd this publication to your clipboard
Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem.

, , , , , and . GD (2), volume 14466 of Lecture Notes in Computer Science, page 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. You can also use the button next to the name to display some publications already assigned to the person.

Tanmay Chakradeo

Tanmay Bharat

Mohan Mohadeo Inamdar

 

Other publications of authors with the same name

Non-Uniform k-Center and Greedy Clustering., and . CoRR, (2021)Clustering What Matters: Optimal Approximation for Clustering with Outliers., , , and . CoRR, (2022)Near-optimal clustering in the k-machine model., , , and . Theor. Comput. Sci., (2022)Capacitated Sum-Of-Radii Clustering: An FPT Approximation., and . ESA, volume 173 of LIPIcs, page 62:1-62:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Kernelization for Spreading Points., , , , and . ESA, volume 274 of LIPIcs, page 48:1-48:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Proportionally Fair Matching with Multiple Groups., , , and . WG, volume 14093 of Lecture Notes in Computer Science, page 1-15. Springer, (2023)The Modal Logic of Inner Models., and . J. Symb. Log., 81 (1): 225-236 (2016)Large-Scale Distributed Algorithms for Facility Location with Outliers., , and . OPODIS, volume 125 of LIPIcs, page 5:1-5:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A Constant Approximation for Colorful k-Center., , , and . ESA, volume 144 of LIPIcs, page 12:1-12:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On Partial Covering For Geometric Set Systems., and . SoCG, volume 99 of LIPIcs, page 47:1-47:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)