{"id":"https://openalex.org/W2009804249","doi":"https://doi.org/10.1016/0304-3975(85)90166-5","title":"Implications of forbidden structures for extremal algorithmic problems","display_name":"Implications of forbidden structures for extremal algorithmic problems","publication_year":1985,"publication_date":"1985-01-01","ids":{"openalex":"https://openalex.org/W2009804249","doi":"https://doi.org/10.1016/0304-3975(85)90166-5","mag":"2009804249"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(85)90166-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(85)90166-5","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5034933367","display_name":"Ming-Deh A. Huang","orcid":"https://orcid.org/0000-0002-6508-1054"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ming-Deh A. Huang","raw_affiliation_strings":["Electrical Engineering and Computer Science Department, Princeton University, Princeton, NJ 08544, U.S.A","Princeton Univ., Princeton , NJ"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science Department, Princeton University, Princeton, NJ 08544, U.S.A","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton Univ., Princeton , NJ","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077724737","display_name":"Karl Lieberherr","orcid":"https://orcid.org/0000-0002-1158-0413"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Karl J. Lieberherr","raw_affiliation_strings":["Electrical Engineering and Computer Science Department, Princeton University, Princeton, NJ 08544, U.S.A","Princeton Univ., Princeton , NJ"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science Department, Princeton University, Princeton, NJ 08544, U.S.A","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton Univ., Princeton , NJ","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5034933367"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.14913888,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"40","issue":null,"first_page":"195","last_page":"210"},"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.9979000091552734,"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.9979000091552734,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9941999912261963,"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/satisfiability","display_name":"Satisfiability","score":0.8146369457244873},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.558912992477417},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5010385513305664},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.47073280811309814},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.44864776730537415},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.4405614137649536},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4137720763683319},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3814576268196106},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35884571075439453},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32514458894729614}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.8146369457244873},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.558912992477417},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5010385513305664},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.47073280811309814},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.44864776730537415},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.4405614137649536},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4137720763683319},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3814576268196106},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35884571075439453},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32514458894729614}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0304-3975(85)90166-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(85)90166-5","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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":12,"referenced_works":["https://openalex.org/W2005180798","https://openalex.org/W2030087828","https://openalex.org/W2040924621","https://openalex.org/W2059401572","https://openalex.org/W2070114427","https://openalex.org/W2082547866","https://openalex.org/W2086917808","https://openalex.org/W2090880042","https://openalex.org/W2141925838","https://openalex.org/W2166566648","https://openalex.org/W3084987570","https://openalex.org/W6684468096"],"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/W1913543287","https://openalex.org/W2268872489","https://openalex.org/W2014111643","https://openalex.org/W2963044240","https://openalex.org/W2076399409"],"abstract_inverted_index":null,"counts_by_year":[{"year":2013,"cited_by_count":2}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}