{"id":"https://openalex.org/W2032707516","doi":"https://doi.org/10.1142/s0219265903000714","title":"IMPROVED BOUNDS FOR THE CROSSING NUMBER OF THE MESH OF TREES","display_name":"IMPROVED BOUNDS FOR THE CROSSING NUMBER OF THE MESH OF TREES","publication_year":2003,"publication_date":"2003-03-01","ids":{"openalex":"https://openalex.org/W2032707516","doi":"https://doi.org/10.1142/s0219265903000714","mag":"2032707516"},"language":"en","primary_location":{"id":"doi:10.1142/s0219265903000714","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219265903000714","pdf_url":null,"source":{"id":"https://openalex.org/S63112013","display_name":"Journal of Interconnection Networks","issn_l":"0219-2659","issn":["0219-2659","1793-6713"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Interconnection Networks","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/A5000793644","display_name":"Robert Cimikowski","orcid":null},"institutions":[{"id":"https://openalex.org/I23732399","display_name":"Montana State University","ror":"https://ror.org/02w0trx84","country_code":"US","type":"education","lineage":["https://openalex.org/I23732399","https://openalex.org/I4210126032"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"ROBERT CIMIKOWSKI","raw_affiliation_strings":["Computer Science Department, Montana State University, Bozeman, Montana 59717-3880, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Montana State University, Bozeman, Montana 59717-3880, USA","institution_ids":["https://openalex.org/I23732399"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063290861","display_name":"Imrich Vrt\u2019o","orcid":null},"institutions":[{"id":"https://openalex.org/I207624831","display_name":"Slovak Academy of Sciences","ror":"https://ror.org/03h7qq074","country_code":"SK","type":"funder","lineage":["https://openalex.org/I207624831"]}],"countries":["SK"],"is_corresponding":false,"raw_author_name":"IMRICH VRT'O","raw_affiliation_strings":["Institute for Informatics, Slovak Academy of Sciences, Bratislava, Slovak Republic"],"affiliations":[{"raw_affiliation_string":"Institute for Informatics, Slovak Academy of Sciences, Bratislava, Slovak Republic","institution_ids":["https://openalex.org/I207624831"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000793644"],"corresponding_institution_ids":["https://openalex.org/I23732399"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.128125,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"04","issue":"01","first_page":"17","last_page":"35"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T11164","display_name":"Remote Sensing and LiDAR Applications","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/2305","display_name":"Environmental Engineering"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9814000129699707,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.8452355265617371},{"id":"https://openalex.org/keywords/crossing-number","display_name":"Crossing number (knot theory)","score":0.7403553128242493},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7235914468765259},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5547022819519043},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5248020887374878},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5015411376953125},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3555520176887512},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2440963089466095},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06202849745750427}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.8452355265617371},{"id":"https://openalex.org/C2777724877","wikidata":"https://www.wikidata.org/wiki/Q2548661","display_name":"Crossing number (knot theory)","level":3,"score":0.7403553128242493},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7235914468765259},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5547022819519043},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5248020887374878},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5015411376953125},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3555520176887512},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2440963089466095},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06202849745750427},{"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/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0219265903000714","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219265903000714","pdf_url":null,"source":{"id":"https://openalex.org/S63112013","display_name":"Journal of Interconnection Networks","issn_l":"0219-2659","issn":["0219-2659","1793-6713"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Interconnection Networks","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.15.5502","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.5502","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.ifi.savba.sk/pub/imrich/motcross.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W44010994","https://openalex.org/W1495591881","https://openalex.org/W1558273801","https://openalex.org/W1995518672","https://openalex.org/W2003689202","https://openalex.org/W2005196216","https://openalex.org/W2024534209","https://openalex.org/W2024937369","https://openalex.org/W2029282358","https://openalex.org/W2031152868","https://openalex.org/W2032958186","https://openalex.org/W2059065509","https://openalex.org/W2060538865","https://openalex.org/W2066782398","https://openalex.org/W2071321409","https://openalex.org/W2097755092","https://openalex.org/W2212201998","https://openalex.org/W2318992515","https://openalex.org/W2326275492","https://openalex.org/W4240657212","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2271503936","https://openalex.org/W3010480555","https://openalex.org/W4226091412","https://openalex.org/W2025239573","https://openalex.org/W4319874546","https://openalex.org/W2032707516","https://openalex.org/W2890418627","https://openalex.org/W2963172655","https://openalex.org/W4299906858","https://openalex.org/W2563528590"],"abstract_inverted_index":{"Improved":[0],"bounds":[1],"for":[2],"the":[3,7,32,60,70],"crossing":[4,71],"number":[5,63,72],"of":[6,9,25,35,46,55,64,73],"mesh":[8],"trees":[10],"graph,":[11],"M":[12,56,74],"n":[13,57],",":[14],"are":[15],"derived.":[16],"In":[17,50],"particular,":[18],"we":[19,52],"derive":[20],"a":[21,39],"new":[22],"lower":[23],"bound":[24,34,45,62],"[Formula:":[26,47],"see":[27,48],"text]":[28],"which":[29,58],"improves":[30],"on":[31],"previous":[33],"Leighton":[36],"[11]":[37],"by":[38],"constant":[40],"factor,":[41],"and":[42],"an":[43],"upper":[44,61],"text].":[49],"addition,":[51],"construct":[53],"drawings":[54],"achieve":[59],"crossings.":[65],"We":[66],"also":[67],"prove":[68],"that":[69],"4":[75],"is":[76],"4.":[77]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}