{"id":"https://openalex.org/W1995424053","doi":"https://doi.org/10.1002/scj.4690201004","title":"Maximum lower bound on embedding areas of general graphs","display_name":"Maximum lower bound on embedding areas of general graphs","publication_year":1989,"publication_date":"1989-01-01","ids":{"openalex":"https://openalex.org/W1995424053","doi":"https://doi.org/10.1002/scj.4690201004","mag":"1995424053"},"language":"en","primary_location":{"id":"doi:10.1002/scj.4690201004","is_oa":false,"landing_page_url":"https://doi.org/10.1002/scj.4690201004","pdf_url":null,"source":{"id":"https://openalex.org/S58208175","display_name":"Systems and Computers in Japan","issn_l":"0882-1666","issn":["0882-1666","1520-684X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Systems and Computers in Japan","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/A5102728563","display_name":"Koichi Wada","orcid":"https://orcid.org/0000-0002-5351-1459"},"institutions":[{"id":"https://openalex.org/I197274945","display_name":"Nagoya Institute of Technology","ror":"https://ror.org/055yf1005","country_code":"JP","type":"education","lineage":["https://openalex.org/I197274945"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Koichi Wada","raw_affiliation_strings":["Faculty of Engineering, Nagoya Institute of Technology, Nagoya, Japan 466","Koichi Wada graduated in 1978 from the Dept. of Information and Computer Sciences, Faculty of Engineering Science, Osaka University, and obtained a Dr. of Sci. degree from the r e in 1983. He was then appointed Assistant Professor on the Faculty of Engineering Science at the University. in 1984, He was appointed Lecturer in the Dept. of Information Science (presently Electrical and Computer Engineering), Nagoya institute of Technology, where He is currently an Associate Professor. He is engaged in research on complexity of VLSI circuits, hardware algorithm and graph theory. He is a member of Society for Information Processing"],"affiliations":[{"raw_affiliation_string":"Faculty of Engineering, Nagoya Institute of Technology, Nagoya, Japan 466","institution_ids":["https://openalex.org/I197274945"]},{"raw_affiliation_string":"Koichi Wada graduated in 1978 from the Dept. of Information and Computer Sciences, Faculty of Engineering Science, Osaka University, and obtained a Dr. of Sci. degree from the r e in 1983. He was then appointed Assistant Professor on the Faculty of Engineering Science at the University. in 1984, He was appointed Lecturer in the Dept. of Information Science (presently Electrical and Computer Engineering), Nagoya institute of Technology, where He is currently an Associate Professor. He is engaged in research on complexity of VLSI circuits, hardware algorithm and graph theory. He is a member of Society for Information Processing","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076660354","display_name":"Kimio Kawaguchi","orcid":null},"institutions":[{"id":"https://openalex.org/I197274945","display_name":"Nagoya Institute of Technology","ror":"https://ror.org/055yf1005","country_code":"JP","type":"education","lineage":["https://openalex.org/I197274945"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kimio Kawaguchi","raw_affiliation_strings":["Faculty of Engineering, Nagoya Institute of Technology, Nagoya, Japan 466","Kimio Kawaguchi graduated in 1958 from the Dept. of Mathematics, Faculty of Science, Osaka University, and in 1961 obtained a Dr. of Sci. degree from the Dept. of Communication Engineering, Faculty of Engineering, Osaka University. in the same year, He joined Fujitsu Corp., leaving in 1968 to become a Lecturer at Osaka University. After becoming an Associate Professor in 1976, He was appointed a Professor in the Dept. of Information Science (presently Electrical and Computer Engineering), Faculty of Engineering, Nagoya institute of Technology. He is engaged in research on queuing matrix system, coding of \u201ckanji\u201d (Japanese characters), graph theory, etc. He is a member of the Society for Information Processing"],"affiliations":[{"raw_affiliation_string":"Faculty of Engineering, Nagoya Institute of Technology, Nagoya, Japan 466","institution_ids":["https://openalex.org/I197274945"]},{"raw_affiliation_string":"Kimio Kawaguchi graduated in 1958 from the Dept. of Mathematics, Faculty of Science, Osaka University, and in 1961 obtained a Dr. of Sci. degree from the Dept. of Communication Engineering, Faculty of Engineering, Osaka University. in the same year, He joined Fujitsu Corp., leaving in 1968 to become a Lecturer at Osaka University. After becoming an Associate Professor in 1976, He was appointed a Professor in the Dept. of Information Science (presently Electrical and Computer Engineering), Faculty of Engineering, Nagoya institute of Technology. He is engaged in research on queuing matrix system, coding of \u201ckanji\u201d (Japanese characters), graph theory, etc. He is a member of the Society for Information Processing","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037224359","display_name":"Hideyuki Fujishima","orcid":null},"institutions":[{"id":"https://openalex.org/I197274945","display_name":"Nagoya Institute of Technology","ror":"https://ror.org/055yf1005","country_code":"JP","type":"education","lineage":["https://openalex.org/I197274945"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hideyuki Fujishima","raw_affiliation_strings":["Faculty of Engineering, Nagoya Institute of Technology, Nagoya, Japan 466","Hideyuki Fujishima graduated in 1987 from the Dept. of Information Science, Faculty of Engineering, Nagoya institute of Technology, where He is presently in the doctoral program in Electrical and Computer Engineering. He is interested in complexity of VLSI, hardware algorithm and data structures. He is a member of the Society for Information Processing"],"affiliations":[{"raw_affiliation_string":"Faculty of Engineering, Nagoya Institute of Technology, Nagoya, Japan 466","institution_ids":["https://openalex.org/I197274945"]},{"raw_affiliation_string":"Hideyuki Fujishima graduated in 1987 from the Dept. of Information Science, Faculty of Engineering, Nagoya institute of Technology, where He is presently in the doctoral program in Electrical and Computer Engineering. He is interested in complexity of VLSI, hardware algorithm and data structures. He is a member of the Society for Information Processing","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5102728563"],"corresponding_institution_ids":["https://openalex.org/I197274945"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0959596,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"20","issue":"10","first_page":"39","last_page":"52"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9995999932289124,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9983999729156494,"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"}},{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/embedding","display_name":"Embedding","score":0.7007989883422852},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6924710273742676},{"id":"https://openalex.org/keywords/rectangle","display_name":"Rectangle","score":0.624732255935669},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5650111436843872},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5315506458282471},{"id":"https://openalex.org/keywords/book-embedding","display_name":"Book embedding","score":0.4911470115184784},{"id":"https://openalex.org/keywords/graph-embedding","display_name":"Graph embedding","score":0.48105549812316895},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4672629237174988},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4308268129825592},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.42938172817230225},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3931756615638733},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34114229679107666},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.27739307284355164},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.23345863819122314},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09188389778137207}],"concepts":[{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.7007989883422852},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6924710273742676},{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.624732255935669},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5650111436843872},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5315506458282471},{"id":"https://openalex.org/C180222743","wikidata":"https://www.wikidata.org/wiki/Q4942980","display_name":"Book embedding","level":5,"score":0.4911470115184784},{"id":"https://openalex.org/C75564084","wikidata":"https://www.wikidata.org/wiki/Q5597085","display_name":"Graph embedding","level":3,"score":0.48105549812316895},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4672629237174988},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4308268129825592},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.42938172817230225},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3931756615638733},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34114229679107666},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.27739307284355164},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.23345863819122314},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09188389778137207},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/scj.4690201004","is_oa":false,"landing_page_url":"https://doi.org/10.1002/scj.4690201004","pdf_url":null,"source":{"id":"https://openalex.org/S58208175","display_name":"Systems and Computers in Japan","issn_l":"0882-1666","issn":["0882-1666","1520-684X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Systems and Computers in Japan","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.44999998807907104,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1585714998","https://openalex.org/W2157211828","https://openalex.org/W4235082445"],"related_works":["https://openalex.org/W2002953601","https://openalex.org/W1525489434","https://openalex.org/W4210542918","https://openalex.org/W1971497628","https://openalex.org/W1518944340","https://openalex.org/W2003472496","https://openalex.org/W4384811834","https://openalex.org/W2002025203","https://openalex.org/W1488574305","https://openalex.org/W2307544818"],"abstract_inverted_index":{"Abstract":[0],"In":[1,75],"designing":[2],"VLSI,":[3],"the":[4,9,19,49,112,115,119,121,126,145,151],"problem":[5,25],"of":[6,15,34,42,87,90,106,114,118,125],"how":[7],"large":[8],"chip":[10],"area":[11,50,127],"will":[12],"be":[13,38,164],"is":[14,26,70,96,137,148],"considerable":[16],"interest.":[17],"Thus,":[18],"primary":[20],"objective":[21],"in":[22],"investigating":[23],"this":[24,56,76],"to":[27,37,54,64,80,129],"consider":[28],"formally":[29],"processing":[30],"elements":[31],"and":[32,40,46],"wires":[33],"a":[35,59,65,81,130],"circuit":[36],"vertices":[39,78],"edges":[41,107],"an":[43,72,100],"undirected":[44],"graph,":[45],"then":[47],"clarify":[48],"sufficient":[51],"or":[52],"necessary":[53],"embed":[55],"graph":[57,62,83,136],"onto":[58],"rectangular":[60,82],"grid":[61],"according":[63],"certain":[66],"embedding":[67,73,101],"method":[68],"(this":[69],"called":[71],"model).":[74],"paper,":[77],"correspond":[79],"such":[84],"that":[85,98,150],"[length":[86],"long":[88,169],"side]/[length":[89],"short":[91],"side]":[92],"\u2264":[93],"constant.":[94],"It":[95],"shown":[97],"under":[99],"model,":[102],"which":[103],"forbids":[104],"images":[105],"(wires)":[108],"from":[109],"passing":[110],"through":[111],"inside":[113],"vertex":[116],"region":[117],"rectangle,":[120],"maximum":[122],"lower":[123],"bound":[124,155],"corresponding":[128],"general":[131],"n":[132,141,160,172],"\u2010vertex":[133,173],"d":[134,139,158,174],"\u2010degree":[135,175],"\u03c9":[138],"2":[140,142,159,161],".":[143],"As":[144],"result,":[146],"it":[147],"seen":[149],"conventionally":[152],"known":[153],"upper":[154],"O":[156],"(":[157],")":[162],"cannot":[163],"improved":[165],"any":[166],"further":[167],"as":[168,170],"all":[171],"graphs":[176],"are":[177],"considered.":[178]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}