{"id":"https://openalex.org/W2004759101","doi":"https://doi.org/10.1016/0196-6774(86)90002-7","title":"Planar 3DM is NP-complete","display_name":"Planar 3DM is NP-complete","publication_year":1986,"publication_date":"1986-06-01","ids":{"openalex":"https://openalex.org/W2004759101","doi":"https://doi.org/10.1016/0196-6774(86)90002-7","mag":"2004759101"},"language":"en","primary_location":{"id":"doi:10.1016/0196-6774(86)90002-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0196-6774(86)90002-7","pdf_url":null,"source":{"id":"https://openalex.org/S110520077","display_name":"Journal of Algorithms","issn_l":"0196-6774","issn":["0196-6774","1090-2678"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319955","host_organization_name":"Academic Press","host_organization_lineage":["https://openalex.org/P4310319955","https://openalex.org/P4310320990"],"host_organization_lineage_names":["Academic Press","Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Algorithms","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/A5019297501","display_name":"Martin Dyer","orcid":"https://orcid.org/0000-0002-2018-0374"},"institutions":[{"id":"https://openalex.org/I874055015","display_name":"Teesside University","ror":"https://ror.org/03z28gk75","country_code":"GB","type":"education","lineage":["https://openalex.org/I874055015"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"M.E Dyer","raw_affiliation_strings":["Department of Mathematics and Statistics, Teesside Polytechnic, Middlesbrough, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, Teesside Polytechnic, Middlesbrough, United Kingdom","institution_ids":["https://openalex.org/I874055015"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056950019","display_name":"Alan Frieze","orcid":"https://orcid.org/0000-0002-8481-5615"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]},{"id":"https://openalex.org/I166337079","display_name":"Queen Mary University of London","ror":"https://ror.org/026zzn846","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I166337079"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"A.M Frieze","raw_affiliation_strings":["Department of Computer Science and Statistics, Queen Mary College, University of London, London, United Kingdom","Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pennsylvania, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Statistics, Queen Mary College, University of London, London, United Kingdom","institution_ids":["https://openalex.org/I166337079"]},{"raw_affiliation_string":"Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pennsylvania, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019297501"],"corresponding_institution_ids":["https://openalex.org/I874055015"],"apc_list":null,"apc_paid":null,"fwci":2.9547,"has_fulltext":false,"cited_by_count":140,"citation_normalized_percentile":{"value":0.90765804,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"7","issue":"2","first_page":"174","last_page":"184"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9986000061035156,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9986000061035156,"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.9984999895095825,"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.9973999857902527,"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/planar","display_name":"Planar","score":0.7908776998519897},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.67148756980896},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6615793704986572},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6343072652816772},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.6141535639762878},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6086728572845459},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5223454236984253},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5100527405738831},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.49738767743110657},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47103527188301086},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4453815817832947},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3770435154438019},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21572661399841309},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11526522040367126}],"concepts":[{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.7908776998519897},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.67148756980896},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6615793704986572},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6343072652816772},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.6141535639762878},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6086728572845459},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5223454236984253},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5100527405738831},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.49738767743110657},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47103527188301086},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4453815817832947},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3770435154438019},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21572661399841309},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11526522040367126},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0196-6774(86)90002-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0196-6774(86)90002-7","pdf_url":null,"source":{"id":"https://openalex.org/S110520077","display_name":"Journal of Algorithms","issn_l":"0196-6774","issn":["0196-6774","1090-2678"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319955","host_organization_name":"Academic Press","host_organization_lineage":["https://openalex.org/P4310319955","https://openalex.org/P4310320990"],"host_organization_lineage_names":["Academic Press","Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W1970776799","https://openalex.org/W2066577300"],"related_works":["https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W2091617677","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489","https://openalex.org/W1913543287","https://openalex.org/W2014111643","https://openalex.org/W2963044240","https://openalex.org/W2076399409"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}