{"id":69,"date":"2014-02-12T17:07:11","date_gmt":"2014-02-12T15:07:11","guid":{"rendered":"http:\/\/www.eng.biu.ac.il\/rawitzd\/?page_id=69"},"modified":"2020-09-18T17:57:24","modified_gmt":"2020-09-18T14:57:24","slug":"research","status":"publish","type":"page","link":"https:\/\/www.eng.biu.ac.il\/rawitzd\/research\/","title":{"rendered":"Research"},"content":{"rendered":"<p><strong>Research Interests:<\/strong><\/p>\n<ul>\n<li>Algorithmic graph theory<\/li>\n<li>Approximation algorithms<\/li>\n<li>Network algorithms<\/li>\n<li>Online algorithms and competitive analysis<\/li>\n<li>Scheduling and resource allocation<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Research Interests: Algorithmic graph theory Approximation algorithms Network algorithms Online algorithms and competitive analysis Scheduling and resource allocation<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"open","template":"","meta":{"footnotes":""},"class_list":["post-69","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.eng.biu.ac.il\/rawitzd\/wp-json\/wp\/v2\/pages\/69"}],"collection":[{"href":"https:\/\/www.eng.biu.ac.il\/rawitzd\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.eng.biu.ac.il\/rawitzd\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.eng.biu.ac.il\/rawitzd\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.eng.biu.ac.il\/rawitzd\/wp-json\/wp\/v2\/comments?post=69"}],"version-history":[{"count":11,"href":"https:\/\/www.eng.biu.ac.il\/rawitzd\/wp-json\/wp\/v2\/pages\/69\/revisions"}],"predecessor-version":[{"id":330,"href":"https:\/\/www.eng.biu.ac.il\/rawitzd\/wp-json\/wp\/v2\/pages\/69\/revisions\/330"}],"wp:attachment":[{"href":"https:\/\/www.eng.biu.ac.il\/rawitzd\/wp-json\/wp\/v2\/media?parent=69"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}