( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
FPT Approximation for Fair Minimum-Load Clustering.

, , , , и . IPEC, том 249 из LIPIcs, стр. 4:1-4:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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.

Nidhi Nuwal

Preeti Purohit

Nidhi Gakhar

Purv Purohit

Manish Purohit

 

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

How to Find a Good Explanation for Clustering?, , , , , и . AAAI, стр. 3904-3912. AAAI Press, (2022)Metric Dimension Parameterized by Treewidth., и . IPEC, том 148 из LIPIcs, стр. 5:1-5:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)FPT Approximation for Fair Minimum-Load Clustering., , , , и . IPEC, том 249 из LIPIcs, стр. 4:1-4:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Exact Exponential Algorithms for Clustering Problems., , , , и . IPEC, том 249 из LIPIcs, стр. 13:1-13:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)On the Parameterized Complexity of Minus Domination., , , , , и . SOFSEM, том 14519 из Lecture Notes in Computer Science, стр. 96-110. Springer, (2024)Metric Dimension Parameterized By Treewidth., и . Algorithmica, 83 (8): 2606-2633 (2021)On the Complexity of Singly Connected Vertex Deletion., , , , , и . IWOCA, том 12126 из Lecture Notes in Computer Science, стр. 237-250. Springer, (2020)Fixed-Parameter Algorithms for Fair Hitting Set Problems., , , , и . MFCS, том 272 из LIPIcs, стр. 55:1-55:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Lossy Kernelization of Same-Size Clustering., , , , и . CSR, том 13296 из Lecture Notes in Computer Science, стр. 96-114. Springer, (2022)Parameterized Complexity of Categorical Clustering with Size Constraints., , и . WADS, том 12808 из Lecture Notes in Computer Science, стр. 385-398. Springer, (2021)