{"id":"https://openalex.org/W3217069028","doi":"https://doi.org/10.1016/j.tcs.2023.113938","title":"Space-efficient algorithms for reachability in directed geometric graphs","display_name":"Space-efficient algorithms for reachability in directed geometric graphs","publication_year":2023,"publication_date":"2023-05-08","ids":{"openalex":"https://openalex.org/W3217069028","doi":"https://doi.org/10.1016/j.tcs.2023.113938","mag":"3217069028"},"language":"en","primary_location":{"id":"doi:10.1016/j.tcs.2023.113938","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.tcs.2023.113938","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-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/A5072487585","display_name":"Sujoy Bhore","orcid":"https://orcid.org/0000-0003-0104-1659"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Sujoy Bhore","raw_affiliation_strings":["Department of Computer Science & Engineering, Indian Institute of Technology Bombay, India"],"raw_orcid":"https://orcid.org/0000-0003-0104-1659","affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, Indian Institute of Technology Bombay, India","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051676245","display_name":"Rahul Jain","orcid":"https://orcid.org/0000-0002-3649-6576"},"institutions":[{"id":"https://openalex.org/I120691247","display_name":"FernUniversit\u00e4t in Hagen","ror":"https://ror.org/04tkkr536","country_code":"DE","type":"education","lineage":["https://openalex.org/I120691247"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rahul Jain","raw_affiliation_strings":["Fernuniversit\u00e4t in Hagen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fernuniversit\u00e4t in Hagen, Germany","institution_ids":["https://openalex.org/I120691247"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5072487585"],"corresponding_institution_ids":["https://openalex.org/I162827531"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00740175,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"961","issue":null,"first_page":"113938","last_page":"113938"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9945999979972839,"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/chordal-graph","display_name":"Chordal graph","score":0.7771359086036682},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7311757206916809},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7268112897872925},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5465233325958252},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.5301821231842041},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.49256759881973267},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48920559883117676},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.47372570633888245},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.45362818241119385},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4277111291885376},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4169420003890991},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.4117029905319214},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3536612093448639},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.28728604316711426},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.267680823802948}],"concepts":[{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.7771359086036682},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7311757206916809},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7268112897872925},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5465233325958252},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.5301821231842041},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.49256759881973267},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48920559883117676},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.47372570633888245},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.45362818241119385},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4277111291885376},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4169420003890991},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.4117029905319214},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3536612093448639},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.28728604316711426},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.267680823802948}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.tcs.2023.113938","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.tcs.2023.113938","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320323448","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W594514321","https://openalex.org/W1527197079","https://openalex.org/W1772007397","https://openalex.org/W1978452004","https://openalex.org/W1982129592","https://openalex.org/W1991755800","https://openalex.org/W2017223622","https://openalex.org/W2034834286","https://openalex.org/W2037106315","https://openalex.org/W2038643780","https://openalex.org/W2039302045","https://openalex.org/W2049516232","https://openalex.org/W2072560800","https://openalex.org/W2077735330","https://openalex.org/W2086119402","https://openalex.org/W2086551550","https://openalex.org/W2089465933","https://openalex.org/W2090708733","https://openalex.org/W2149392423","https://openalex.org/W2734370244","https://openalex.org/W2788229924","https://openalex.org/W2911575671","https://openalex.org/W2914612129","https://openalex.org/W2971732594","https://openalex.org/W2972321504","https://openalex.org/W3019997545","https://openalex.org/W6602474391","https://openalex.org/W6634076561","https://openalex.org/W6637698136","https://openalex.org/W6640240589","https://openalex.org/W6646886840","https://openalex.org/W6659287788","https://openalex.org/W6666564640","https://openalex.org/W6678762054","https://openalex.org/W6683936283","https://openalex.org/W6692741400","https://openalex.org/W6695436447","https://openalex.org/W6712414278","https://openalex.org/W6758998730","https://openalex.org/W6761004260","https://openalex.org/W6787969449"],"related_works":["https://openalex.org/W2963009577","https://openalex.org/W2788975631","https://openalex.org/W2903402681","https://openalex.org/W2117608641","https://openalex.org/W2004663694","https://openalex.org/W2966902162","https://openalex.org/W1977862280","https://openalex.org/W2084631735","https://openalex.org/W4289672287","https://openalex.org/W2963574048"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-02-03T00:53:05.648605","created_date":"2025-10-10T00:00:00"}