{"id":"https://openalex.org/W2775963553","doi":"https://doi.org/10.1007/s10878-017-0226-x","title":"The matching extension problem in general graphs is co-NP-complete","display_name":"The matching extension problem in general graphs is co-NP-complete","publication_year":2017,"publication_date":"2017-12-21","ids":{"openalex":"https://openalex.org/W2775963553","doi":"https://doi.org/10.1007/s10878-017-0226-x","mag":"2775963553"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-017-0226-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-017-0226-x","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038261463","display_name":"Jan Hackfeld","orcid":"https://orcid.org/0000-0002-6030-2268"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Jan Hackfeld","raw_affiliation_strings":["School of Business and Economics,  Humboldt-Universit\u00e4t zu Berlin, Spandauer Stra\u00dfe 1, 10178, Berlin, Germany"],"raw_orcid":"https://orcid.org/0000-0002-6030-2268","affiliations":[{"raw_affiliation_string":"School of Business and Economics,  Humboldt-Universit\u00e4t zu Berlin, Spandauer Stra\u00dfe 1, 10178, Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043443150","display_name":"Arie M. C. A. Koster","orcid":"https://orcid.org/0000-0002-8035-7012"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Arie M. C. A. Koster","raw_affiliation_strings":["Lehrstuhl II f\u00fcr Mathematik, RWTH Aachen University, 52056, Aachen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lehrstuhl II f\u00fcr Mathematik, RWTH Aachen University, 52056, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5038261463"],"corresponding_institution_ids":["https://openalex.org/I39343248"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.237,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.60451867,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"35","issue":"3","first_page":"853","last_page":"859"},"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.9994000196456909,"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/T12288","display_name":"Optimization and Search Problems","score":0.9934999942779541,"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.8284739255905151},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7861311435699463},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7195522785186768},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5491353869438171},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5328291654586792},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5137695074081421},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.47653064131736755},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.4738089144229889},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.44351309537887573},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4254331886768341},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.42205584049224854},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40427568554878235},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17538782954216003},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13563397526741028}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8284739255905151},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7861311435699463},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7195522785186768},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5491353869438171},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5328291654586792},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5137695074081421},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.47653064131736755},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.4738089144229889},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.44351309537887573},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4254331886768341},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.42205584049224854},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40427568554878235},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17538782954216003},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13563397526741028},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","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":3,"locations":[{"id":"doi:10.1007/s10878-017-0226-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-017-0226-x","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:oai:RePEc:spr:jcomop:v:35:y:2018:i:3:d:10.1007_s10878-017-0226-x","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-017-0226-x","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"},{"id":"pmh:oai:publications.rwth-aachen.de:720077","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/720077","pdf_url":null,"source":{"id":"https://openalex.org/S4306401033","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of combinatorial optimization 35(3,) 853-859 (2017). doi:10.1007/s10878-017-0226-x","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W97712820","https://openalex.org/W1969953447","https://openalex.org/W2044545593","https://openalex.org/W2059608229","https://openalex.org/W2063889627","https://openalex.org/W2401610261","https://openalex.org/W2506696544","https://openalex.org/W4233756358"],"related_works":["https://openalex.org/W2054458431","https://openalex.org/W3181584291","https://openalex.org/W2371352078","https://openalex.org/W4205756423","https://openalex.org/W2567825307","https://openalex.org/W2966673134","https://openalex.org/W2080136900","https://openalex.org/W2352066879","https://openalex.org/W4301329442","https://openalex.org/W2953390393"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}