{"id":"https://openalex.org/W2019301863","doi":"https://doi.org/10.1145/2422436.2422468","title":"Reachability in graph timelines","display_name":"Reachability in graph timelines","publication_year":2013,"publication_date":"2013-01-03","ids":{"openalex":"https://openalex.org/W2019301863","doi":"https://doi.org/10.1145/2422436.2422468","mag":"2019301863"},"language":"en","primary_location":{"id":"doi:10.1145/2422436.2422468","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2422436.2422468","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 4th conference on Innovations in Theoretical Computer Science","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044510135","display_name":"Jakub \u0141\u0105cki","orcid":"https://orcid.org/0000-0001-9347-0041"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Jakub Lacki","raw_affiliation_strings":["University of Warsaw, Warsaw, Poland","University of Warsaw , Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"University of Warsaw , Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025494465","display_name":"Piotr Sankowski","orcid":"https://orcid.org/0000-0002-0907-3754"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Piotr Sankowski","raw_affiliation_strings":["University of Warsaw, Warsaw, Poland","University of Warsaw , Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"University of Warsaw , Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044510135"],"corresponding_institution_ids":["https://openalex.org/I4654613"],"apc_list":null,"apc_paid":null,"fwci":1.4427,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.85382386,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"257","last_page":"268"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9912999868392944,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/timeline","display_name":"Timeline","score":0.8858264684677124},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.610725998878479},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6060056090354919},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5590688586235046},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5057899951934814},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.4671207070350647},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.445904403924942},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4436849355697632},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3396284580230713},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32404571771621704},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08653250336647034},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07439440488815308}],"concepts":[{"id":"https://openalex.org/C4438859","wikidata":"https://www.wikidata.org/wiki/Q186117","display_name":"Timeline","level":2,"score":0.8858264684677124},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.610725998878479},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6060056090354919},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5590688586235046},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5057899951934814},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.4671207070350647},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.445904403924942},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4436849355697632},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3396284580230713},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32404571771621704},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08653250336647034},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07439440488815308},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2422436.2422468","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2422436.2422468","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 4th conference on Innovations in Theoretical Computer Science","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1484930340","https://openalex.org/W1530081940","https://openalex.org/W1969485351","https://openalex.org/W1972418517","https://openalex.org/W2007572995","https://openalex.org/W2010151376","https://openalex.org/W2038728802","https://openalex.org/W2075557785","https://openalex.org/W2089016801","https://openalex.org/W2090263269","https://openalex.org/W2099450374","https://openalex.org/W2115271283","https://openalex.org/W2127087946","https://openalex.org/W2157748587","https://openalex.org/W2169557227","https://openalex.org/W2953368724","https://openalex.org/W3138321435","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1986684738","https://openalex.org/W2967218597","https://openalex.org/W2061471762","https://openalex.org/W2061523528","https://openalex.org/W2147848106","https://openalex.org/W2740487895","https://openalex.org/W2477977050","https://openalex.org/W2984253331","https://openalex.org/W2166041606","https://openalex.org/W3174869962"],"abstract_inverted_index":{"In":[0,161],"this":[1,156],"paper":[2],"we":[3],"consider":[4,82],"the":[5,65,70,74,130,135,140],"problem":[6],"of":[7,25,67,73,85,104,123,134,137],"maintaining":[8],"information":[9,143],"about":[10,64,144],"graphs":[11,26,32],"with":[12],"history":[13,145],"--":[14],"so":[15],"called":[16],"graph":[17,20,169],"timeline.":[18],"A":[19],"timeline":[21,72,170],"is":[22,127,165],"a":[23,46,96,115],"sequence":[24],"G1,...,":[27],"Gt,":[28],"in":[29,69,102,121,175],"which":[30],"consecutive":[31],"are":[33,58],"obtained":[34],"from":[35,98,117],"previous":[36],"ones":[37],"by":[38,42,129],"small":[39],"modifications,":[40],"e.g.,":[41],"adding":[43],"or":[44,76],"removing":[45],"single":[47],"edge.":[48],"We":[49,81,150],"aim":[50],"to":[51,60,100,119,167],"devise":[52],"algorithms":[53],"that":[54,91,110,152],"after":[55],"some":[56,78,162],"preprocessing":[57],"able":[59],"efficiently":[61,148],"answer":[62,172],"queries":[63,155,174],"existence":[66],"paths":[68],"entire":[71],"graph,":[75],"within":[77],"time":[79],"interval.":[80],"two":[83],"types":[84],"queries:":[86],"[forall":[87],"(u,v,a,b)]":[88],"---":[89,108],"query":[90,109],"checks":[92,111],"if":[93,112],"there":[94,113],"exists":[95,114],"path":[97,116,154],"u":[99,118],"v":[101,120],"each":[103],"Ga,...,":[105],"Gb;":[106],"[exists(u,v,a,b)]":[107],"any":[122],"Ga,...,Gb.":[124],"Our":[125],"study":[126,133],"motivated":[128],"recent":[131],"intensive":[132],"evolution":[136],"graphs,":[138],"and":[139,171],"question":[141],"whether":[142],"can":[146],"be":[147],"aggregated.":[149],"show":[151],"for":[153],"is,":[157],"somewhat":[158],"astonishingly,":[159],"true.":[160],"cases":[163],"it":[164],"possible":[166],"preprocess":[168],"such":[173],"almost":[176],"optimal":[177],"time.":[178]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2015,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}