{"id":"https://openalex.org/W2082832869","doi":"https://doi.org/10.1016/0020-0190(89)90022-7","title":"A note on lower bounds for the maximum area and maximum perimeter k-gon problems","display_name":"A note on lower bounds for the maximum area and maximum perimeter k-gon problems","publication_year":1989,"publication_date":"1989-10-01","ids":{"openalex":"https://openalex.org/W2082832869","doi":"https://doi.org/10.1016/0020-0190(89)90022-7","mag":"2082832869"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(89)90022-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(89)90022-7","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"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":"Information Processing Letters","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/A5103488244","display_name":"Robert L. Scot Drysdale","orcid":null},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert L.(Scot) Drysdale","raw_affiliation_strings":["Department of Mathematics and Computer Science, Dartmouth College, Hanover, NH 03755, USA","Darthmouth College, Hanover, NH#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Dartmouth College, Hanover, NH 03755, USA","institution_ids":["https://openalex.org/I107672454"]},{"raw_affiliation_string":"Darthmouth College, Hanover, NH#TAB#","institution_ids":["https://openalex.org/I107672454"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058294332","display_name":"Jerzy W. Jaromczyk","orcid":"https://orcid.org/0000-0003-1427-4072"},"institutions":[{"id":"https://openalex.org/I143302722","display_name":"University of Kentucky","ror":"https://ror.org/02k3smh20","country_code":"US","type":"education","lineage":["https://openalex.org/I143302722"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jerzy W. Jaromczyk","raw_affiliation_strings":["Department of Computer Science, University of Kentucky, KY 40506-0027, USA","University of Kentucky, Lexington"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Kentucky, KY 40506-0027, USA","institution_ids":["https://openalex.org/I143302722"]},{"raw_affiliation_string":"University of Kentucky, Lexington","institution_ids":["https://openalex.org/I143302722"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.28865979,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"32","issue":"6","first_page":"301","last_page":"303"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9855999946594238,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9855999946594238,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10374","display_name":"Advanced Graph Theory Research","score":0.9769999980926514,"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.9549999833106995,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/perimeter","display_name":"Perimeter","score":0.8366442322731018},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6929299831390381},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6740003824234009},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6518197059631348},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5222909450531006},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5038840174674988},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5022509098052979},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4623023569583893},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45044389367103577},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36311036348342896},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33059465885162354},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2317194640636444},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11567133665084839}],"concepts":[{"id":"https://openalex.org/C98503990","wikidata":"https://www.wikidata.org/wiki/Q28474","display_name":"Perimeter","level":2,"score":0.8366442322731018},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6929299831390381},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6740003824234009},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6518197059631348},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5222909450531006},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5038840174674988},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5022509098052979},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4623023569583893},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45044389367103577},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36311036348342896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33059465885162354},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2317194640636444},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11567133665084839},{"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/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/0020-0190(89)90022-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(89)90022-7","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"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":"Information Processing Letters","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":7,"referenced_works":["https://openalex.org/W2005314985","https://openalex.org/W2052562833","https://openalex.org/W2055257826","https://openalex.org/W2059985428","https://openalex.org/W3041834803","https://openalex.org/W4231519719","https://openalex.org/W6665422471"],"related_works":["https://openalex.org/W3082270022","https://openalex.org/W2384088252","https://openalex.org/W1997669545","https://openalex.org/W2383524940","https://openalex.org/W2150905383","https://openalex.org/W2963726605","https://openalex.org/W2108149667","https://openalex.org/W2142686046","https://openalex.org/W2619536498","https://openalex.org/W2103770283"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}