{"id":3510,"date":"2025-06-13T13:55:38","date_gmt":"2025-06-13T12:55:38","guid":{"rendered":"https:\/\/blogs.qub.ac.uk\/dipsa\/?p=3510"},"modified":"2025-06-13T13:55:38","modified_gmt":"2025-06-13T12:55:38","slug":"best-poster-award-at-ipdps-2025","status":"publish","type":"post","link":"https:\/\/blogs.qub.ac.uk\/dipsa\/best-poster-award-at-ipdps-2025\/","title":{"rendered":"Best Poster Award at IPDPS 2025"},"content":{"rendered":"\n<p>We&#8217;re excited to share that <strong>Marco<\/strong> has been awarded the Best Poster Award at the IPDPS 2025 PhD Forum! Marco&#8217;s winning poster, titled &#8220;Towards Efficient Asynchronous Single-Source Shortest Path&#8221;, presents Wasp, a novel algorithm that tackles the fundamental Single-Source Shortest Path problem. His approach addresses a key challenge in parallel graph algorithms by introducing on-demand priority relaxation through a priority-based work-stealing mechanism.<\/p>\n\n\n\n<p>Congratulations, Marco, on this well-deserved recognition! We&#8217;re proud to have you as part of our research team and look forward to seeing your continued contributions to the field.<\/p>\n\n\n\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>We&#8217;re excited to share that Marco has been awarded the Best Poster Award at the IPDPS 2025 PhD Forum! Marco&#8217;s winning poster, titled &#8220;Towards Efficient Asynchronous Single-Source Shortest Path&#8221;, presents Wasp, a novel algorithm that tackles the fundamental Single-Source Shortest &hellip; <a href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/best-poster-award-at-ipdps-2025\/\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":3511,"comment_status":"closed","ping_status":"","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[143],"tags":[34,142,35,38],"class_list":["post-3510","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-awards","tag-algorithm-design-and-engineering","tag-award","tag-graph-processing","tag-high-performance-computing"],"jetpack_featured_media_url":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2025\/06\/ipdps25_bestphdposteraward-scaled.jpg","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/posts\/3510","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/comments?post=3510"}],"version-history":[{"count":3,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/posts\/3510\/revisions"}],"predecessor-version":[{"id":3515,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/posts\/3510\/revisions\/3515"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/media\/3511"}],"wp:attachment":[{"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/media?parent=3510"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/categories?post=3510"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/tags?post=3510"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}