{"id":"https://openalex.org/W2783145657","doi":"https://doi.org/10.1145/3369933","title":"FPT Algorithms for Embedding into Low-Complexity Graphic Metrics","display_name":"FPT Algorithms for Embedding into Low-Complexity Graphic Metrics","publication_year":2019,"publication_date":"2019-12-16","ids":{"openalex":"https://openalex.org/W2783145657","doi":"https://doi.org/10.1145/3369933","mag":"2783145657"},"language":"en","primary_location":{"id":"doi:10.1145/3369933","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3369933","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1801.03253","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101861796","display_name":"Arijit Ghosh","orcid":"https://orcid.org/0000-0002-2821-265X"},"institutions":[{"id":"https://openalex.org/I6498739","display_name":"Indian Statistical Institute","ror":"https://ror.org/00q2w1j53","country_code":"IN","type":"education","lineage":["https://openalex.org/I6498739"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Arijit Ghosh","raw_affiliation_strings":["Indian Statistical Institute, Kolkata, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Statistical Institute, Kolkata, India","institution_ids":["https://openalex.org/I6498739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000594690","display_name":"Sudeshna Kolay","orcid":"https://orcid.org/0000-0002-2975-4856"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Sudeshna Kolay","raw_affiliation_strings":["Ben-Gurion University of the Negev, Israel","Ben\u2010Gurion University of the Negev, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev, Israel","institution_ids":["https://openalex.org/I124227911"]},{"raw_affiliation_string":"Ben\u2010Gurion University of the Negev, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020352999","display_name":"Gopinath Mishra","orcid":"https://orcid.org/0000-0003-0540-0292"},"institutions":[{"id":"https://openalex.org/I6498739","display_name":"Indian Statistical Institute","ror":"https://ror.org/00q2w1j53","country_code":"IN","type":"education","lineage":["https://openalex.org/I6498739"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Gopinath Mishra","raw_affiliation_strings":["Indian Statistical Institute, Kolkata, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Statistical Institute, Kolkata, India","institution_ids":["https://openalex.org/I6498739"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0117708,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"12","issue":"1","first_page":"1","last_page":"41"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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.996999979019165,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9854999780654907,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.7778985500335693},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.7210755944252014},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6365814805030823},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6307615637779236},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5627440214157104},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5310946702957153},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5096607208251953},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.49970579147338867},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.47457435727119446},{"id":"https://openalex.org/keywords/bijection","display_name":"Bijection","score":0.4529808759689331},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43150651454925537},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.42613479495048523},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20803070068359375},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.18873438239097595},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.0903657078742981},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06725123524665833}],"concepts":[{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.7778985500335693},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.7210755944252014},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6365814805030823},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6307615637779236},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5627440214157104},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5310946702957153},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5096607208251953},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.49970579147338867},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.47457435727119446},{"id":"https://openalex.org/C24424167","wikidata":"https://www.wikidata.org/wiki/Q180907","display_name":"Bijection","level":2,"score":0.4529808759689331},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43150651454925537},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42613479495048523},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20803070068359375},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.18873438239097595},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0903657078742981},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06725123524665833},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.1145/3369933","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3369933","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1801.03253","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1801.03253","pdf_url":"https://arxiv.org/pdf/1801.03253","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"pmh:oai:drops-oai.dagstuhl.de:9498","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.35","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol112-esa2018/LIPIcs.ESA.2018.35/LIPIcs.ESA.2018.35.pdf","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/5c1c6df2-572e-462c-9e98-9aab3879ec05","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/5c1c6df2-572e-462c-9e98-9aab3879ec05","pdf_url":"https://pure.tue.nl/ws/files/106166012/LIPIcs_ESA_2018_35.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Ghosh, A, Kolay, S & Mishra, G 2018, FPT algorithms for embedding into low complexity graphic metrics. in H Bast, G Herman & Y Azar (eds), 26th European Symposium on Algorithms, ESA 2018., 35, Leibniz International Proceedings in Informatics (LIPIcs), vol. 112, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Wadern, 26th European Symposium on Algorithms, ESA 2018, Helsinki, Finland, 20/08/18. https://doi.org/10.4230/LIPIcs.ESA.2018.35","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"mag:2783145657","is_oa":true,"landing_page_url":"http://export.arxiv.org/pdf/1801.03253","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:library.tue.nl:903314","is_oa":false,"landing_page_url":"http://repository.tue.nl/903314","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:tue:oai:pure.tue.nl:publications/5c1c6df2-572e-462c-9e98-9aab3879ec05","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/5c1c6df2-572e-462c-9e98-9aab3879ec05","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"26th European Symposium on Algorithms, ESA 2018","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"doi:10.48550/arxiv.1801.03253","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1801.03253","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.4230/lipics.esa.2018.35","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.esa.2018.35","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:arXiv.org:1801.03253","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1801.03253","pdf_url":"https://arxiv.org/pdf/1801.03253","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W48861618","https://openalex.org/W1530239281","https://openalex.org/W1995402321","https://openalex.org/W2017427469","https://openalex.org/W2054702649","https://openalex.org/W2063491776","https://openalex.org/W2082353536","https://openalex.org/W2096141080","https://openalex.org/W2114493937","https://openalex.org/W2127248062","https://openalex.org/W2163459114","https://openalex.org/W2176446742","https://openalex.org/W2199123782","https://openalex.org/W2569466538","https://openalex.org/W2776260255","https://openalex.org/W2914414140","https://openalex.org/W2964325321","https://openalex.org/W2979473749"],"related_works":["https://openalex.org/W3096349457","https://openalex.org/W3081273719","https://openalex.org/W2178947270","https://openalex.org/W2047577363","https://openalex.org/W2798555189","https://openalex.org/W1974179433","https://openalex.org/W2135418030","https://openalex.org/W2945806087","https://openalex.org/W2399111859","https://openalex.org/W2963774991","https://openalex.org/W2949485274","https://openalex.org/W2163619062","https://openalex.org/W1672478516","https://openalex.org/W1983504800","https://openalex.org/W1798831264","https://openalex.org/W2989336906","https://openalex.org/W2094182335","https://openalex.org/W2141649469","https://openalex.org/W3022808231"],"abstract_inverted_index":{"Given":[0],"metric":[1,181,304,329,346],"spaces":[2,182,305],"(":[3,10,68,70,75,81,106,115,117,122,183,190,330,347],"X":[4,7,20,28,44,65,80,103,105,153,184,187,214,254],",":[5,12,57,84,95,109,185,192,332,349,398,403,439],"D":[6,13,66,79,104,113,186,193,333,350],")":[8,63,87,101,188,335],"and":[9,35,88,127,189,196,404,440],"Y":[11,14,22,30,46,67,114,155,191,194,216,258],"),":[15,73,120,195,352],"an":[16,24,40,210,225,283,326],"embedding":[17,41,150,211,226,232,436],"F":[18,34,38,42,51,69,74,90,116,121,130,135,138,141,146,151,160,167,212,220],":":[19,43,152,213],"\u2192":[21,45,154,215],"is":[23,131,156,168,204,209,227,241,272,364],"injective":[25],"mapping":[26,445],"from":[27,383],"to":[29,205,274,281,415,423,450],".":[31,142,170,201,223,233,411,455],"Expansion":[32],"e":[33,50,137],"contraction":[36],"c":[37,89,140,159,408],"of":[39,245,313,315,396,401,409,427,446],"are":[47,306,381],"defined":[48,132],"as":[49,133,178,421],"=":[52,91,136,256],"max":[53,92],"x":[54,58,61,71,76,82,85,93,96,99,107,110,118,123],";":[55],"1":[56,62,72,83,94,100,108,119],"2":[59,77,86,97,111,124],"(\u2260":[60,98],"\u2208":[64,102],"))/":[78],")/":[112],")),":[125],"respectively,":[126],"distortion":[128,230],"d":[129,134,145,164,200,219,222,231,387],"\u22c5":[139],"Observe":[143],"that":[144,218],"\u2265":[147],"1.":[148,162],"An":[149],"noncontracting":[157],"if":[158],"\u2264":[161,221],"When":[163],"=1,":[165],"then":[166],"isometry":[169],"The":[171,202,234,376],"M":[172,236,247,264,296],"etric":[173,237,248,265,297],"E":[174,238,249,266,298],"mbedding":[175,239,250,267,299],"problem":[176,240,251,317],"takes":[177],"input":[179],"two":[180,303],"a":[197,229,242,365,434],"positive":[198],"integer":[199],"objective":[203],"determine":[206,324],"whether":[207,325],"there":[208],"such":[217],"Such":[224],"called":[228],"bijective":[235],"special":[243],"case":[244],"the":[246,263,291,302,311,316,319,354,379,384,393,425,428,441,444],"where":[252,301,353],"\u2223":[253,255,257],"\u2223.":[259],"In":[260,286],"parameterized":[261,320],"complexity,":[262],"problem,":[268,300],"in":[269,318,431,453],"full":[270],"generality,":[271],"known":[273],"be":[275,337,419],"W-hard":[276],"and,":[277],"therefore,":[278],"not":[279],"expected":[280],"have":[282],"FPT":[284],"algorithm.":[285],"this":[287],"article,":[288],"we":[289],"consider":[290],"G":[292,331,334,432],"en":[293],"-G":[294],"raph":[295],"graph":[307,328,345,355],"metrics.":[308],"We":[309,323],"explore":[310],"extent":[312],"tractability":[314],"complexity":[321],"setting.":[322],"unweighted":[327,344],"can":[336,418],"embedded,":[338,341],"or":[339,367,372],"bijectively":[340],"into":[342,437],"another":[343],"H":[348,351,356,363,368,397,402,410,438,454],"has":[357,369,449],"low":[358],"structural":[359,442],"complexity.":[360],"For":[361],"example,":[362],"cycle,":[366],"bounded":[370,373],"treewidth":[371,399,406],"connected":[374,405],"treewidth.":[375],"parameters":[377],"for":[378],"algorithms":[380],"chosen":[382],"upper":[385],"bound":[386,390],"on":[388,392],"distortion,":[389],"\u0394":[391],"maximum":[394],"degree":[395],"\u03b1":[400,407],"Our":[412],"general":[413],"approach":[414],"these":[416,447],"problems":[417],"summarized":[420],"trying":[422],"understand":[424],"behavior":[426],"shortest":[429,451],"paths":[430,448,452],"under":[433],"low-distortion":[435],"relation":[443]},"counts_by_year":[],"updated_date":"2026-06-21T07:57:09.225873","created_date":"2025-10-10T00:00:00"}