{"id":"https://openalex.org/W4414838668","doi":"https://doi.org/10.4230/lipics.wads.2025.12","title":"Testing Whether a Subgraph Is Convex or Isometric","display_name":"Testing Whether a Subgraph Is Convex or Isometric","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4414838668","doi":"https://doi.org/10.4230/lipics.wads.2025.12"},"language":"en","primary_location":{"id":"pmh:oai:dirros.openscience.si:IzpisGradiva.php?id=24738","is_oa":true,"landing_page_url":"https://dirros.openscience.si/IzpisGradiva.php?id=24738","pdf_url":null,"source":{"id":"https://openalex.org/S4377196363","display_name":"DiRROS repository (University of Maribor)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I37696226","host_organization_name":"University of Maribor","host_organization_lineage":["https://openalex.org/I37696226"],"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":"ISBN: 978-3-95977-398-0","raw_type":"info:eu-repo/semantics/publishedVersion"},"type":"article","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://dirros.openscience.si/IzpisGradiva.php?id=24738","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034923438","display_name":"Sergio Cabello","orcid":"https://orcid.org/0000-0002-3183-4126"},"institutions":[{"id":"https://openalex.org/I153976015","display_name":"University of Ljubljana","ror":"https://ror.org/05njb9z20","country_code":"SI","type":"education","lineage":["https://openalex.org/I153976015"]},{"id":"https://openalex.org/I4210106342","display_name":"Institute of Mathematics, Physics, and Mechanics","ror":"https://ror.org/01eb3qa50","country_code":"SI","type":"facility","lineage":["https://openalex.org/I4210106342"]}],"countries":["SI"],"is_corresponding":true,"raw_author_name":"Cabello, Sergio","raw_affiliation_strings":["Faculty of Mathematics and Physics, University of Ljubljana, Slovenia","Institute of Mathematics, Physics and Mechanics, Ljubljana, Slovenia"],"raw_orcid":"https://orcid.org/0000-0002-3183-4126","affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Physics, University of Ljubljana, Slovenia","institution_ids":["https://openalex.org/I153976015"]},{"raw_affiliation_string":"Institute of Mathematics, Physics and Mechanics, Ljubljana, Slovenia","institution_ids":["https://openalex.org/I4210106342"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5034923438"],"corresponding_institution_ids":["https://openalex.org/I153976015","https://openalex.org/I4210106342"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.27824092,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.2635999917984009,"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.2635999917984009,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.2572999894618988,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.6266999840736389},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5760999917984009},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.46209999918937683},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4569000005722046},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44350001215934753},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3937999904155731},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.35899999737739563}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7548999786376953},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6899999976158142},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.6266999840736389},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5760999917984009},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.46209999918937683},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4569000005722046},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4456999897956848},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44350001215934753},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3937999904155731},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.35899999737739563},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.34769999980926514},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.34299999475479126},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3343999981880188},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.320499986410141},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.28949999809265137},{"id":"https://openalex.org/C103486182","wikidata":"https://www.wikidata.org/wiki/Q1216236","display_name":"Isometric exercise","level":2,"score":0.2847999930381775},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2831000089645386}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:dirros.openscience.si:IzpisGradiva.php?id=24738","is_oa":true,"landing_page_url":"https://dirros.openscience.si/IzpisGradiva.php?id=24738","pdf_url":null,"source":{"id":"https://openalex.org/S4377196363","display_name":"DiRROS repository (University of Maribor)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I37696226","host_organization_name":"University of Maribor","host_organization_lineage":["https://openalex.org/I37696226"],"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":"ISBN: 978-3-95977-398-0","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:repozitorij.uni-lj.si:IzpisGradiva.php?id=176951","is_oa":true,"landing_page_url":"https://repozitorij.uni-lj.si/IzpisGradiva.php?id=176951","pdf_url":null,"source":{"id":"https://openalex.org/S4377196268","display_name":"Repository of the University of Ljubljana (University of Ljubljana)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I153976015","host_organization_name":"University of Ljubljana","host_organization_lineage":["https://openalex.org/I153976015"],"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":"ISBN: 978-3-95977-398-0","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:2502.16193","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2502.16193","pdf_url":"https://arxiv.org/pdf/2502.16193","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":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2502.16193","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2502.16193","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.wads.2025.12","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.wads.2025.12","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:dirros.openscience.si:IzpisGradiva.php?id=24738","is_oa":true,"landing_page_url":"https://dirros.openscience.si/IzpisGradiva.php?id=24738","pdf_url":null,"source":{"id":"https://openalex.org/S4377196363","display_name":"DiRROS repository (University of Maribor)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I37696226","host_organization_name":"University of Maribor","host_organization_lineage":["https://openalex.org/I37696226"],"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":"ISBN: 978-3-95977-398-0","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5099342464","display_name":null,"funder_award_id":"101071836","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,50,81],"consider":[1],"the":[2,36,43,72,85,113],"following":[3],"two":[4],"algorithmic":[5],"problems:":[6],"given":[7],"a":[8,12,23,52,108,118,126],"graph":[9,120],"$G$":[10,116],"and":[11,64,96,121],"subgraph":[13,26],"$H\\subseteq":[14],"G$,":[15],"decide":[16],"whether":[17],"$H$":[18,122],"is":[19,30,117,123],"an":[20],"isometric":[21],"or":[22],"geodesically":[24],"convex":[25],"of":[27,48,102],"$G$.":[28,130],"It":[29],"relatively":[31],"easy":[32],"to":[33,70],"see":[34],"that":[35,84],"problems":[37],"can":[38,87],"be":[39,88],"solved":[40,89],"by":[41,125],"computing":[42],"distances":[44],"between":[45],"all":[46],"pairs":[47],"vertices.":[49],"provide":[51,107],"conditional":[53],"lower":[54],"bound":[55],"showing":[56],"that,":[57],"for":[58,77,93,100,112],"sparse":[59],"graphs":[60,95,101],"with":[61],"$n$":[62],"vertices":[63],"$\u0398(n)$":[65],"edges,":[66],"we":[67,106],"cannot":[68],"expect":[69],"solve":[71],"problem":[73,86],"in":[74,90,97,129],"$O(n^{2-\\varepsilon})$":[75],"time":[76,92,99,110],"any":[78],"constant":[79],"$\\varepsilon>0$.":[80],"also":[82],"show":[83],"subquadratic":[91],"planar":[94],"near-linear":[98,109],"bounded":[103],"treewidth.":[104],"Finally,":[105],"algorithm":[111],"setting":[114],"where":[115],"plane":[119],"defined":[124],"few":[127],"cycles":[128]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-06T00:00:00"}