{"id":"https://openalex.org/W2036263637","doi":"https://doi.org/10.1137/0405010","title":"On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design","display_name":"On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design","publication_year":1992,"publication_date":"1992-02-01","ids":{"openalex":"https://openalex.org/W2036263637","doi":"https://doi.org/10.1137/0405010","mag":"2036263637"},"language":"en","primary_location":{"id":"doi:10.1137/0405010","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0405010","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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/A5054676766","display_name":"Michael R. Fellows","orcid":"https://orcid.org/0000-0002-6148-9212"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael R. Fellows","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5011863644","display_name":"Michael A. Langston","orcid":"https://orcid.org/0000-0001-5945-5796"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael A. Langston","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.8694,"has_fulltext":false,"cited_by_count":87,"citation_normalized_percentile":{"value":0.90729593,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"5","issue":"1","first_page":"117","last_page":"126"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9977999925613403,"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/mathematics","display_name":"Mathematics","score":0.6910742521286011},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6240819096565247},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.559980571269989},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4990382194519043},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4805926978588104},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.4658646881580353},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4632026255130768},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.45084550976753235},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4339922368526459},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4176056981086731},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2696857452392578},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23669418692588806}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6910742521286011},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6240819096565247},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.559980571269989},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4990382194519043},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4805926978588104},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4658646881580353},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4632026255130768},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.45084550976753235},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4339922368526459},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4176056981086731},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2696857452392578},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23669418692588806},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0405010","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0405010","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7699999809265137,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1485291616","https://openalex.org/W1587936952","https://openalex.org/W1754271228","https://openalex.org/W1987092466","https://openalex.org/W2000611521","https://openalex.org/W2019067855","https://openalex.org/W2036740975","https://openalex.org/W2045403474","https://openalex.org/W2047871605","https://openalex.org/W2057826895","https://openalex.org/W2063019820","https://openalex.org/W2084182003","https://openalex.org/W2116378217","https://openalex.org/W2137766675","https://openalex.org/W2143314829","https://openalex.org/W2155694459","https://openalex.org/W2162371997","https://openalex.org/W2162494152"],"related_works":["https://openalex.org/W1978042415","https://openalex.org/W1996842245","https://openalex.org/W1516407058","https://openalex.org/W4377372033","https://openalex.org/W3003396734","https://openalex.org/W207698748","https://openalex.org/W3005925191","https://openalex.org/W4221160330","https://openalex.org/W2141285440","https://openalex.org/W2067623439"],"abstract_inverted_index":{"The":[0,58,78],"existence":[1],"of":[2,13,45,69,80,83],"decision":[3],"algorithms":[4],"with":[5,52],"low-degree":[6],"polynomial":[7,55],"running":[8,56],"times":[9],"for":[10],"a":[11],"number":[12],"well-studied":[14],"graph":[15],"layout,":[16],"placement,":[17],"and":[18,75],"routing":[19],"problems":[20,85],"is":[21,86],"nonconstructively":[22],"proved.":[23],"Some":[24],"were":[25,36],"not":[26],"previously":[27],"known":[28,38],"to":[29,39],"be":[30,40],"in":[31,41],"$\\mathcal{P}$":[32,42],"at":[33],"all;":[34],"others":[35],"only":[37],"by":[43],"way":[44],"brute":[46],"force":[47],"or":[48],"dynamic":[49],"programming":[50],"formulations":[51],"unboundedly":[53],"high-degree":[54],"times.":[57],"methods":[59],"applied":[60],"include":[61],"the":[62,67,73],"recent":[63],"Robertson\u2013Seymour":[64],"theorems":[65],"on":[66],"well-partial-ordering":[68],"graphs":[70],"under":[71],"both":[72],"minor":[74],"immersion":[76],"orders.":[77],"complexity":[79],"search":[81],"versions":[82],"these":[84],"also":[87],"briefly":[88],"addressed.":[89]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":7}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}