{"id":"https://openalex.org/W4401395842","doi":"https://doi.org/10.1007/s10878-024-01197-9","title":"Polynomial algorithms for sparse spanners on subcubic graphs","display_name":"Polynomial algorithms for sparse spanners on subcubic graphs","publication_year":2024,"publication_date":"2024-08-01","ids":{"openalex":"https://openalex.org/W4401395842","doi":"https://doi.org/10.1007/s10878-024-01197-9"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-024-01197-9","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1007/s10878-024-01197-9","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.1007/s10878-024-01197-9","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073394534","display_name":"Renzo G\u00f3mez","orcid":"https://orcid.org/0000-0002-5759-5418"},"institutions":[{"id":"https://openalex.org/I71715416","display_name":"Universidade Federal do ABC","ror":"https://ror.org/028kg9j04","country_code":"BR","type":"education","lineage":["https://openalex.org/I71715416"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"R. G\u00f3mez","raw_affiliation_strings":["Centro de Matem\u00e1tica, Computa\u00e7\u00e3o e Cogni\u00e7\u00e3o, Universidade Federal do ABC, Santo Andr\u00e9, Brazil"],"raw_orcid":"https://orcid.org/0000-0002-5759-5418","affiliations":[{"raw_affiliation_string":"Centro de Matem\u00e1tica, Computa\u00e7\u00e3o e Cogni\u00e7\u00e3o, Universidade Federal do ABC, Santo Andr\u00e9, Brazil","institution_ids":["https://openalex.org/I71715416"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040576989","display_name":"Fl\u00e1vio K. Miyazawa","orcid":"https://orcid.org/0000-0002-1067-6421"},"institutions":[{"id":"https://openalex.org/I181391015","display_name":"Universidade Estadual de Campinas (UNICAMP)","ror":"https://ror.org/04wffgt70","country_code":"BR","type":"education","lineage":["https://openalex.org/I181391015"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"F. K. Miyazawa","raw_affiliation_strings":["Instituto de Computa\u00e7\u00e3o, Universidade Estadual de Campinas, Campinas, Brazil"],"raw_orcid":"https://orcid.org/0000-0002-1067-6421","affiliations":[{"raw_affiliation_string":"Instituto de Computa\u00e7\u00e3o, Universidade Estadual de Campinas, Campinas, Brazil","institution_ids":["https://openalex.org/I181391015"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113324592","display_name":"Y. Wakababayashi","orcid":null},"institutions":[{"id":"https://openalex.org/I17974374","display_name":"Universidade de S\u00e3o Paulo","ror":"https://ror.org/036rp1748","country_code":"BR","type":"education","lineage":["https://openalex.org/I17974374"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Y. Wakababayashi","raw_affiliation_strings":["Instituto de Matem\u00e1tica e Estat\u00edstica, Universidade de S\u00e3o Paulo, S\u00e3o Paulo, Brazil"],"raw_orcid":"https://orcid.org/0000-0002-8229-3139","affiliations":[{"raw_affiliation_string":"Instituto de Matem\u00e1tica e Estat\u00edstica, Universidade de S\u00e3o Paulo, S\u00e3o Paulo, Brazil","institution_ids":["https://openalex.org/I17974374"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5113324592"],"corresponding_institution_ids":["https://openalex.org/I17974374"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14573697,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"48","issue":"1","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.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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.988099992275238,"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/combinatorics","display_name":"Combinatorics","score":0.8044923543930054},{"id":"https://openalex.org/keywords/spanner","display_name":"Spanner","score":0.7429599165916443},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7150158882141113},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5832955837249756},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4704303443431854},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.4680366814136505},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4636813998222351},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4267977178096771},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4239950180053711},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4223122000694275},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4079371988773346},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20848235487937927},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15949082374572754}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8044923543930054},{"id":"https://openalex.org/C2779585601","wikidata":"https://www.wikidata.org/wiki/Q4049850","display_name":"Spanner","level":2,"score":0.7429599165916443},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7150158882141113},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5832955837249756},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4704303443431854},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.4680366814136505},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4636813998222351},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4267977178096771},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4239950180053711},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4223122000694275},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4079371988773346},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20848235487937927},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15949082374572754},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10878-024-01197-9","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1007/s10878-024-01197-9","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:003232579","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-024-01197-9","pdf_url":null,"source":{"id":"https://openalex.org/S4306402641","display_name":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Cient\u00edficas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4383465926","host_organization_name":"LA Referencia","host_organization_lineage":["https://openalex.org/I4383465926"],"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":"instacron:USP","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:48:y:2024:i:1:d:10.1007_s10878-024-01197-9","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-024-01197-9","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"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":"article"}],"best_oa_location":{"id":"pmh:003232579","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-024-01197-9","pdf_url":null,"source":{"id":"https://openalex.org/S4306402641","display_name":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Cient\u00edficas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4383465926","host_organization_name":"LA Referencia","host_organization_lineage":["https://openalex.org/I4383465926"],"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":"instacron:USP","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G258796466","display_name":null,"funder_award_id":"311892/2021-3","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"},{"id":"https://openalex.org/G305158216","display_name":null,"funder_award_id":"2016/01860-1","funder_id":"https://openalex.org/F4320320997","funder_display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo"},{"id":"https://openalex.org/G4990664419","display_name":null,"funder_award_id":"2015/11937-9","funder_id":"https://openalex.org/F4320320997","funder_display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo"},{"id":"https://openalex.org/G8692999307","display_name":null,"funder_award_id":"313146/2022-5","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"},{"id":"https://openalex.org/G996350498","display_name":null,"funder_award_id":"2019/14471-1","funder_id":"https://openalex.org/F4320320997","funder_display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo"}],"funders":[{"id":"https://openalex.org/F4320320997","display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","ror":"https://ror.org/02ddkpn78"},{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W966818798","https://openalex.org/W1512588309","https://openalex.org/W1796769919","https://openalex.org/W1980466385","https://openalex.org/W2012939398","https://openalex.org/W2018963243","https://openalex.org/W2029105149","https://openalex.org/W2034220466","https://openalex.org/W2045446569","https://openalex.org/W2045824107","https://openalex.org/W2059372025","https://openalex.org/W2063722406","https://openalex.org/W2069409708","https://openalex.org/W2091569826","https://openalex.org/W2092534058","https://openalex.org/W2157760787","https://openalex.org/W2810702411","https://openalex.org/W2897842022","https://openalex.org/W2912257407","https://openalex.org/W2991449023","https://openalex.org/W3032246104","https://openalex.org/W3041408219","https://openalex.org/W3135634383","https://openalex.org/W3193515507","https://openalex.org/W4225639063","https://openalex.org/W4235239597","https://openalex.org/W4245082111","https://openalex.org/W4312537081","https://openalex.org/W4313893408"],"related_works":["https://openalex.org/W2949889395","https://openalex.org/W4240054244","https://openalex.org/W2242006561","https://openalex.org/W2962992394","https://openalex.org/W2152434295","https://openalex.org/W2032550399","https://openalex.org/W2057791178","https://openalex.org/W1553492721","https://openalex.org/W1828145824","https://openalex.org/W2596986022"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-13T06:13:01.061226","created_date":"2025-10-10T00:00:00"}
