{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T01:40:07Z","timestamp":1744854007611,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642346101"},{"type":"electronic","value":"9783642346118"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34611-8_4","type":"book-chapter","created":{"date-parts":[[2012,10,22]],"date-time":"2012-10-22T08:42:25Z","timestamp":1350895345000},"page":"4-6","source":"Crossref","is-referenced-by-count":0,"title":["Student Poster Session"],"prefix":"10.1007","author":[{"given":"Martin Charles","family":"Golumbic","sequence":"first","affiliation":[]},{"given":"Michal","family":"Stern","sequence":"additional","affiliation":[]},{"given":"Avivit","family":"Levy","sequence":"additional","affiliation":[]},{"given":"Gila","family":"Morgenstern","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Chechik, S., Gavoille, C.: Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels. In: Proc. the 44th Symposium on Theory of Computing Conference, STOC 2012, pp. 1199\u20131218 (2012)","DOI":"10.1145\/2213977.2214084"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Avin, C., Cohen, A., Haddad, Y., Kantor, E., Lotker, Z., Parter, M., Peleg, D.: In: Proc. the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, pp. 502\u2013515 (2012)","DOI":"10.1137\/1.9781611973099.43"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-642-31104-8_21","volume-title":"Structural Information and Communication Complexity","author":"I. Gamzu","year":"2012","unstructured":"Gamzu, I., Medina, M.: Improved Approximation for Orienting Mixed Graphs. In: Even, G., Halld\u00f3rsson, M.M. (eds.) SIROCCO 2012. LNCS, vol.\u00a07355, pp. 243\u2013253. Springer, Heidelberg (2012)"},{"key":"4_CR4","unstructured":"Jurkiewicz, M., Kubale, M.: Product Graphs Invariants with Applications to the Theory of Information. In: The 5th International Interdisciplinary Technical Conference of Young Scientists InterTech (2012)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Roditty, L., Tov, R.: Approximating the Girth. In: Proc. the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, pp. 1446\u20131454 (2011)","DOI":"10.1137\/1.9781611973082.112"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34611-8_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T01:23:52Z","timestamp":1744853032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34611-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642346101","9783642346118"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34611-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}