{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:51:51Z","timestamp":1750308711996,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,1,9]],"date-time":"2013-01-09T00:00:00Z","timestamp":1357689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,1,9]]},"DOI":"10.1145\/2422436.2422468","type":"proceedings-article","created":{"date-parts":[[2013,1,3]],"date-time":"2013-01-03T12:58:22Z","timestamp":1357217902000},"page":"257-268","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Reachability in graph timelines"],"prefix":"10.1145","author":[{"given":"Jakub","family":"Lacki","sequence":"first","affiliation":[{"name":"University of Warsaw, Warsaw, Poland"}]},{"given":"Piotr","family":"Sankowski","sequence":"additional","affiliation":[{"name":"University of Warsaw, Warsaw, Poland"}]}],"member":"320","published-online":{"date-parts":[[2013,1,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/338219.338645"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/338219.338645"},{"key":"e_1_3_2_1_3_1","unstructured":"Thomas H. Cormen Clifford Stein Ronald L. Rivest and Charles E. Leiserson. Introduction to Algorithms. McGraw-Hill Higher Education 2nd edition 2001.   Thomas H. Cormen Clifford Stein Ronald L. Rivest and Charles E. Leiserson. Introduction to Algorithms. McGraw-Hill Higher Education 2nd edition 2001."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1059513.1059514"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/645928.672544"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1033"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775246"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01594940"},{"key":"e_1_3_2_1_10_1","unstructured":"Giuseppe\n     F.\n      \n  \n   \n  Italiano and Neil Sarnak. Fully persistent data structures for disjoint set union problems. In Frank K. H. A. Dehne Jorg-Rudiger Sack and Nicola Santoro editors WADS volume \n  519\n   of \n  Lecture Notes in Computer Science pages \n  449\n  --\n  460\n  . \n  Springer 1991\n  .  Giuseppe F. Italiano and Neil Sarnak. Fully persistent data structures for disjoint set union problems. In Frank K. H. A. Dehne Jorg-Rudiger Sack and Nicola Santoro editors WADS volume 519 of Lecture Notes in Computer Science pages 449--460. Springer 1991."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.312.0249"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Tsvi Kopelowitz. On-line indexing for general alphabets via predecessor queries on subsets of an ordered list. CoRR abs\/1208.3798 2012.  Tsvi Kopelowitz. On-line indexing for general alphabets via predecessor queries on subsets of an ordered list. CoRR abs\/1208.3798 2012.","DOI":"10.1109\/FOCS.2012.79"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02522825"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988674"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.25"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9166-2"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335345"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Mikkel\n       \n      Thorup\n    .\n      \n  \n   \n  Fully-dynamic all-pairs shortest paths: Faster and allowing negative cycles. In Torben Hagerup and Jyrki Katajainen editors SWAT volume \n  3111\n   of \n  Lecture Notes in Computer Science pages \n  384\n  --\n  396\n  . \n  Springer 2004\n  .  Mikkel Thorup. Fully-dynamic all-pairs shortest paths: Faster and allowing negative cycles. In Torben Hagerup and Jyrki Katajainen editors SWAT volume 3111 of Lecture Notes in Computer Science pages 384--396. Springer 2004.","DOI":"10.1007\/978-3-540-27810-8_33"}],"event":{"name":"ITCS '13: Innovations in Theoretical Computer Science","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Berkeley California USA","acronym":"ITCS '13"},"container-title":["Proceedings of the 4th conference on Innovations in Theoretical Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2422436.2422468","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2422436.2422468","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:14:14Z","timestamp":1750277654000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2422436.2422468"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,9]]},"references-count":18,"alternative-id":["10.1145\/2422436.2422468","10.1145\/2422436"],"URL":"https:\/\/doi.org\/10.1145\/2422436.2422468","relation":{},"subject":[],"published":{"date-parts":[[2013,1,9]]},"assertion":[{"value":"2013-01-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}