{"id":"https://openalex.org/W2887184711","doi":"https://doi.org/10.1007/s00373-018-1932-6","title":"The Matching Extendability of Optimal 1-Planar Graphs","display_name":"The Matching Extendability of Optimal 1-Planar Graphs","publication_year":2018,"publication_date":"2018-08-09","ids":{"openalex":"https://openalex.org/W2887184711","doi":"https://doi.org/10.1007/s00373-018-1932-6","mag":"2887184711"},"language":"en","primary_location":{"id":"doi:10.1007/s00373-018-1932-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00373-018-1932-6","pdf_url":null,"source":{"id":"https://openalex.org/S186126824","display_name":"Graphs and Combinatorics","issn_l":"0911-0119","issn":["0911-0119","1435-5914"],"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":"Graphs and Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055942870","display_name":"Jun Fujisawa","orcid":"https://orcid.org/0000-0002-7588-2859"},"institutions":[{"id":"https://openalex.org/I203951103","display_name":"Keio University","ror":"https://ror.org/02kn6nx58","country_code":"JP","type":"education","lineage":["https://openalex.org/I203951103"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Jun Fujisawa","raw_affiliation_strings":["Faculty of Business and Commerce, Keio University, Hiyoshi 4-1-1, Kohoku-ku, Yokohama, Kanagawa, 223-8521, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Business and Commerce, Keio University, Hiyoshi 4-1-1, Kohoku-ku, Yokohama, Kanagawa, 223-8521, Japan","institution_ids":["https://openalex.org/I203951103"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022011523","display_name":"Keita Segawa","orcid":null},"institutions":[{"id":"https://openalex.org/I71395657","display_name":"Niigata University","ror":"https://ror.org/04ww21r56","country_code":"JP","type":"education","lineage":["https://openalex.org/I71395657"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Keita Segawa","raw_affiliation_strings":["Graduate School of Science and Technology, Niigata University, 8050 Ikarashi 2-no-cho, Nishi-ku, Niigata, 950-2181, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Science and Technology, Niigata University, 8050 Ikarashi 2-no-cho, Nishi-ku, Niigata, 950-2181, Japan","institution_ids":["https://openalex.org/I71395657"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030137541","display_name":"Yusuke Suzuki","orcid":"https://orcid.org/0000-0001-6940-9777"},"institutions":[{"id":"https://openalex.org/I71395657","display_name":"Niigata University","ror":"https://ror.org/04ww21r56","country_code":"JP","type":"education","lineage":["https://openalex.org/I71395657"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yusuke Suzuki","raw_affiliation_strings":["Department of Mathematics, Niigata University, 8050 Ikarashi 2-no-cho, Nishi-ku, Niigata, 950-2181, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Niigata University, 8050 Ikarashi 2-no-cho, Nishi-ku, Niigata, 950-2181, Japan","institution_ids":["https://openalex.org/I71395657"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055942870"],"corresponding_institution_ids":["https://openalex.org/I203951103"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":0.1898,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.54581562,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"34","issue":"5","first_page":"1089","last_page":"1099"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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.9988999962806702,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9750999808311462,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.824169397354126},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7815449833869934},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.7745358943939209},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5654072165489197},{"id":"https://openalex.org/keywords/planar-straight-line-graph","display_name":"Planar straight-line graph","score":0.5545861124992371},{"id":"https://openalex.org/keywords/outerplanar-graph","display_name":"Outerplanar graph","score":0.5409174561500549},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5229787826538086},{"id":"https://openalex.org/keywords/book-embedding","display_name":"Book embedding","score":0.4836617410182953},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4567680358886719},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3885015845298767},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3553348183631897},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.33641791343688965},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.27599576115608215},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11309397220611572}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.824169397354126},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7815449833869934},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.7745358943939209},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5654072165489197},{"id":"https://openalex.org/C131930043","wikidata":"https://www.wikidata.org/wiki/Q7200964","display_name":"Planar straight-line graph","level":5,"score":0.5545861124992371},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.5409174561500549},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5229787826538086},{"id":"https://openalex.org/C180222743","wikidata":"https://www.wikidata.org/wiki/Q4942980","display_name":"Book embedding","level":5,"score":0.4836617410182953},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4567680358886719},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3885015845298767},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3553348183631897},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.33641791343688965},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.27599576115608215},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11309397220611572},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00373-018-1932-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00373-018-1932-6","pdf_url":null,"source":{"id":"https://openalex.org/S186126824","display_name":"Graphs and Combinatorics","issn_l":"0911-0119","issn":["0911-0119","1435-5914"],"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":"Graphs and Combinatorics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1029795006","display_name":"Maximal 1-embeddings on closed surfaces","funder_award_id":"16K05250","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G1291861874","display_name":null,"funder_award_id":"Grant-in-Aid for Scientific Research (C) 17K05349","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G1476404002","display_name":"On Factor problems in graph on surfaces","funder_award_id":"17K05349","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G3999327765","display_name":null,"funder_award_id":"Grant-in-Aid for Scientific Research (C) 16K05250","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G5014878268","display_name":null,"funder_award_id":"Grant-in-Aid for Scientific Research (B) 16H03952","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G7205053551","display_name":null,"funder_award_id":"Grant-in-Aid for Young Scientists (B) 26800085","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G7945989916","display_name":"Development of Extremal Graph Theory for Sparse Graphs","funder_award_id":"16H03952","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W116810871","https://openalex.org/W1563135114","https://openalex.org/W1974494866","https://openalex.org/W1986153011","https://openalex.org/W1988161135","https://openalex.org/W1988180925","https://openalex.org/W1991502153","https://openalex.org/W2045730620","https://openalex.org/W2079157536","https://openalex.org/W2083421046","https://openalex.org/W2093843500","https://openalex.org/W2128988613","https://openalex.org/W2295687861","https://openalex.org/W2751190017","https://openalex.org/W2798588639","https://openalex.org/W2799803339"],"related_works":["https://openalex.org/W2009558719","https://openalex.org/W43225448","https://openalex.org/W2413835308","https://openalex.org/W2395770054","https://openalex.org/W4327673321","https://openalex.org/W2953040170","https://openalex.org/W4300721795","https://openalex.org/W4255751875","https://openalex.org/W4298336578","https://openalex.org/W2133160845"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}