{"id":"https://openalex.org/W2037357531","doi":"https://doi.org/10.1016/0166-218x(92)90040-h","title":"On the tree packing problem","display_name":"On the tree packing problem","publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W2037357531","doi":"https://doi.org/10.1016/0166-218x(92)90040-h","mag":"2037357531"},"language":"en","primary_location":{"id":"doi:10.1016/0166-218x(92)90040-h","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(92)90040-h","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"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":"Discrete Applied 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/A5070060839","display_name":"Shigeru Masuyama","orcid":null},"institutions":[{"id":"https://openalex.org/I136259955","display_name":"Toyohashi University of Technology","ror":"https://ror.org/04ezg6d83","country_code":"JP","type":"education","lineage":["https://openalex.org/I136259955"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Shigeru Masuyama","raw_affiliation_strings":["Department of Knowledge-Based Information Engineering, Toyohashi University of Technology, Toyohashi 441, Japan","Department of Knowledge-based Information Engineering, Toyohashi University of Technology, Toyohashi 441, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Knowledge-Based Information Engineering, Toyohashi University of Technology, Toyohashi 441, Japan","institution_ids":["https://openalex.org/I136259955"]},{"raw_affiliation_string":"Department of Knowledge-based Information Engineering, Toyohashi University of Technology, Toyohashi 441, Japan","institution_ids":["https://openalex.org/I136259955"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5070060839"],"corresponding_institution_ids":["https://openalex.org/I136259955"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.17461464,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"35","issue":"2","first_page":"163","last_page":"166"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9994000196456909,"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/mathematics","display_name":"Mathematics","score":0.8242323398590088},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.702204704284668},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.6960330009460449},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6455444097518921},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6370521783828735},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6077315807342529},{"id":"https://openalex.org/keywords/set-packing","display_name":"Set packing","score":0.5935011506080627},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.46364063024520874},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.41493889689445496},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3237247169017792},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3172988295555115},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2740475535392761},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.17396512627601624},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11994093656539917},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11594721674919128},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.10754764080047607},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.06594917178153992}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8242323398590088},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.702204704284668},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.6960330009460449},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6455444097518921},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6370521783828735},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6077315807342529},{"id":"https://openalex.org/C134516590","wikidata":"https://www.wikidata.org/wiki/Q475603","display_name":"Set packing","level":3,"score":0.5935011506080627},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.46364063024520874},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.41493889689445496},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3237247169017792},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3172988295555115},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2740475535392761},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.17396512627601624},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11994093656539917},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11594721674919128},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.10754764080047607},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.06594917178153992},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0166-218x(92)90040-h","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(92)90040-h","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"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":"Discrete Applied Mathematics","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":14,"referenced_works":["https://openalex.org/W1975356722","https://openalex.org/W1985061810","https://openalex.org/W1999341643","https://openalex.org/W2026880263","https://openalex.org/W2028696249","https://openalex.org/W2034350206","https://openalex.org/W2038558760","https://openalex.org/W2067665587","https://openalex.org/W2125690626","https://openalex.org/W2465316182","https://openalex.org/W2799004609","https://openalex.org/W4285719527","https://openalex.org/W6659593253","https://openalex.org/W6719312957"],"related_works":["https://openalex.org/W191748763","https://openalex.org/W2560694610","https://openalex.org/W2010520791","https://openalex.org/W107228333","https://openalex.org/W3087791475","https://openalex.org/W3174963230","https://openalex.org/W2000723919","https://openalex.org/W2046322208","https://openalex.org/W2015843241","https://openalex.org/W2157454326"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}