{"id":"https://openalex.org/W7162575817","doi":"https://doi.org/10.4230/lipics.socg.2026.49","title":"Algorithms for Euclidean Distance Matrix Completion: Exploiting Proximity to Triviality","display_name":"Algorithms for Euclidean Distance Matrix Completion: Exploiting Proximity to Triviality","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7162575817","doi":"https://doi.org/10.4230/lipics.socg.2026.49"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25855","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.49","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.49/LIPIcs.SoCG.2026.49.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":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.49/LIPIcs.SoCG.2026.49.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5137086314","display_name":"Fedor V. Fomin","orcid":"https://orcid.org/0000-0003-1955-4612"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Fomin, Fedor V.","raw_affiliation_strings":["University of Bergen, Norway"],"raw_orcid":"https://orcid.org/0000-0003-1955-4612","affiliations":[{"raw_affiliation_string":"University of Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137093503","display_name":"Petr A. Golovach","orcid":"https://orcid.org/0000-0002-2619-2990"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Golovach, Petr A.","raw_affiliation_strings":["University of Bergen, Norway"],"raw_orcid":"https://orcid.org/0000-0002-2619-2990","affiliations":[{"raw_affiliation_string":"University of Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137113799","display_name":"M. S. Ramanujan","orcid":"https://orcid.org/0000-0002-2116-6048"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Ramanujan, M. S.","raw_affiliation_strings":["University of Warwick, UK"],"raw_orcid":"https://orcid.org/0000-0002-2116-6048","affiliations":[{"raw_affiliation_string":"University of Warwick, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5137106462","display_name":"Saket Saurabh","orcid":"https://orcid.org/0000-0001-7847-6402"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]},{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]}],"countries":["IN","NO"],"is_corresponding":false,"raw_author_name":"Saurabh, Saket","raw_affiliation_strings":["Institute of Mathematical Sciences, Chennai, India","University of Bergen, Norway"],"raw_orcid":"https://orcid.org/0000-0001-7847-6402","affiliations":[{"raw_affiliation_string":"Institute of Mathematical Sciences, Chennai, India","institution_ids":["https://openalex.org/I59611059"]},{"raw_affiliation_string":"University of Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]}],"institutions":[],"countries_distinct_count":3,"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.69662921,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.3882000148296356,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.3882000148296356,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.10509999841451645,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.08020000159740448,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.4799000024795532},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4348999857902527},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.40130001306533813},{"id":"https://openalex.org/keywords/block-matrix","display_name":"Block matrix","score":0.3601999878883362},{"id":"https://openalex.org/keywords/matrix-completion","display_name":"Matrix completion","score":0.350600004196167},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.33809998631477356},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.329800009727478},{"id":"https://openalex.org/keywords/euclidean-distance-matrix","display_name":"Euclidean distance matrix","score":0.3264999985694885},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.3255000114440918},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.32499998807907104}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.669700026512146},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6093999743461609},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.4799000024795532},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4348999857902527},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.40130001306533813},{"id":"https://openalex.org/C85817219","wikidata":"https://www.wikidata.org/wiki/Q884772","display_name":"Block matrix","level":3,"score":0.3601999878883362},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35679998993873596},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3522000014781952},{"id":"https://openalex.org/C2778459887","wikidata":"https://www.wikidata.org/wiki/Q6787865","display_name":"Matrix completion","level":3,"score":0.350600004196167},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.33809998631477356},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.329800009727478},{"id":"https://openalex.org/C171558263","wikidata":"https://www.wikidata.org/wiki/Q5406122","display_name":"Euclidean distance matrix","level":3,"score":0.3264999985694885},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.3255000114440918},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.32499998807907104},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.3231000006198883},{"id":"https://openalex.org/C111208986","wikidata":"https://www.wikidata.org/wiki/Q901698","display_name":"Distance matrix","level":2,"score":0.3138999938964844},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3041999936103821},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.3003000020980835},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29919999837875366},{"id":"https://openalex.org/C98371066","wikidata":"https://www.wikidata.org/wiki/Q230848","display_name":"Euclidean algorithm","level":2,"score":0.2973000109195709},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.29580000042915344},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.29170000553131104},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.28999999165534973},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.28360000252723694},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.27480000257492065},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.27219998836517334},{"id":"https://openalex.org/C5349765","wikidata":"https://www.wikidata.org/wiki/Q5282866","display_name":"Distance matrices in phylogeny","level":2,"score":0.2718999981880188},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.26660001277923584},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26100000739097595},{"id":"https://openalex.org/C94940","wikidata":"https://www.wikidata.org/wiki/Q652941","display_name":"Hermitian matrix","level":2,"score":0.2565000057220459},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.2558000087738037},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.2535000145435333},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.25270000100135803},{"id":"https://openalex.org/C104140500","wikidata":"https://www.wikidata.org/wiki/Q2088159","display_name":"Row and column spaces","level":3,"score":0.250900000333786}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25855","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.49","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.49/LIPIcs.SoCG.2026.49.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":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.socg.2026.49","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2026.49","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25855","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.49","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.49/LIPIcs.SoCG.2026.49.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":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7162575817.pdf","grobid_xml":"https://content.openalex.org/works/W7162575817.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"the":[1,86,120,151,164,179,201,209],"d-Euclidean":[2],"Distance":[3],"Matrix":[4],"Completion":[5],"(d-EDMC)":[6],"problem,":[7],"one":[8],"aims":[9],"to":[10,23,54,59,74,141],"determine":[11],"whether":[12],"a":[13,24,35,69,132,138,142,188,205],"given":[14,139,180],"partial":[15],"matrix":[16,28],"of":[17,37,97,123,150,167,178,204],"pairwise":[18],"distances":[19],"can":[20],"be":[21],"extended":[22],"full":[25],"Euclidean":[26],"distance":[27,223],"in":[29,85],"d":[30,118,162,199],"dimensions.":[31],"This":[32,128,182,215],"problem":[33,48],"is":[34,129,184,217],"cornerstone":[36],"computational":[38],"geometry":[39,224],"with":[40,242],"numerous":[41],"applications.":[42],"While":[43],"classical":[44],"work":[45,232],"on":[46,51,64,144],"this":[47],"often":[49],"focuses":[50],"exploiting":[52,245],"connections":[53],"semidefinite":[55],"programming":[56],"typically":[57],"leading":[58],"approximation":[60],"algorithms,":[61],"we":[62],"focus":[63],"exact":[65],"algorithms":[66,226,244],"and":[67,95,119,163,200,225,239],"propose":[68],"novel":[70,133],"distance-from-triviality":[71],"parameterization":[72],"framework":[73],"obtain":[75],"tractability":[76],"results":[77],"for":[78,114,158,195],"d-EDMC.":[79],"We":[80,105],"identify":[81],"key":[82],"structural":[83],"patterns":[84],"input":[87],"that":[88,136],"capture":[89],"entry":[90],"density,":[91],"including":[92],"chordal":[93],"substructures":[94],"coverability":[96],"specified":[98,102,169,176,210],"entries":[99,125,173,177,211],"by":[100,117,161,219],"fully":[101,168],"principal":[103,170],"submatrices.":[104],"obtain:":[106],"1)":[107],"The":[108,154],"first":[109,155],"fixed-parameter":[110],"algorithm":[111,135,157,194],"(FPT":[112],"algorithm)":[113],"d-EDMC":[115,159,196],"parameterized":[116,160],"maximum":[121],"number":[122,166],"unspecified":[124],"per":[126],"row/column.":[127],"achieved":[130,186,218],"through":[131,187],"compression":[134,189],"reduces":[137],"instance":[140],"submatrix":[143],"\ud835\udcaa(1)":[145],"rows":[146],"(for":[147],"fixed":[148,213],"values":[149],"parameters).":[152],"2)":[153],"FPT":[156],"minimum":[165,202],"submatrices":[171],"whose":[172],"cover":[174],"all":[175],"matrix.":[181],"result":[183,216],"also":[185],"algorithm.":[190],"3)":[191],"A":[192],"polynomial-time":[193],"when":[197],"both":[198,248],"fill-in":[203],"natural":[206],"graph":[207,240],"representing":[208],"are":[212],"constants.":[214],"combining":[220],"tools":[221],"from":[222,227,247],"real":[228],"algebraic":[229],"geometry.":[230],"Our":[231],"identifies":[233],"interesting":[234],"parallels":[235],"between":[236],"EDM":[237],"completion":[238],"problems,":[241],"our":[243],"techniques":[246],"domains.":[249]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2026-05-28T00:00:00"}