{"id":161,"date":"2021-05-20T18:05:00","date_gmt":"2021-05-20T18:05:00","guid":{"rendered":"http:\/\/www.podc.org\/podc2021\/?page_id=161"},"modified":"2021-10-29T14:41:40","modified_gmt":"2021-10-29T14:41:40","slug":"awards","status":"publish","type":"page","link":"https:\/\/www.podc.org\/podc2021\/awards\/","title":{"rendered":"Awards"},"content":{"rendered":"\n<p><strong>Best paper<\/strong><br>Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs<br>Greg Bodwin and Merav Parter<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Best paperRestorable Shortest Path Tiebreaking for Edge-Faulty GraphsGreg Bodwin and Merav Parter<\/p>\n","protected":false},"author":17,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-161","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.podc.org\/podc2021\/wp-json\/wp\/v2\/pages\/161","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.podc.org\/podc2021\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.podc.org\/podc2021\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2021\/wp-json\/wp\/v2\/users\/17"}],"replies":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2021\/wp-json\/wp\/v2\/comments?post=161"}],"version-history":[{"count":3,"href":"https:\/\/www.podc.org\/podc2021\/wp-json\/wp\/v2\/pages\/161\/revisions"}],"predecessor-version":[{"id":207,"href":"https:\/\/www.podc.org\/podc2021\/wp-json\/wp\/v2\/pages\/161\/revisions\/207"}],"wp:attachment":[{"href":"https:\/\/www.podc.org\/podc2021\/wp-json\/wp\/v2\/media?parent=161"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}