( en | de | ru )

 

Disambiguation of "McCreesh, Ciaran"

Author of the publication

copydeleteadd this publication to your clipboard
Understanding the Empirical Hardness of Random Optimisation Problems.

, , and . CP, volume 11802 of Lecture Notes in Computer Science, page 333-349. Springer, (2019)

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.

Ciarán Nicholl

Ciaran Toal

Ciaran Wills

Ciaran O'Reilly

 

Other publications of authors with the same name

Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem., and . CP, volume 8656 of Lecture Notes in Computer Science, page 549-563. Springer, (2014)Morphing Between Stable Matching Problems., , and . CP, volume 9892 of Lecture Notes in Computer Science, page 832-840. Springer, (2016)Certified Symmetry and Dominance Breaking for Combinatorial Optimisation., , , and . AAAI, page 3698-3707. AAAI Press, (2022)Proof Logging for the Circuit Constraint., , and . CPAIOR (2), volume 14743 of Lecture Notes in Computer Science, page 38-55. Springer, (2024)Greedy Graph Colouring is a Misleading Heuristic., and . CoRR, (2013)Understanding the Empirical Hardness of Random Optimisation Problems., , and . CP, volume 11802 of Lecture Notes in Computer Science, page 333-349. Springer, (2019)Complications for Computational Experiments from Modern Processors., , , and . CP, volume 210 of LIPIcs, page 25:1-25:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Pseudo-Boolean Reasoning About States and Transitions to Certify Dynamic Programming and Decision Diagram Algorithms., , , , , and . CP, volume 307 of LIPIcs, page 9:1-9:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)On Maximum Weight Clique Algorithms, and How They Are Evaluated., , , and . CP, volume 10416 of Lecture Notes in Computer Science, page 206-225. Springer, (2017)Solving the task variant allocation problem in distributed robotics., , , , , , and . Auton. Robots, 42 (7): 1477-1495 (2018)