{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:48:55Z","timestamp":1750308535962,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,14]],"date-time":"2015-06-14T00:00:00Z","timestamp":1434240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"The Israeli Centers of Research Excellence (I-CORE) program","award":["Center No. 4\/11"],"award-info":[{"award-number":["Center No. 4\/11"]}]},{"name":"Israel Science Foundation (ISF)","award":["1841\/14 and 822\/10"],"award-info":[{"award-number":["1841\/14 and 822\/10"]}]},{"name":"Binational Science Foundation (BSF)","award":["2012338"],"award-info":[{"award-number":["2012338"]}]},{"name":"FNU project AlgoDisc - Discrete Mathematics Algorithms and Data Structures."},{"name":"Danish Council for Independent Research","award":["Advanced Grant DFF-0602-02499B under the Sapere Aude research ca"],"award-info":[{"award-number":["Advanced Grant DFF-0602-02499B under the Sapere Aude research ca"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,6,14]]},"DOI":"10.1145\/2746539.2746545","type":"proceedings-article","created":{"date-parts":[[2015,6,3]],"date-time":"2015-06-03T15:35:56Z","timestamp":1433345756000},"page":"625-634","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Adjacency Labeling Schemes and Induced-Universal Graphs"],"prefix":"10.1145","author":[{"given":"Stephen","family":"Alstrup","sequence":"first","affiliation":[{"name":"University of Copenhagen, Copenhagen, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haim","family":"Kaplan","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikkel","family":"Thorup","sequence":"additional","affiliation":[{"name":"University of Copenhagen, Copenhagen, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uri","family":"Zwick","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703437211"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v31:2"},{"key":"e_1_3_2_1_3_1","first-page":"373","volume-title":"Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Alon N.","year":"2008","unstructured":"N. Alon and M. Capalbo . Optimal universal graphs with deterministic embedding . In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms , pages 373 -- 378 , 2008 . N. Alon and M. Capalbo. Optimal universal graphs with deterministic embedding. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 373--378, 2008."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-004-1155-5"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634146"},{"key":"e_1_3_2_1_6_1","volume-title":"Adjacency labeling schemes and induced-universal graphs. CoRR, abs\/1404.3391","author":"Alstrup S.","year":"2014","unstructured":"S. Alstrup , H. Kaplan , M. Thorup , and U. Zwick . Adjacency labeling schemes and induced-universal graphs. CoRR, abs\/1404.3391 , 2014 . S. Alstrup, H. Kaplan, M. Thorup, and U. Zwick. Adjacency labeling schemes and induced-universal graphs. CoRR, abs\/1404.3391, 2014."},{"key":"e_1_3_2_1_7_1","volume-title":"Proc. of the 13th annual ACM-SIAM Symp. on Discrete Algorithms (SODA)","author":"Alstrup S.","year":"2002","unstructured":"S. Alstrup and T. Rauhe . Improved labeling schemes for ancestor queries . In Proc. of the 13th annual ACM-SIAM Symp. on Discrete Algorithms (SODA) , 2002 . S. Alstrup and T. Rauhe. Improved labeling schemes for ancestor queries. In Proc. of the 13th annual ACM-SIAM Symp. on Discrete Algorithms (SODA), 2002."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652151"},{"key":"e_1_3_2_1_9_1","volume-title":"On graphs which contain all sparse graphs. Ann. discrete Math., 12:21--26","author":"Babai L.","year":"1982","unstructured":"L. Babai , F. R. K. Chung , P. E. R. L. Graham , and J. Spencer . On graphs which contain all sparse graphs. Ann. discrete Math., 12:21--26 , 1982 . L. Babai, F. R. K. Chung, P. E. R. L. Graham, and J. Spencer. On graphs which contain all sparse graphs. Ann. discrete Math., 12:21--26, 1982."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/0402014"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(81)80015-7"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-60406-5_7"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2007.01.022"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1966.1053860"},{"key":"e_1_3_2_1_15_1","volume-title":"An unexpected result on coding vertices of a graph. J. of Mathemathical analysis and applications, 20:583--600","author":"Breuer M. A.","year":"1967","unstructured":"M. A. Breuer and J. Folkman . An unexpected result on coding vertices of a graph. J. of Mathemathical analysis and applications, 20:583--600 , 1967 . M. A. Breuer and J. Folkman. An unexpected result on coding vertices of a graph. J. of Mathemathical analysis and applications, 20:583--600, 1967."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-009-0860-x"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190140408"},{"issue":"1","key":"e_1_3_2_1_18_1","first-page":"14","article-title":"On graphs which contain all small trees. Journal of combinatorial theory","volume":"24","author":"Chung F. R. K.","year":"1978","unstructured":"F. R. K. Chung and R. L. Graham . On graphs which contain all small trees. Journal of combinatorial theory , Series B , 24 ( 1 ): 14 -- 23 , 1978 . F. R. K. Chung and R. L. Graham. On graphs which contain all small trees. Journal of combinatorial theory, Series B, 24(1):14--23, 1978.","journal-title":"Series B"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1749-6632.1979.tb32784.x"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-27.2.203"},{"key":"e_1_3_2_1_21_1","first-page":"213","volume-title":"Colloquia Mathematica","author":"Chung F. R. K.","year":"1976","unstructured":"F. R. K. Chung , R. L. Graham , and N. Pippenger . On graphs which contain all small trees ii . Colloquia Mathematica , pages 213 -- 223 , 1976 . F. R. K. Chung, R. L. Graham, and N. Pippenger. On graphs which contain all small trees ii. Colloquia Mathematica, pages 213--223, 1976."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806771"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00002-6"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055349"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.04.020"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.09.031"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9664-0"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"P.\n      Fraigniaud\n     and \n      C.\n      Gavoille\n  . \n  Routing in trees. In $28^th$ International Colloquium on Automata Languages and Programming (ICALP) volume \n  2076\n   of \n  LNCS pages \n  757\n  --\n  772 2001\n  .   P. Fraigniaud and C. Gavoille. Routing in trees. In $28^th$ International Colloquium on Automata Languages and Programming (ICALP) volume 2076 of LNCS pages 757--772 2001.","DOI":"10.1007\/3-540-48224-5_62"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873639"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806773"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/1778580.1778634"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-002-0073-5"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.05.002"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405049"},{"key":"e_1_3_2_1_35_1","volume-title":"LNCS","author":"Kaplan H.","year":"2001","unstructured":"H. Kaplan and T. Milo . Short and distances and other functions. In 7nd Work. on Algo. and Data Struc ., LNCS , 2001 . H. Kaplan and T. Milo. Short and distances and other functions. In 7nd Work. on Algo. and Data Struc., LNCS, 2001."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703433912"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1721837.1721855"},{"key":"e_1_3_2_1_39_1","first-page":"84","article-title":"Minimal universal bipartite graphs","author":"Lozin V. V.","year":"2007","unstructured":"V. V. Lozin and G. Rudolf . Minimal universal bipartite graphs . Ars Comb. , 84 , 2007 . V. V. Lozin and G. Rudolf. Minimal universal bipartite graphs. Ars Comb., 84, 2007.","journal-title":"Ars Comb."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1017\/S2040618500035139"},{"key":"e_1_3_2_1_41_1","volume-title":"Topics on tournaments","author":"Moon J. W.","year":"1968","unstructured":"J. W. Moon . Topics on tournaments . New York , 1968 . J. W. Moon. Topics on tournaments. New York, 1968."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.03.005"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.83"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873612"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(200003)33:3%26lt;%26gt;1.0.CO;2-Y"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.4064\/aa-9-4-331-340"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/791230.792294"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/378580.378581"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1044731.1044732"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1070\/RM1968v023n06ABEH001252"}],"event":{"name":"STOC '15: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Portland Oregon USA","acronym":"STOC '15"},"container-title":["Proceedings of the forty-seventh annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2746539.2746545","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2746539.2746545","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T18:56:03Z","timestamp":1750272963000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2746539.2746545"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,14]]},"references-count":49,"alternative-id":["10.1145\/2746539.2746545","10.1145\/2746539"],"URL":"https:\/\/doi.org\/10.1145\/2746539.2746545","relation":{},"subject":[],"published":{"date-parts":[[2015,6,14]]},"assertion":[{"value":"2015-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}