( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Collision-Free Robot Scheduling.

, , , и . CoRR, (2024)

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.

Anders Adamson

Hazel Duncan

Duncan Reid

Duncan MacVicar

Duncan Large

 

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

Distributed Coloring of Hypergraphs., , и . SIROCCO, том 13892 из Lecture Notes in Computer Science, стр. 89-111. Springer, (2023)The k-Centre Problem for Classes of Cyclic Words., , , и . SOFSEM, том 13878 из Lecture Notes in Computer Science, стр. 385-400. Springer, (2023)k-Universality of Regular Languages., , , , , и . ISAAC, том 283 из LIPIcs, стр. 4:1-4:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Enumerating m-Length Walks in Directed Graphs with Constant Delay., , и . LATIN (1), том 14578 из Lecture Notes in Computer Science, стр. 35-50. Springer, (2024)Longest Common Subsequence with Gap Constraints., , , , и . WORDS, том 13899 из Lecture Notes in Computer Science, стр. 60-76. Springer, (2023)Ranking and Unranking k-Subsequence Universal Words.. WORDS, том 13899 из Lecture Notes in Computer Science, стр. 47-59. Springer, (2023)On the structural and combinatorial properties in 2-swap word permutation graphs., , , и . CoRR, (2023)The Complexity of Periodic Energy Minimisation., , , и . MFCS, том 241 из LIPIcs, стр. 8:1-8:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Ranking Bracelets in Polynomial Time., , , и . CPM, том 191 из LIPIcs, стр. 4:1-4:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Collision-Free Robot Scheduling., , , и . CoRR, (2024)