( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Parameterized Complexity of Clustering Incomplete Data.

, , , , и . AAAI, стр. 7296-7304. AAAI Press, (2021)

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.

Mahmoud Kanj

Ali Kanj

Hassan Iyad

Iyad Asid

Iyad Nassif

 

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

On Covering Segments with Unit Intervals., , , и . STACS, том 154 из LIPIcs, стр. 13:1-13:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On the Parameterized Complexity of Motion Planning for Rectangular Robots., и . CoRR, (2024)Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time., , , , и . CoRR, (2023)Dynamic Modeling and Validation of Soft Robotic Snake Locomotion., , , , , , и . CoRR, (2023)The Parameterized Complexity of Clustering Incomplete Data., , , , и . AAAI, стр. 7296-7304. AAAI Press, (2021)Geometric spanners: Recent results and open directions.. ICCIT, стр. 78-82. IEEE, (2013)Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time., , , , и . ISAAC, том 212 из LIPIcs, стр. 48:1-48:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Anticipatory Path Planning for Continuum Arms in Dynamic Environments., , , , и . ICRA, стр. 7815-7820. IEEE, (2021)The Parameterized Complexity of Coordinated Motion Planning., , и . SoCG, том 258 из LIPIcs, стр. 28:1-28:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Optimal Streaming Algorithms for Graph Matching., , , и . CoRR, (2021)