{"id":"https://openalex.org/W2963209922","doi":"https://doi.org/10.4230/lipics.esa.2017.39","title":"Distance-Preserving Subgraphs of Interval Graphs","display_name":"Distance-Preserving Subgraphs of Interval Graphs","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2963209922","doi":"https://doi.org/10.4230/lipics.esa.2017.39","mag":"2963209922"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:7879","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.39","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.39","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011331683","display_name":"Kshitij Gajjar","orcid":"https://orcid.org/0000-0003-0890-199X"},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Gajjar, Kshitij","raw_affiliation_strings":["Tata Institute of Fundamental Research, Mumbai, India"],"affiliations":[{"raw_affiliation_string":"Tata Institute of Fundamental Research, Mumbai, India","institution_ids":["https://openalex.org/I11947397"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080324608","display_name":"Jaikumar Radhakrishnan","orcid":"https://orcid.org/0000-0002-3875-4620"},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Radhakrishnan, Jaikumar","raw_affiliation_strings":["Tata Institute of Fundamental Research, Mumbai, India"],"affiliations":[{"raw_affiliation_string":"Tata Institute of Fundamental Research, Mumbai, India","institution_ids":["https://openalex.org/I11947397"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011331683"],"corresponding_institution_ids":["https://openalex.org/I11947397"],"apc_list":null,"apc_paid":null,"fwci":0.43,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.67623523,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8329841494560242},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.8035429120063782},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6368918418884277},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5509702563285828},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4849405586719513},{"id":"https://openalex.org/keywords/permutation-graph","display_name":"Permutation graph","score":0.4754875898361206},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46919959783554077},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.45743849873542786},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4416532516479492},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4125528037548065},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.2877267897129059},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.27588945627212524}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8329841494560242},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.8035429120063782},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6368918418884277},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5509702563285828},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4849405586719513},{"id":"https://openalex.org/C68965932","wikidata":"https://www.wikidata.org/wiki/Q7169369","display_name":"Permutation graph","level":3,"score":0.4754875898361206},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46919959783554077},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.45743849873542786},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4416532516479492},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4125528037548065},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2877267897129059},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.27588945627212524},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:7879","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.39","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.esa.2017.39","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.esa.2017.39","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:7879","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.39","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2898116945","https://openalex.org/W2031536548","https://openalex.org/W2953373266","https://openalex.org/W2117562847","https://openalex.org/W1982529066","https://openalex.org/W2952658105","https://openalex.org/W3202730110","https://openalex.org/W3102805201","https://openalex.org/W2949321943","https://openalex.org/W1867877755","https://openalex.org/W2963664420","https://openalex.org/W2474556182","https://openalex.org/W1497632486","https://openalex.org/W2985803252","https://openalex.org/W2460070602","https://openalex.org/W2135382359","https://openalex.org/W2066367171","https://openalex.org/W2041949666","https://openalex.org/W2726740999","https://openalex.org/W1170606744"],"abstract_inverted_index":{"We":[0,19,35],"consider":[1],"the":[2],"problem":[3],"of":[4,9,73],"finding":[5],"small":[6],"distance-preserving":[7,27],"subgraphs":[8,60],"undirected,":[10],"unweighted":[11],"interval":[12,23,45,57],"graphs":[13,58],"that":[14,21,56,65],"have":[15],"k":[16],"terminal":[17],"vertices.":[18,34],"show":[20,55],"every":[22],"graph":[24,46],"admits":[25],"a":[26,38],"subgraph":[28],"with":[29,61],"O(k":[30],"log":[31],"k)":[32],"branching":[33,63],"also":[36],"prove":[37],"matching":[39],"lower":[40],"bound":[41],"by":[42],"exhibiting":[43],"an":[44,70],"based":[47],"on":[48],"bit-reversal":[49],"permutation":[50],"matrices.":[51],"In":[52],"addition,":[53],"we":[54],"admit":[59],"O(k)":[62],"vertices":[64],"approximate":[66],"distances":[67],"up":[68],"to":[69],"additive":[71],"term":[72],"+1.":[74]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2019-07-30T00:00:00"}