Author of the publication

The Complexity of Periodic Energy Minimisation.

, , , and . MFCS, volume 241 of LIPIcs, page 8:1-8:15. 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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Distributed Coloring of Hypergraphs., , and . SIROCCO, volume 13892 of Lecture Notes in Computer Science, page 89-111. Springer, (2023)The k-Centre Problem for Classes of Cyclic Words., , , and . SOFSEM, volume 13878 of Lecture Notes in Computer Science, page 385-400. Springer, (2023)Ranking Binary Unlabelled Necklaces in Polynomial Time.. DCFS, volume 13439 of Lecture Notes in Computer Science, page 15-29. Springer, (2022)Tight Bounds for the Number of Absent Scattered Factors., , , and . CoRR, (2024)Brief Announcement: Collision-Free Robot Scheduling., , , and . SAND, volume 292 of LIPIcs, page 22:1-22:5. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)On the Hardness of Energy Minimisation for Crystal Structure Prediction., , , and . SOFSEM, volume 12011 of Lecture Notes in Computer Science, page 587-596. Springer, (2020)Ranking Bracelets in Polynomial Time., , , and . CPM, volume 191 of LIPIcs, page 4:1-4:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)The Complexity of Periodic Energy Minimisation., , , and . MFCS, volume 241 of LIPIcs, page 8:1-8:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Longest Common Subsequence with Gap Constraints., , , , and . WORDS, volume 13899 of Lecture Notes in Computer Science, page 60-76. Springer, (2023)Ranking and Unranking k-Subsequence Universal Words.. WORDS, volume 13899 of Lecture Notes in Computer Science, page 47-59. Springer, (2023)