{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T05:16:33Z","timestamp":1672290993333},"reference-count":5,"publisher":"Association for Computing Machinery (ACM)","issue":"4","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[2004,12]]},"abstract":"\n After publication of our paper\n Etude on theme of Dijkstra<\/jats:italic>\n in September issue of v.35 of SIGACT News [1], we had a very interesting communication with Dr. John Hershberger related to the topic of the paper.\n Etude<\/jats:italic>\n was not a research paper, but presented a tutorial for undergraduate students who are engaged with programming contests (like ACM ICPC). The tutorial was a part of a special undergraduate course at Novosibirsk State University (Russia) and was based on E. Dijkstra's heuristic search solution of non-crossing matching problem on the plane.\n <\/jats:p>","DOI":"10.1145\/1054916.1054919","type":"journal-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T19:28:32Z","timestamp":1131391712000},"page":"118-118","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Addendum to Etude on theme of Dijkstra"],"prefix":"10.1145","volume":"35","author":[{"given":"S. O.","family":"Shilova","sequence":"first","affiliation":[{"name":"Institute of Mathematics, Novosibirsk, Russia"}]},{"given":"N. V.","family":"Shilov","sequence":"additional","affiliation":[{"name":"Institute of Informatics Systems, Novosibirsk, Russia"}]}],"member":"320","published-online":{"date-parts":[[2004,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1027914.1027917"},{"key":"e_1_2_1_2_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , Ch. E. Leiserson , R. L. Rivest , C. Stein , Introduction to Algorithms . 2 nd ed., The MIT Press , 2001 . T. H. Cormen, Ch. E. Leiserson, R. L. Rivest, C. Stein, Introduction to Algorithms. 2nd ed., The MIT Press, 2001.","edition":"2"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/88723.88800"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01994880"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90065-0"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1054916.1054919","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T13:44:55Z","timestamp":1672235095000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1054916.1054919"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,12]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2004,12]]}},"alternative-id":["10.1145\/1054916.1054919"],"URL":"https:\/\/doi.org\/10.1145\/1054916.1054919","relation":{},"ISSN":["0163-5700"],"issn-type":[{"value":"0163-5700","type":"print"}],"subject":[],"published":{"date-parts":[[2004,12]]},"assertion":[{"value":"2004-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}