[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"\"}":3,"_public_publisher_byId_9a26e89a-7255-4678-9e57-85c3994b6830":865,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"totalCitation\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:9a26e89a-7255-4678-9e57-85c3994b6830,\"}":892},{"meta":4,"data":6},{"total":5},"117",[7,56,246,295,379,474,535,646,710,744],{"id":8,"createTime":9,"updateTime":10,"relativeEntities":11,"slug":12,"properties":13,"entityType":25,"verifyStatus":26,"verifyTime":27,"verifyNote":28,"languages":29,"translateLanguages":28,"viewCount":32,"subjectFields":33,"manageAffiliations":34,"indexDatabases":35,"url":36,"thumbnailPath":28,"statistic":28,"gsStatistic":37,"type":55,"analyzePriority":28},"f8d0bf97-8d89-482e-b58c-2fc481a0b79b","2025-10-27T06:27:08.591+00:00","2026-08-27T01:57:29.562+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Khoa-h%E1%BB%8Dc-v%C3%A0-C%C3%B4ng-ngh%E1%BB%87-nhi%E1%BB%87t-%C4%91%E1%BB%9Bi",{"country":14,"issn":16,"title":18,"introduce":21,"gsId":23},{"VOID":15},"VN",{"VOID":17},"08667535",{"EN":19,"VI":20},"Journal of Tropical Science and Engineering","Tạp chí Khoa học và Công nghệ nhiệt đới",{"EN":22},"\u003Cp style=\"text-align:justify;\">     Journal of Tropical Science and Engineering (JTSE) is a multidisciplinary scientific journal, licensed to operate as a print journal in 2012 and an electronic journal in 2024 (License No.1479\u002FGP-BTTTT dated August 20, 2012 and No.91\u002FGP-BTTTT dated April 9, 2024 issued by the Ministry of Information and Communications of Vietnam). The JTSE is headquartered in Hanoi.\u003C\u002Fp>\u003Cp style=\"text-align:justify;\">        The JTSE is published every 3 months (4 issues\u002Fyear), publishing research results and overview articles in 3 groups of fields: Tropical Ecology and Environment; Chemistry and Material Sciences; Biomedicine and Pharmacy. In 2022, the JTSE registered the international identifier Digital Object Identifier (DOI): 10.58334\u002Fvrtc.jtst and assigned DOI codes to all articles of the journal. The members of the Editorial Board of the JTSE are prestigious scientists and leading scientists from Vietnam and many countries in the world. The JTSE has been recognized by the Vietnam State Council for Professorship to score scientific articles in Chemistry, Medicine and Biology with scores ranging from 0-0.75 points.\u003C\u002Fp>\u003Cp style=\"text-align:justify;\">      Currently, the JTSE is building and perfecting a set of criteria and making efforts to join the List of prestigious  international journals with a roadmap to enter Scopus and SCIE in the coming time.\u003C\u002Fp>",{"VOID":24},"MS2_GJQAAAAJ","PUBLISHER","VERIFIED","2025-10-27T06:27:25.058+00:00",null,[30,31],"VI","EN",0,[],[],[],"https:\u002F\u002Ftapchikhcnnd.com.vn",{"impactFactor":28,"impactFactorByYear":28,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":38,"totalPublicationByYear":39,"totalCitation":43,"totalCitationByYear":44,"totalCitationPerPublication":52,"totalCitationPerPublicationByYear":53,"hindexLast5Year":42,"hindex":42},483,{"0":40,"2020":40,"2021":40,"2022":40,"2024":40,"2025":41,"2026":42},1,475,3,117,{"2017":40,"2018":40,"2019":45,"2020":46,"2021":46,"2022":47,"2023":48,"2024":49,"2025":50,"2026":51},4,5,11,6,7,53,15,0.24,{"2020":46,"2021":46,"2022":47,"2024":49,"2025":54,"2026":46},0.11,"JOURNAL",{"id":57,"createTime":58,"updateTime":10,"relativeEntities":59,"slug":60,"properties":61,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":69,"subjectFields":70,"manageAffiliations":71,"indexDatabases":84,"url":101,"thumbnailPath":28,"statistic":102,"gsStatistic":195,"type":55,"analyzePriority":28},"cc3aedc1-bd17-441e-b403-4be82349b362","2023-05-29T12:05:16.902+00:00",[],"Vietnam-Journal-of-Mechanics",{"country":62,"issn":63,"title":65,"gsId":67},{"VOID":15},{"VOID":64},"08667136",{"EN":66},"Vietnam Journal of Mechanics",{"VOID":68},"B98qpzgAAAAJ",29,[],[72],{"id":73,"createTime":28,"updateTime":28,"relativeEntities":74,"slug":28,"properties":75,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":82,"parentIds":83,"statistic":28},"5bf72910-eb8d-41eb-b358-ea294f24f765",[],{"title":76,"country":79,"abbreviation":80},{"EN":77,"VI":78},"Vietnam Academy of Science and Technology","Viện Hàn lâm Khoa học và Công nghệ Việt Nam",{"VOID":15},{"VOID":81},"VAST","https:\u002F\u002Fvast.gov.vn\u002F",[],[85],{"id":86,"indexDatabase":87,"url":97,"indexYears":98,"academicFieldIds":99,"indexDatabaseRanking":28},"61d05d3d-1119-4247-9062-3944e6a8afd5",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":89,"label":90,"description":92,"key":94,"publicationTags":95,"standard":28},"7c6668cf-5dbb-472f-ac65-0e3d0d95e1c2",[],{"EN":91,"VI":91},"ACI - Asean Citation Index",{"EN":93,"VI":93},"Cơ sở dữ liệu ACI","aci",[96],"ACI","https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=10758","2018-2022",[100],"007635a4-2624-49b8-a8f3-fec188e6a80e","http:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fvjmech\u002Findex",{"impactFactor":32,"impactFactorByYear":103,"i10Index":122,"i10IndexLast5Year":123,"totalPublication":124,"totalPublicationByYear":125,"totalCitation":143,"totalCitationByYear":144,"totalCitationPerPublication":163,"totalCitationPerPublicationByYear":164,"hindexLast5Year":146,"hindex":146},{"1994":104,"1995":105,"1997":54,"1998":106,"1999":105,"2000":107,"2001":108,"2002":107,"2003":107,"2004":109,"2005":110,"2006":111,"2007":105,"2008":110,"2010":112,"2011":113,"2012":114,"2013":115,"2014":105,"2015":116,"2016":111,"2017":116,"2018":117,"2019":109,"2020":118,"2021":119,"2022":115,"2023":120,"2024":121},0.12,0.08,0.05,0.02,0.1,0.15,0.14,0.09,0.07,0.21,0.73,0.52,0.13,0.26,0.36,0.61,0.64,0.27,23,2,1046,{"1979":126,"1980":127,"1981":128,"1982":129,"1983":51,"1984":129,"1985":130,"1986":128,"1987":51,"1988":51,"1989":122,"1990":128,"1991":129,"1992":128,"1993":131,"1994":132,"1995":133,"1996":133,"1997":132,"1998":131,"1999":128,"2000":122,"2001":134,"2002":130,"2003":135,"2004":122,"2005":136,"2006":133,"2007":137,"2008":138,"2009":131,"2010":134,"2011":47,"2012":139,"2013":131,"2014":134,"2015":131,"2016":135,"2017":140,"2018":132,"2019":131,"2020":141,"2021":122,"2022":142,"2023":130,"2024":123},12,17,18,19,20,25,28,27,22,21,24,38,35,37,26,39,36,1403,{"1980":40,"1982":40,"1983":40,"1991":132,"1992":45,"1993":48,"1994":49,"1995":145,"1996":146,"1997":134,"1998":140,"1999":47,"2000":136,"2001":127,"2002":128,"2003":147,"2004":148,"2005":131,"2006":149,"2007":150,"2008":151,"2009":152,"2010":153,"2011":154,"2012":155,"2013":156,"2014":152,"2015":157,"2016":158,"2017":138,"2018":159,"2019":160,"2020":159,"2021":161,"2022":162,"2023":45},9,13,31,30,46,40,65,43,119,105,89,72,63,66,70,59,68,58,1.34,{"1980":165,"1982":106,"1983":112,"1991":166,"1992":167,"1993":52,"1994":168,"1995":169,"1996":170,"1997":171,"1998":172,"1999":119,"2000":172,"2001":173,"2002":174,"2003":175,"2004":176,"2005":172,"2006":177,"2007":178,"2008":179,"2009":180,"2010":181,"2011":182,"2012":183,"2013":184,"2014":185,"2015":186,"2016":187,"2017":188,"2018":189,"2019":190,"2020":191,"2021":192,"2022":193,"2023":194},0.06,1.47,0.22,0.25,0.33,0.48,0.79,1.04,0.77,0.9,1.48,1.3,1.7,1.05,1.86,1.72,5.41,9.55,2.41,2.88,1.95,2.52,3.14,1.35,2.5,2.36,1.79,2.96,1.61,0.2,{"impactFactor":28,"impactFactorByYear":28,"i10Index":196,"i10IndexLast5Year":128,"totalPublication":197,"totalPublicationByYear":198,"totalCitation":203,"totalCitationByYear":204,"totalCitationPerPublication":219,"totalCitationPerPublicationByYear":220,"hindexLast5Year":126,"hindex":199},42,1244,{"0":147,"1979":146,"1980":127,"1981":127,"1982":199,"1983":199,"1984":129,"1985":129,"1986":128,"1987":129,"1988":51,"1989":140,"1990":127,"1991":129,"1992":129,"1993":133,"1994":147,"1995":132,"1996":69,"1997":132,"1998":131,"1999":134,"2000":140,"2001":131,"2002":134,"2003":131,"2004":133,"2005":132,"2006":131,"2007":200,"2008":138,"2009":140,"2010":132,"2011":122,"2012":201,"2013":132,"2014":140,"2015":148,"2016":122,"2017":202,"2018":69,"2019":140,"2020":69,"2021":132,"2022":139,"2023":130,"2024":133,"2025":131,"2026":138},16,47,41,32,2194,{"1997":126,"1998":205,"1999":126,"2000":145,"2001":145,"2002":126,"2003":205,"2004":127,"2005":129,"2006":146,"2007":132,"2008":136,"2009":47,"2010":131,"2011":138,"2012":206,"2013":207,"2014":208,"2015":162,"2016":209,"2017":209,"2018":210,"2019":211,"2020":212,"2021":213,"2022":214,"2023":215,"2024":216,"2025":217,"2026":218},10,54,64,62,93,123,118,122,168,159,177,205,255,154,1.76,{"1997":221,"1998":222,"1999":223,"2000":224,"2001":118,"2002":223,"2003":222,"2004":225,"2005":226,"2006":115,"2007":227,"2008":228,"2009":229,"2010":230,"2011":231,"2012":232,"2013":233,"2014":234,"2015":235,"2016":236,"2017":237,"2018":238,"2019":239,"2020":240,"2021":48,"2022":241,"2023":242,"2024":243,"2025":244,"2026":245},0.43,0.4,0.55,0.35,0.63,0.68,0.6,0.69,0.42,0.89,1.52,1.32,2.29,2.38,1.93,4.04,2.91,4.24,4.54,4.21,4.3,8.85,7.59,10.2,4.4,{"id":247,"createTime":248,"updateTime":10,"relativeEntities":249,"slug":250,"properties":251,"entityType":25,"verifyStatus":26,"verifyTime":261,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":147,"subjectFields":262,"manageAffiliations":263,"indexDatabases":264,"url":273,"thumbnailPath":28,"statistic":274,"gsStatistic":290,"type":55,"analyzePriority":28},"b5209d2b-2258-40ef-8732-874e80fe24a5","2023-08-01T04:13:30.887+00:00",[],"VNU-Journal-of-Science-Medical-and-Pharmaceutical-Sciences",{"country":252,"eissn":253,"issn":255,"title":257,"gsId":259},{"VOID":15},{"VOID":254},"25881132",{"VOID":256},"26159309",{"EN":258},"VNU Journal of Science: Medical and Pharmaceutical Sciences",{"VOID":260},"nxupvWQAAAAJ","2023-08-01T04:16:22.633+00:00",[],[],[265],{"id":266,"indexDatabase":267,"url":272,"indexYears":28,"academicFieldIds":28,"indexDatabaseRanking":28},"1c684ac3-c7bf-4466-8841-3c6146083c3c",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":268,"label":269,"description":270,"key":94,"publicationTags":271,"standard":28},[],{"EN":91,"VI":91},{"EN":93,"VI":93},[96],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=11969","https:\u002F\u002Fjs.vnu.edu.vn\u002FMPS",{"impactFactor":32,"impactFactorByYear":275,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":276,"totalPublicationByYear":277,"totalCitation":282,"totalCitationByYear":283,"totalCitationPerPublication":284,"totalCitationPerPublicationByYear":285,"hindexLast5Year":45,"hindex":45},{"2019":106,"2020":110,"2021":104,"2022":104,"2023":109,"2024":108},360,{"2016":140,"2017":278,"2018":69,"2019":148,"2020":279,"2021":200,"2022":280,"2023":281,"2024":200},34,48,49,50,163,{"2016":145,"2017":145,"2018":135,"2019":140,"2020":50,"2021":135,"2022":128,"2023":48},0.45,{"2016":224,"2017":117,"2018":286,"2019":287,"2020":288,"2021":284,"2022":289,"2023":104},0.72,0.87,1.1,0.37,{"impactFactor":28,"impactFactorByYear":28,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":136,"totalPublicationByYear":291,"totalCitation":127,"totalCitationByYear":292,"totalCitationPerPublication":293,"totalCitationPerPublicationByYear":294,"hindexLast5Year":123,"hindex":42},{"0":123,"2014":40,"2015":40,"2016":130},{"2016":40,"2019":123,"2021":123,"2023":45,"2024":42,"2025":40,"2026":40},0.71,{"2016":106},{"id":296,"createTime":297,"updateTime":10,"relativeEntities":298,"slug":299,"properties":300,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":51,"subjectFields":310,"manageAffiliations":311,"indexDatabases":312,"url":313,"thumbnailPath":28,"statistic":314,"gsStatistic":349,"type":55,"analyzePriority":28},"e7ce3904-ad2d-4341-b39e-98ebe8da5908","2023-06-13T10:30:04.853+00:00",[],"Communications-in-Physics",{"country":301,"eissn":302,"issn":304,"title":306,"gsId":308},{"VOID":15},{"VOID":303},"28155947",{"VOID":305},"08863166",{"EN":307},"Communications in Physics",{"VOID":309},"FStER9AAAAAJ",[],[],[],"https:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fcip",{"impactFactor":32,"impactFactorByYear":315,"i10Index":199,"i10IndexLast5Year":45,"totalPublication":321,"totalPublicationByYear":322,"totalCitation":326,"totalCitationByYear":327,"totalCitationPerPublication":335,"totalCitationPerPublicationByYear":336,"hindexLast5Year":126,"hindex":126},{"2008":110,"2009":316,"2010":165,"2011":317,"2012":317,"2013":112,"2014":318,"2015":105,"2016":108,"2017":116,"2018":318,"2019":52,"2020":319,"2021":284,"2022":320,"2023":116,"2024":222},0.3,0.03,0.16,0.34,0.28,738,{"2007":323,"2008":145,"2009":145,"2010":136,"2011":139,"2012":324,"2013":138,"2014":151,"2015":69,"2016":151,"2017":325,"2018":142,"2019":50,"2020":201,"2021":141,"2022":152,"2023":150,"2024":278,"2025":123},14,107,56,947,{"2007":148,"2008":49,"2009":49,"2010":127,"2011":328,"2012":155,"2013":278,"2014":329,"2015":206,"2016":330,"2017":331,"2018":332,"2019":333,"2020":334,"2021":127,"2022":132,"2023":148},52,94,86,129,76,91,106,1.28,{"2007":337,"2008":338,"2009":338,"2010":293,"2011":339,"2012":340,"2013":341,"2014":342,"2015":179,"2016":232,"2017":343,"2018":344,"2019":180,"2020":345,"2021":346,"2022":347,"2023":348},2.14,0.78,1.41,0.83,0.97,1.45,2.3,2.11,2.59,0.44,0.65,0.75,{"impactFactor":28,"impactFactorByYear":28,"i10Index":133,"i10IndexLast5Year":145,"totalPublication":350,"totalPublicationByYear":351,"totalCitation":355,"totalCitationByYear":356,"totalCitationPerPublication":363,"totalCitationPerPublicationByYear":364,"hindexLast5Year":145,"hindex":323},1117,{"0":48,"1972":40,"1991":127,"1992":51,"1993":49,"1994":47,"1995":323,"1996":42,"1997":40,"1998":146,"1999":146,"2000":205,"2001":47,"2002":128,"2003":136,"2004":132,"2005":136,"2006":148,"2007":141,"2008":149,"2009":352,"2010":353,"2011":196,"2012":208,"2013":280,"2014":354,"2015":150,"2016":328,"2017":137,"2018":142,"2019":325,"2020":152,"2021":139,"2022":139,"2023":142,"2024":148,"2025":147,"2026":132},33,44,92,1611,{"2004":46,"2005":357,"2006":47,"2007":47,"2008":126,"2009":140,"2010":69,"2011":147,"2012":147,"2013":147,"2014":208,"2015":353,"2016":201,"2017":280,"2018":161,"2019":358,"2020":212,"2021":331,"2022":212,"2023":359,"2024":360,"2025":361,"2026":362},8,85,153,178,188,132,1.44,{"2004":365,"2005":169,"2006":289,"2007":320,"2008":117,"2009":171,"2010":366,"2011":367,"2012":368,"2013":225,"2014":369,"2015":288,"2016":171,"2017":370,"2018":371,"2019":231,"2020":372,"2021":373,"2022":374,"2023":375,"2024":376,"2025":377,"2026":378},0.18,0.66,0.74,0.5,0.67,1.29,1.89,2.84,3.49,3.3,4.25,5.93,6.06,4.71,{"id":380,"createTime":381,"updateTime":382,"relativeEntities":383,"slug":384,"properties":385,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":394,"translateLanguages":28,"viewCount":127,"subjectFields":395,"manageAffiliations":396,"indexDatabases":404,"url":418,"thumbnailPath":28,"statistic":419,"gsStatistic":446,"type":55,"analyzePriority":28},"2300fd63-13a8-4ee9-92b0-d24d9e616c6b","2023-05-29T12:05:31.684+00:00","2026-08-27T01:57:29.561+00:00",[],"Journal-of-Computer-Science-and-Cybernetics",{"country":386,"issn":387,"title":389,"gsId":392},{"VOID":15},{"VOID":388},"18139663",{"EN":390,"VI":391},"Journal of Computer Science and Cybernetics","Tạp chí tin học và điều khiển học",{"VOID":393},"hVh9fuMAAAAJ",[30,31],[],[397],{"id":73,"createTime":28,"updateTime":28,"relativeEntities":398,"slug":28,"properties":399,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":82,"parentIds":403,"statistic":28},[],{"title":400,"country":401,"abbreviation":402},{"EN":77,"VI":78},{"VOID":15},{"VOID":81},[],[405],{"id":406,"indexDatabase":407,"url":412,"indexYears":413,"academicFieldIds":414,"indexDatabaseRanking":28},"0c897c2c-8ca4-4a7a-91b9-14955abc3043",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":408,"label":409,"description":410,"key":94,"publicationTags":411,"standard":28},[],{"EN":91,"VI":91},{"EN":93,"VI":93},[96],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=11305","2019-2021",[100,415,416,417],"a24a4497-b6ac-43f3-ae94-c044be819e49","b2d37900-0c9f-4074-a519-9ee0b570caa7","37da756c-1c5e-4925-87f2-a9bd3ce5859c","http:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fjcc",{"impactFactor":32,"impactFactorByYear":420,"i10Index":129,"i10IndexLast5Year":42,"totalPublication":425,"totalPublicationByYear":426,"totalCitation":431,"totalCitationByYear":432,"totalCitationPerPublication":438,"totalCitationPerPublicationByYear":439,"hindexLast5Year":323,"hindex":323},{"2013":107,"2014":107,"2015":111,"2016":365,"2017":107,"2018":421,"2019":117,"2020":422,"2021":227,"2022":423,"2023":368,"2024":424},0.04,0.32,0.39,0.57,1184,{"2012":427,"2013":358,"2014":278,"2015":428,"2016":429,"2017":51,"2018":430,"2019":148,"2020":130,"2021":136,"2022":199,"2023":132,"2024":42},473,71,251,134,995,{"2012":433,"2013":434,"2014":434,"2015":333,"2016":435,"2017":436,"2018":437,"2019":211,"2020":281,"2021":434,"2022":126,"2023":152},149,45,114,51,232,0.84,{"2012":422,"2013":440,"2014":232,"2015":335,"2016":284,"2017":441,"2018":442,"2019":443,"2020":189,"2021":444,"2022":348,"2023":445},0.53,3.4,1.73,3.93,1.88,1.54,{"impactFactor":28,"impactFactorByYear":28,"i10Index":150,"i10IndexLast5Year":132,"totalPublication":447,"totalPublicationByYear":448,"totalCitation":449,"totalCitationByYear":450,"totalCitationPerPublication":192,"totalCitationPerPublicationByYear":460,"hindexLast5Year":51,"hindex":199},1105,{"0":47,"1981":40,"1985":199,"1986":135,"1987":136,"1988":323,"1989":126,"1990":199,"1991":127,"1992":126,"1993":47,"1994":129,"1995":130,"1996":132,"1997":142,"1998":148,"1999":201,"2000":196,"2001":353,"2002":353,"2003":352,"2004":132,"2005":131,"2006":148,"2007":147,"2008":133,"2009":131,"2010":139,"2011":201,"2012":281,"2013":142,"2014":202,"2015":69,"2016":140,"2017":136,"2018":140,"2019":134,"2020":134,"2021":133,"2022":134,"2023":134,"2024":136,"2025":49},3272,{"2007":145,"2008":323,"2009":46,"2010":48,"2011":129,"2012":148,"2013":140,"2014":69,"2015":152,"2016":160,"2017":162,"2018":451,"2019":452,"2020":453,"2021":454,"2022":455,"2023":456,"2024":457,"2025":458,"2026":459},109,173,236,318,398,469,442,440,297,{"2007":461,"2008":115,"2009":194,"2010":318,"2011":462,"2012":227,"2013":286,"2014":463,"2015":175,"2016":464,"2017":465,"2018":466,"2019":467,"2020":468,"2021":469,"2022":470,"2023":471,"2024":472,"2025":473},0.29,0.46,0.91,2.27,2.42,4.19,7.86,10.73,11.78,18.09,21.32,18.42,62.86,{"id":475,"createTime":476,"updateTime":382,"relativeEntities":477,"slug":478,"properties":479,"entityType":25,"verifyStatus":26,"verifyTime":491,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":202,"subjectFields":492,"manageAffiliations":493,"indexDatabases":509,"url":510,"thumbnailPath":28,"statistic":511,"gsStatistic":525,"type":55,"analyzePriority":28},"25b6bd10-676c-40c0-8dc3-356d1679a284","2023-05-19T02:22:33.430+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Y-D%C6%B0%E1%BB%A3c-h%E1%BB%8Dc-C%E1%BA%A7n-Th%C6%A1",{"country":480,"issn":481,"title":483,"introduce":486,"gsId":489},{"VOID":15},{"VOID":482},"23541210",{"EN":484,"VI":485},"Cantho Journal of Medicine and Pharmacy","Tạp chí Y Dược học Cần Thơ",{"EN":487,"VI":488},"\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">04\u002F10\u002F2015 Ministry of Information and Communications allowed Can Tho journal of medicine and pharmacy to operate (102 \u002FGP-BTTTT)\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">07\u002F16\u002F2015 Can Tho journal of medicine and pharmacy is internationally recognized: ISSN 2354-1210\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">In 2016, The journal has been included in the list of medical science journals by The State Council for professorship which is awarded a work score of 0-0.5 points for a published article.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Can Tho Journal of Medicine and Pharmacy welcome original works that haven’t been submitted or published in other medical journals. Posts must contain content related to one of the journal’s categories.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The content published\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The journal is divided into 3 categories:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Scientific research article: are valuable scientific works, which have been researched and accepted.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Overview of medicine, biology and pharmacy: serving the objective of continuing training in the fields of medicine, biology and pharmacy; to systematize classical and modern knowledge.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Update information on new knowledge about medicine, biology, pharmacy in the country and in the world.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Scope\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Publication and introduction of scientific research in the fields:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Medicine (internal medicine, surgery, pediatrics, obstetrics and gynecology, odonto-stomatology, laboratory, oncology, traditional medicine, nursing).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Biology (genetics, biotechnology).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Pharmacology (pharmaceutics, drug quality analysis-control, synthetic pharmaceutical chemistry, biochemistry, pharmacognosy, botany, clinical pharmacy).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- To enhance the quality of undergraduate, postgraduate education, scientifically researching and meet the necessary treatment in hospital.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Introducing the updated domestic and oversea information about science technology to promote scientific research and exchanging technology in local, other universities.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Exchanging pharmaceutical and medical information for social health developing in the Mekong Delta and Vietnam.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The object\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Postgraduate students, student of Can Tho University of Medicine and Pharmacy, scientists from schools, research institutes, hospitals, health centers, pharmaceutical companies of the Mekong Delta; other provinces and regions in Vietnam and other country.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Address\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Headquarters of Can Tho Journal of Medicine and Pharmacy, located Scientific Research and International Cooperation Office: 179 Nguyen Van Cu Street, An Khanh Ward, Ninh Kieu District, Can Tho City, Vietnam.\u003C\u002Fspan>\u003C\u002Fp>","\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Ngày 16\u002F7\u002F2015, Tạp chí Y Dược học Cần Thơ được cấp chỉ số quốc tế: ISSN 2354-1210.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Từ tháng 4\u002F2016, Tạp chí đã được Hội đồng Giáo sư ngành Y đưa vào danh sách các tạp chí khoa học Y học được tính điểm công trình 0-0,5 điểm cho một bài báo đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Năm 2020 Tạp chí Y Dược học Cần Thơ đã được phê duyệt vào danh mục của các Hội đồng Giáo sư ngành Dược học được tính điểm công trình 0-0,5 điểm cho một bài báo đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ ra 12 số\u002Fnăm, 180-200 trang\u002Fsố.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Từ tháng 12\u002F2022 Tạp chí Y Dược học Cần Thơ là thành viên của hệ thống Crossref và từ tháng 01\u002F2023 tạp chí thực hiện bình duyệt online kín 2 chiều nhằm tăng tính minh bạch, tin cậy của các công trình nghiên cứu khoa học và đảm bảo tốt nhất chất lượng khoa học của bài viết.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tôn chỉ, mục đích và phạm vi của tạp chí\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tôn chỉ và mục đích hoạt động của tạp chí: xuất bản nhằm mục đích phổ biến kết quả từ các đề tài nghiên cứu khoa học; giao lưu trao đổi khoa học, chia sẻ kinh nghiệm, học tập, đồng thời cập nhật thông tin khoa học mới trong các lĩnh vực y, sinh, dược học trong và ngoài nước.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Phạm vi của tạp chí: Tạp chí xuất bản được chia thành 3 chuyên mục: (i) Bài báo nghiên cứu khoa học là kết quả công trình nghiên cứu khoa học có giá trị đã được triển khai nghiên cứu, (ii) Bài tổng quan y, sinh, dược học: phục vụ mục tiêu đào tạo liên tục trong lĩnh vực y, sinh, dược học; nhằm hệ thống hóa những kiến thức kinh điển và hiện đại; (iii) Thông tin cập nhật kiến thức mới về y, sinh, dược học trong nước và trên thế giới.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Chính sách truy cập mở\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ áp dụng chính sách truy cập mở đối với các bài báo đã xuất bản đến với độc giả, nhằm mở rộng cơ hội tiếp cận các kết quả nghiên cứu chất lượng cao và tăng cường trao đổi kiến thức. Tạp chí đăng tải trực tuyến (miễn phí) toàn văn các bài báo được công bố trên website của Tạp chí (https:\u002F\u002Ftapchi.ctump.edu.vn).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đạo đức xuất bản\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ cam kết tuân thủ đạo đức xuất bản phù hợp với các hướng dẫn và tiêu chuẩn của the Committee on Publication Ethics (COPE), tuân thủ các nguyên tắc của COPE’s Core Practices, Best Practices Guidelines for Journal Editors và Guidelines on Good Publication Practices.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Bản thảo bài báo chỉ được chấp nhận khi được tác giả chịu trách nhiệm chính cam kết các nội dung sau: Các nội dung của bản thảo chưa được đăng tải toàn bộ hoặc một phần ở các tạp chí khác; Tất cả các tác giả đều có đóng góp một cách đáng kể vào quá trình nghiên cứu hoặc chuẩn bị bản thảo và cùng chịu trách nhiệm về các nội dung của bản thảo; Tuân thủ các biện pháp đảm bảo đạo đức nghiên cứu (ví dụ thỏa thuận đồng ý tham gia nghiên cứu).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Cam kết bảo mật\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí cam kết thực hiện và tuân thủ các quy định của luật và các văn bản hướng dẫn liên quan đến bảo mật thông tin cá nhân trên không gian mạng. Các thông tin mà người dùng (tác giả, độc giả, biên tập viên, người phản biện) nhập vào các biểu mẫu trên Hệ thống Quản lý xuất bản trực tuyến của tạp chí chỉ được sử dụng vào các mục đích đã được tuyên bố rõ ràng và sẽ không được cung cấp cho bất kỳ bên thứ ba nào khác, hay dùng vào bất kỳ mục đích nào khác.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Phí gửi bài\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Lệ phí gửi đăng bài: 1.000.000đ\u002Fbài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Lệ phí gửi đăng nhanh: 1.500.000đ\u002Fbài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đối với tác giả là cán bộ viên chức thuộc Trường Đại học Y Dược Cần Thơ thì được hỗ trợ 50% lệ phí gửi đăng bài.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đối với sinh viên thực hiện đề tài nghiên cứu khoa học cấp trường được hỗ trợ 100% lệ phí đăng bài ( Tác giả gửi đính kèm “ Quyết định về việc giao tổ chức thực hiện đề tài nghiên cứu khoa học cấp Trường của sinh viên”).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Hình thức nộp lệ phí:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Tiền mặt:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Nộp trực tiếp tại Phòng Tài chính - Kế toán, Trường Đại học Y Dược Cần Thơ, số 179 Nguyễn Văn Cừ, P. An Khánh, Q. Ninh Kiều, thành phố Cần Thơ.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Chuyển khoản:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tên Tài khoản: Trường ĐHYD Cần Thơ, Số TK: 0111000115668, tại ngân hàng Vietcombank chi nhánh Cần Thơ.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Thời gian: Áp dụng từ ngày 01\u002F02\u002F2023.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">* Phí gửi bài không được hoàn trả khi bài viết bị từ chối hoặc tác giả xin rút bài viết.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Quy trình phản biện bài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ thực hiện quy trình phản biện kín hai chiều nghiêm ngặt. Danh tính của những người phản biện không được tiết lộ cho các tác giả và ngược lại. Quy trình thẩm định bài báo đăng gồm các bước sau:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tiếp nhận bản thảo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tác giả liên hệ gửi bản thảo đến Tạp chí qua hệ thống trực tuyến tại website: https:\u002F\u002Ftapchi.ctump.edu.vn. Hướng dẫn về cách đăng ký, gửi bài và chuẩn bị bản thảo được cung cấp trên website của Tạp chí.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Sàng lọc sơ bộ\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Sau khi Tòa soạn nhận được bài báo của tác giả, Ban Thư ký sẽ tiến hành kiểm tra sơ bộ bài báo (các yêu cầu về nội dung và hình thức). Những bài báo không đúng quy cách hoặc có nội dung không phù hợp hoặc vi phạm bản quyền sẽ bị từ chối (Ban Thư ký thông báo phản hồi đến tác giả trong vòng 1 tuần). Những bài báo đủ điều kiện, được Ban Thư ký tòa soạn chuyển đến Ban Biên tập có cùng chuyên môn với nội dung bài báo để đề xuất người phản biện. Thời gian kể từ khi Ban Biên tập nhận bài báo đến khi đề xuất người phản biện bài báo chậm nhất là 5 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Vòng phản biện\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Ban Thư ký gửi bài và yêu cầu phản biện đến 02 phản biện độc lập.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Các phản biện gởi nhận xét cho Ban Thư ký. Thời gian từ khi gửi bài cho phản biện đến khi nhận ý kiến của phản biện tối đa là 20 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Xử ký kết quả phản biện\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Nếu ý kiến đồng ý cho đăng và không cần chỉnh sửa, Ban Thư ký tiếp tục đăng bài theo qui trình.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Nếu ý kiến đồng ý đăng và cần chỉnh sửa, Ban Thư ký sẽ thông tin đến tác giả chỉnh sửa theo yêu cầu của người phản biện. Thời gian chỉnh sửa và gửi lại kéo dài không quá 2 tuần, từ khi tác giả bài báo nhận được thông tin (Quá trình này có thể lặp lại tối đa 2 lần\u002F1 bài báo). Khi có sự thống nhất, đồng ý của người phản biện; bài báo được tiếp tục đăng theo qui trình.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">3. Những bài báo có chất lượng không đạt yêu cầu, cả 2 phản biện không đồng ý cho đăng sẽ bị Tòa soạn từ chối đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Xuất bản\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Ban Thư ký tổng hợp các bản thảo đã được tác giả hoàn thiện sau thẩm định trình Ban Biên tập xem xét, Tổng Biên tập phê duyệt, quyết định bài đăng theo các tiêu chí: sự phù hợp nội dung với tôn chỉ và mục đích, thể loại bài viết (ưu tiên các bài có bài có nghiên cứu chuyên sâu, hàm lượng khoa học cao), đóng góp mới bài báo, bài báo được ưu tiên đăng trong số gần nhất của Tạp chí theo thứ tự: tính thời sự, chất lượng bài báo và thời gian gửi bài.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Ban Biên tập và Ban Thư ký biên tập bản thảo, chế bản, đọc rà soát lỗi. Thời gian hoàn thành từ 10-15 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">3. Ban Thư ký có trách nhiệm thông báo cho tác giả bài báo (bằng e-mail) về tình hình phê duyệt bài báo, thời gian, số kỳ, tập xuất bản bài báo theo qui định.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">4. Danh sách bài báo theo số Tạp chí được in ấn và phát hành trong năm định kỳ được công bố chính thức trên website: https:\u002F\u002Ftapchi.ctump.edu.vn\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>",{"VOID":490},"wcQ1uqwAAAAJ","2023-05-30T08:17:21.868+00:00",[],[494],{"id":495,"createTime":28,"updateTime":28,"relativeEntities":496,"slug":28,"properties":497,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":507,"parentIds":508,"statistic":28},"6413896b-eca9-442b-a73f-182a58a0ce40",[],{"title":498,"address":501,"country":504,"abbreviation":505},{"EN":499,"VI":500},"Can Tho University of Medicine and Pharmacy","Trường Đại học Y Dược Cần Thơ",{"EN":502,"VI":503},"No 179, Nguyen Van Cu street, An Khanh ward, Ninh Kieu district, Can Tho city, Vietnam","Số 179, đường Nguyễn Văn Cừ, phường An Khánh, quận Ninh Kiều, thành phố Cần Thơ, Việt Nam",{"VOID":15},{"VOID":506},"ctump","http:\u002F\u002Fwww.ctump.edu.vn\u002F",[],[],"https:\u002F\u002Ftapchi.ctump.edu.vn\u002Findex.php\u002Fctump",{"impactFactor":32,"impactFactorByYear":512,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":514,"totalPublicationByYear":515,"totalCitation":520,"totalCitationByYear":521,"totalCitationPerPublication":108,"totalCitationPerPublicationByYear":523,"hindexLast5Year":45,"hindex":45},{"2022":513,"2023":111,"2024":106},0.01,1556,{"2020":47,"2021":516,"2022":517,"2023":518,"2024":519,"2025":122},57,306,801,358,161,{"2021":146,"2022":280,"2023":522},99,{"2021":524,"2022":318,"2023":104},0.23,{"impactFactor":28,"impactFactorByYear":28,"i10Index":123,"i10IndexLast5Year":123,"totalPublication":526,"totalPublicationByYear":527,"totalCitation":526,"totalCitationByYear":528,"totalCitationPerPublication":40,"totalCitationPerPublicationByYear":531,"hindexLast5Year":49,"hindex":49},476,{"0":205,"2019":123,"2021":139,"2022":459,"2023":451,"2024":357,"2025":49,"2026":48},{"2021":42,"2022":123,"2023":161,"2024":529,"2025":360,"2026":530},136,83,{"2021":105,"2022":513,"2023":532,"2024":127,"2025":533,"2026":534},0.62,25.43,13.83,{"id":536,"createTime":537,"updateTime":382,"relativeEntities":538,"slug":539,"properties":540,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":552,"translateLanguages":28,"viewCount":133,"subjectFields":553,"manageAffiliations":554,"indexDatabases":555,"url":556,"thumbnailPath":557,"statistic":558,"gsStatistic":594,"type":55,"analyzePriority":28},"6984a56a-db70-403b-9cc4-4013e1ceaffa","2023-05-09T06:47:40.346+00:00",[],"T%E1%BA%A1p%20ch%C3%AD%20Nghi%C3%AAn%20c%E1%BB%A9u%20n%C6%B0%E1%BB%9Bc%20ngo%C3%A0i",{"country":541,"issn":542,"title":544,"introduce":547,"gsId":550},{"VOID":15},{"VOID":543},"25252445",{"EN":545,"VI":546},"VNU Journal of Foreign Studies","Tạp chí Nghiên cứu nước ngoài",{"EN":548,"VI":549},"{\"ops\":[{\"insert\":\"\\n\\nThe \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science\"},{\"insert\":\"\\n was established in 1985 for the publication of national and international research papers in all fields of natural sciences and technology, social sciences and humanities. Since then, the journal has grown in quality, size and scope and now comprises a dozen of serials spanning academic research. In 2002, with the rapid expansion of the field of Foreign Languages and International Studies, the \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science\"},{\"insert\":\"\\n was delighted to announce the launch of the \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science: Foreign Studies\"},{\"insert\":\"\\n.\\n\\n\\nSince 2017, as a natural development from its predecessor \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science: Foreign Studies\"},{\"insert\":\"\\n, the\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\" \"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\"VNU Journal of Foreign Studies \"},{\"insert\":\"\\ncontinues to be an official, independent publication of the University of Languages and International Studies (ULIS) under Vietnam National University (VNU).\\nThe\\n\"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\" VNU Journal of Foreign Studies\"},{\"attributes\":{\"italic\":true},\"insert\":\" \"},{\"insert\":\"\\npublishes \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"blind\"},{\"insert\":\"\\n \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"peer-reviewed\"},{\"insert\":\"\\n research papers, discussions and reviews concerning:\\nLinguisticsForeign language educationInternational studiesRelated social sciences and humanities\\nBimonthly in 4 English editions and 2 Vietnamese editions in the current year in both print and electronic forms, the journal provides maximum exposure for published articles, making research available to all to read and share.\\n\\n\\n\"}]}","{\"ops\":[{\"attributes\":{\"italic\":true},\"insert\":\"Tạp chí Khoa học, Đại học Quốc gia Hà Nội\"},{\"insert\":\"\\n được thành lập năm 1985 với mục đích xuất bản các bài báo nghiên cứu trong nước và quốc tế về tất cả các lĩnh vực khoa học tự nhiên và công nghệ, khoa học xã hội và nhân văn. Kể từ đó, tạp chí đã phát triển về chất lượng, quy mô và phạm vi với hàng chục số báo liên quan đến nghiên cứu học thuật. Năm 2002, với sự phát triển nhanh chóng của lĩnh vực Ngoại ngữ và Quốc tế học, \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"Tạp chí Khoa học Đại học Quốc gia Hà Nội\"},{\"insert\":\"\\n đã vui mừng thông báo ra mắt Chuyên san \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"Nghiên cứu Nước ngoài.\"},{\"insert\":\"\\n\\n\\nKể từ năm 2017, như một sự kế thừa và phát triển từ tiền thân Chuyên san \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"Nghiên cứu Nước ngoài\"},{\"insert\":\"\\n của Tạp chí Khoa học, Đại học Quốc gia Hà Nội, \\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Tạp chí\"},{\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\" \"},{\"insert\":\"\\n\"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\"Nghiên cứu nước ngoài \"},{\"insert\":\"\\ntiếp tục là ấn phẩm khoa học chính thức và độc lập của Trường Đại học Ngoại ngữ, Đại học Quốc gia Hà Nội.\\nTạp chí \\n\"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\"Nghiên cứu nước ngoài\"},{\"insert\":\"\\n xuất bản các bài báo nghiên cứu, trao đổi và đánh giá đã được phản biện kín về:\\nNgôn ngữ họcGiảng dạy ngoại ngữ\u002Fngôn ngữQuốc tế họcCác ngành khoa học xã hội và nhân văn có liên quan\\nTạp chí xuất bản định kì 06 số\u002Fnăm (gồm 04 số tiếng Anh\u002Fnăm và 2 số tiếng Việt\u002Fnăm) dưới dạng bản in và bản điện tử. Tạp chí cung cấp khả năng tiếp cận tối đa tới các bài báo đã xuất bản nhằm giúp độc giả dễ dàng đọc và chia sẻ.\\n\"}]}",{"VOID":551},"jyihv3YAAAAJ",[30,31],[],[],[],"https:\u002F\u002Fjfs.ulis.vnu.edu.vn\u002Findex.php\u002Ffs","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F6984a56a-db70-403b-9cc4-4013e1ceaffa\u002F92693604f5caf63c64520c5c2cd756b5.jpg",{"impactFactor":32,"impactFactorByYear":559,"i10Index":560,"i10IndexLast5Year":205,"totalPublication":561,"totalPublicationByYear":562,"totalCitation":568,"totalCitationByYear":569,"totalCitationPerPublication":579,"totalCitationPerPublicationByYear":580,"hindexLast5Year":140,"hindex":140},{"2007":317,"2010":112,"2011":109,"2012":421,"2013":165,"2014":421,"2015":421,"2016":111,"2017":116,"2018":104,"2019":109,"2020":320,"2021":284,"2022":168,"2023":116,"2024":108},67,1200,{"2002":51,"2003":51,"2004":47,"2005":352,"2006":142,"2007":131,"2008":147,"2009":139,"2010":278,"2011":138,"2012":69,"2013":206,"2014":137,"2015":69,"2016":196,"2017":563,"2018":209,"2019":564,"2020":565,"2021":566,"2022":530,"2023":567,"2024":428,"2025":281},130,78,90,80,61,3204,{"2002":42,"2003":123,"2004":123,"2005":570,"2006":47,"2007":127,"2008":571,"2009":572,"2010":196,"2011":573,"2012":130,"2013":560,"2014":574,"2015":149,"2016":325,"2017":575,"2018":576,"2019":577,"2020":578,"2021":453,"2022":206,"2023":205,"2025":51},189,223,765,246,98,171,377,355,199,2.67,{"2002":194,"2003":116,"2004":365,"2005":581,"2006":582,"2007":226,"2008":583,"2009":584,"2010":585,"2011":586,"2012":228,"2013":585,"2014":587,"2015":588,"2016":589,"2017":232,"2018":590,"2019":591,"2020":592,"2021":593,"2022":347,"2023":318,"2025":316},5.73,0.31,7.19,20.68,1.24,7.03,2.58,1.59,1.33,4.05,4.55,2.21,2.95,{"impactFactor":28,"impactFactorByYear":28,"i10Index":595,"i10IndexLast5Year":596,"totalPublication":597,"totalPublicationByYear":598,"totalCitation":609,"totalCitationByYear":610,"totalCitationPerPublication":625,"totalCitationPerPublicationByYear":626,"hindexLast5Year":142,"hindex":152},379,311,2120,{"0":361,"1960":40,"1971":40,"1975":40,"1987":40,"1988":40,"1989":40,"1990":45,"1992":40,"1993":40,"1994":46,"1995":46,"1996":45,"1997":42,"1998":49,"1999":42,"2000":123,"2001":42,"2002":48,"2003":46,"2004":145,"2005":131,"2006":51,"2007":131,"2008":135,"2009":146,"2010":127,"2011":122,"2012":148,"2013":352,"2014":201,"2015":149,"2016":599,"2017":600,"2018":601,"2019":209,"2020":602,"2021":603,"2022":604,"2023":605,"2024":606,"2025":607,"2026":608},77,75,97,143,167,156,182,231,230,128,13225,{"2003":149,"2004":150,"2005":201,"2006":196,"2007":157,"2008":436,"2009":328,"2010":611,"2011":612,"2012":333,"2013":522,"2014":613,"2015":520,"2016":614,"2017":615,"2018":616,"2019":617,"2020":618,"2021":619,"2022":620,"2023":621,"2024":622,"2025":623,"2026":624},74,88,146,228,310,347,413,636,944,1261,1400,1846,2511,1882,6.24,{"2003":627,"2004":628,"2005":629,"2006":630,"2007":186,"2008":631,"2009":45,"2010":632,"2011":633,"2012":634,"2013":42,"2014":635,"2015":636,"2016":192,"2017":637,"2018":638,"2019":628,"2020":639,"2021":640,"2022":641,"2023":642,"2024":643,"2025":644,"2026":645},9.2,4.44,1.64,2.8,2.43,4.35,3.83,3.03,3.56,3.5,4.13,3.58,4.45,5.65,8.08,7.69,7.99,10.92,14.7,{"id":647,"createTime":648,"updateTime":382,"relativeEntities":649,"slug":650,"properties":651,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":664,"languages":665,"translateLanguages":28,"viewCount":142,"subjectFields":666,"manageAffiliations":667,"indexDatabases":668,"url":677,"thumbnailPath":678,"statistic":679,"gsStatistic":699,"type":55,"analyzePriority":28},"21d239d8-ac9d-48c7-a176-9d8aadc5eba5","2023-08-21T02:43:48.721+00:00",[],"Khoa-h%E1%BB%8Dc-%C4%90HQGHN-Khoa-h%E1%BB%8Dc-T%E1%BB%B1-nhi%C3%AAn-v%C3%A0-C%C3%B4ng-ngh%E1%BB%87",{"country":652,"eissn":653,"issn":655,"title":657,"introduce":660,"gsId":662},{"VOID":15},{"VOID":654},"25881140",{"VOID":656},"26159317",{"EN":658,"VI":659},"VNU Journal of Science: Natural Science and Technology","Khoa học ĐHQGHN: Khoa học Tự nhiên và Công nghệ",{"EN":661},"{\"ops\":[{\"insert\":\"The \"},{\"attributes\":{\"italic\":true},\"insert\":\"Journal\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"of\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"Science\"},{\"insert\":\" was established in 1985 for the publication of national and international research papers in all fields of natural sciences and technology, social sciences and humanities. Since then, the journal has grown in quality, size and scope and now comprises a dozen of serials spanning academic research.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"With the rapid expansion of the field of Economics, the VNU \"},{\"attributes\":{\"italic\":true},\"insert\":\"Journal\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"of\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"Science\"},{\"insert\":\" is delighted to announce the launch of the \"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science: Natural Sciences and Technology (JS: NST) \"},{\"insert\":\"since 1985. This serial publication provides researchers with the opportunity to publish research covering aspects in these areas in the popular \"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science\"},{\"insert\":\" series.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"As a fully open access publication, the journal will provide maximum exposure for published articles, making the research available to all to read and share. The journal will be published quarterly in March, June, September and December.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Scope\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"JS: NST is an open access journal publishing double-blinded peer-reviewed research papers, communications and reviews dealing with Biology, Bio-technology, Chemistry, Chemical engineering, Energy, Environmental technology and Materials engineering.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Publication Ethics\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"VNUJS is committed to maintaining the highest standards of publication ethics and takes all possible measures against any publication malpractices. The journal follows the guidelines and recommendations of the Committee on Publication Ethics (C.O.P.E) to ensure ethical publishing practices.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Plagiarism is strictly prohibited and will not be tolerated. Any form of plagiarism, including but not limited to copying, paraphrasing, or reusing previously published work without proper attribution, will result in rejection of the manuscript and potential sanctions against the author. VNUJS utilizes DoIt as plagiarism detection software to verify the originality of submitted manuscripts.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"The publication ethics statement with full detail of the responsibilities of authors, reviewers and editors can be found \"},{\"attributes\":{\"bold\":true,\"color\":\"#464d50\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fjs.vnu.edu.vn\u002FNST\u002Fethics\"},\"insert\":\"here\"},{\"attributes\":{\"bold\":true},\"insert\":\".\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Peer Review Process\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Any manuscript followed the journal’s scope and author guideline will be assigned to the managing editors. All manuscripts have undergone editorial screening and anonymous double-blind peer-review by the at least one independent expert in the field. The managing editor makes an editorial decision, which is subject to endorsement by the Editor – in - Chief.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"The journal publishing process can be found in detail \"},{\"attributes\":{\"bold\":true,\"color\":\"#464d50\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fdrive.google.com\u002Ffile\u002Fd\u002F136BOGahfq9_5BB3TzSBsLBkQKfCUe5yN\u002Fview?usp=share_link\"},\"insert\":\"here\"},{\"insert\":\".\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}",{"VOID":663},"ZfBridMAAAAJ","Admin update database",[30,31],[],[],[669],{"id":670,"indexDatabase":671,"url":676,"indexYears":28,"academicFieldIds":28,"indexDatabaseRanking":28},"6684da33-2cb9-49f9-8332-28f0bcd72e39",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":672,"label":673,"description":674,"key":94,"publicationTags":675,"standard":28},[],{"EN":91,"VI":91},{"EN":93,"VI":93},[96],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=11968","https:\u002F\u002Fjs.vnu.edu.vn\u002FNST","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F21d239d8-ac9d-48c7-a176-9d8aadc5eba5\u002Fb081d4211e382646c2cdc054ead551b3.jpg",{"impactFactor":32,"impactFactorByYear":680,"i10Index":130,"i10IndexLast5Year":40,"totalPublication":682,"totalPublicationByYear":683,"totalCitation":685,"totalCitationByYear":686,"totalCitationPerPublication":691,"totalCitationPerPublicationByYear":692,"hindexLast5Year":47,"hindex":47},{"2000":317,"2005":513,"2007":107,"2010":513,"2011":317,"2012":106,"2013":107,"2014":317,"2015":107,"2016":107,"2017":421,"2018":317,"2019":421,"2020":113,"2021":582,"2022":681,"2023":194,"2024":104},0.19,1700,{"1985":131,"1986":353,"1987":130,"1988":69,"1989":69,"1990":200,"1991":196,"1992":146,"1993":279,"1994":148,"1995":200,"1996":201,"1999":278,"2000":140,"2001":128,"2002":202,"2003":353,"2004":138,"2005":202,"2006":136,"2007":278,"2008":139,"2009":137,"2010":141,"2011":278,"2012":132,"2013":202,"2014":202,"2015":278,"2016":684,"2017":359,"2018":160,"2019":162,"2020":281,"2021":157,"2022":436,"2023":358,"2024":136,"2025":135},165,870,{"1995":123,"1999":123,"2001":45,"2002":130,"2003":40,"2004":123,"2005":42,"2007":69,"2008":687,"2009":352,"2010":688,"2011":137,"2012":127,"2013":47,"2014":46,"2015":146,"2016":331,"2017":689,"2018":331,"2019":690,"2020":353,"2021":567,"2022":130,"2023":357},82,60,55,102,0.51,{"1995":421,"1999":165,"2001":167,"2002":532,"2003":107,"2004":165,"2005":111,"2007":693,"2008":694,"2009":287,"2010":445,"2011":695,"2012":119,"2013":319,"2014":318,"2015":696,"2016":338,"2017":118,"2018":697,"2019":219,"2020":698,"2021":341,"2022":423,"2023":111},0.85,2.22,1.12,0.38,2.19,0.88,{"impactFactor":28,"impactFactorByYear":28,"i10Index":126,"i10IndexLast5Year":123,"totalPublication":570,"totalPublicationByYear":700,"totalCitation":701,"totalCitationByYear":702,"totalCitationPerPublication":703,"totalCitationPerPublicationByYear":704,"hindexLast5Year":46,"hindex":205},{"0":48,"1999":146,"2000":47,"2001":45,"2002":40,"2003":199,"2004":123,"2005":42,"2006":123,"2007":145,"2008":145,"2009":46,"2010":49,"2011":47,"2012":47,"2013":49,"2014":45,"2015":45,"2016":157,"2017":40},425,{"2008":42,"2009":357,"2010":47,"2011":51,"2012":199,"2013":135,"2014":323,"2015":51,"2016":278,"2017":69,"2018":69,"2019":137,"2020":142,"2021":140,"2022":148,"2023":122,"2024":202,"2025":135,"2026":126},2.25,{"2008":169,"2009":705,"2010":706,"2011":707,"2012":342,"2013":42,"2014":636,"2015":708,"2016":709,"2017":69},1.6,1.57,1.36,3.75,0.54,{"id":711,"createTime":712,"updateTime":382,"relativeEntities":713,"slug":714,"properties":715,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":664,"languages":28,"translateLanguages":28,"viewCount":150,"subjectFields":727,"manageAffiliations":728,"indexDatabases":729,"url":730,"thumbnailPath":731,"statistic":732,"gsStatistic":738,"type":55,"analyzePriority":28},"954132b5-ca74-461c-b819-45ad6e49a404","2023-08-17T03:30:52.301+00:00",[],"HPU2-Journal-of-Science-Natural-Sciences-and-Technology",{"country":716,"issn":717,"title":719,"introduce":722,"gsId":725},{"VOID":15},{"VOID":718},"28155637",{"EN":720,"VI":721},"HPU2 Journal of Science: Natural Sciences and Technology","TẠP CHÍ KHOA HỌC TRƯỜNG ĐHSP HÀ NỘI 2: CHUYÊN SAN KHOA HỌC TỰ NHIÊN VÀ CÔNG NGHỆ",{"EN":723,"VI":724},"{\"ops\":[{\"insert\":\"HPU2 journal of Science aims to provide an interdisciplinary platform for the dissemination of advances in sciences and technology. The journal publishes original papers of scientific or technological value in all areas of natural, social or educational sciences.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"The main interest of HPU2 Journal of Science: Natural sciences and technology is in papers that describe valuable findings in physics, mathematics, chemistry, biology; solving engineering or technological problems.\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"The main interest of HPU2 Journal of Science: Social Sciences and Humanity is to facilitate the publication of high-quality papers in various areas of social sciences and studies for human development.\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"The main interest of HPU2 Journal of Science: Educational Sciences is to publish papers in the field of educational sciences and applications of advances to education for improving and enhancing science education at all levels.\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"Papers that are published by HPU2 Journal of Science are doubled-blind, peer-reviewed by at least two experts, are evaluated by the section editor and editor in chief.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Types of Articles\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Research articles\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"Academic reports of original research that have never been published elsewhere in any languages. Manuscripts, where appropriate, should contain the following sections in the order: Title, Authors, Author affiliations, Email address of corresponding authors, Abstract, Keywords, Nomenclature (if any), Introduction, Experiment, Theory, Results and Discussion, Conclusions, Conflict of Interest, Acknowledgments (if any), References, Appendix (if any). Pre-published are to be formatted according to Templates (MS-Word version). \"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Review articles\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"In addition to invited reviews, literature reviews, systematic reviews, and critical reviews will be accepted for consideration. The manuscript should be composed and organized according to the required sequence: Titles, Author names, Affiliations, Email addresses, Abstract, Keywords, Main text, Conclusion, Conflict of Interest, Acknowledgments (if any), References. Although, the main text structure may vary based on the review subtopics, the articles should be formatted according to suitable Templates as research articles.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}","{\"ops\":[{\"insert\":\"Tạp chí Khoa học Trường ĐHSP Hà Nội 2 nhằm mục đích cung cấp một nền tảng liên ngành của sự phổ biến những tiến bộ của khoa học và công nghệ. Tạp chí xuất bản các bài báo gốc có giá trị khoa học hoặc công nghệ trong tất cả các lĩnh vực khoa học tự nhiên, xã hội hoặc giáo dục.\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Chuyên san Khoa học tự nhiên và công nghệ:\"},{\"insert\":\" Là các bài báo mô tả những phát hiện có giá trị trong vật lý, toán học, hóa học, sinh học; giải quyết các vấn đề kỹ thuật hoặc công nghệ.\"},{\"attributes\":{\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Chuyên san Khoa học Xã hội và Nhân văn:\"},{\"insert\":\" là các bài báo xuất bản chất lượng cao trong các lĩnh vực khác nhau của khoa học xã hội và nghiên cứu phát triển con người.\"},{\"attributes\":{\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Chuyên san Khoa học giáo dục:\"},{\"insert\":\" là các bài báo xuất bản trong lĩnh vực khoa học giáo dục và các ứng dụng của tiến bộ vào giáo dục để cải thiện và nâng cao giáo dục khoa học ở tất cả các cấp.\"},{\"attributes\":{\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"Tạp chí trường ĐHSP Hà Nội 2 xuất bản được phản biện kín, xét duyệt bởi ít nhất 02 chuyên gia, và được đánh giá, chọn lựa từ ban biên tập và Tổng biên tập.\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Các loại bài báo\"},{\"insert\":\":\\nBài báo nghiên cứu:\"},{\"attributes\":{\"list\":\"ordered\"},\"insert\":\"\\n\"},{\"insert\":\"Báo cáo học thuật về nghiên cứu ban đầu chưa từng được xuất bản ở bất kỳ nơi nào, hay bằng bất kỳ ngôn ngữ nào khác. Bản thảo thích hợp, nên chứa các phần sau theo thứ tự: Tiêu đề, Tác giả, Liên kết tác giả, Địa chỉ email của tác giả tương ứng, Tóm tắt, Từ khóa, Danh pháp (nếu có), Giới thiệu, Thử nghiệm, Lý thuyết, Kết quả và thảo luận, Kết luận, Xung đột quan tâm, Lời cảm ơn (nếu có), Tài liệu tham khảo, Phụ lục (nếu có). Bản xuất bản trước phải được định dạng theo Mẫu (phiên bản MS-Word).\\n2. Bài báo tổng quan:\\nNgoài các bài phê bình được mời, các bài phê bình tài liệu, bài phê bình có hệ thống và bài phê bình sẽ được chấp nhận để xem xét. Bản thảo cần được soạn thảo và sắp xếp theo trình tự yêu cầu: Tên sách, Tên tác giả, Liên kết, Địa chỉ email, Tóm tắt, Từ khóa, Nội dung chính, Kết luận, Xung đột lợi ích, Lời cảm ơn (nếu có), Tài liệu tham khảo. Mặc dù, cấu trúc văn bản chính có thể thay đổi dựa trên các chủ đề phụ của bài đánh giá, các bài báo nên được định dạng theo các Mẫu phù hợp như các bài báo nghiên cứu.\\n\"}]}",{"VOID":726},"YPoBvsIAAAAJ",[],[],[],"https:\u002F\u002Fsj.hpu2.edu.vn\u002Findex.php\u002Fjournal","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F954132b5-ca74-461c-b819-45ad6e49a404\u002F2790ef1d0a7d7a40a504c2fc1647f670.jpg",{"impactFactor":32,"impactFactorByYear":733,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":329,"totalPublicationByYear":735,"totalCitation":134,"totalCitationByYear":736,"totalCitationPerPublication":524,"totalCitationPerPublicationByYear":737,"hindexLast5Year":123,"hindex":123},{"2024":734},0.17,{"2022":136,"2023":278,"2024":142},{"2022":357,"2023":126,"2024":123},{"2022":169,"2023":224,"2024":165},{"impactFactor":28,"impactFactorByYear":28,"i10Index":45,"i10IndexLast5Year":45,"totalPublication":330,"totalPublicationByYear":739,"totalCitation":154,"totalCitationByYear":740,"totalCitationPerPublication":741,"totalCitationPerPublicationByYear":742,"hindexLast5Year":46,"hindex":46},{"0":123,"2022":134,"2023":136,"2024":69,"2025":145},{"2023":46,"2024":136,"2025":201,"2026":278},1.22,{"2023":113,"2024":340,"2025":743},4.56,{"id":745,"createTime":746,"updateTime":747,"relativeEntities":748,"slug":749,"properties":750,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":69,"subjectFields":762,"manageAffiliations":763,"indexDatabases":771,"url":817,"thumbnailPath":28,"statistic":818,"gsStatistic":850,"type":55,"analyzePriority":28},"21ccdb34-414d-420f-8a60-a592a2fa848e","2023-05-29T10:42:53.358+00:00","2026-08-27T01:57:29.560+00:00",[],"Vietnam-Journal-of-Earth-Sciences",{"country":751,"eissn":752,"issn":754,"title":756,"introduce":758,"gsId":760},{"VOID":15},{"VOID":753},"26159783",{"VOID":755},"08667187",{"EN":757},"Vietnam Journal of Earth Sciences",{"EN":759},"Science of the Earth, formerly Vietnam Journal of Earth Sciences, is a peer-reviewed journal to publish high-quality articles on the entire range of earth sciences and the environment, focused on the Asia Pacific region and their correlations and connections to the globe. The journal publishes fundamental and applied research in earth sciences and the environment, including geology, geophysics, geography, soil science, hydrology, meteorology, oceanography, petroleum, geohazards, environmental sciences, environmental engineering, sustainable development, geoinformatics, geodesy, GIS, and remote sensing.",{"VOID":761},"5htfr3YAAAAJ",[],[764],{"id":73,"createTime":28,"updateTime":28,"relativeEntities":765,"slug":28,"properties":766,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":82,"parentIds":770,"statistic":28},[],{"title":767,"country":768,"abbreviation":769},{"EN":77,"VI":78},{"VOID":15},{"VOID":81},[],[772,789,806],{"id":773,"indexDatabase":774,"url":786,"indexYears":28,"academicFieldIds":787,"indexDatabaseRanking":28},"06f278ee-37b9-41eb-a9b0-3d2d77fa502b",{"id":775,"createTime":28,"updateTime":28,"relativeEntities":776,"label":777,"description":779,"key":782,"publicationTags":783,"standard":28},"88bab0f7-443b-476c-a72a-7fa5222da393",[],{"EN":778,"VI":778},"ISI\u002FESCI  - Emerging Sources Citation Index",{"EN":780,"VI":781},"ESCI database","Cơ sở dữ liệu ESCI","esci",[784,785],"ESCI","ISI","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=0866-7187",[788],"0db73426-2364-455f-81a4-efe0f91d712e",{"id":790,"indexDatabase":791,"url":801,"indexYears":802,"academicFieldIds":803,"indexDatabaseRanking":805},"6ace2085-a177-4a27-b309-8813b832111e",{"id":792,"createTime":28,"updateTime":28,"relativeEntities":793,"label":794,"description":796,"key":798,"publicationTags":799,"standard":28},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9",[],{"EN":795,"VI":795},"Scopus - Elsevier",{"EN":795,"VI":797},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[800],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F21101039869","2018-2024",[804],"1689391c-5702-4349-aaa7-d720ee4321fc","NONE",{"id":807,"indexDatabase":808,"url":813,"indexYears":814,"academicFieldIds":815,"indexDatabaseRanking":28},"dadb15a8-ee22-41c2-a287-49e969d9a998",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":809,"label":810,"description":811,"key":94,"publicationTags":812,"standard":28},[],{"EN":91,"VI":91},{"EN":93,"VI":93},[96],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=10629","2016-2022",[816],"e04f14cf-280b-4aa8-b711-b77ddd79cbaf","https:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fjse\u002F",{"impactFactor":32,"impactFactorByYear":819,"i10Index":151,"i10IndexLast5Year":132,"totalPublication":824,"totalPublicationByYear":825,"totalCitation":827,"totalCitationByYear":828,"totalCitationPerPublication":838,"totalCitationPerPublicationByYear":839,"hindexLast5Year":129,"hindex":129},{"2007":513,"2008":513,"2010":513,"2011":107,"2012":513,"2013":513,"2014":317,"2015":107,"2016":54,"2017":168,"2018":222,"2019":820,"2020":821,"2021":371,"2022":445,"2023":822,"2024":823},1.03,1.08,1.49,1.43,1180,{"2000":689,"2001":688,"2002":281,"2003":160,"2004":279,"2005":325,"2006":516,"2007":137,"2008":200,"2009":162,"2010":436,"2011":826,"2012":434,"2013":689,"2014":280,"2015":152,"2016":150,"2017":148,"2018":352,"2019":147,"2020":152,"2021":69,"2022":148,"2023":280,"2024":139,"2025":45},79,2421,{"2000":205,"2001":51,"2002":145,"2003":146,"2004":126,"2005":51,"2006":130,"2007":128,"2008":127,"2009":152,"2010":122,"2011":137,"2012":567,"2013":200,"2014":829,"2015":687,"2016":830,"2017":831,"2018":832,"2019":833,"2020":834,"2021":835,"2022":836,"2023":837,"2024":145,"2025":40},73,197,219,380,281,328,148,183,160,2.05,{"2000":365,"2001":168,"2002":365,"2003":167,"2004":168,"2005":121,"2006":224,"2007":840,"2008":118,"2009":367,"2010":284,"2011":170,"2012":707,"2013":693,"2014":822,"2015":841,"2016":842,"2017":843,"2018":844,"2019":845,"2020":846,"2021":847,"2022":848,"2023":849,"2024":52,"2025":168},0.47,1.91,4.93,7.3,11.52,9.06,7.63,5.1,6.1,3.27,{"impactFactor":28,"impactFactorByYear":28,"i10Index":435,"i10IndexLast5Year":155,"totalPublication":130,"totalPublicationByYear":851,"totalCitation":852,"totalCitationByYear":853,"totalCitationPerPublication":860,"totalCitationPerPublicationByYear":861,"hindexLast5Year":136,"hindex":133},{"1017":40,"2015":40,"2016":123,"2017":42,"2018":42,"2019":40,"2020":45,"2022":123,"2023":123,"2024":40},3528,{"2014":323,"2015":140,"2016":201,"2017":158,"2018":522,"2019":613,"2020":854,"2021":855,"2022":701,"2023":856,"2024":857,"2025":858,"2026":859},280,403,436,525,589,366,176.4,{"2015":140,"2016":862,"2017":134,"2018":352,"2019":613,"2020":159,"2022":863,"2023":864,"2024":857},20.5,212.5,218,{"code":866,"data":867,"meta":28},"SUCCESS",{"id":868,"createTime":869,"updateTime":870,"relativeEntities":871,"slug":872,"properties":873,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":42,"subjectFields":879,"manageAffiliations":880,"indexDatabases":881,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},"9a26e89a-7255-4678-9e57-85c3994b6830","2023-11-25T13:42:16.116+00:00","2025-11-21T09:55:37.382+00:00",[],"Journal-of-Discrete-Algorithms",{"issn":874,"title":876},{"VOID":875},"15708667",{"EN":877},"Journal of Discrete Algorithms","PENDING",[],[],[882],{"id":883,"indexDatabase":884,"url":889,"indexYears":890,"academicFieldIds":28,"indexDatabaseRanking":891},"b20e9198-952f-4aca-a0a7-242f1093f61f",{"id":792,"createTime":28,"updateTime":28,"relativeEntities":885,"label":886,"description":887,"key":798,"publicationTags":888,"standard":28},[],{"EN":795,"VI":795},{"EN":795,"VI":797},[800],"https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F25607","2003-2018","SCOPUS__Q2",{"meta":893,"data":895},{"total":894},"323",[896,954,1035,1119,1183,1298,1366,1435,1488,1582],{"id":897,"createTime":898,"updateTime":899,"relativeEntities":900,"slug":901,"properties":902,"entityType":909,"verifyStatus":26,"verifyTime":899,"verifyNote":910,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":911,"fullTextUrl":28,"authors":912,"publicationType":929,"publisherRelationship":930,"citationCount":28,"citationInfo":28,"publishDate":950,"publishYear":951,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":952,"openAccess":28,"references":28,"isForceReanalyzing":953},"0181d0ce-6eee-4a6a-9ae9-5f8b49a23924","2024-01-29T04:03:39.172+00:00","2025-01-13T21:54:45.572+00:00",[],"Fast-searching-in-packed-strings",{"title":903,"references":905,"doi":907},{"EN":904},"Fast searching in packed strings",{"VOID":906},"Aho, 1975, Efficient string matching: an aid to bibliographic search, Commun. ACM, 18, 333, 10.1145\u002F360825.360855\nA. Amir, G. Benson, Efficient two-dimensional compressed matching, in: Proceedings of the 2nd Data Compression Conference, 1992, pp. 279–288.\nA. Amir, G. Benson, Two-dimensional periodicity and its applications, in: Proceedings of the 3rd Annual ACM–SIAM Symposium on Discrete Algorithms, 1992, pp. 440–452.\nAmir, 1996, Let sleeping files lie: pattern matching in Z-compressed files, J. Comput. System Sci., 52, 299, 10.1006\u002Fjcss.1996.0023\nArlazarov, 1970, On economic construction of the transitive closure of a directed graph, Dokl. Acad. Nauk, 194, 487\nR.A. Baeza-Yates, Efficient text searching, PhD thesis, Dept. of Computer Science, University of Waterloo, 1989.\nBaeza-Yates, 1989, Improved string searching, Softw. Pract. Exp., 19, 257, 10.1002\u002Fspe.4380190305\nBaeza-Yates, 1992, A new approach to text searching, Commun. ACM, 35, 74, 10.1145\u002F135239.135243\nBille, 2009, Faster regular expression matching, vol. 5555, 171\nBoyer, 1977, A fast string searching algorithm, Commun. ACM, 20, 762, 10.1145\u002F359842.359859\nFaro, 2009, An efficient matching algorithm for encoded DNA sequences and binary strings, vol. 5577, 106\nS. Faro, T. Lecroq, Efficient pattern matching on binary strings, in: Proceedings of the 35th International Conference on Current Trends in Theory and Practice of Computer Science, 2009.\nFredriksson, 2002, Faster string matching with super-alphabets, vol. 2476, 44\nFredriksson, 2003, Shift-or string matching with super-alphabets, Inf. Process. Lett., 87, 201, 10.1016\u002FS0020-0190(03)00296-5\nGusfield, 1997\nKarp, 1987, Efficient randomized pattern-matching algorithms, IBM J. Res. Dev., 31, 249, 10.1147\u002Frd.312.0249\nKlein, 2007, Accelerating Boyer Moore searches on binary texts, vol. 4783, 130\nKnuth, 1977, Fast pattern matching in strings, SIAM J. Comput., 6, 323, 10.1137\u002F0206024\nMasek, 1980, A faster algorithm for computing string edit distances, J. Comput. System Sci., 20, 18, 10.1016\u002F0022-0000(80)90002-1\nJ. Morris, R.V. Pratt, A linear pattern matching algorithm, Technical Report 40, Univ. of California, Berkeley, 1970.\nMyers, 1992, A four-Russians algorithm for regular expression pattern matching, J. ACM, 39, 430, 10.1145\u002F128749.128755\nNavarro, 2002\nRytter, 1999, Algorithms on compressed strings and arrays, vol. 1725, 48\nTarhio, 1997, String matching in the DNA alphabet, Softw. Pract. Exp., 27, 851, 10.1002\u002F(SICI)1097-024X(199707)27:7\u003C851::AID-SPE108>3.0.CO;2-D\nThompson, 1968, Regular expression search algorithm, Commun. ACM, 11, 419, 10.1145\u002F363347.363387\nWelch, 1984, A technique for high-performance data compression, IEEE Computer, 17, 8, 10.1109\u002FMC.1984.1659158\nWu, 1995, A subquadratic algorithm for approximate regular expression matching, J. Algorithms, 19, 346, 10.1006\u002Fjagm.1995.1041",{"VOID":908},"10.1016\u002Fj.jda.2010.09.003","PUBLICATION","Auto Verify","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1570866710000353",[913],{"id":914,"sortIndex":32,"researcher":28,"roles":915,"affiliations":917,"properties":926,"displayName":928,"givenName":28,"familyName":28},"99f9c218-9d73-49a5-b059-40c670b11245",[916],"AUTHOR",[918],{"id":919,"sortIndex":32,"affiliation":920,"properties":28},"2b2dfd2b-beb0-4fc2-ae67-200222a3965e",{"id":919,"createTime":28,"updateTime":28,"relativeEntities":921,"slug":28,"properties":922,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":925,"statistic":28},[],{"title":923},{"VI":924},"Technical University of Denmark, Kgs. Lyngby, Denmark",[],{"title":927},{"VI":928},"Philip Bille","ARTICLE",{"url":911,"publisher":931,"properties":945},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":932,"slug":872,"properties":933,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":42,"subjectFields":936,"manageAffiliations":937,"indexDatabases":938,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":934,"title":935},{"VOID":875},{"EN":877},[],[],[939],{"id":883,"indexDatabase":940,"url":889,"indexYears":890,"academicFieldIds":28,"indexDatabaseRanking":891},{"id":792,"createTime":28,"updateTime":28,"relativeEntities":941,"label":942,"description":943,"key":798,"publicationTags":944,"standard":28},[],{"EN":795,"VI":795},{"EN":795,"VI":797},[800],{"pages":946,"volume":948},{"VOID":947},"49-56",{"VOID":949},"9","2011-03-01",2011,[891],false,{"id":955,"createTime":956,"updateTime":956,"relativeEntities":957,"slug":28,"properties":958,"entityType":909,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":965,"fullTextUrl":28,"authors":966,"publicationType":929,"publisherRelationship":1012,"citationCount":28,"citationInfo":28,"publishDate":1032,"publishYear":1033,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1034,"openAccess":28,"references":28,"isForceReanalyzing":953},"01c83835-2f74-4084-bee4-7ee80440d04d","2024-01-26T14:23:48.997+00:00",[],{"title":959,"references":961,"doi":963},{"EN":960},"Excessive index for mesh derived networks",{"VOID":962},"Beineke, 1967, On the 1-factors of a nonseparable graph, J. Comb. Theory, 2, 285, 10.1016\u002FS0021-9800(67)80029-2\nBelcastro, 2011, 1-factor covers of regular graphs, Discrete Appl. Math., 159, 281, 10.1016\u002Fj.dam.2010.12.003\nBonisoli, 2007, Excessive factorizations of regular graphs, 73\nCariolaro, 2008, On minimum sets of 1-factors covering a complete multipartite graph, J. Graph Theory, 58, 239, 10.1002\u002Fjgt.20303\nCariolaro, 2009, Excessive near 1-factorizations, Discrete Math., 309, 4690, 10.1016\u002Fj.disc.2008.05.035\nCariolaro, 2009, The excessive 3-index of all graphs, Electron. J. Comb., 16\nChartrand, 2011\nCorrea, 2008, Some remarks about factors of graphs, J. Graph Theory, 57, 265, 10.1002\u002Fjgt.20284\nFouquet\nHolyer, 1981, The NP-completeness of edge colouring, SIAM J. Comput., 10, 718, 10.1137\u002F0210055\nJurczyk, 2008, Interconnection Networks for Parallel Computers\nManuel, 2013, Excessive index of certain chemical structures, Int. J. Pure Appl. Math., 83\nMazzuoccolo, 2011, Graphs of arbitrary excessive class, Discrete Math., 311, 32, 10.1016\u002Fj.disc.2010.09.016\nPetersen, 1891, Die Theorie der reguldren Graphen, Acta Math., 193, 10.1007\u002FBF02392606\nRajasingh, 2013, On excessive index of certain networks, Theor. Comput. Sci., 501, 34, 10.1016\u002Fj.tcs.2013.05.016\nStojmenovic, 1997, Honeycomb networks: topological properties and communication algorithms, IEEE Trans. Parallel Distrib. Syst., 8, 1036, 10.1109\u002F71.629486\nSumner, 1974, Graphs with 1-factors, Proc. Am. Math. Soc., 42, 8, 10.1090\u002FS0002-9939-1974-0323648-6\nTutte, 1947, The factorizations of linear graphs, J. Lond. Math. Soc., 22, 107, 10.1112\u002Fjlms\u002Fs1-22.2.107",{"VOID":964},"10.1016\u002Fj.jda.2014.07.001","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1570866714000446",[967,982,997],{"id":968,"sortIndex":32,"researcher":28,"roles":969,"affiliations":970,"properties":979,"displayName":981,"givenName":28,"familyName":28},"52073a29-a5cc-4434-b23a-da9f2514f050",[916],[971],{"id":972,"sortIndex":32,"affiliation":973,"properties":28},"17a274d8-26b5-4a3e-9c3c-e063c590fb4f",{"id":972,"createTime":28,"updateTime":28,"relativeEntities":974,"slug":28,"properties":975,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":978,"statistic":28},[],{"title":976},{"VI":977},"School of Advanced Sciences, VIT University, Chennai 600 127, India",[],{"title":980},{"VI":981},"Indra Rajasingh",{"id":983,"sortIndex":40,"researcher":28,"roles":984,"affiliations":985,"properties":994,"displayName":996,"givenName":28,"familyName":28},"7bd26585-e6de-416b-bee9-bc7801702606",[916],[986],{"id":987,"sortIndex":32,"affiliation":988,"properties":28},"a6103be1-a969-42a1-8921-89204bc1a4ca",{"id":987,"createTime":28,"updateTime":28,"relativeEntities":989,"slug":28,"properties":990,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":993,"statistic":28},[],{"title":991},{"VI":992},"Department of Mathematics, Stella Maris College, Chennai 600 086, India",[],{"title":995},{"VI":996},"A.S. Shanthi",{"id":998,"sortIndex":123,"researcher":28,"roles":999,"affiliations":1000,"properties":1009,"displayName":1011,"givenName":28,"familyName":28},"012356cd-4ef2-4a58-8911-9564fd85d62d",[916],[1001],{"id":1002,"sortIndex":32,"affiliation":1003,"properties":28},"ad2d7ddd-ca65-42ff-b405-72ca3ba5a7c4",{"id":1002,"createTime":28,"updateTime":28,"relativeEntities":1004,"slug":28,"properties":1005,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1008,"statistic":28},[],{"title":1006},{"VI":1007},"Department of Mathematics, Loyola College, Chennai 600 034, India",[],{"title":1010},{"VI":1011},"Albert Muthumalai",{"url":965,"publisher":1013,"properties":1027},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1014,"slug":872,"properties":1015,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":42,"subjectFields":1018,"manageAffiliations":1019,"indexDatabases":1020,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1016,"title":1017},{"VOID":875},{"EN":877},[],[],[1021],{"id":883,"indexDatabase":1022,"url":889,"indexYears":890,"academicFieldIds":28,"indexDatabaseRanking":891},{"id":792,"createTime":28,"updateTime":28,"relativeEntities":1023,"label":1024,"description":1025,"key":798,"publicationTags":1026,"standard":28},[],{"EN":795,"VI":795},{"EN":795,"VI":797},[800],{"pages":1028,"volume":1030},{"VOID":1029},"43-48",{"VOID":1031},"33","2015-07-01",2015,[891],{"id":1036,"createTime":1037,"updateTime":1038,"relativeEntities":1039,"slug":1040,"properties":1041,"entityType":909,"verifyStatus":26,"verifyTime":1048,"verifyNote":910,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1049,"fullTextUrl":28,"authors":1050,"publicationType":929,"publisherRelationship":1096,"citationCount":28,"citationInfo":28,"publishDate":1116,"publishYear":1117,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1118,"openAccess":28,"references":28,"isForceReanalyzing":953},"02250974-5aee-4ec8-b4a3-eaf8c42f883d","2024-02-07T06:00:21.132+00:00","2025-02-25T20:37:00.748+00:00",[],"CHECKCOL-Improved-local-search-for-graph-coloring",{"title":1042,"references":1044,"doi":1046},{"EN":1043},"CHECKCOL: Improved local search for graph coloring",{"VOID":1045},"Bianco, 1998, Solving a preemptive scheduling problem using coloring technique\nBlazewicz, 1996\nCangalovic, 1991, Exact coloring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths, EJOR, 51, 248, 10.1016\u002F0377-2217(91)90254-S\nCaramia, 1999, A fast and simple local search for graph coloring, vol. 1618, 319\nChams, 1987, Some experiments with simulated annealing for coloring graphs, EJOR, 32, 260, 10.1016\u002FS0377-2217(87)80148-0\nCoffman, 1983, An introduction to combinatorial models of dynamic storage allocation, SIAM Rev., 25, 311, 10.1137\u002F1025074\nDailey, 1980, Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete, Discrete Math., 30, 289, 10.1016\u002F0012-365X(80)90236-8\nDe Werra, 1985, An introduction to timetabling, European J. Oper. Res., 19, 151, 10.1016\u002F0377-2217(85)90167-5\nEiben, 1998, Graph coloring with adaptive evolutionary algorithms, J. Heuristics, 4, 25, 10.1023\u002FA:1009638304510\nFleurent, 1995, Genetic and hybrid algorithms for graph coloring, Ann. Oper. Res., 63, 437, 10.1007\u002FBF02125407\nGarey, 1976, Some simplified NP-complete graph problems, Theoret. Comput. Sci., 1, 237, 10.1016\u002F0304-3975(76)90059-1\nGlover, 1997\nHertz, 1987, Using tabu search techniques for graph coloring, Computing, 39, 345, 10.1007\u002FBF02239976\nJohnson, 1991, Optimization by simulated annealing: An experimental evaluation; Part II, Graph coloring and number partitioning, Oper. Res., 39, 378, 10.1287\u002Fopre.39.3.378\nKannan, 1998, Register allocation in structured programs, J. Algorithms, 29, 223, 10.1006\u002Fjagm.1998.0956\nKrawczyk, 1985, An approximation algorithm for diagnostic test scheduling in multicomputer systems, IEEE Trans. Comput., C-34, 869, 10.1109\u002FTC.1985.1676647\nLeighton, 1979, A graph coloring algorithm for large scheduling problems, J. Res. Nat. Bur. Standards, 84, 412, 10.6028\u002Fjres.084.024\nLewandowski, 1996, Experiments with parallel graph coloring heuristics, vol. 26\nLund, 1993, On the hardness of approximating minimization problems, 286\nMorgenstern, 1996, Distributed coloration neighborhood search, vol. 26, 335\nOsman, 1996\nSewell, 1996, An improved algorithm for exact graph coloring, vol. 26, 359\nSrivastava, 1994, ATOM: A system for building customized program analysis tools, 196",{"VOID":1047},"10.1016\u002Fj.jda.2005.03.006","2025-02-25T20:37:00.747+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1570866705000262",[1051,1066,1081],{"id":1052,"sortIndex":32,"researcher":28,"roles":1053,"affiliations":1054,"properties":1063,"displayName":1065,"givenName":28,"familyName":28},"51c83a5a-1033-4d64-b0d9-921234d322ee",[916],[1055],{"id":1056,"sortIndex":32,"affiliation":1057,"properties":28},"8fb1eb6e-e49d-4398-b5f4-fc666adfd328",{"id":1056,"createTime":28,"updateTime":28,"relativeEntities":1058,"slug":28,"properties":1059,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1062,"statistic":28},[],{"title":1060},{"VI":1061},"Istituto per le Applicazioni del Calcolo “M. Picone”, Viale del Policlinico 137, 00161 Roma, Italy",[],{"title":1064},{"VI":1065},"Massimiliano Caramia",{"id":1067,"sortIndex":40,"researcher":28,"roles":1068,"affiliations":1069,"properties":1078,"displayName":1080,"givenName":28,"familyName":28},"036f2c73-bdcb-4f7d-a673-5be5d19b8c94",[916],[1070],{"id":1071,"sortIndex":32,"affiliation":1072,"properties":28},"7b23899c-bc88-4b7a-a3c2-487520de6505",{"id":1071,"createTime":28,"updateTime":28,"relativeEntities":1073,"slug":28,"properties":1074,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1077,"statistic":28},[],{"title":1075},{"VI":1076},"Dipartimento di Statistica, Probabilità e Statistiche Applicate, Università di Roma “La Sapienza”, Piazzale Aldo Moro, 5, 00185 Roma, Italy",[],{"title":1079},{"VI":1080},"Paolo Dell'Olmo",{"id":1082,"sortIndex":123,"researcher":28,"roles":1083,"affiliations":1084,"properties":1093,"displayName":1095,"givenName":28,"familyName":28},"2fbb1e7b-8ae3-46c0-beca-7382a0ff6b08",[916],[1085],{"id":1086,"sortIndex":32,"affiliation":1087,"properties":28},"1020c73c-c516-49c6-8eb0-7a0b8c22c618",{"id":1086,"createTime":28,"updateTime":28,"relativeEntities":1088,"slug":28,"properties":1089,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1092,"statistic":28},[],{"title":1090},{"VI":1091},"Dipartimento di Informatica, Sistemi e Produzione, Università di Roma “Tor Vergata”, Viale del Politecnico, 1, 00133 Roma, Italy",[],{"title":1094},{"VI":1095},"Giuseppe F. Italiano",{"url":1049,"publisher":1097,"properties":1111},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1098,"slug":872,"properties":1099,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":42,"subjectFields":1102,"manageAffiliations":1103,"indexDatabases":1104,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1100,"title":1101},{"VOID":875},{"EN":877},[],[],[1105],{"id":883,"indexDatabase":1106,"url":889,"indexYears":890,"academicFieldIds":28,"indexDatabaseRanking":891},{"id":792,"createTime":28,"updateTime":28,"relativeEntities":1107,"label":1108,"description":1109,"key":798,"publicationTags":1110,"standard":28},[],{"EN":795,"VI":795},{"EN":795,"VI":797},[800],{"pages":1112,"volume":1114},{"VOID":1113},"277-298",{"VOID":1115},"4","2006-06-01",2006,[891],{"id":1120,"createTime":1121,"updateTime":1122,"relativeEntities":1123,"slug":1124,"properties":1125,"entityType":909,"verifyStatus":26,"verifyTime":1122,"verifyNote":910,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1130,"fullTextUrl":28,"authors":1131,"publicationType":929,"publisherRelationship":1162,"citationCount":28,"citationInfo":28,"publishDate":1181,"publishYear":1117,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1182,"openAccess":28,"references":28,"isForceReanalyzing":953},"03b22efa-168d-4de2-9a1b-866e120e2a84","2024-01-30T08:21:07.464+00:00","2025-01-12T14:01:23.605+00:00",[],"A-loop-free-two-close-Gray-code-algorithm-for-listing-k-ary-Dyck-words",{"title":1126,"doi":1128},{"EN":1127},"A loop-free two-close Gray-code algorithm for listing k-ary Dyck words",{"VOID":1129},"10.1016\u002Fj.jda.2005.07.003","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1570866705000559",[1132,1147],{"id":1133,"sortIndex":32,"researcher":28,"roles":1134,"affiliations":1135,"properties":1144,"displayName":1146,"givenName":28,"familyName":28},"5418ef6a-7158-4717-90df-dc6c90a7f30a",[916],[1136],{"id":1137,"sortIndex":32,"affiliation":1138,"properties":28},"2cbd9479-eda9-4430-9c79-59f30f59a45b",{"id":1137,"createTime":28,"updateTime":28,"relativeEntities":1139,"slug":28,"properties":1140,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1143,"statistic":28},[],{"title":1141},{"VI":1142},"LE21 FRE-CNRS 2309, Université de Bourgogne, B.P. 47 870, 21078 Dijon-Cedex, France",[],{"title":1145},{"VI":1146},"Vincent Vajnovszki",{"id":1148,"sortIndex":40,"researcher":28,"roles":1149,"affiliations":1150,"properties":1159,"displayName":1161,"givenName":28,"familyName":28},"0456a3ed-51ea-4dec-b0e0-2075de8926c8",[916],[1151],{"id":1152,"sortIndex":32,"affiliation":1153,"properties":28},"5176dc17-30ad-4920-8865-3da6d309f668",{"id":1152,"createTime":28,"updateTime":28,"relativeEntities":1154,"slug":28,"properties":1155,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1158,"statistic":28},[],{"title":1156},{"VI":1157},"Department of Computer Science, University of Quebec At Montreal, P.O. 8888, Station A, Montreal, Quebec, Canada, H3C 3P8",[],{"title":1160},{"VI":1161},"Timothy Walsh",{"url":1130,"publisher":1163,"properties":1177},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1164,"slug":872,"properties":1165,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":42,"subjectFields":1168,"manageAffiliations":1169,"indexDatabases":1170,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1166,"title":1167},{"VOID":875},{"EN":877},[],[],[1171],{"id":883,"indexDatabase":1172,"url":889,"indexYears":890,"academicFieldIds":28,"indexDatabaseRanking":891},{"id":792,"createTime":28,"updateTime":28,"relativeEntities":1173,"label":1174,"description":1175,"key":798,"publicationTags":1176,"standard":28},[],{"EN":795,"VI":795},{"EN":795,"VI":797},[800],{"pages":1178,"volume":1180},{"VOID":1179},"633-648",{"VOID":1115},"2006-12-01",[891],{"id":1184,"createTime":1185,"updateTime":1186,"relativeEntities":1187,"slug":1188,"properties":1189,"entityType":909,"verifyStatus":26,"verifyTime":1186,"verifyNote":910,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1196,"fullTextUrl":28,"authors":1197,"publicationType":929,"publisherRelationship":1275,"citationCount":28,"citationInfo":28,"publishDate":1295,"publishYear":1296,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1297,"openAccess":28,"references":28,"isForceReanalyzing":953},"03ca8262-1fd6-4dd9-96db-8ff539916105","2023-12-01T16:47:06.854+00:00","2025-01-07T03:39:32.753+00:00",[],"Compact-directed-acyclic-word-graphs-for-a-sliding-window",{"title":1190,"references":1192,"doi":1194},{"EN":1191},"Compact directed acyclic word graphs for a sliding window",{"VOID":1193},"Apostolico, 1985, The myriad virtues of subword trees, vol. 12, 85\nBlumer, 1987, Complete inverted files for efficient text retrieval and analysis, J. ACM, 34, 578, 10.1145\u002F28869.28873\nCleary, 1995, Unbounded length contexts for PPM, 52\nCleary, 1984, Data compression using adaptive coding and partial string matching, IEEE Trans. Comm., 32, 396, 10.1109\u002FTCOM.1984.1096090\nCrochemore, 1994\nCrochemore, 1997, On compact directed acyclic word graphs, vol. 1261, 192\nFiala, 1989, Data compression with finite windows, Comm. ACM, 32, 490, 10.1145\u002F63334.63341\nGusfield, 1997\nInenaga, 2003, Bidirectional construction of suffix trees, Nordic J. Comput., 10, 52\nInenaga, 2001, Construction of the CDAWG for a trie\nInenaga, 2001, On-line construction of symmetric compact directed acyclic word graphs, 96\nInenaga, 2001, On-line construction of compact directed acyclic word graphs, vol. 2089, 169\nInenaga, 2002, Compact directed acyclic word graphs for a sliding window, vol. 2476, 310\nInenaga, 2002, Space-economical construction of index structures for all suffixes of a string, vol. 2420, 341\nJesper Larsson, 1996, Extended application of suffix trees to data compression, 190\nN. Jesper Larsson, Structures of string matching and data compression, PhD Thesis, Lund University, 1999\nMcCreight, 1976, A space-economical suffix tree construction algorithm, J. ACM, 23, 262, 10.1145\u002F321941.321946\nMoffat, 1990, Implementing the PPM data compression scheme, IEEE Trans. Comm., 38, 1917, 10.1109\u002F26.61469\nUkkonen, 1995, On-line construction of suffix trees, Algorithmica, 14, 249, 10.1007\u002FBF01206331\nWeiner, 1973, Linear pattern matching algorithms, 1",{"VOID":1195},"10.1016\u002Fs1570-8667(03)00064-9","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1570866703000649",[1198,1222,1242,1262],{"id":1199,"sortIndex":32,"researcher":28,"roles":1200,"affiliations":1201,"properties":1219,"displayName":1221,"givenName":28,"familyName":28},"3b9c7620-dda0-46ab-bbb1-79cceb61c167",[916],[1202,1210],{"id":1203,"sortIndex":32,"affiliation":1204,"properties":28},"d864a8e0-4f47-4b7b-b7d4-1767d48fe220",{"id":1203,"createTime":28,"updateTime":28,"relativeEntities":1205,"slug":28,"properties":1206,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1209,"statistic":28},[],{"title":1207},{"VI":1208},"Department of Informatics, Kyushu University 33, Fukuoka 812-8581, Japan",[],{"id":1211,"sortIndex":40,"affiliation":1212,"properties":1218},"1133a8ec-5fdf-4dc9-a91d-feed18e97559",{"id":1211,"createTime":28,"updateTime":28,"relativeEntities":1213,"slug":28,"properties":1214,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1217,"statistic":28},[],{"title":1215},{"VI":1216},"PRESTO, Japan Science and Technology corporation (JST), Japan",[],{},{"title":1220},{"VI":1221},"Shunsuke Inenaga",{"id":1223,"sortIndex":40,"researcher":28,"roles":1224,"affiliations":1225,"properties":1239,"displayName":1241,"givenName":28,"familyName":28},"751b2fe4-b77c-4169-9e37-cac7c39af6a8",[916],[1226,1232],{"id":1203,"sortIndex":32,"affiliation":1227,"properties":28},{"id":1203,"createTime":28,"updateTime":28,"relativeEntities":1228,"slug":28,"properties":1229,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1231,"statistic":28},[],{"title":1230},{"VI":1208},[],{"id":1211,"sortIndex":40,"affiliation":1233,"properties":1238},{"id":1211,"createTime":28,"updateTime":28,"relativeEntities":1234,"slug":28,"properties":1235,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1237,"statistic":28},[],{"title":1236},{"VI":1216},[],{},{"title":1240},{"VI":1241},"Ayumi Shinohara",{"id":1243,"sortIndex":123,"researcher":28,"roles":1244,"affiliations":1245,"properties":1259,"displayName":1261,"givenName":28,"familyName":28},"8b7baa83-9b5f-4ae9-acc0-527408cc0611",[916],[1246,1252],{"id":1203,"sortIndex":32,"affiliation":1247,"properties":28},{"id":1203,"createTime":28,"updateTime":28,"relativeEntities":1248,"slug":28,"properties":1249,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1251,"statistic":28},[],{"title":1250},{"VI":1208},[],{"id":1211,"sortIndex":40,"affiliation":1253,"properties":1258},{"id":1211,"createTime":28,"updateTime":28,"relativeEntities":1254,"slug":28,"properties":1255,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1257,"statistic":28},[],{"title":1256},{"VI":1216},[],{},{"title":1260},{"VI":1261},"Masayuki Takeda",{"id":1263,"sortIndex":42,"researcher":28,"roles":1264,"affiliations":1265,"properties":1272,"displayName":1274,"givenName":28,"familyName":28},"5e88b012-367f-43a1-a6f8-2e4844373943",[916],[1266],{"id":1203,"sortIndex":32,"affiliation":1267,"properties":28},{"id":1203,"createTime":28,"updateTime":28,"relativeEntities":1268,"slug":28,"properties":1269,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1271,"statistic":28},[],{"title":1270},{"VI":1208},[],{"title":1273},{"VI":1274},"Setsuo Arikawa",{"url":1196,"publisher":1276,"properties":1290},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1277,"slug":872,"properties":1278,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":42,"subjectFields":1281,"manageAffiliations":1282,"indexDatabases":1283,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1279,"title":1280},{"VOID":875},{"EN":877},[],[],[1284],{"id":883,"indexDatabase":1285,"url":889,"indexYears":890,"academicFieldIds":28,"indexDatabaseRanking":891},{"id":792,"createTime":28,"updateTime":28,"relativeEntities":1286,"label":1287,"description":1288,"key":798,"publicationTags":1289,"standard":28},[],{"EN":795,"VI":795},{"EN":795,"VI":797},[800],{"pages":1291,"volume":1293},{"VOID":1292},"33-51",{"VOID":1294},"2","2004-03-01",2004,[891],{"id":1299,"createTime":1300,"updateTime":1301,"relativeEntities":1302,"slug":1303,"properties":1304,"entityType":909,"verifyStatus":26,"verifyTime":1301,"verifyNote":910,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1311,"fullTextUrl":28,"authors":1312,"publicationType":929,"publisherRelationship":1343,"citationCount":28,"citationInfo":28,"publishDate":1363,"publishYear":1364,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1365,"openAccess":28,"references":28,"isForceReanalyzing":953},"03dbfe9b-ec46-4981-9773-b6d9ee678c3a","2024-02-08T17:10:01.481+00:00","2025-01-08T03:23:03.694+00:00",[],"Hardness-of-approximation-for-orthogonal-rectangle-packing-and-covering-problems",{"title":1305,"references":1307,"doi":1309},{"EN":1306},"Hardness of approximation for orthogonal rectangle packing and covering problems",{"VOID":1308},"Ausiello, 1999\nBaker, 1983, Approximation algorithms for maximizing the number of squares packed into a rectangle, SIAM Journal on Algebraic and Discrete Methods, 4, 383, 10.1137\u002F0604039\nBansal, 2006, Bin packing in multiple dimensions: Inapproximability results and approximation schemes, Mathematics of Operations Research, 31, 31, 10.1287\u002Fmoor.1050.0168\nN. Bansal, M. Sviridenko, New approximability and inapproximability results for 2-dimensional bin packing, in: Proceedings of the 15th Annual ACM–SIAM Symposium on Discrete Algorithms, SODA, 2004, pp. 189–196\nA. Caprara, Packing 2-dimensional bins in harmony, in: Proceedings of the 43th Annual IEEE Symposium on Foundations of Computer Science, FOCS, 2002, pp. 490–499\nC. Chekuri, S. Khanna, On multi-dimensional packing problems, in: Proc. of the 10th ACM–SIAM Symposium on Discrete Algorithms, SODA, 1999, pp. 185–194\nChlebík, 2006, Complexity of approximating bounded variants of optimization problems, Theoretical Computer Science, 354, 320, 10.1016\u002Fj.tcs.2005.11.029\nJ.R. Correa, C. Kenyon, Approximation schemes for multidimensional packing, in: Proceedings of the 15th ACM–SIAM Symposium on Discrete Algorithms, SODA, 2004, pp. 179–188\nJ. Csirik, D.S. Johnson, C. Kenyon, Better approximation algorithms for bin covering, in: Proceedings of the 12th ACM–SIAM Symposium on Discrete Algorithms, SODA (2001), 557–566\nCsirik, 1993, An on-line algorithm for multidimensional bin packing, Operation Research Letters, 13, 149, 10.1016\u002F0167-6377(93)90004-Z\nFernandez de la Vega, 1981, Bin packing can be solved within (1+ε) in linear time, Combinatorica, 1, 349, 10.1007\u002FBF02579456\nA. Freund, J. Naor, Approximating the advertisement placement problem, in: Proceedings of the 9th Conference on Integer Programming and Combinatorial Optimization, IPCO, in: LNCS, vol. 2337, 2002, pp. 415–424\nJansen, 2003, An asymptotic fully polynomial time approximation scheme for bin covering, Theoretical Computer Science, 306, 543, 10.1016\u002FS0304-3975(03)00363-3\nK. Jansen, R. Solis-Oba, An asymptotic approximation algorithm for 3d-strip packing, in: Proceedings of the 17th Annual ACM–SIAM Symposium on Discrete Algorithms, SODA, 2006, pp. 143–152\nK. Jansen, R. Stee, On strip packing with rotations, in: Proceedings of the 37th ACM Symposium on Theory of Computing, STOC, 2005, pp. 755–761\nK. Jansen, G. Zhang, On rectangle packing: Maximizing benefits, in: Proceedings of the 15th Annual ACM–SIAM Symposium on Discrete Algorithms, SODA, 2004, pp. 197–206\nKann, 1991, Maximum bounded 3-dimensional matching is MAX SNP complete, Information Processing Letters, 37, 27, 10.1016\u002F0020-0190(91)90246-E\nN. Karmarkar, R.M. Karp, An efficient approximation scheme for the one-dimensional bin-packing problem, in: Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, FOCS, 1982, pp. 312–320\nKenyon, 2000, A near optimal solution to a two-dimensional cutting stock problem, Mathematics of Operations Research, 25, 645, 10.1287\u002Fmoor.25.4.645.12118\nLi, 1990, On three-dimensional packing, SIAM J. Comput., 19, 847, 10.1137\u002F0219059\nMiyazawa, 2000, Approximation algorithms for the orthogonal z-oriented three-dimensional packing problems, SIAM J. Comput., 29, 1008, 10.1137\u002FS009753979631391X\nMiyazawa, 2004, Packing problems with orthogonal rotations, vol. 2976, 359\nPetrank, 1994, The hardness of approximation: Gap location, Computational Complexity, 4, 133, 10.1007\u002FBF01202286\nWoeginger, 1997, There is no asymptotic PTAS for two-dimensional vector packing, Information Processing Letters, 64, 293, 10.1016\u002FS0020-0190(97)00179-8",{"VOID":1310},"10.1016\u002Fj.jda.2009.02.002","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1570866709000240",[1313,1328],{"id":1314,"sortIndex":32,"researcher":28,"roles":1315,"affiliations":1316,"properties":1325,"displayName":1327,"givenName":28,"familyName":28},"d8ee34c9-69e5-45e7-b193-914c837077a8",[916],[1317],{"id":1318,"sortIndex":32,"affiliation":1319,"properties":28},"7ad7a1f0-7b6e-497b-ae1e-27948a1874d9",{"id":1318,"createTime":28,"updateTime":28,"relativeEntities":1320,"slug":28,"properties":1321,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1324,"statistic":28},[],{"title":1322},{"VI":1323},"Department of Mathematics, University of Sussex, Brighton BN1 9RF, UK",[],{"title":1326},{"VI":1327},"Miroslav Chlebík",{"id":1329,"sortIndex":40,"researcher":28,"roles":1330,"affiliations":1331,"properties":1340,"displayName":1342,"givenName":28,"familyName":28},"f35cf57e-76d5-4786-83ff-337338bba653",[916],[1332],{"id":1333,"sortIndex":32,"affiliation":1334,"properties":28},"157375e8-12de-41d9-9576-0544731e8e69",{"id":1333,"createTime":28,"updateTime":28,"relativeEntities":1335,"slug":28,"properties":1336,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1339,"statistic":28},[],{"title":1337},{"EN":1338},"Faculty of Mathematics, Physics and Informatics, Mlynská dolina, 842 48, Bratislava, Slovakia",[],{"title":1341},{"VI":1342},"Janka Chlebíková",{"url":1311,"publisher":1344,"properties":1358},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1345,"slug":872,"properties":1346,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":42,"subjectFields":1349,"manageAffiliations":1350,"indexDatabases":1351,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1347,"title":1348},{"VOID":875},{"EN":877},[],[],[1352],{"id":883,"indexDatabase":1353,"url":889,"indexYears":890,"academicFieldIds":28,"indexDatabaseRanking":891},{"id":792,"createTime":28,"updateTime":28,"relativeEntities":1354,"label":1355,"description":1356,"key":798,"publicationTags":1357,"standard":28},[],{"EN":795,"VI":795},{"EN":795,"VI":797},[800],{"pages":1359,"volume":1361},{"VOID":1360},"291-305",{"VOID":1362},"7","2009-09-01",2009,[891],{"id":1367,"createTime":1368,"updateTime":1369,"relativeEntities":1370,"slug":1371,"properties":1372,"entityType":909,"verifyStatus":26,"verifyTime":1379,"verifyNote":910,"languages":28,"translateLanguages":28,"viewCount":40,"primaryUrl":1380,"fullTextUrl":28,"authors":1381,"publicationType":929,"publisherRelationship":1412,"citationCount":28,"citationInfo":28,"publishDate":1432,"publishYear":1433,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1434,"openAccess":28,"references":28,"isForceReanalyzing":953},"04b9b1de-bbc3-4978-8f5f-00b1f1fc1d87","2024-01-14T11:20:30.327+00:00","2024-12-25T15:11:33.973+00:00",[],"Broadcasting-in-geometric-radio-networks",{"title":1373,"references":1375,"doi":1377},{"EN":1374},"Broadcasting in geometric radio networks",{"VOID":1376},"Alon, 1991, A lower bound for radio broadcast, Journal of Computer and System Sciences, 43, 290, 10.1016\u002F0022-0000(91)90015-W\nAwerbuch, 1990, A tradeoff between information and communication in broadcast protocols, Journal of the ACM, 37, 238, 10.1145\u002F77600.77618\nBar-Yehuda, 1992, On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization, Journal of Computer and System Sciences, 45, 104, 10.1016\u002F0022-0000(92)90042-H\nBasagni, 1999, A mobility-transparent deterministic broadcast mechanism for ad hoc networks, IEEE\u002FACM Transactions on Networking, 7, 799, 10.1109\u002F90.811446\nS. Basagni, A.D. Myers, V.R. Syrotiuk, Mobility-independent flooding for real-time multimedia applications in ad hoc networks, in: Proc. 1999 IEEE Emerging Technologies Symposium on Wireless Communications & Systems, Richardson, TX\nBruschi, 1997, Lower bounds for the broadcast problem in mobile radio networks, Distributed Computing, 10, 129, 10.1007\u002Fs004460050030\nChlamtac, 1994, Making transmission schedule immune to topology changes in multi-hop packet radio networks, IEEE\u002FACM Transactions on Networking, 2, 23, 10.1109\u002F90.282605\nChlamtac, 1997, Time-spread multiple access (TSMA) protocols for multihop mobile radio networks, IEEE\u002FACM Transactions on Networking, 5, 804, 10.1109\u002F90.650140\nChlamtac, 1985, On broadcasting in radio networks—problem analysis and protocol design, IEEE Transactions on Communications, 33, 1240, 10.1109\u002FTCOM.1985.1096245\nChlamtac, 1987, Tree based broadcasting in multihop radio networks, IEEE Transactions on Computers, 36, 1209, 10.1109\u002FTC.1987.1676861\nChlamtac, 1991, The wave expansion approach to broadcasting in multihop radio networks, IEEE Transactions on Communications, 39, 426, 10.1109\u002F26.79285\nChlebus, 2002, Deterministic broadcasting in ad hoc radio networks, Distributed Computing, 15, 27, 10.1007\u002Fs446-002-8028-1\nChlebus, 2000, Deterministic radio broadcasting, vol. 1853, 717\nM. Chrobak, L. Gasieniec, W. Rytter, Fast broadcasting and gossiping in radio networks, in: Proc. 41st Symposium on Foundations of Computer Science (FOCS'2000), pp. 575–581\nA.E.F. Clementi, A. Monti, R. Silvestri, Selective families, superimposed codes, and broadcasting on unknown radio networks, in: Proc. 12th Ann. ACM–SIAM Symposium on Discrete Algorithms (SODA'2001), pp. 709–718\nA. Czumaj, W. Rytter, Broadcasting algorithms in radio networks with unknown topology, in: Proc. 44th Symposium on Foundations of Computer Science (FOCS'2003), pp. 492–501\nDe Marco, 2001, Faster broadcasting in unknown radio networks, Information Processing Letters, 79, 53, 10.1016\u002FS0020-0190(00)00178-2\nA. Dessmark, A. Pelc, Tradeoffs between knowledge and time of communication in geometric radio networks, in: Proc. 13th Ann. ACM Symposium on Parallel Algorithms and Architectures (SPAA'2001), pp. 59–66\nDiks, 2002, The impact of knowledge on broadcasting time in linear radio networks, Theoretical Computer Science, 287, 449, 10.1016\u002FS0304-3975(01)00256-0\nM. Elkin, G. Kortsarz, An improved algorithm for radio broadcast, in: Proc. 16th Ann. ACM–SIAM Symp. on Discrete Algorithms (SODA'2005)\nI. Gaber, Y. Mansour, Broadcast in radio networks, in: Proc. 6th Ann. ACM–SIAM Symp. on Discrete Algorithms (SODA'1995), pp. 577–585\nGallager, 1985, A perspective on multiaccess channels, IEEE Transactions on Information Theory, 31, 124, 10.1109\u002FTIT.1985.1057022\nL. Gasieniec, D. Peleg, Q. Xin, Faster communication in known topology radio networks, in: Proc. 24th Annual ACM Symposium on Principles of Distributed Computing (PODC'2005), pp. 129–137\nKowalski, 2004, Time of deterministic broadcasting in radio networks with local knowledge, SIAM Journal on Computing, 33, 870, 10.1137\u002FS0097539702419339\nKowalski, 2004, Faster deterministic broadcasting in ad hoc radio networks, SIAM Journal on Discrete Mathematics, 18, 332, 10.1137\u002FS089548010342464X\nD. Kowalski, A. Pelc, Broadcasting in undirected ad hoc radio networks, in: Proc. 22nd Ann. ACM Symposium on Principles of Distributed Computing (PODC'2003), pp. 73–82\nKowalski, 2004, Centralized deterministic broadcasting in undirected multi-hop radio networks, vol. 3122, 171\nD. Kowalski, A. Pelc, Optimal deterministic broadcasting in known topology radio networks, Distributed Computing, in press\nKranakis, 2001, Fault-tolerant broadcasting in radio networks, Journal of Algorithms, 39, 47, 10.1006\u002Fjagm.2000.1147\nKushilevitz, 1998, An Omega(D log (N\u002FD)) lower bound for broadcast in radio networks, SIAM Journal on Computing, 27, 702, 10.1137\u002FS0097539794279109\nA. Pelc, D. Peleg, Feasibility and complexity of broadcasting with random transmission failures, in: Proc. 24th Ann. ACM Symposium on Principles of Distributed Computing (PODC'2005), pp. 334–341\nD. Peleg, Deterministic radio broadcast with no topological knowledge, Manuscript, 2000\nRavishankar, 1994, Broadcasting on [0,L], Discrete Applied Mathematics, 53, 299, 10.1016\u002F0166-218X(94)90193-7\nA. Sen and M.L. Huson, A new model for scheduling packet radio networks, in: Proc. 15th Annual Joint Conference of the IEEE Computer and Communication Societies (IEEE INFOCOM'96), 1996, pp. 1116–1124",{"VOID":1378},"10.1016\u002Fj.jda.2006.07.001","2024-12-25T15:11:33.972+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1570866706000566",[1382,1397],{"id":1383,"sortIndex":32,"researcher":28,"roles":1384,"affiliations":1385,"properties":1394,"displayName":1396,"givenName":28,"familyName":28},"7493dc83-b53e-45e7-ac6e-818db13b0d44",[916],[1386],{"id":1387,"sortIndex":32,"affiliation":1388,"properties":28},"4e6e37e3-0ade-459f-a9fb-5552725a9e03",{"id":1387,"createTime":28,"updateTime":28,"relativeEntities":1389,"slug":28,"properties":1390,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1393,"statistic":28},[],{"title":1391},{"VI":1392},"Department of Computer Science, Lund University, Box 118, S-22100 Lund, Sweden",[],{"title":1395},{"VI":1396},"Anders Dessmark",{"id":1398,"sortIndex":40,"researcher":28,"roles":1399,"affiliations":1400,"properties":1409,"displayName":1411,"givenName":28,"familyName":28},"b9de3ab1-6c24-4afb-8deb-611702fefc24",[916],[1401],{"id":1402,"sortIndex":32,"affiliation":1403,"properties":28},"97fe23a6-9df1-41b0-a441-585e257e25fd",{"id":1402,"createTime":28,"updateTime":28,"relativeEntities":1404,"slug":28,"properties":1405,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1408,"statistic":28},[],{"title":1406},{"VI":1407},"Département d’informatique, Université du Québec en Outaouais, Gatineau, Québec J8X 3X7, Canada",[],{"title":1410},{"VI":1411},"Andrzej Pelc",{"url":1380,"publisher":1413,"properties":1427},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1414,"slug":872,"properties":1415,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":42,"subjectFields":1418,"manageAffiliations":1419,"indexDatabases":1420,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1416,"title":1417},{"VOID":875},{"EN":877},[],[],[1421],{"id":883,"indexDatabase":1422,"url":889,"indexYears":890,"academicFieldIds":28,"indexDatabaseRanking":891},{"id":792,"createTime":28,"updateTime":28,"relativeEntities":1423,"label":1424,"description":1425,"key":798,"publicationTags":1426,"standard":28},[],{"EN":795,"VI":795},{"EN":795,"VI":797},[800],{"pages":1428,"volume":1430},{"VOID":1429},"187-201",{"VOID":1431},"5","2007-03-01",2007,[891],{"id":1436,"createTime":1437,"updateTime":1438,"relativeEntities":1439,"slug":1440,"properties":1441,"entityType":909,"verifyStatus":26,"verifyTime":1438,"verifyNote":910,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1448,"fullTextUrl":28,"authors":1449,"publicationType":929,"publisherRelationship":1465,"citationCount":28,"citationInfo":28,"publishDate":1485,"publishYear":1486,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1487,"openAccess":28,"references":28,"isForceReanalyzing":953},"05a0b2e5-ff22-4c09-876f-986d2e87ab7c","2024-02-09T01:21:30.859+00:00","2024-12-12T14:14:19.546+00:00",[],"Distributed-suffix-trees",{"title":1442,"references":1444,"doi":1446},{"EN":1443},"Distributed suffix trees",{"VOID":1445},"Andersson, 1999, Suffix trees on words, Algorithmica, 23, 246, 10.1007\u002FPL00009260\nAndersson, 1993, Improved behaviour of tries by adaptive branching, Inform. Process. Lett., 46, 293, 10.1016\u002F0020-0190(93)90068-K\nApostolico, 1985, The myriad virtues of subword trees, vol. F12, 85\nBurkhardt, 2003, Fast lightweight suffix array construction and checking, vol. 2676, 55\nChang, 1994, Sublinear expected time approximate string matching and biological applications, Algorithmica, 12, 327, 10.1007\u002FBF01185431\nClark, 1996, Efficient suffix trees on secondary storage, 383\nDelcher, 1999, Alignment of whole genomes, Nucleic Acids Research, 27, 2369, 10.1093\u002Fnar\u002F27.11.2369\nDorohonceanu, 2000, Accelerating protein classification using suffix trees, 126\nFerragina, 1995, A fully-dynamic data structure for external substring search, 693\nFerragina, 1996, Fast string searching in secondary storage: Theoretical developments and experimental results, 373\nFerragina, 1999, The string B-Tree: a new data structure for string search in external memory and its applications, J. ACM, 46, 238, 10.1145\u002F301970.301973\nGiegerich, 1997, From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction, Algorithmica, 10.1007\u002FPL00009177\nGusfield, 1997\nGusfield, 1992, An efficient algorithm for the all pairs suffix-prefix problem, Inform. Process. Lett., 41, 181, 10.1016\u002F0020-0190(92)90176-V\nHariharan, 1994, Optimal parallel suffix tree construction, 290\nKärkkäinen, 1995, Suffix cactus: a cross between suffix tree and suffix array, vol. 937, 191\nKärkkäinen, 1996, Sparse suffix trees, vol. 1090, 219\nS. Kurtz, Reducing the space requirement of suffix trees, Report 98-03, Technical Report, Technische Fakultat, Universitat Bielefeld, 1998\nKurtz, 1999, Reputer: Fast computation of maximal repeats in complete genomes, Bioinformatics, 15, 426, 10.1093\u002Fbioinformatics\u002F15.5.426\nManber, 1990, Suffix arrays: a new method for on-line string searches, 319\nMcCreight, 1976, A space–economical suffix tree construction algorithm, J. ACM, 23, 262, 10.1145\u002F321941.321946\nUkkonen, 1995, On-line construction of suffix-trees, Algorithmica, 14, 249, 10.1007\u002FBF01206331\nWaterman, 1995",{"VOID":1447},"10.1016\u002Fj.jda.2004.08.004","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1570866704000516",[1450],{"id":1451,"sortIndex":32,"researcher":28,"roles":1452,"affiliations":1453,"properties":1462,"displayName":1464,"givenName":28,"familyName":28},"19e16505-9c2e-4427-acc5-6baeb4d5dea2",[916],[1454],{"id":1455,"sortIndex":32,"affiliation":1456,"properties":28},"35472139-8b33-4e32-9864-814a052cb390",{"id":1455,"createTime":28,"updateTime":28,"relativeEntities":1457,"slug":28,"properties":1458,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1461,"statistic":28},[],{"title":1459},{"VI":1460},"Algorithm Design Group, Department of Computer Science King’s College, London, UK",[],{"title":1463},{"VI":1464},"Raphaël Clifford",{"url":1448,"publisher":1466,"properties":1480},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1467,"slug":872,"properties":1468,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":42,"subjectFields":1471,"manageAffiliations":1472,"indexDatabases":1473,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1469,"title":1470},{"VOID":875},{"EN":877},[],[],[1474],{"id":883,"indexDatabase":1475,"url":889,"indexYears":890,"academicFieldIds":28,"indexDatabaseRanking":891},{"id":792,"createTime":28,"updateTime":28,"relativeEntities":1476,"label":1477,"description":1478,"key":798,"publicationTags":1479,"standard":28},[],{"EN":795,"VI":795},{"EN":795,"VI":797},[800],{"pages":1481,"volume":1483},{"VOID":1482},"176-197",{"VOID":1484},"3","2005-06-01",2005,[891],{"id":1489,"createTime":1490,"updateTime":1491,"relativeEntities":1492,"slug":1493,"properties":1494,"entityType":909,"verifyStatus":26,"verifyTime":1491,"verifyNote":910,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1501,"fullTextUrl":28,"authors":1502,"publicationType":929,"publisherRelationship":1559,"citationCount":28,"citationInfo":28,"publishDate":1579,"publishYear":1580,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1581,"openAccess":28,"references":28,"isForceReanalyzing":953},"06f5536d-18ea-46b8-b1ba-92e964d52b91","2024-01-04T12:27:48.417+00:00","2025-02-21T03:21:49.663+00:00",[],"A-note-on-maximum-differential-coloring-of-planar-graphs",{"title":1495,"references":1497,"doi":1499},{"EN":1496},"A note on maximum differential coloring of planar graphs",{"VOID":1498},"Assmann, 1981, The bandwidth of caterpillars with hairs of length 1 and 2, SIAM J. Algebr. Discrete Methods, 2, 387, 10.1137\u002F0602041\nBansal, 2011, Memetic algorithm for the antibandwidth maximization problem, J. Heuristics, 17, 39, 10.1007\u002Fs10732-010-9124-4\nCalamoneri, 2006, Antibandwidth of complete k-ary trees, Electron. Notes Discrete Math., 24, 259, 10.1016\u002Fj.endm.2006.06.028\nDobrev, 2013, Antibandwidth and cyclic antibandwidth of hamming graphs, Discrete Appl. Math., 161, 1402, 10.1016\u002Fj.dam.2012.12.026\nDuarte, 2011, Grasp with path relinking heuristics for the antibandwidth problem, Networks, 58, 171, 10.1002\u002Fnet.20418\nGansner, 2010, GMap: visualizing graphs and clusters as maps, 201\nGarey, 1979\nGolovach, 2009, Bandwidth on AT-free graphs, Algorithms Comput., 412, 573, 10.1007\u002F978-3-642-10631-6_59\nHajnal, 1970, Proof of a conjecture of P. Erdös, Comb. Theory Appl., 601\nHale, 1980, Frequency assignment: theory and applications, Proc. IEEE, 68, 1497, 10.1109\u002FPROC.1980.11899\nHeggernes, 2008, Bandwidth of bipartite permutation graphs in polynomial time, vol. 4957, 216\nHu, 2011, On maximum differential graph coloring, vol. 6502, 274\nIsaak, 1998, Powers of Hamiltonian paths in interval graphs, J. Graph Theory, 28, 31, 10.1002\u002F(SICI)1097-0118(199805)28:1\u003C31::AID-JGT3>3.0.CO;2-G\nKloks, 1998, Bandwidth of chain graphs, Inf. Process. Lett., 68, 313, 10.1016\u002FS0020-0190(98)00173-2\nKubale, 2004, Graph Colorings, vol. 352\nLeung, 1984, On some variants of the bandwidth minimization problem, SIAM J. Comput., 13, 650, 10.1137\u002F0213040\nLin, 2012, Antibandwidth of bipartite graphs, 191\nLin, 1989, A level structure approach on the bandwidth problem for special graphs, Ann. N.Y. Acad. Sci., 576, 344, 10.1111\u002Fj.1749-6632.1989.tb16417.x\nMiller, 1989, On the separation number of a graph, Networks, 19, 651, 10.1002\u002Fnet.3230190604\nMonien, 1986, The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete, SIAM J. Algebr. Discrete Methods, 7, 505, 10.1137\u002F0607057\nPapadimitriou, 1975, The NP-Completeness of the bandwidth minimization problem, Computing, 16, 263, 10.1007\u002FBF02280884\nRahaman, 2014, Antibandwidth problem for itchy caterpillar, 1\nRaspaud, 2009, Antibandwidth and cyclic antibandwidth of meshes and hypercubes, Discrete Math., 309, 3541, 10.1016\u002Fj.disc.2007.12.058\nReed, 2003, Recent Advances in Algorithmic Combinatorics\nTörök, 2010, Antibandwidth of three-dimensional meshes, Discrete Math., 310, 505, 10.1016\u002Fj.disc.2009.03.029\nWang, 2009, On explicit formulas for bandwidth and antibandwidth of hypercubes, Discrete Appl. Math., 157, 1947, 10.1016\u002Fj.dam.2008.12.004\nWeili, 2003, Dual bandwidth of some special trees, J. Zhengzhou Univ. Nat. Sci. Ed., 35, 16\nYan, 1997, The bandwidth problem in cographs, Tamsui Oxford Univ. J. Math. Sci., 13, 31\nYixun, 2003, The dual bandwidth problem for graphs, J. Zhengzhou Univ. Nat. Sci. Ed., 35, 1",{"VOID":1500},"10.1016\u002Fj.jda.2014.06.004","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1570866714000458",[1503,1518,1531,1546],{"id":1504,"sortIndex":32,"researcher":28,"roles":1505,"affiliations":1506,"properties":1515,"displayName":1517,"givenName":28,"familyName":28},"d48bee30-2584-4573-b2fe-2cf0714a63d2",[916],[1507],{"id":1508,"sortIndex":32,"affiliation":1509,"properties":28},"00ec7759-2895-49b8-bcd9-b1d1adce1b0d",{"id":1508,"createTime":28,"updateTime":28,"relativeEntities":1510,"slug":28,"properties":1511,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1514,"statistic":28},[],{"title":1512},{"VI":1513},"Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Germany",[],{"title":1516},{"VI":1517},"M.A. Bekos",{"id":1519,"sortIndex":40,"researcher":28,"roles":1520,"affiliations":1521,"properties":1528,"displayName":1530,"givenName":28,"familyName":28},"866772ee-d385-4680-8088-c5361d8fa1ea",[916],[1522],{"id":1508,"sortIndex":32,"affiliation":1523,"properties":28},{"id":1508,"createTime":28,"updateTime":28,"relativeEntities":1524,"slug":28,"properties":1525,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1527,"statistic":28},[],{"title":1526},{"VI":1513},[],{"title":1529},{"VI":1530},"M. Kaufmann",{"id":1532,"sortIndex":123,"researcher":28,"roles":1533,"affiliations":1534,"properties":1543,"displayName":1545,"givenName":28,"familyName":28},"0b1d64c2-8c17-412c-8dca-f8ee7b1f1bbe",[916],[1535],{"id":1536,"sortIndex":32,"affiliation":1537,"properties":28},"666bb367-79b2-46b0-be64-10f56df042f6",{"id":1536,"createTime":28,"updateTime":28,"relativeEntities":1538,"slug":28,"properties":1539,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1542,"statistic":28},[],{"title":1540},{"VI":1541},"Dept. of Computer Science, University of Arizona, Tucson, AZ, USA",[],{"title":1544},{"VI":1545},"S. Kobourov",{"id":1547,"sortIndex":42,"researcher":28,"roles":1548,"affiliations":1549,"properties":1556,"displayName":1558,"givenName":28,"familyName":28},"875854ce-040f-4edc-a8ea-3da23788c1df",[916],[1550],{"id":1536,"sortIndex":32,"affiliation":1551,"properties":28},{"id":1536,"createTime":28,"updateTime":28,"relativeEntities":1552,"slug":28,"properties":1553,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1555,"statistic":28},[],{"title":1554},{"VI":1541},[],{"title":1557},{"VI":1558},"S. Veeramoni",{"url":1501,"publisher":1560,"properties":1574},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1561,"slug":872,"properties":1562,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":42,"subjectFields":1565,"manageAffiliations":1566,"indexDatabases":1567,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1563,"title":1564},{"VOID":875},{"EN":877},[],[],[1568],{"id":883,"indexDatabase":1569,"url":889,"indexYears":890,"academicFieldIds":28,"indexDatabaseRanking":891},{"id":792,"createTime":28,"updateTime":28,"relativeEntities":1570,"label":1571,"description":1572,"key":798,"publicationTags":1573,"standard":28},[],{"EN":795,"VI":795},{"EN":795,"VI":797},[800],{"pages":1575,"volume":1577},{"VOID":1576},"1-7",{"VOID":1578},"29","2014-11-01",2014,[891],{"id":1583,"createTime":1584,"updateTime":1585,"relativeEntities":1586,"slug":1587,"properties":1588,"entityType":909,"verifyStatus":26,"verifyTime":1585,"verifyNote":910,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1595,"fullTextUrl":28,"authors":1596,"publicationType":929,"publisherRelationship":1640,"citationCount":28,"citationInfo":28,"publishDate":1660,"publishYear":1661,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1662,"openAccess":28,"references":28,"isForceReanalyzing":953},"0715612e-9cd9-491d-9106-98639710f028","2023-12-12T21:31:42.593+00:00","2024-12-28T07:15:04.355+00:00",[],"An-improved-approximation-algorithm-for-maximum-edge-2-coloring-in-simple-graphs",{"title":1589,"references":1591,"doi":1593},{"EN":1590},"An improved approximation algorithm for maximum edge 2-coloring in simple graphs",{"VOID":1592},"Feige, 2002, Approximating maximum edge coloring in multigraphs, vol. 2462, 108\nH.N. Gabow, An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems, in: Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983, pp. 448–456\nD. Hartvigsen, Extensions of matching theory, Ph.D. Thesis, Carnegie-Mellon University, 1984\nHochbaum, 1997\nJacobs, 2000, Complexity of recognizing equal unions in families of sets, Journal of Algorithms, 37, 495, 10.1006\u002Fjagm.2000.1121\nKawarabayashi, 2002, Path factors in cubic graphs, Journal of Graph Theory, 39, 188, 10.1002\u002Fjgt.10022\nA. Kosowski, M. Malafiejski, P. Zylinski, Packing edge covers in graphs of small degree, Manuscript, 2006\nO'Rourke, 1987\nUrrutia, 2000, Art gallery and illumination problems",{"VOID":1594},"10.1016\u002Fj.jda.2007.08.002","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1570866707000573",[1597,1612,1625],{"id":1598,"sortIndex":32,"researcher":28,"roles":1599,"affiliations":1600,"properties":1609,"displayName":1611,"givenName":28,"familyName":28},"1b1d5253-0cc1-486b-bd16-5f2966bb3e47",[916],[1601],{"id":1602,"sortIndex":32,"affiliation":1603,"properties":28},"de9ce55f-7c42-4704-8bc7-1f335c872b98",{"id":1602,"createTime":28,"updateTime":28,"relativeEntities":1604,"slug":28,"properties":1605,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1608,"statistic":28},[],{"title":1606},{"VI":1607},"Department of Mathematical Sciences, Tokyo Denki University, Hatoyama, Saitama 350-0394, Japan",[],{"title":1610},{"VI":1611},"Zhi-Zhong Chen",{"id":1613,"sortIndex":40,"researcher":28,"roles":1614,"affiliations":1615,"properties":1622,"displayName":1624,"givenName":28,"familyName":28},"056fb9b5-f772-4102-83a6-2aaed6569e21",[916],[1616],{"id":1602,"sortIndex":32,"affiliation":1617,"properties":28},{"id":1602,"createTime":28,"updateTime":28,"relativeEntities":1618,"slug":28,"properties":1619,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1621,"statistic":28},[],{"title":1620},{"VI":1607},[],{"title":1623},{"VI":1624},"Ruka Tanahashi",{"id":1626,"sortIndex":123,"researcher":28,"roles":1627,"affiliations":1628,"properties":1637,"displayName":1639,"givenName":28,"familyName":28},"2bc6a0b9-f4d0-45c0-8712-306530733ee8",[916],[1629],{"id":1630,"sortIndex":32,"affiliation":1631,"properties":28},"957ea4b0-c6a3-42ef-805d-2ce8132c47ad",{"id":1630,"createTime":28,"updateTime":28,"relativeEntities":1632,"slug":28,"properties":1633,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1636,"statistic":28},[],{"title":1634},{"VI":1635},"Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong",[],{"title":1638},{"VI":1639},"Lusheng Wang",{"url":1595,"publisher":1641,"properties":1655},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1642,"slug":872,"properties":1643,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":42,"subjectFields":1646,"manageAffiliations":1647,"indexDatabases":1648,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1644,"title":1645},{"VOID":875},{"EN":877},[],[],[1649],{"id":883,"indexDatabase":1650,"url":889,"indexYears":890,"academicFieldIds":28,"indexDatabaseRanking":891},{"id":792,"createTime":28,"updateTime":28,"relativeEntities":1651,"label":1652,"description":1653,"key":798,"publicationTags":1654,"standard":28},[],{"EN":795,"VI":795},{"EN":795,"VI":797},[800],{"pages":1656,"volume":1658},{"VOID":1657},"205-215",{"VOID":1659},"6","2008-06-01",2008,[891]]