[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"\"}":3,"_public_publisher_byId_bc04808e-265e-415f-ac01-cc14425d4973":656,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"totalCitation\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:bc04808e-265e-415f-ac01-cc14425d4973,\"}":746},{"meta":4,"data":6},{"total":5},"117",[7,60,176,207,299,413,445,480,543,572],{"id":8,"createTime":9,"updateTime":10,"relativeEntities":11,"slug":12,"properties":13,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":29,"subjectFields":30,"manageAffiliations":31,"indexDatabases":32,"url":33,"thumbnailPath":34,"statistic":35,"gsStatistic":26,"type":26,"analyzePriority":26},"5a09599f-54d1-44c3-8f16-3847ac552024","2023-08-17T04:28:50.832+00:00","2025-10-13T23:58:52.517+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Truy%E1%BB%81n-nhi%E1%BB%85m-Vi%E1%BB%87t-Nam",{"country":14,"issn":16,"introduce":18,"title":21},{"VOID":15},"VN",{"VOID":17},"08667829",{"EN":19,"VI":20},"{\"ops\":[{\"insert\":\"Vietnam Journal of Infectious Diseases is a social - professional forum of the Vietnam Society for Infectious Diseases, whose responsibility is to introduce the researches, the scientific advances in Vietnam and from the world; to contribute to the improvement of knowledges for health care staffs about clinic, treatment, guideline, prevention, epidemiology for infectious diseases, HIV\u002FAIDS and community health care; to provide, exchange and publish scientific information to the public accurately and promptly.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Vietnam Journal of Infectious Diseases publishes in the whole country; serves the professional work for researchers, clinical staffs, administrators, undergraduate and postgraduate students who are working and studying in the infections, tropical diseases and HIV\u002FAIDS from central to local levels, also organizations and individuals in the world who are interested in infectious and tropical diseases and prevention for HIV\u002FAIDS.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Editor in Chief:\"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"insert\":\"Prof. Dr. Nguyen Van Kinh. - Chairman of Editorial Board\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"Prof. Dr. Nguyen Van Mui.\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Headquarter:\"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Address:\"},{\"insert\":\" Level 6, National Hospital for Tropical Diseases, No. 78 Giai Phong Street, Dong Da District, Hanoi city, Vietnam.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Tel:\"},{\"insert\":\" \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:02435765464\"},\"insert\":\"02435765464\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913552672\"},\"insert\":\"0913552672\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913228072\"},\"insert\":\"0913228072\"},{\"insert\":\".\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Email\"},{\"insert\":\": \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Findex\u002Fadmin\u002Fcontexts\u002Fmailto:tungphamvan52@gmail.com\"},\"insert\":\"tungphamvan52@gmail.com\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Fmailto:tapchitruyennhiem@gmail.com\"},\"insert\":\"tapchitruyennhiem@gmail.com\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Bank account:\"},{\"insert\":\" 0021000275119, Vietcombank Hanoi Branch. Transaction office No. 7, 402 Tran Khat Chan, Hai Ba Trung District, Hanoi city, Vietnam.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}","{\"ops\":[{\"insert\":\"Tạp chí Truyền nhiễm Việt Nam là cơ quan ngôn luận của Hội Truyền nhiễm Việt Nam, chịu sự lãnh đạo, chỉ đạo trực tiếp của Thường vụ Ban Chấp hành Hội Truyền nhiễm Việt Nam; sự kiểm tra, giám sát về nghiệp vụ báo chí của các cơ quan chức năng quản lý báo chí thuộc Bộ Thông tin và Truyền thông và Ban Tuyên giáo Trung ương Đảng.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Tạp chí có trách nhiệm giới thiệu các công trình nghiên cứu khoa học, những tiến bộ khoa học trên thế giới và trong nước, góp phần nâng cao kiến thức khoa học cho cán bộ y tế về lâm sàng, điều trị, hướng dẫn, dự phòng, dịch tễ học các bệnh truyền nhiễm, HIV\u002FAIDS và chăm sóc sức khỏe cộng đồng; cung cấp, trao đổi, phổ biến các thông tin khoa học tới công chúng chính xác và kịp thời.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Tạp chí xuất bản 03 tháng\u002F01 kỳ và được phát hành qua Bưu điện và tự phát hành trong phạm vi toàn quốc.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Lãnh đạo Tạp chí: \"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"insert\":\"Tổng Biên tập: ThS.BSCKII Nguyễn Trung Cấp\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"Phó Tổng Biên tập:\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"            TS.BSCKII Phạm Ngọc Thạch\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Trụ sở tòa soạn:\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Địa chỉ: Tầng 6, Bệnh viện Bệnh Nhiệt đới Trung ương, 78 đường Giải Phóng, phường Phương Mai, quận Đống Đa, thành phố Hà Nội.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Điện thoại:\"},{\"insert\":\" \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:02435765464\"},\"insert\":\"02435765464\"},{\"insert\":\" - \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913228072\"},\"insert\":\"0913228072\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Email\"},{\"insert\":\": \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Findex\u002Fadmin\u002Fcontexts\u002Fmailto:tungphamvan52@gmail.com\"},\"insert\":\"tungphamvan52@gmail.com\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Fmailto:tapchitruyennhiem@gmail.com\"},\"insert\":\"tapchitruyennhiem@gmail.com\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Tài khoản:\"},{\"insert\":\" Số 0021000275119 Ngân hàng Ngoại thương Việt Nam, chi nhánh Hà Nội (Vietcombank Hà Nội). Phòng giao dịch số 7, 402 Trần Khát Chân, quận Hai Bà Trưng, Thành phố Hà Nội.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}",{"EN":22,"VI":23},"Vietnam Journal of Infectious Diseases","Tạp chí Truyền nhiễm Việt Nam","PUBLISHER","VERIFIED",null,"Admin update database","PENDING",51,[],[],[],"https:\u002F\u002Ftruyennhiemvietnam.vn\u002Findex.php\u002Fvjid","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F5a09599f-54d1-44c3-8f16-3847ac552024\u002Fadb0e52bf25e0de580fd4289519cb8bf.jpg",{"impactFactor":36,"impactFactorByYear":37,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":41,"totalPublicationByYear":42,"totalCitation":48,"totalCitationByYear":49,"totalCitationPerPublication":54,"totalCitationPerPublicationByYear":55,"hindexLast5Year":59,"hindex":59},0,{"2022":38,"2023":39,"2024":40},0.01,0.03,0.13,315,{"2020":43,"2021":44,"2022":45,"2023":46,"2024":47},63,58,57,65,72,43,{"2020":50,"2021":51,"2022":52,"2023":53},8,15,9,11,0.14,{"2020":40,"2021":56,"2022":57,"2023":58},0.26,0.16,0.17,3,{"id":61,"createTime":62,"updateTime":63,"relativeEntities":64,"slug":65,"properties":66,"entityType":24,"verifyStatus":25,"verifyTime":78,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":79,"subjectFields":80,"manageAffiliations":81,"indexDatabases":136,"url":137,"thumbnailPath":26,"statistic":138,"gsStatistic":155,"type":175,"analyzePriority":26},"25b6bd10-676c-40c0-8dc3-356d1679a284","2023-05-19T02:22:33.430+00:00","2026-06-18T23:33:57.141+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":67,"issn":68,"introduce":70,"title":73,"gsId":76},{"VOID":15},{"VOID":69},"23541210",{"EN":71,"VI":72},"\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>",{"EN":74,"VI":75},"Cantho Journal of Medicine and Pharmacy","Tạp chí Y Dược học Cần Thơ",{"VOID":77},"wcQ1uqwAAAAJ","2023-05-30T08:17:21.868+00:00",32,[],[82],{"id":83,"createTime":84,"updateTime":85,"relativeEntities":86,"slug":87,"properties":88,"entityType":98,"verifyStatus":25,"verifyTime":99,"verifyNote":26,"syncStatus":28,"languages":100,"translateLanguages":26,"viewCount":103,"url":104,"parentIds":105,"statistic":106},"6413896b-eca9-442b-a73f-182a58a0ce40","2023-06-12T14:59:13.446+00:00","2026-06-19T02:29:32.871+00:00",[],"Tr%C6%B0%E1%BB%9Dng-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Y-D%C6%B0%E1%BB%A3c-C%E1%BA%A7n-Th%C6%A1",{"country":89,"title":90,"address":93,"abbreviation":96},{"VOID":15},{"EN":91,"VI":92},"Can Tho University of Medicine and Pharmacy","Trường Đại học Y Dược Cần Thơ",{"VI":94,"EN":95},"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","No 179, Nguyen Van Cu street, An Khanh ward, Ninh Kieu district, Can Tho city, Vietnam",{"VOID":97},"ctump","AFFILIATION","2023-08-01T14:07:27.977+00:00",[101,102],"VI","EN",12,"http:\u002F\u002Fwww.ctump.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":107,"i10Index":111,"i10IndexLast5Year":59,"totalPublication":112,"totalPublicationByYear":113,"totalCitation":122,"totalCitationByYear":123,"totalCitationPerPublication":128,"totalCitationPerPublicationByYear":129,"hindexLast5Year":135,"hindex":135},{"2022":108,"2023":109,"2024":110,"2025":38},0.1,0.05,0.07,4,1489,{"2013":114,"2014":115,"2015":115,"2016":111,"2017":115,"2018":59,"2019":114,"2020":116,"2021":117,"2022":118,"2023":119,"2024":120,"2025":121,"2026":111},2,1,10,84,281,680,260,156,313,{"2013":59,"2014":114,"2018":124,"2021":125,"2022":126,"2023":127},17,36,123,132,0.21,{"2013":130,"2014":114,"2018":131,"2021":132,"2022":133,"2023":134},1.5,5.67,0.43,0.44,0.19,6,[],"https:\u002F\u002Ftapchi.ctump.edu.vn\u002Findex.php\u002Fctump",{"impactFactor":36,"impactFactorByYear":139,"i10Index":114,"i10IndexLast5Year":114,"totalPublication":140,"totalPublicationByYear":141,"totalCitation":147,"totalCitationByYear":148,"totalCitationPerPublication":151,"totalCitationPerPublicationByYear":152,"hindexLast5Year":135,"hindex":135},{"2022":38,"2023":36,"2024":39,"2025":38},1956,{"0":114,"2019":114,"2020":50,"2021":142,"2022":143,"2023":144,"2024":145,"2025":146},76,403,789,305,371,524,{"0":114,"2019":135,"2021":124,"2022":149,"2023":150,"2024":111,"2025":114},287,206,0.27,{"0":115,"2019":59,"2021":153,"2022":154,"2023":56,"2024":38,"2025":38},0.22,0.71,{"impactFactor":26,"impactFactorByYear":26,"i10Index":114,"i10IndexLast5Year":114,"totalPublication":156,"totalPublicationByYear":157,"totalCitation":163,"totalCitationByYear":164,"totalCitationPerPublication":169,"totalCitationPerPublicationByYear":170,"hindexLast5Year":135,"hindex":135},461,{"0":158,"2019":114,"2021":159,"2022":160,"2023":161,"2024":158,"2025":162},7,37,296,107,5,419,{"2021":59,"2022":59,"2023":165,"2024":166,"2025":167,"2026":168},71,126,171,41,0.91,{"2021":171,"2022":38,"2023":172,"2024":173,"2025":174},0.08,0.66,18,34.2,"JOURNAL",{"id":177,"createTime":178,"updateTime":179,"relativeEntities":180,"slug":181,"properties":182,"entityType":24,"verifyStatus":25,"verifyTime":193,"verifyNote":26,"syncStatus":28,"languages":194,"translateLanguages":26,"viewCount":36,"subjectFields":195,"manageAffiliations":196,"indexDatabases":197,"url":198,"thumbnailPath":26,"statistic":26,"gsStatistic":199,"type":175,"analyzePriority":26},"f8d0bf97-8d89-482e-b58c-2fc481a0b79b","2025-10-27T06:27:08.591+00:00","2026-06-18T23:33:41.667+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":183,"introduce":184,"gsId":186,"title":188,"issn":191},{"VOID":15},{"EN":185},"\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":187},"MS2_GJQAAAAJ",{"VI":189,"EN":190},"Tạp chí Khoa học và Công nghệ nhiệt đới","Journal of Tropical Science and Engineering",{"VOID":192},"08667535","2025-10-27T06:27:25.058+00:00",[101,102],[],[],[],"https:\u002F\u002Ftapchikhcnnd.com.vn",{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":200,"totalPublicationByYear":201,"totalCitation":161,"totalCitationByYear":203,"totalCitationPerPublication":153,"totalCitationPerPublicationByYear":205,"hindexLast5Year":114,"hindex":114},481,{"0":115,"2020":115,"2021":115,"2022":114,"2024":115,"2025":202,"2026":115},474,{"2017":114,"2018":115,"2019":111,"2020":162,"2021":162,"2022":116,"2023":50,"2024":162,"2025":204,"2026":52},52,{"2020":162,"2021":162,"2022":162,"2024":162,"2025":206,"2026":52},0.11,{"id":208,"createTime":209,"updateTime":210,"relativeEntities":211,"slug":212,"properties":213,"entityType":24,"verifyStatus":25,"verifyTime":221,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":222,"subjectFields":223,"manageAffiliations":224,"indexDatabases":225,"url":226,"thumbnailPath":26,"statistic":227,"gsStatistic":276,"type":175,"analyzePriority":26},"a3d1e82a-57e2-40f9-940e-f5fa8b9ef64a","2023-06-01T07:11:26.039+00:00","2026-06-18T23:33:28.573+00:00",[],"VNU-Journal-of-Science-Earth-and-Environmental-Sciences",{"issn":214,"title":216,"country":218,"gsId":219},{"VOID":215},"26159279",{"EN":217},"VNU Journal of Science: Earth and Environmental Sciences",{"VOID":15},{"VOID":220},"UmXD8vEAAAAJ","2023-06-01T07:17:59.210+00:00",27,[],[],[],"https:\u002F\u002Fjs.vnu.edu.vn\u002FEES",{"impactFactor":36,"impactFactorByYear":228,"i10Index":234,"i10IndexLast5Year":36,"totalPublication":235,"totalPublicationByYear":236,"totalCitation":246,"totalCitationByYear":247,"totalCitationPerPublication":261,"totalCitationPerPublicationByYear":262,"hindexLast5Year":103,"hindex":103},{"2010":229,"2012":40,"2013":230,"2014":230,"2015":231,"2016":54,"2017":171,"2018":109,"2019":110,"2020":57,"2021":232,"2022":233,"2023":151,"2024":58},0.02,0.04,0.09,0.31,0.4,19,656,{"2008":237,"2009":238,"2010":239,"2011":238,"2012":240,"2013":241,"2014":239,"2015":242,"2016":243,"2017":244,"2018":245,"2019":165,"2020":125,"2021":168,"2022":125,"2023":222,"2024":111},23,24,22,28,25,20,146,29,78,1038,{"2008":248,"2009":249,"2010":250,"2011":251,"2012":252,"2013":253,"2014":254,"2015":255,"2016":256,"2017":257,"2018":161,"2019":258,"2020":259,"2021":29,"2022":260},119,64,66,86,38,73,59,31,129,39,97,53,26,1.58,{"2008":263,"2009":264,"2010":59,"2011":265,"2012":266,"2013":267,"2014":268,"2015":269,"2016":270,"2017":271,"2018":272,"2019":272,"2020":273,"2021":274,"2022":275},5.17,2.67,3.58,1.36,2.92,2.68,1.55,0.88,1.34,1.37,1.47,1.24,0.72,{"impactFactor":26,"impactFactorByYear":26,"i10Index":173,"i10IndexLast5Year":135,"totalPublication":277,"totalPublicationByYear":278,"totalCitation":279,"totalCitationByYear":280,"totalCitationPerPublication":288,"totalCitationPerPublicationByYear":289,"hindexLast5Year":158,"hindex":298},113,{"2007":114,"2008":103,"2009":173,"2010":116,"2011":51,"2012":239,"2013":103,"2014":162,"2015":53,"2016":135},616,{"2009":162,"2010":114,"2011":52,"2012":124,"2013":222,"2014":255,"2015":48,"2016":44,"2017":281,"2018":282,"2019":259,"2020":283,"2021":284,"2022":285,"2023":286,"2024":257,"2025":287,"2026":59},54,60,49,47,34,44,33,5.45,{"2009":290,"2010":291,"2011":292,"2012":293,"2013":294,"2014":295,"2015":296,"2016":297},0.28,0.2,0.6,0.77,2.25,6.2,3.91,9.67,14,{"id":300,"createTime":301,"updateTime":302,"relativeEntities":303,"slug":304,"properties":305,"entityType":24,"verifyStatus":25,"verifyTime":316,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":234,"subjectFields":317,"manageAffiliations":318,"indexDatabases":388,"url":389,"thumbnailPath":390,"statistic":391,"gsStatistic":409,"type":175,"analyzePriority":26},"a7166325-6c9e-4db3-8a59-7c879701a372","2023-07-31T04:28:49.231+00:00","2026-06-18T23:33:22.428+00:00",[],"VNU-Journal-of-Science-Policy-and-Management-Studies",{"country":306,"issn":307,"eissn":309,"title":311,"gsId":314},{"VOID":15},{"VOID":308},"26159295",{"VOID":310},"25881116",{"EN":312,"VI":313},"VNU Journal of Science: Policy and Management Studies","Tạp chí Nghiên cứu Chính sách và Quản lý",{"VOID":315},"xKW2E_cAAAAJ","2023-08-01T03:23:46.688+00:00",[],[319],{"id":320,"createTime":321,"updateTime":322,"relativeEntities":323,"slug":324,"properties":325,"entityType":98,"verifyStatus":25,"verifyTime":335,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":336,"url":337,"parentIds":338,"statistic":339},"12466116-8f60-4b01-8faf-2411483a0977","2023-05-30T09:37:38.472+00:00","2026-06-19T02:14:28.352+00:00",[],"Vietnam-National-University",{"country":326,"title":327,"abbreviation":330,"address":332},{"VOID":15},{"EN":328,"VI":329},"Vietnam National University, Hanoi","Đại học Quốc gia Hà Nội",{"VOID":331},"VNU",{"VI":333,"EN":334},"Số 144 Xuân Thủy, Phường Dịch Vọng Hậu, Quận Cầu Giấy, Hà Nội, Việt Nam","No. 144 Xuan Thuy Street, Dich Vong Hau Ward, Cau Giay District, Hanoi, Vietnam","2023-08-02T13:58:17.029+00:00",16,"http:\u002F\u002Fwww.vnu.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":340,"i10Index":285,"i10IndexLast5Year":162,"totalPublication":344,"totalPublicationByYear":345,"totalCitation":354,"totalCitationByYear":355,"totalCitationPerPublication":368,"totalCitationPerPublicationByYear":369,"hindexLast5Year":336,"hindex":336},{"2014":109,"2015":231,"2016":231,"2017":206,"2018":341,"2019":110,"2020":342,"2021":343,"2022":171,"2023":231,"2024":110,"2025":39},0.06,0.18,0.35,1247,{"2003":115,"2004":115,"2005":114,"2006":59,"2007":111,"2008":162,"2009":59,"2010":50,"2011":124,"2012":336,"2013":260,"2014":244,"2015":250,"2016":281,"2017":346,"2018":347,"2019":348,"2020":349,"2021":350,"2022":351,"2023":352,"2024":353,"2025":255,"2026":50},94,88,83,67,176,185,187,93,1644,{"2004":111,"2005":115,"2006":52,"2007":298,"2008":356,"2009":298,"2010":286,"2011":357,"2012":244,"2013":358,"2014":359,"2015":360,"2016":361,"2017":362,"2018":363,"2019":364,"2020":365,"2021":366,"2022":367,"2023":367,"2024":162},13,81,48,70,151,115,109,259,174,181,121,101,1.32,{"2004":111,"2005":370,"2006":59,"2007":371,"2008":372,"2009":373,"2010":374,"2011":375,"2012":376,"2013":377,"2014":378,"2015":379,"2016":380,"2017":381,"2018":382,"2019":383,"2020":384,"2021":385,"2022":386,"2023":387,"2024":109},0.5,3.5,2.6,4.67,5.5,4.76,1.81,1.85,2.41,2.29,2.13,1.16,2.94,2.1,2.7,0.69,0.55,0.54,[],"https:\u002F\u002Fjs.vnu.edu.vn\u002FPaM","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002Fa7166325-6c9e-4db3-8a59-7c879701a372\u002Fecfe83f4bcc60c7023ae04d8900fe0ac.jpg",{"impactFactor":36,"impactFactorByYear":392,"i10Index":111,"i10IndexLast5Year":36,"totalPublication":394,"totalPublicationByYear":395,"totalCitation":399,"totalCitationByYear":400,"totalCitationPerPublication":293,"totalCitationPerPublicationByYear":403,"hindexLast5Year":158,"hindex":158},{"2018":109,"2019":171,"2020":393,"2021":108,"2022":54,"2023":206,"2024":54},0.23,320,{"2015":50,"2016":239,"2017":286,"2018":396,"2019":397,"2020":159,"2021":398,"2022":168,"2023":79,"2024":255},30,35,40,247,{"2015":115,"2016":242,"2017":401,"2018":222,"2019":402,"2020":79,"2021":239,"2022":50,"2023":116},77,50,{"2015":404,"2016":169,"2017":405,"2018":406,"2019":407,"2020":408,"2021":386,"2022":291,"2023":232},0.12,1.75,0.9,1.43,0.86,{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":103,"totalPublicationByYear":410,"totalCitation":234,"totalCitationByYear":411,"totalCitationPerPublication":261,"totalCitationPerPublicationByYear":412,"hindexLast5Year":114,"hindex":59},{"2015":114,"2016":116},{"2016":115,"2017":114,"2018":114,"2019":59,"2020":114,"2021":59,"2022":114,"2023":114,"2024":115,"2026":115},{"2016":108},{"id":414,"createTime":415,"updateTime":416,"relativeEntities":417,"slug":418,"properties":419,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":238,"subjectFields":428,"manageAffiliations":429,"indexDatabases":430,"url":431,"thumbnailPath":26,"statistic":432,"gsStatistic":438,"type":175,"analyzePriority":26},"16e65a3f-d274-47dd-8691-56d76eb58c3d","2023-05-30T09:10:06.062+00:00","2026-06-18T23:33:17.679+00:00",[],"Vietnam-Journal-of-Otorhinolaryngology-Head-and-Neck-Surgery",{"country":420,"issn":421,"title":423,"gsId":426},{"VOID":15},{"VOID":422},"18593704",{"EN":424,"VI":425},"Vietnam Journal of Otorhinolaryngology - Head and Neck Surgery","Tạp chí Tai Mũi Họng Việt Nam",{"VOID":427},"L78B_eIAAAAJ",[],[],[],"https:\u002F\u002Ftapchitaimuihong.vn\u002Findex.php\u002Ftmh",{"impactFactor":36,"impactFactorByYear":433,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":434,"totalPublicationByYear":435,"totalCitation":111,"totalCitationByYear":436,"totalCitationPerPublication":230,"totalCitationPerPublicationByYear":437,"hindexLast5Year":115,"hindex":115},{"2024":229},95,{"2022":52,"2023":286,"2024":255,"2025":53},{"2023":111},{"2023":231},{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":240,"totalPublicationByYear":439,"totalCitation":234,"totalCitationByYear":440,"totalCitationPerPublication":441,"totalCitationPerPublicationByYear":442,"hindexLast5Year":114,"hindex":114},{"2023":53,"2024":116,"2025":135,"2026":115},{"2024":59,"2025":298,"2026":114},0.68,{"2024":443,"2025":444,"2026":114},0.3,2.33,{"id":446,"createTime":447,"updateTime":448,"relativeEntities":449,"slug":450,"properties":451,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":396,"subjectFields":460,"manageAffiliations":461,"indexDatabases":462,"url":463,"thumbnailPath":464,"statistic":465,"gsStatistic":472,"type":175,"analyzePriority":26},"25988add-c322-4eda-afda-63b1559bb824","2023-04-07T03:49:55.817+00:00","2026-06-18T23:32:23.776+00:00",[],"T%E1%BA%A1p%20ch%C3%AD%20Y%20-%20D%C6%B0%E1%BB%A3c%20h%E1%BB%8Dc%20qu%C3%A2n%20s%E1%BB%B1",{"country":452,"issn":453,"title":455,"gsId":458},{"VOID":15},{"VOID":454},"18590748",{"EN":456,"VI":457},"Journal of Military Pharmaco-medicine","Tạp chí Y - Dược học quân sự",{"VOID":459},"_pmQ8IEAAAAJ",[],[],[],"https:\u002F\u002Fjmpm.vn\u002Findex.php\u002Fjmpm","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F25988add-c322-4eda-afda-63b1559bb824\u002F09c6bc42157cf5ece95edc971ccddb52.jpg",{"impactFactor":36,"impactFactorByYear":466,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":467,"totalPublicationByYear":468,"totalCitation":135,"totalCitationByYear":470,"totalCitationPerPublication":38,"totalCitationPerPublicationByYear":471,"hindexLast5Year":115,"hindex":115},{"2023":229,"2024":38},475,{"2022":168,"2023":365,"2024":469,"2025":124},236,{"2022":114,"2023":111},{"2022":109,"2023":229},{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":277,"totalPublicationByYear":473,"totalCitation":401,"totalCitationByYear":474,"totalCitationPerPublication":441,"totalCitationPerPublicationByYear":475,"hindexLast5Year":59,"hindex":59},{"2015":115,"2018":114,"2019":115,"2020":115,"2021":59,"2022":103,"2023":159,"2024":287,"2025":237},{"2020":115,"2021":115,"2022":115,"2023":52,"2024":237,"2025":79,"2026":116},{"2020":115,"2021":476,"2022":171,"2023":477,"2024":478,"2025":479},0.33,0.24,0.7,1.39,{"id":481,"createTime":482,"updateTime":483,"relativeEntities":484,"slug":485,"properties":486,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":496,"translateLanguages":26,"viewCount":45,"subjectFields":497,"manageAffiliations":498,"indexDatabases":525,"url":526,"thumbnailPath":527,"statistic":528,"gsStatistic":26,"type":26,"analyzePriority":26},"2b8d7b12-2d20-4777-be98-077f44f03c69","2023-09-07T07:40:58.286+00:00","2025-07-13T21:21:00.542+00:00",[],"VNU-Journal-of-Social-Sciences-and-Humanities",{"country":487,"issn":488,"introduce":490,"title":493},{"VOID":15},{"VOID":489},"23541172",{"EN":491,"VI":492},"{\"ops\":[{\"insert\":\"VNU Journal of Social Sciences and Humanities (ISSN 2354-1172) is a double-blind peer-reviewed journal published by University of Social Sciences and Humanities, Vietnam National University, Hanoi, Vietnam, under the publication permit no. 155\u002FGP-BTTTT, issued on 11\"},{\"attributes\":{\"script\":\"super\"},\"insert\":\"th \"},{\"insert\":\"May, 2015 by Ministry of Information and Communications. The journal publishes four Vietnamese issues and two English issues per year.\\nCurrently, there are 35 reputable professors in the editorial board. The main objectives of the journal include: providing an intellectual platform for Vietnamese and international scholars; promoting interdisciplinary studies in social sciences and humanities; becoming the leading journal in social sciences and humanities in Vietnam; being indexed by worldwide databases and having academic recognition internationally in the near future.\\nThe journal is currently indexed by Google Scholar, WorldCat, Open Archives, Cosmos Impact Factor, Advanced Sciences Index, Scientific Indexing Services, CrossRef, EBSCO Information Services and Vietnam National University’s digital archive.\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Journal of Social Sciences and Humanities-Vietnam\"},{\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"ISSN 2354-1172, email: tapchikhxhnv@gmail.com, tckhxhnv@vnu.edu.vn\"},{\"insert\":\"\\n\"}]}","{\"ops\":[{\"insert\":\"Được thành lập ngày 31\u002F8\u002F2015 (giấy phép hoạt động số 155\u002FGP-BVHTT ngày 11 tháng 5 năm 2015 của Bộ Thông tin và Truyền thông, mã số tiêu chuẩn quốc tế ISSN 2354-1172), Tạp chí Khoa học Xã hội và Nhân văn (Journal of Social Sciences and Humanities) là ấn phẩm khoa học chính thức, duy nhất của Trường Đại học Khoa học Xã hội và Nhân văn, ĐHQG Hà Nội, phát triển và kế thừa Chuyên san Khoa học Xã hội và Nhân văn, Tạp chí Khoa học, ĐHQG Hà Nội.\\nTạp chí xuất bản định kỳ (04 số tiếng Việt\u002Fnăm và 02 số tiếng Anh\u002Fnăm), có nhiệm vụ \"},{\"attributes\":{\"italic\":true},\"insert\":\"công bố, giới thiệu các công trình nghiên cứu khoa học khoa học xã hội và nhân văn của các tác giả là các nhà khoa học trong và ngoài nước, phục vụ giảng dạy, học tập và nghiên cứu khoa học\"},{\"insert\":\". Hội đồng biên tập của Tạp chí hiện bao gồm 33 nhà khoa học có uy tín trong nước và quốc tế. Tạp chí tập trung và ưu tiên đăng tải những bài báo theo định hướng của tinh thần cởi mở, sáng tạo, nhanh chóng vươn lên để tiếp cận và sánh ngang với các tạp chí có uy tín hàng đầu của khu vực và trên thế giới. Nội dung chính của Tạp chí bao gồm các Bài nghiên cứu (khoảng 6000 đến 15000 từ), các bài điểm sách, thông tin khoa học (khoảng 300 đến 1500 từ) được trình bày theo đúng cấu trúc và chuẩn mực của một tạp chí khoa học.\\nCác bài viết của Tạp chí hiện đang được trích dẫn bởi Google Scholar, WorldCat, Open Archives, Cosmos Impact Factor, Advanced Sciences Index, Scientific Indexing Services, CrossRef, EBSCO Information Services.\\nMọi thông tin xin liên hệ: \"},{\"attributes\":{\"italic\":true},\"insert\":\"Phòng Tạp chí, 701 - E, Trường Đại học Khoa học Xã hội và Nhân văn, 336 Nguyễn Trãi, Thanh Xuân, Hà Nội. ĐT: 024.35581984; email: tckhxhnv@vnu.edu.vn \"},{\"insert\":\"hoặc \"},{\"attributes\":{\"italic\":true},\"insert\":\"tapchikhxhnv@gmail.com \"},{\"insert\":\"\\n\"}]}",{"EN":494,"VI":495},"VNU Journal of Social Sciences and Humanities","Tạp chí Khoa học Xã hội và Nhân văn",[101,102],[],[499],{"id":500,"createTime":501,"updateTime":502,"relativeEntities":503,"slug":504,"properties":505,"entityType":98,"verifyStatus":25,"verifyTime":509,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":222,"url":26,"parentIds":510,"statistic":511},"8b6e349b-0daf-4895-9c3f-85f30f1bfd42","2023-07-31T12:55:58.430+00:00","2026-06-19T02:30:07.899+00:00",[],"Tr%C6%B0%E1%BB%9Dng-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Khoa-h%E1%BB%8Dc-X%C3%A3-h%E1%BB%99i-v%C3%A0-Nh%C3%A2n-v%C4%83n-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-H%C3%A0-N%E1%BB%99i",{"title":506},{"EN":507,"VI":508},"VNU University of Social Sciences and Humanities","Trường Đại học Khoa học Xã hội và Nhân văn, Đại học Quốc gia Hà Nội","2023-08-02T15:28:49.057+00:00",[],{"impactFactor":36,"impactFactorByYear":512,"i10Index":59,"i10IndexLast5Year":115,"totalPublication":514,"totalPublicationByYear":515,"totalCitation":518,"totalCitationByYear":519,"totalCitationPerPublication":520,"totalCitationPerPublicationByYear":521,"hindexLast5Year":162,"hindex":162},{"2016":229,"2017":230,"2018":229,"2021":230,"2022":58,"2023":513,"2024":38},0.15,365,{"2013":115,"2014":158,"2015":125,"2016":252,"2017":44,"2018":516,"2019":286,"2020":396,"2021":259,"2022":517,"2023":396,"2024":115,"2025":59,"2026":115},21,42,169,{"2015":283,"2016":135,"2017":52,"2018":50,"2019":298,"2020":53,"2021":359,"2022":115,"2023":115},0.46,{"2015":266,"2016":57,"2017":57,"2018":522,"2019":523,"2020":524,"2021":368,"2022":229,"2023":39},0.38,0.32,0.37,[],"http:\u002F\u002Fjournal.ussh.vnu.edu.vn\u002Findex.php\u002Fvjossh","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F2b8d7b12-2d20-4777-be98-077f44f03c69\u002F0bd0751202944a4b4165b482e6e623e4.png",{"impactFactor":36,"impactFactorByYear":529,"i10Index":162,"i10IndexLast5Year":115,"totalPublication":530,"totalPublicationByYear":531,"totalCitation":537,"totalCitationByYear":538,"totalCitationPerPublication":343,"totalCitationPerPublicationByYear":540,"hindexLast5Year":135,"hindex":135},{"2016":341,"2017":39,"2018":229,"2019":38,"2020":110,"2021":231,"2022":231,"2023":341,"2024":39},764,{"2015":255,"2016":245,"2017":532,"2018":259,"2019":533,"2020":534,"2021":535,"2022":536,"2023":534,"2024":254,"2025":50},111,106,68,92,89,265,{"2015":539,"2016":241,"2017":168,"2018":51,"2019":349,"2020":260,"2021":244,"2022":298,"2023":114},46,{"2015":541,"2016":523,"2017":524,"2018":290,"2019":542,"2020":522,"2021":523,"2022":57,"2023":39},1.48,0.63,{"id":544,"createTime":545,"updateTime":546,"relativeEntities":547,"slug":548,"properties":549,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":558,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":50,"subjectFields":559,"manageAffiliations":560,"indexDatabases":561,"url":562,"thumbnailPath":563,"statistic":564,"gsStatistic":26,"type":26,"analyzePriority":26},"6ec01bd0-15c0-469a-86ac-41339076ae0a","2023-08-10T07:08:33.153+00:00","2026-01-31T21:19:06.362+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Da-li%E1%BB%85u-h%E1%BB%8Dc-Vi%E1%BB%87t-Nam",{"country":550,"issn":551,"introduce":553,"title":555},{"VOID":15},{"VOID":552},"18594824",{"VI":554},"{\"ops\":[{\"insert\":\"Tạp chí “Da liễu học Việt Nam” (Tiếng Anh: Vietnamese Journal of Dermatology and Venereology) thuộc Hội Da liễu Việt Nam, xuất bản 4 số mỗi năm bằng tiếng Việt hoặc tiếng Anh.\\nTạp chí Da liễu học Việt Nam hoạt động với mục đích, tôn chỉ là phổ biến, trao đổi thông tin trong lĩnh vực chuyên ngành da liễu; đăng tải các công trình nghiên cứu khoa học; chuyển giao công nghệ - kinh tế và khoa học kỹ thuật liên quan đến lĩnh vực da liễu.\\nPhạm vi của tạp chí là tất cả các bài báo khoa học, bài tổng quan, giới thiệu ca lâm sàng, … có liên quan tới chuyên ngành da liễu trong và ngoài nước. Tạp chí công bố các công trình nghiên cứu liên quan đến mô hình bệnh tật, các phương pháp chẩn đoán, điều trị, dự phòng và phục hồi chức năng các bệnh thuộc chuyên ngành da liễu. Ngoài ra, tạp chí còn đăng tải các bài tổng quan, cập nhật thông tin, kiến thức, hướng dẫn chẩn đoán, điều trị trong chuyên ngành da liễu trong nước và quốc tế; đăng tải các bài ca lâm sàng đặc biệt trong chuyên ngành da liễu.\\nTạp chí Da liễu học Việt Nam được biết tới là một tạp chí chuyên ngành có uy tín trong lĩnh vực da liễu. Các bài báo về nghiên cứu khoa học đăng trong Tạp chí được bình duyệt một cách nghiêm ngặt bởi ít nhất 2 chuyên gia. Hội đồng biên tập tạp chí bao gồm các nhà khoa học có uy tín (Giáo sư, Phó Giáo sư, Tiến sĩ, Bác sĩ…) trong chuyên ngành da liễu nhằm đảm bảo chất lượng và tính khách quan, khoa học cho các bài viết đăng trên Tạp chí.\\n\"}]}",{"EN":556,"VI":557},"Vietnamese Journal of Dermatology and Venereology","Tạp chí Da liễu học Việt Nam","Admin Import",[],[],[],"https:\u002F\u002Fvjdv.vn\u002Findex.php\u002Fvjdv","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F6ec01bd0-15c0-469a-86ac-41339076ae0a\u002F3cbc81720e58429dc7b1c4d7ab1935ca.jpg",{"impactFactor":36,"impactFactorByYear":565,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":566,"totalPublicationByYear":567,"totalCitation":116,"totalCitationByYear":570,"totalCitationPerPublication":109,"totalCitationPerPublicationByYear":571,"hindexLast5Year":115,"hindex":115},{"2023":38,"2024":230},182,{"2022":568,"2023":45,"2024":569},69,56,{"2022":52,"2023":115},{"2022":40,"2023":229},{"id":573,"createTime":574,"updateTime":575,"relativeEntities":576,"slug":577,"properties":578,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":587,"translateLanguages":26,"viewCount":283,"subjectFields":588,"manageAffiliations":589,"indexDatabases":647,"url":648,"thumbnailPath":649,"statistic":650,"gsStatistic":26,"type":26,"analyzePriority":26},"19221551-7519-47ff-a892-331d1139c64b","2023-09-12T07:03:05.744+00:00","2026-01-24T20:54:40.144+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Khoa-h%E1%BB%8Dc-S%E1%BB%A9c-kho%E1%BA%BB-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-Th%C3%A0nh-ph%E1%BB%91-H%E1%BB%93-Ch%C3%AD-Minh",{"country":579,"issn":580,"introduce":582,"title":584},{"VOID":15},{"VOID":581},"27349446",{"EN":583},"{\"ops\":[{\"attributes\":{\"bold\":true},\"insert\":\"1. History\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Science and Technology Development Journal\"},{\"insert\":\" (STDJ) (ISSN 2734-9446), Vietnam National University - Ho Chi Minh City (VNU-HCM) was established in 1997. And the first issue was published in January 1998 with ISSN 1859-0128. Since then, STDJ has become the most important scientific forum of scientists from VNU-HCM as well as other universities. The magazine has undergone 20 years of development and has become a bridge for scientific exchanges, as well as enriching reference materials for the faculty, doctoral students, students of VNU-HCM in particular and other universities, institutes...\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Science and Technology Development Journal - Health Sciences (STDJ-HS) is a subjournal of Science and Technology Development Journal since 2020.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\" \"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"2. Focus and Scope\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Publishing articles with contents on healthcare, research projects in the field of health, advanced directions in health education and management. Therefore, STDJ-HS will accept articles from doctors, administrators, teachers, researchers, graduate students and fellows. The authors will be responsible for the accuracy of the data, opinions, opinions and material cited in the article.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Facilitating the exchange of scientific and technological information and act as a bridge between theory and practice in the community of educators, scientists, managers, policy makers and enterprises in and out of the country.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}",{"EN":585,"VI":586},"VNUHCM JOURNAL OF HEALTH SCIENCES","Tạp chí Khoa học Sức khoẻ Đại học Quốc gia Thành phố Hồ Chí Minh",[101,102],[],[590],{"id":591,"createTime":592,"updateTime":593,"relativeEntities":594,"slug":595,"properties":596,"entityType":98,"verifyStatus":25,"verifyTime":606,"verifyNote":26,"syncStatus":28,"languages":607,"translateLanguages":26,"viewCount":608,"url":609,"parentIds":610,"statistic":611},"fc4c2560-868c-4677-acb1-8686bef88727","2023-06-26T04:48:23.774+00:00","2026-06-19T01:46:17.248+00:00",[],"%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-Th%C3%A0nh-ph%E1%BB%91-H%E1%BB%93-Ch%C3%AD-Minh",{"country":597,"title":598,"abbreviation":601,"address":603},{"VOID":15},{"EN":599,"VI":600},"Vietnam National University Ho Chi Minh City","Đại học Quốc gia Thành phố Hồ Chí Minh",{"VOID":602},"VNUHCM",{"VI":604,"EN":605},"khu phố 6, Phường Linh Trung, Thành phố Thủ Đức, Thành phố Hồ Chí Minh, Việt Nam","Quarter 6, Linh Trung Ward, Thu Duc City, Ho Chi Minh City, Vietnam","2023-08-16T14:13:07.134+00:00",[101,102],45,"https:\u002F\u002Fvnuhcm.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":612,"i10Index":285,"i10IndexLast5Year":51,"totalPublication":613,"totalPublicationByYear":614,"totalCitation":624,"totalCitationByYear":625,"totalCitationPerPublication":634,"totalCitationPerPublicationByYear":635,"hindexLast5Year":124,"hindex":124},{"2014":36,"2015":38,"2016":109,"2017":39,"2018":229,"2019":38,"2020":110,"2021":171,"2022":110,"2023":110,"2024":171,"2025":229},3708,{"2005":115,"2006":115,"2007":115,"2008":135,"2009":111,"2010":53,"2011":52,"2012":568,"2013":615,"2014":351,"2015":616,"2016":469,"2017":617,"2018":127,"2019":618,"2020":619,"2021":620,"2022":621,"2023":622,"2024":623,"2025":159,"2026":50},164,266,177,226,603,931,314,246,74,2399,{"2006":115,"2008":50,"2010":162,"2011":242,"2012":222,"2013":43,"2014":626,"2015":627,"2016":628,"2017":629,"2018":258,"2019":630,"2020":631,"2021":632,"2022":633,"2023":353,"2024":115},250,124,157,162,152,385,559,128,0.65,{"2006":115,"2008":636,"2010":637,"2011":638,"2012":639,"2013":522,"2014":640,"2015":641,"2016":642,"2017":643,"2018":644,"2019":642,"2020":645,"2021":292,"2022":646,"2023":522,"2024":38},1.33,0.45,2.22,0.39,1.35,0.47,0.67,0.92,0.73,0.64,0.41,[],"http:\u002F\u002Fstdjhs.scienceandtechnology.com.vn\u002Findex.php\u002Fstdjhs","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F19221551-7519-47ff-a892-331d1139c64b\u002F2e10768b7d1e380c36a25ed0c714dd7e.png",{"impactFactor":36,"impactFactorByYear":651,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":652,"totalPublicationByYear":653,"totalCitation":516,"totalCitationByYear":654,"totalCitationPerPublication":151,"totalCitationPerPublicationByYear":655,"hindexLast5Year":59,"hindex":59},{"2022":57,"2023":108,"2024":39},79,{"2020":116,"2021":240,"2022":239,"2023":52,"2024":162,"2025":162},{"2020":59,"2021":51,"2022":59},{"2020":443,"2021":387,"2022":54},{"code":657,"data":658,"meta":26},"SUCCESS",{"id":659,"createTime":660,"updateTime":661,"relativeEntities":662,"slug":663,"properties":664,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":669,"manageAffiliations":694,"indexDatabases":704,"url":26,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},"bc04808e-265e-415f-ac01-cc14425d4973","2023-12-05T05:46:38.315+00:00","2025-11-21T10:01:06.835+00:00",[],"Discrete-Optimization",{"issn":665,"title":667},{"VOID":666},"15725286",{"EN":668},"Discrete Optimization",[670,678,686],{"id":671,"createTime":672,"updateTime":673,"relativeEntities":674,"label":675,"description":677,"parentId":26,"standard":26,"scholarHubFieldId":26},"ee33e266-088e-4829-aa2f-5ea59917dac0","2023-05-29T10:24:03.075+00:00","2023-11-21T08:08:48.024+00:00",[],{"EN":676},"Applied Mathematics",{},{"id":679,"createTime":680,"updateTime":681,"relativeEntities":682,"label":683,"description":685,"parentId":26,"standard":26,"scholarHubFieldId":26},"e8c4e2fa-b139-4154-a158-595bd93d381c","2023-05-29T10:24:07.692+00:00","2023-11-21T07:15:31.396+00:00",[],{"EN":684},"Computational Theory and Mathematics",{},{"id":687,"createTime":688,"updateTime":689,"relativeEntities":690,"label":691,"description":693,"parentId":26,"standard":26,"scholarHubFieldId":26},"cfe20487-5108-4c23-a284-2aedca5fb76d","2023-05-29T10:24:09.965+00:00","2023-11-21T05:15:17.277+00:00",[],{"EN":692},"Theoretical Computer Science",{},[695],{"id":696,"createTime":697,"updateTime":698,"relativeEntities":699,"slug":700,"properties":701,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":53,"url":26,"parentIds":703,"statistic":26},"c749757b-dddf-4e6f-9697-b9c441adc06c","2023-05-29T10:24:07.401+00:00","2025-11-21T10:06:14.206+00:00",[],"Elsevier",{"title":702},{"EN":700},[],[705,726],{"id":706,"indexDatabase":707,"url":719,"indexYears":720,"academicFieldIds":721,"indexDatabaseRanking":725},"c003c4e7-8362-4ea1-bed4-b023f3383950",{"id":708,"createTime":709,"updateTime":710,"relativeEntities":711,"label":712,"description":714,"key":716,"publicationTags":717,"standard":26},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9","2023-05-22T09:57:18.509+00:00","2025-11-21T10:07:52.274+00:00",[],{"EN":713,"VI":713},"Scopus - Elsevier",{"EN":713,"VI":715},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[718],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F28469","2004-2025",[722,723,724],"bccef185-f7d5-4f2e-881a-2dc383ea6c57","8f050cfc-6be8-4218-91ba-e890405f0438","f58e9119-c14c-473f-8a7c-5a035e4ab69a","SCOPUS__Q2",{"id":727,"indexDatabase":728,"url":742,"indexYears":26,"academicFieldIds":743,"indexDatabaseRanking":26},"9986ddc4-096f-4591-ae7c-b63156c5ac70",{"id":729,"createTime":730,"updateTime":731,"relativeEntities":732,"label":733,"description":735,"key":738,"publicationTags":739,"standard":26},"a4921856-b128-4d9f-8f1f-e80813d3bbd4","2023-05-22T09:59:31.026+00:00","2025-11-21T10:07:52.153+00:00",[],{"EN":734,"VI":734},"ISI\u002FSCIE - Science Citation Index Expanded",{"VI":736,"EN":737},"Cơ sở dữ liệu SCIE","SCIE database","scie",[740,741],"SCIE","ISI","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=1572-5286",[744,745],"ef99e6f3-ace4-49a6-aa47-d5e24f7d2768","0a89cee9-2df6-4b14-8fcb-700fd0044c25",{"meta":747,"data":749},{"total":748},"290",[750,951,1160,1388,1473,1615,1838,1935,2032,2113],{"id":751,"createTime":752,"updateTime":752,"relativeEntities":753,"slug":754,"properties":755,"entityType":766,"verifyStatus":25,"verifyTime":767,"verifyNote":768,"syncStatus":28,"languages":769,"translateLanguages":26,"viewCount":36,"primaryUrl":770,"fullTextUrl":26,"authors":771,"publicationType":809,"publisherRelationship":810,"citationCount":52,"citationInfo":838,"publishDate":840,"publishYear":841,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":842,"isForceReanalyzing":950},"aa0a4c80-96da-4a72-a21e-7ef3e26cd2d5","2024-09-05T17:50:12.595+00:00",[],"On-some-tractable-and-hard-instances-for-partial-incentives-and-target-set-selection",{"mag":756,"keywords":758,"openalex":759,"abstract":761,"title":762,"doi":764},{"VOID":757},"2962944345",{},{"VOID":760},"W2962944345",{},{"EN":763},"On some tractable and hard instances for partial incentives and target set selection",{"VOID":765},"10.1016\u002Fj.disopt.2019.05.004","PUBLICATION","2024-09-05T17:50:12.594+00:00","Auto Verify",[102],"https:\u002F\u002Flinkinghub.elsevier.com\u002Fretrieve\u002Fpii\u002FS1572528618301166",[772,792],{"id":773,"sortIndex":36,"researcher":26,"roles":774,"affiliations":775,"properties":787},"ed743da0-1663-4020-aa8d-d6ad45b35c74",[],[776],{"id":777,"sortIndex":36,"affiliation":778,"properties":26},"7287a9f6-21fa-49cc-9fb4-5fa249c20087",{"id":779,"createTime":780,"updateTime":781,"relativeEntities":782,"slug":783,"properties":784,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"9a31a54a-d871-4096-8f6d-1a733f9005a3","2024-01-13T05:50:36.924+00:00","2024-09-05T17:50:12.742+00:00",[],"Institut-f%C3%BCr-Optimierung-und-Operations-Research-Universit%C3%A4t-Ulm-Ulm-Germany",{"title":785},{"VI":786},"Institut für Optimierung und Operations Research, Universität Ulm, Ulm, Germany",{"openalex":788,"title":790},{"VOID":789},"A5074156102",{"EN":791},"Stefan Ehard",{"id":793,"sortIndex":115,"researcher":26,"roles":794,"affiliations":795,"properties":802},"5e536afc-86a2-46c6-9243-87e707fe9db7",[],[796],{"id":797,"sortIndex":36,"affiliation":798,"properties":26},"671c181f-089e-4b49-a7c9-4047c418258e",{"id":779,"createTime":780,"updateTime":781,"relativeEntities":799,"slug":783,"properties":800,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":801},{"VI":786},{"openalex":803,"orcid":805,"title":807},{"VOID":804},"A5032828042",{"VOID":806},"https:\u002F\u002Forcid.org\u002F0000-0002-7214-042X",{"EN":808},"Dieter Rautenbach","ARTICLE",{"url":26,"publisher":811,"properties":833},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":812,"slug":663,"properties":813,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":816,"manageAffiliations":817,"indexDatabases":818,"url":26,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":814,"title":815},{"VOID":666},{"EN":668},[],[],[819,826],{"id":706,"indexDatabase":820,"url":719,"indexYears":720,"academicFieldIds":825,"indexDatabaseRanking":725},{"id":708,"createTime":709,"updateTime":710,"relativeEntities":821,"label":822,"description":823,"key":716,"publicationTags":824,"standard":26},[],{"EN":713,"VI":713},{"EN":713,"VI":715},[718],[722,723,724],{"id":727,"indexDatabase":827,"url":742,"indexYears":26,"academicFieldIds":832,"indexDatabaseRanking":26},{"id":729,"createTime":730,"updateTime":731,"relativeEntities":828,"label":829,"description":830,"key":738,"publicationTags":831,"standard":26},[],{"EN":734,"VI":734},{"VI":736,"EN":737},[740,741],[744,745],{"volume":834,"pages":836},{"VOID":835},"34",{"VOID":837},"100547",{"total":52,"publishYear":26,"statisticByYear":839},{"2019":115,"2021":114,"2022":114,"2023":59,"2024":115},"2019-11-01",2019,[843,847,851,855,859,863,867,870,874,878,882,885,889,893,897,901,905,908,912,916,920,923,927,931,935,939,943,946],{"id":26,"text":844,"url":26,"identifiers":845},"Dreyer, 2009, Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion, Discrete Appl. Math., 157, 1615, 10.1016\u002Fj.dam.2008.09.012",{"doi":846},"10.1016\u002Fj.dam.2008.09.012",{"id":26,"text":848,"url":26,"identifiers":849},"Kempe, 2015, Maximizing the spread of influence through a social network, Theory Comput., 11, 105, 10.4086\u002Ftoc.2015.v011a004",{"doi":850},"10.4086\u002Ftoc.2015.v011a004",{"id":26,"text":852,"url":26,"identifiers":853},"Centeno, 2011, Irreversible conversion of graphs, Theoret. Comput. Sci., 412, 3693, 10.1016\u002Fj.tcs.2011.03.029",{"doi":854},"10.1016\u002Fj.tcs.2011.03.029",{"id":26,"text":856,"url":26,"identifiers":857},"Chen, 2009, On the approximability of influence in social networks, SIAM J. Discrete Math., 23, 1400, 10.1137\u002F08073617X",{"doi":858},"10.1137\u002F08073617X",{"id":26,"text":860,"url":26,"identifiers":861},"Ben-Zwi, 2011, Treewidth governs the complexity of target set selection, Discrete Optim., 8, 87, 10.1016\u002Fj.disopt.2010.09.007",{"doi":862},"10.1016\u002Fj.disopt.2010.09.007",{"id":26,"text":864,"url":26,"identifiers":865},"Bessy, 2019, Dynamic monopolies for interval graphs with bounded thresholds, Discrete Appl. Math., 260, 256, 10.1016\u002Fj.dam.2019.01.022",{"doi":866},"10.1016\u002Fj.dam.2019.01.022",{"id":26,"text":868,"url":26,"identifiers":869},"Kynčl, 2017, Irreversible 2-conversion set in graphs of bounded degree, Discrete Math. Theor. Comput. Sci., 19, # 3",{},{"id":26,"text":871,"url":26,"identifiers":872},"Cordasco, 2015, Optimizing spread of influence in social networks via partial incentives, Lecture Notes in Comput. Sci., 9439, 119, 10.1007\u002F978-3-319-25258-2_9",{"doi":873},"10.1007\u002F978-3-319-25258-2_9",{"id":26,"text":875,"url":26,"identifiers":876},"Ackerman, 2010, Combinatorial model and bounds for target set selection, Theoret. Comput. Sci., 411, 4017, 10.1016\u002Fj.tcs.2010.08.021",{"doi":877},"10.1016\u002Fj.tcs.2010.08.021",{"id":26,"text":879,"url":26,"identifiers":880},"Reichman, 2012, New bounds for contagious sets, Discrete Math., 312, 1812, 10.1016\u002Fj.disc.2012.01.016",{"doi":881},"10.1016\u002Fj.disc.2012.01.016",{"id":26,"text":883,"url":26,"identifiers":884},"Brause, 2018",{},{"id":26,"text":886,"url":26,"identifiers":887},"Abrahamson, 1995, Fixed parameter tractability and completeness IV: on completeness for W[P] and PSPACE analogues, Ann. Pure Appl. Logic, 73, 235, 10.1016\u002F0168-0072(94)00034-Z",{"doi":888},"10.1016\u002F0168-0072(94)00034-Z",{"id":26,"text":890,"url":26,"identifiers":891},"Chopin, 2014, Constant thresholds can make target set selection tractable, Theory Comput. Syst., 55, 61, 10.1007\u002Fs00224-013-9499-3",{"doi":892},"10.1007\u002Fs00224-013-9499-3",{"id":26,"text":894,"url":26,"identifiers":895},"Hartmann, 2017, Target set selection parameterized by clique–width and maximum threshold, Lecture Notes in Comput. Sci., 10706, 137, 10.1007\u002F978-3-319-73117-9_10",{"doi":896},"10.1007\u002F978-3-319-73117-9_10",{"id":26,"text":898,"url":26,"identifiers":899},"Papadimitriou, 1991, Optimization, approximation, and complexity classes, J. Comput. System Sci., 43, 425, 10.1016\u002F0022-0000(91)90023-X",{"doi":900},"10.1016\u002F0022-0000(91)90023-X",{"id":26,"text":902,"url":26,"identifiers":903},"Baker, 1994, Approximation algorithms for NP-complete problems on planar graphs, J. ACM, 41, 153, 10.1145\u002F174644.174650",{"doi":904},"10.1145\u002F174644.174650",{"id":26,"text":906,"url":26,"identifiers":907},"Demaine, 2005, Bidimensionality: New connections between FPT algorithms and PTASs, 590",{},{"id":26,"text":909,"url":26,"identifiers":910},"Demaine, 2008, The bidimensionality theory and its algorithmic applications, Comput. J., 51, 292, 10.1093\u002Fcomjnl\u002Fbxm033",{"doi":911},"10.1093\u002Fcomjnl\u002Fbxm033",{"id":26,"text":913,"url":26,"identifiers":914},"Alber, 2002, Fixed parameter algorithms for dominating set and related problems on planar graphs, Algorithmica, 33, 461, 10.1007\u002Fs00453-001-0116-5",{"doi":915},"10.1007\u002Fs00453-001-0116-5",{"id":26,"text":917,"url":26,"identifiers":918},"Garey, 1976, Some simplified NP-complete graph problems, Theoret. Comput. Sci., 1, 237, 10.1016\u002F0304-3975(76)90059-1",{"doi":919},"10.1016\u002F0304-3975(76)90059-1",{"id":26,"text":921,"url":26,"identifiers":922},"Kloks, 1994, vol. 842",{},{"id":26,"text":924,"url":26,"identifiers":925},"Arnborg, 1987, Complexity of finding embeddings in a k-tree, SIAM J. Algebr. Discrete Methods, 8, 277, 10.1137\u002F0608024",{"doi":926},"10.1137\u002F0608024",{"id":26,"text":928,"url":26,"identifiers":929},"Chiang, 2013, Some results on the target set selection problem, J. Comb. Optim., 25, 702, 10.1007\u002Fs10878-012-9518-3",{"doi":930},"10.1007\u002Fs10878-012-9518-3",{"id":26,"text":932,"url":26,"identifiers":933},"Booth, 1976, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, J. Comput. System Sci., 13, 335, 10.1016\u002FS0022-0000(76)80045-1",{"doi":934},"10.1016\u002FS0022-0000(76)80045-1",{"id":26,"text":936,"url":26,"identifiers":937},"Bodlaender, 1998, A partial k-arboretum of graphs with bounded treewidth, Theoret. Comput. Sci., 209, 1, 10.1016\u002FS0304-3975(97)00228-4",{"doi":938},"10.1016\u002FS0304-3975(97)00228-4",{"id":26,"text":940,"url":26,"identifiers":941},"Aazami, 2009, Approximation algorithms and hardness for domination with propagation, SIAM J. Discrete Math., 23.3, 1382, 10.1137\u002F06066672X",{"doi":942},"10.1137\u002F06066672X",{"id":26,"text":944,"url":26,"identifiers":945},"Z. Dvorák, S. Norin, Treewidth of graphs with balanced separations, arXiv:1408.3869.",{},{"id":26,"text":947,"url":26,"identifiers":948},"Lipton, 1979, A separator theorem for planar graphs, SIAM J. Appl. Math., 36, 177, 10.1137\u002F0136016",{"doi":949},"10.1137\u002F0136016",false,{"id":952,"createTime":953,"updateTime":954,"relativeEntities":955,"slug":956,"properties":957,"entityType":766,"verifyStatus":25,"verifyTime":964,"verifyNote":768,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":115,"primaryUrl":965,"fullTextUrl":26,"authors":966,"publicationType":809,"publisherRelationship":999,"citationCount":135,"citationInfo":1027,"publishDate":1030,"publishYear":1028,"citationAnalyzeStatus":28,"lastCitationAnalyze":1031,"indexDatabases":26,"openAccess":26,"references":1032,"isForceReanalyzing":950},"d3fc41ad-28ff-4328-802f-f554e1469f09","2024-01-04T06:30:24.640+00:00","2025-09-18T13:44:40.710+00:00",[],"On-the-polyhedral-lift-and-project-methods-and-the-fractional-stable-set-polytope",{"title":958,"doi":960,"gsPaper":962},{"EN":959},"On the polyhedral lift-and-project methods and the fractional stable set polytope",{"VOID":961},"10.1016\u002Fj.disopt.2008.10.002",{"VOID":963},"[\"4774737668530999147\"]","2024-05-03T00:13:13.723+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1572528608000704",[967,985],{"id":968,"sortIndex":115,"researcher":26,"roles":969,"affiliations":971,"properties":982},"7f5e979b-ab85-4432-b940-de96e328c655",[970],"AUTHOR",[972],{"id":26,"sortIndex":36,"affiliation":973,"properties":26},{"id":974,"createTime":975,"updateTime":976,"relativeEntities":977,"slug":978,"properties":979,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"7a9ed6f6-ba70-4c25-ab54-f4b121b9e564","2023-12-19T18:46:31.374+00:00","2024-09-28T01:14:50.581+00:00",[],"Department-of-Combinatorics-and-Optimization-Faculty-of-Mathematics-University-of-Waterloo-Waterloo-Ontario-N2L-3G1-Canada",{"title":980},{"VI":981},"Department of Combinatorics and Optimization Faculty of Mathematics University of Waterloo Waterloo, Ontario N2L 3G1, Canada",{"title":983},{"VI":984},"Levent Tunçel",{"id":986,"sortIndex":36,"researcher":26,"roles":987,"affiliations":988,"properties":994},"793b7111-c3d1-4407-af8e-9f99f0b0e711",[970],[989],{"id":26,"sortIndex":36,"affiliation":990,"properties":26},{"id":974,"createTime":975,"updateTime":976,"relativeEntities":991,"slug":978,"properties":992,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":993},{"VI":981},{"title":995,"gsAuthor":997},{"VI":996},"Yu-Hin Au",{"VOID":998},"[\"NhKzxZIAAAAJ\"]",{"url":965,"publisher":1000,"properties":1022},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1001,"slug":663,"properties":1002,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1005,"manageAffiliations":1006,"indexDatabases":1007,"url":26,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":1003,"title":1004},{"VOID":666},{"EN":668},[],[],[1008,1015],{"id":706,"indexDatabase":1009,"url":719,"indexYears":720,"academicFieldIds":1014,"indexDatabaseRanking":725},{"id":708,"createTime":709,"updateTime":710,"relativeEntities":1010,"label":1011,"description":1012,"key":716,"publicationTags":1013,"standard":26},[],{"EN":713,"VI":713},{"EN":713,"VI":715},[718],[722,723,724],{"id":727,"indexDatabase":1016,"url":742,"indexYears":26,"academicFieldIds":1021,"indexDatabaseRanking":26},{"id":729,"createTime":730,"updateTime":731,"relativeEntities":1017,"label":1018,"description":1019,"key":738,"publicationTags":1020,"standard":26},[],{"EN":734,"VI":734},{"VI":736,"EN":737},[740,741],[744,745],{"volume":1023,"pages":1025},{"VOID":1024},"6",{"VOID":1026},"206-213",{"total":135,"publishYear":1028,"statisticByYear":1029},2009,{"2011":115,"2014":114,"2016":115,"2017":115},"2009-05-01","2025-09-18T13:44:40.709+00:00",[1033,1039,1045,1048,1054,1060,1066,1073,1080,1087,1094,1101,1108,1113,1116,1123,1130,1137,1140,1147,1153],{"id":1034,"text":1035,"url":1036,"identifiers":1037},"c0ef3f27-8159-4e4c-b3a4-95cd4145c13c","Aguilera, 2004, Lift and project relaxations for the matching and related polytopes, Discrete Appl. Math., 134, 193, 10.1016\u002FS0166-218X(03)00337-8","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0166218X03003378",{"doi":1038},"10.1016\u002Fs0166-218x(03)00337-8",{"id":1040,"text":1041,"url":1042,"identifiers":1043},"4c68646b-0035-4279-8000-0006b275d4fa","S. Arora, B. Bollobás, L. Lovász, Proving integrality gaps without knowing the linear program, in: Proc. 43rd IEEE Symp. FOCS, 2002, pp. 313–322","https:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs10440-022-00541-7",{"doi":1044},"10.1007\u002Fs10440-022-00541-7",{"id":1040,"text":1046,"url":1042,"identifiers":1047},"Y. Au, On the polyhedral lift-and-project rank conjecture for the fractional stable set polytope, M.Math. Thesis, Dept. of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo, Canada, 2008",{"doi":1044},{"id":1049,"text":1050,"url":1051,"identifiers":1052},"27daad1d-3a2c-4db7-b49d-a1e9eaee2d07","E. Balas, Disjunctive programming: Properties of the convex hull of feasible points, Management Science Research Report 348 GSIA, Carnegie Mellon University, Pittsburgh, PA, USA, 1974. (Appeared as: E. Balas, Disjunctive programming: Properties of the convex hull of feasible points, Discrete Appl. Math. 89 (1998) 3–44.)","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0166218X9800136X",{"doi":1053},"10.1016\u002Fs0166-218x(98)00136-x",{"id":1055,"text":1056,"url":1057,"identifiers":1058},"8dbaea67-43d5-4e1f-8745-13b031de32e7","Balas, 1993, A lift-and-project cutting plane algorithm for mixed 0-1 programs, Math. Program., 58, 295, 10.1007\u002FBF01581273","http:\u002F\u002Flink.springer.com\u002F10.1007\u002FBF01581273",{"doi":1059},"10.1007\u002Fbf01581273",{"id":1061,"text":1062,"url":1063,"identifiers":1064},"f48342e0-ee5c-4a22-9a6f-b02e9f0ff6ff","Bienstock, 2004, Tree-width and the Sherali-Adams operator, Discrete Optim., 1, 13, 10.1016\u002Fj.disopt.2004.03.002","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1572528604000039",{"doi":1065},"10.1016\u002Fj.disopt.2004.03.002",{"id":26,"text":1067,"url":1068,"identifiers":1069},"Bienstock, 2004, Subset algebra lift operators for 0-1 integer programming, SIAM J. Optim., 15, 63, 10.1137\u002FS1052623402420346","https:\u002F\u002Fdoi.org\u002F10.1137\u002Fs1052623402420346",{"mag":1070,"openalex":1071,"doi":1072},"2068848618","W2068848618","10.1137\u002Fs1052623402420346",{"id":26,"text":1074,"url":1075,"identifiers":1076},"Cook, 2001, On the matrix-cut rank of polyhedra, Math. Oper. Res., 26, 19, 10.1287\u002Fmoor.26.1.19.10593","https:\u002F\u002Fdoi.org\u002F10.1287\u002Fmoor.26.1.19.10593",{"mag":1077,"openalex":1078,"doi":1079},"2146471456","W2146471456","10.1287\u002Fmoor.26.1.19.10593",{"id":26,"text":1081,"url":1082,"identifiers":1083},"Cornuéjols, 2008, Valid inequalities for mixed integer linear programs, Math. Program., 112, 3, 10.1007\u002Fs10107-006-0086-0","https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs10107-006-0086-0",{"mag":1084,"openalex":1085,"doi":1086},"2152088446","W2152088446","10.1007\u002Fs10107-006-0086-0",{"id":26,"text":1088,"url":1089,"identifiers":1090},"Cornuéjols, 2001, Elementary closures for integer programs, Oper. Res. Lett., 28, 1, 10.1016\u002FS0167-6377(00)00067-5","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fs0167-6377(00)00067-5",{"mag":1091,"openalex":1092,"doi":1093},"1975254220","W1975254220","10.1016\u002Fs0167-6377(00)00067-5",{"id":26,"text":1095,"url":1096,"identifiers":1097},"de Klerk, 2002, Approximation of the stability number of a graph via copositive programming, SIAM J. Optim., 12, 875, 10.1137\u002FS1052623401383248","https:\u002F\u002Fdoi.org\u002F10.1137\u002Fs1052623401383248",{"mag":1098,"openalex":1099,"doi":1100},"2120146316","W2120146316","10.1137\u002Fs1052623401383248",{"id":26,"text":1102,"url":1103,"identifiers":1104},"Goemans, 2001, When does the positive semidefiniteness constraint help in lifting procedures, Math. Oper. Res., 26, 796, 10.1287\u002Fmoor.26.4.796.10012","https:\u002F\u002Fdoi.org\u002F10.1287\u002Fmoor.26.4.796.10012",{"mag":1105,"openalex":1106,"doi":1107},"2167508847","W2167508847","10.1287\u002Fmoor.26.4.796.10012",{"id":26,"text":1109,"url":1110,"identifiers":1111},"Laurent, 2003, A comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre relaxations for 0-1 programming, Math. Oper. Res., 28, 470, 10.1287\u002Fmoor.28.3.470.16391","http:\u002F\u002Fdx.doi.org\u002F10.1287\u002Fmoor.28.3.470.16391",{"doi":1112},"10.1287\u002Fmoor.28.3.470.16391",{"id":26,"text":1114,"url":26,"identifiers":1115},"L. Lipták, Critical facets of the stable set polytope, Ph.D. Thesis, Yale University, 1999",{},{"id":26,"text":1117,"url":1118,"identifiers":1119},"Lipták, 2003, Stable set problem and the lift-and-project ranks of graphs, Math. Program., 98, 319, 10.1007\u002Fs10107-003-0407-5","https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs10107-003-0407-5",{"mag":1120,"openalex":1121,"doi":1122},"1604898370","W1604898370","10.1007\u002Fs10107-003-0407-5",{"id":26,"text":1124,"url":1125,"identifiers":1126},"Lovász, 1991, Cones of matrices and set-functions and 0-1 optimization, SIAM J. Optim., 1, 166, 10.1137\u002F0801013","https:\u002F\u002Fdoi.org\u002F10.1137\u002F0801013",{"mag":1127,"openalex":1128,"doi":1129},"2106264302","W2106264302","10.1137\u002F0801013",{"id":26,"text":1131,"url":1132,"identifiers":1133},"Peña, 2007, Computing the stability number of a graph via linear and semidefinite programming, SIAM J. Optim., 18, 87, 10.1137\u002F05064401X","https:\u002F\u002Fdoi.org\u002F10.1137\u002F05064401x",{"mag":1134,"openalex":1135,"doi":1136},"2162579105","W2162579105","10.1137\u002F05064401x",{"id":26,"text":1138,"url":26,"identifiers":1139},"Sherali, 1999, 31",{},{"id":26,"text":1141,"url":1142,"identifiers":1143},"Sherali, 1990, A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems, SIAM J. Discrete Math., 3, 411, 10.1137\u002F0403036","https:\u002F\u002Fdoi.org\u002F10.1137\u002F0403036",{"mag":1144,"openalex":1145,"doi":1146},"2049143039","W2049143039","10.1137\u002F0403036",{"id":1148,"text":1149,"url":1150,"identifiers":1151},"36869907-433b-4aff-910a-84711783aea4","Sherali, 1996, Tighter representations for set partitioning problems, Discrete Appl. Math., 68, 153, 10.1016\u002F0166-218X(95)00060-5","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002F0166218X95000605",{"doi":1152},"10.1016\u002F0166-218x(95)00060-5",{"id":26,"text":1154,"url":1155,"identifiers":1156},"Stephen, 1999, On a representation of the matching polytope via semidefinite liftings, Math. Oper. Res., 24, 1, 10.1287\u002Fmoor.24.1.1","https:\u002F\u002Fdoi.org\u002F10.1287\u002Fmoor.24.1.1",{"mag":1157,"openalex":1158,"doi":1159},"2026189949","W2026189949","10.1287\u002Fmoor.24.1.1",{"id":1161,"createTime":1162,"updateTime":1162,"relativeEntities":1163,"slug":1164,"properties":1165,"entityType":766,"verifyStatus":25,"verifyTime":1176,"verifyNote":768,"syncStatus":28,"languages":1177,"translateLanguages":26,"viewCount":36,"primaryUrl":1178,"fullTextUrl":26,"authors":1179,"publicationType":809,"publisherRelationship":1252,"citationCount":135,"citationInfo":1280,"publishDate":1282,"publishYear":1283,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1284,"isForceReanalyzing":950},"1698dd00-c369-4046-81d8-678d42457e2e","2025-01-24T15:30:24.303+00:00",[],"On-the-Balanced-Minimum-Evolution-polytope",{"mag":1166,"keywords":1168,"openalex":1169,"abstract":1171,"title":1172,"doi":1174},{"VOID":1167},"3007262143",{},{"VOID":1170},"W3007262143",{},{"EN":1173},"On the Balanced Minimum Evolution polytope",{"VOID":1175},"10.1016\u002Fj.disopt.2020.100570","2025-01-24T15:30:24.302+00:00",[102],"https:\u002F\u002Flinkinghub.elsevier.com\u002Fretrieve\u002Fpii\u002FS1572528620300049",[1180,1202,1224],{"id":1181,"sortIndex":114,"researcher":26,"roles":1182,"affiliations":1183,"properties":1195},"2362bf9d-3935-4cae-be6c-a9683a39c001",[],[1184],{"id":1185,"sortIndex":36,"affiliation":1186,"properties":26},"d118a5bb-7f85-41b8-964a-431074d34b3f",{"id":1187,"createTime":1188,"updateTime":1189,"relativeEntities":1190,"slug":1191,"properties":1192,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"e8af8a0a-9d94-4daf-9605-a915ec66aa3c","2023-12-08T11:48:36.601+00:00","2025-01-24T15:30:24.322+00:00",[],"Center-for-Operations-Research-and-Econometrics-CORE-Universit%C3%A9-Catholique-de-Louvain-Voie-du-Roman-Pays-34-B-1348-Louvain-la-Neuve-Belgium",{"title":1193},{"VI":1194},"Center for Operations Research and Econometrics (CORE), Université Catholique de Louvain, Voie du Roman Pays 34, B-1348, Louvain-la-Neuve, Belgium",{"openalex":1196,"orcid":1198,"title":1200},{"VOID":1197},"A5070306586",{"VOID":1199},"https:\u002F\u002Forcid.org\u002F0000-0001-5330-6239",{"EN":1201},"Laurence A. Wolsey",{"id":1203,"sortIndex":115,"researcher":26,"roles":1204,"affiliations":1205,"properties":1217},"59717048-86d0-49e7-aaa9-100731f98cb5",[],[1206],{"id":1207,"sortIndex":36,"affiliation":1208,"properties":26},"f8929178-6898-4ba0-b17e-e51b289e22b8",{"id":1209,"createTime":1210,"updateTime":1211,"relativeEntities":1212,"slug":1213,"properties":1214,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"8bea683f-c529-4f46-ba0d-22e4ef6d3be3","2023-12-08T10:48:20.677+00:00","2025-01-24T15:30:26.943+00:00",[],"Department-of-Management-Universit%C3%A0-Ca-Foscari-San-Giobbe-Cannaregio-837-I-30121-Venezia-Italy",{"title":1215},{"VI":1216},"Department of Management, Università Ca’ Foscari, San Giobbe, Cannaregio 837, I-30121 Venezia, Italy",{"openalex":1218,"orcid":1220,"title":1222},{"VOID":1219},"A5066238119",{"VOID":1221},"https:\u002F\u002Forcid.org\u002F0000-0001-5890-4238",{"EN":1223},"Raffaele Pesenti",{"id":1225,"sortIndex":36,"researcher":26,"roles":1226,"affiliations":1227,"properties":1245},"896383e8-1dc2-4153-8c20-9de9fa50c0cd",[],[1228,1239],{"id":1229,"sortIndex":115,"affiliation":1230,"properties":26},"f9256591-9885-4711-acb6-71ebed7c6911",{"id":1231,"createTime":1232,"updateTime":1233,"relativeEntities":1234,"slug":1235,"properties":1236,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"43026055-ae9f-4da2-80df-b318dd0fbd1c","2023-12-15T02:17:40.882+00:00","2025-01-24T15:30:24.325+00:00",[],"Luxembourg-Institute-of-Socio-Economic-Research-LISER-11-Porte-des-Sciences-L-4366-Esch-sur-Alzette-Luxembourg",{"title":1237},{"VI":1238},"Luxembourg Institute of Socio-Economic Research (LISER), 11 Porte des Sciences, L-4366 Esch-sur-Alzette, Luxembourg",{"id":1240,"sortIndex":36,"affiliation":1241,"properties":26},"648900cd-a9b8-436c-a9ce-aae30680e345",{"id":1187,"createTime":1188,"updateTime":1189,"relativeEntities":1242,"slug":1191,"properties":1243,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1244},{"VI":1194},{"openalex":1246,"orcid":1248,"title":1250},{"VOID":1247},"A5028337021",{"VOID":1249},"https:\u002F\u002Forcid.org\u002F0000-0001-9427-1562",{"EN":1251},"Daniele Catanzaro",{"url":26,"publisher":1253,"properties":1275},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1254,"slug":663,"properties":1255,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1258,"manageAffiliations":1259,"indexDatabases":1260,"url":26,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":1256,"title":1257},{"VOID":666},{"EN":668},[],[],[1261,1268],{"id":706,"indexDatabase":1262,"url":719,"indexYears":720,"academicFieldIds":1267,"indexDatabaseRanking":725},{"id":708,"createTime":709,"updateTime":710,"relativeEntities":1263,"label":1264,"description":1265,"key":716,"publicationTags":1266,"standard":26},[],{"EN":713,"VI":713},{"EN":713,"VI":715},[718],[722,723,724],{"id":727,"indexDatabase":1269,"url":742,"indexYears":26,"academicFieldIds":1274,"indexDatabaseRanking":26},{"id":729,"createTime":730,"updateTime":731,"relativeEntities":1270,"label":1271,"description":1272,"key":738,"publicationTags":1273,"standard":26},[],{"EN":734,"VI":734},{"VI":736,"EN":737},[740,741],[744,745],{"volume":1276,"pages":1278},{"VOID":1277},"36",{"VOID":1279},"100570",{"total":135,"publishYear":26,"statisticByYear":1281},{"2019":115,"2020":115,"2021":59,"2023":115},"2020-05-01",2020,[1285,1288,1291,1295,1299,1303,1307,1311,1315,1319,1322,1326,1329,1332,1336,1339,1342,1346,1350,1353,1357,1361,1365,1368,1371,1375,1379,1382,1385],{"id":26,"text":1286,"url":26,"identifiers":1287},"Felsenstein, 2004",{},{"id":26,"text":1289,"url":26,"identifiers":1290},"Catanzaro, 2011, Estimating phylogenies from molecular data, 149",{},{"id":26,"text":1292,"url":26,"identifiers":1293},"Catanzaro, 2012, The balanced minimum evolution problem, INFORMS J. Comput., 24, 276, 10.1287\u002Fijoc.1110.0455",{"doi":1294},"10.1287\u002Fijoc.1110.0455",{"id":26,"text":1296,"url":26,"identifiers":1297},"Rinnooy Kan, 1978, The complexity of the network design problem, Networks, 8, 279, 10.1002\u002Fnet.3230080402",{"doi":1298},"10.1002\u002Fnet.3230080402",{"id":26,"text":1300,"url":26,"identifiers":1301},"Pauplin, 2000, Direct calculation of a tree length using a distance matrix, J. Mol. Evol., 51, 41, 10.1007\u002Fs002390010065",{"doi":1302},"10.1007\u002Fs002390010065",{"id":26,"text":1304,"url":26,"identifiers":1305},"Desper, 2004, Theoretical foundations of the balanced minimum evolution method of phylogenetic inference and its relationship to the weighted least-squares tree fitting, Mol. Biol. Evol., 21, 587, 10.1093\u002Fmolbev\u002Fmsh049",{"doi":1306},"10.1093\u002Fmolbev\u002Fmsh049",{"id":26,"text":1308,"url":26,"identifiers":1309},"Gascuel, 2006, Neighbor-joining revealed, Mol. Biol. Evol., 23, 1997, 10.1093\u002Fmolbev\u002Fmsl072",{"doi":1310},"10.1093\u002Fmolbev\u002Fmsl072",{"id":26,"text":1312,"url":26,"identifiers":1313},"Fiorini, 2012, Approximating the balanced minimum evolution problem, Oper. Res. Lett., 40, 31, 10.1016\u002Fj.orl.2011.10.003",{"doi":1314},"10.1016\u002Fj.orl.2011.10.003",{"id":26,"text":1316,"url":26,"identifiers":1317},"Aringhieri, 2011, Optimal solutions for the balanced minimum evolution problem, Comput. Oper. Res., 38, 1845, 10.1016\u002Fj.cor.2011.02.020",{"doi":1318},"10.1016\u002Fj.cor.2011.02.020",{"id":26,"text":1320,"url":26,"identifiers":1321},"Pardi, 2009",{},{"id":26,"text":1323,"url":26,"identifiers":1324},"Catanzaro, 2009, The minimum evolution problem: Overview and classification, Networks, 53, 112, 10.1002\u002Fnet.20280",{"doi":1325},"10.1002\u002Fnet.20280",{"id":26,"text":1327,"url":26,"identifiers":1328},"Gascuel, 2005",{},{"id":26,"text":1330,"url":26,"identifiers":1331},"Huffman, 1952, A method for the construction of minimum redundancy codes",{},{"id":26,"text":1333,"url":26,"identifiers":1334},"Parker, 1996, The construction of Huffman codes is a submodular (“convex”) optimization problem over a lattice of binary trees, SIAM J. Comput., 28, 1875, 10.1137\u002FS0097539796311077",{"doi":1335},"10.1137\u002FS0097539796311077",{"id":26,"text":1337,"url":26,"identifiers":1338},"Sayood, 2017",{},{"id":26,"text":1340,"url":26,"identifiers":1341},"Eickmeyer, 2008, On the optimality of the neighbor-joining algorithm, Algorithms Mol. Biol., 3, 1",{},{"id":26,"text":1343,"url":26,"identifiers":1344},"Haws, 2011, Optimality of the neighbor joining algorithm and faces of the balanced minimum evolution polytope, Bull. Math. Biol., 73, 2627, 10.1007\u002Fs11538-011-9640-x",{"doi":1345},"10.1007\u002Fs11538-011-9640-x",{"id":26,"text":1347,"url":26,"identifiers":1348},"Forcey, 2016, Facets of the balanced minimal evolution polytope, J. Math. Biol., 73, 447, 10.1007\u002Fs00285-015-0957-1",{"doi":1349},"10.1007\u002Fs00285-015-0957-1",{"id":26,"text":1351,"url":26,"identifiers":1352},"Gawrilow, 2000, Polymake: A framework for analyzing convex polytopes, 43",{},{"id":26,"text":1354,"url":26,"identifiers":1355},"Billera, 2001, Geometry of the space of phylogenetic trees, Adv. Appl. Math., 27, 733, 10.1006\u002Faama.2001.0759",{"doi":1356},"10.1006\u002Faama.2001.0759",{"id":26,"text":1358,"url":26,"identifiers":1359},"Forcey, 2017, Split-facets for balanced minimal evolution polytopes and the permutoassociahedron, Bull. Math. Biol., 79, 975, 10.1007\u002Fs11538-017-0264-7",{"doi":1360},"10.1007\u002Fs11538-017-0264-7",{"id":26,"text":1362,"url":26,"identifiers":1363},"Kapranov, 1993, The permutoassociahedron, Mac Lane’s coherence theorem and asymptotic zones for the KZ equation, J. Pure Appl. Algebra, 85, 119, 10.1016\u002F0022-4049(93)90049-Y",{"doi":1364},"10.1016\u002F0022-4049(93)90049-Y",{"id":26,"text":1366,"url":26,"identifiers":1367},"Reiner, 1993",{},{"id":26,"text":1369,"url":26,"identifiers":1370},"Buneman, 1971, The recovery of trees from measure of dissimilarities, 387",{},{"id":26,"text":1372,"url":26,"identifiers":1373},"Erdös, 1999, A few logs suffice to build (almost) all trees: Part I, Random Struct. Algorithms, 14, 153, 10.1002\u002F(SICI)1098-2418(199903)14:2\u003C153::AID-RSA3>3.0.CO;2-R",{"doi":1374},"10.1002\u002F(SICI)1098-2418(199903)14:2\u003C153::AID-RSA3>3.0.CO;2-R",{"id":26,"text":1376,"url":26,"identifiers":1377},"Waterman, 1977, Additive evolutionary trees, J. Theoret. Biol., 64, 199, 10.1016\u002F0022-5193(77)90351-4",{"doi":1378},"10.1016\u002F0022-5193(77)90351-4",{"id":26,"text":1380,"url":26,"identifiers":1381},"Nemhauser, 1999",{},{"id":26,"text":1383,"url":26,"identifiers":1384},"Wolfram Research, Inc. Mathematica, Version 11.3. Champaign, IL, 2018.",{},{"id":26,"text":1386,"url":26,"identifiers":1387},"Reinhard, 2005",{},{"id":1389,"createTime":1390,"updateTime":1391,"relativeEntities":1392,"slug":1393,"properties":1394,"entityType":766,"verifyStatus":25,"verifyTime":1403,"verifyNote":768,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"primaryUrl":1404,"fullTextUrl":26,"authors":1405,"publicationType":809,"publisherRelationship":1440,"citationCount":36,"citationInfo":1468,"publishDate":1470,"publishYear":1471,"citationAnalyzeStatus":1472,"lastCitationAnalyze":1391,"indexDatabases":26,"openAccess":26,"references":26,"isForceReanalyzing":950},"25d9ecac-b0b2-4ae5-8114-a600758de01c","2024-02-08T22:36:35.306+00:00","2026-05-20T03:24:54.451+00:00",[],"On-the-length-of-L-Grundy-sequences",{"references":1395,"title":1397,"doi":1399,"gsPaper":1401},{"VOID":1396},"Lin, 2021\nWork, 2008, Zero forcing sets and the minimum rank of graphs, Linear Algebra Appl., 428, 1628, 10.1016\u002Fj.laa.2007.10.009\nBarioli, 2010, Zero forcing parameters and minimum rank problems, Linear Algebra Appl., 433, 401, 10.1016\u002Fj.laa.2010.03.008\nHuang, 2010, On minimum rank and zero forcing sets of a graph, Linear Algebra Appl., 432, 2961, 10.1016\u002Fj.laa.2010.01.001\nEdholm, 2012, Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph, Linear Algebra Appl., 436, 4352, 10.1016\u002Fj.laa.2010.10.015\nBenson, 2018, Zero forcing and power domination for graph products, Australas. J. Combin., 70, 221\nBozeman, 2019, Restricted power domination and zero forcing problems, J. Comb. Optim., 37, 935, 10.1007\u002Fs10878-018-0330-6\nBrešar, 2014, Dominating sequences in graphs, Discrete Math., 336, 22, 10.1016\u002Fj.disc.2014.07.016\nBrešar, 2017, Grundy dominating sequences and zero forcing sets, Discrete Optim., 26, 66, 10.1016\u002Fj.disopt.2017.07.001\nBrešar, 2016, Total dominating sequences in graphs, Discrete Math., 339, 1665, 10.1016\u002Fj.disc.2016.01.017\nBrešar, 2020, On the L-Grundy domination number of a graph, Filomat, 34, 3205, 10.2298\u002FFIL2010205B\nBrešar, 2021\nLin, 2019, Zero forcing number, grundy domination number, and their variants, Linear Algebra Appl., 563, 240, 10.1016\u002Fj.laa.2018.11.003\nNasini, 2020, Grundy dominating sequences on X-join product, Discrete Appl. Math., 284, 138, 10.1016\u002Fj.dam.2020.03.016\nBell, 2021, Grundy domination of forests and the strong product conjecture, Electron. J. Combin., 28, 10.37236\u002F9507\nBrešar, 2016, Dominating sequences under atomic changes with applications to sierpinski and interval graphs, Appl. Anal. Discrete Math., 10, 518, 10.2298\u002FAADM161005024B\nBrešar, 2018, Total dominating sequences in trees, split graphs, and under modular decomposition, Discrete Optim., 28, 10.1016\u002Fj.disopt.2017.10.002\nKos, 2019",{"EN":1398},"On the length of L-Grundy sequences",{"VOID":1400},"10.1016\u002Fj.disopt.2022.100725",{"VOID":1402},"[\"6616482954599346421\"]","2024-06-24T02:48:59.903+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1572528622000342",[1406,1423],{"id":1407,"sortIndex":36,"researcher":26,"roles":1408,"affiliations":1409,"properties":1418},"0a19b9d2-cf66-4b8d-957b-d047ed95c3fc",[970],[1410],{"id":26,"sortIndex":36,"affiliation":1411,"properties":26},{"id":1412,"createTime":1413,"updateTime":1413,"relativeEntities":1414,"slug":26,"properties":1415,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"2e675ba9-3837-453d-92c6-dee7ba77f14d","2023-12-13T12:32:26.988+00:00",[],{"title":1416},{"VI":1417},"Department of Industrial and Systems Engineering, The University of Tennessee, Knoxville, TN, United States of America",{"title":1419,"gsAuthor":1421},{"VI":1420},"Rebekah Herrman",{"VOID":1422},"[\"CGJR52sAAAAJ\"]",{"id":1424,"sortIndex":115,"researcher":26,"roles":1425,"affiliations":1426,"properties":1435},"a1fd917d-bdbc-4d2d-9db5-7f05f30b80e0",[970],[1427],{"id":26,"sortIndex":36,"affiliation":1428,"properties":26},{"id":1429,"createTime":1430,"updateTime":1430,"relativeEntities":1431,"slug":26,"properties":1432,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"d73dd5d6-c1fe-4810-a1a2-620c44fc5d80","2024-02-08T22:36:35.360+00:00",[],{"title":1433},{"VI":1434},"Center for Adult and Continuing Education, Huston-Tillotson University, Austin, TX, United States of America",{"title":1436,"gsAuthor":1438},{"VI":1437},"Stephen G.Z. Smith",{"VOID":1439},"[\"Dw7qDMQAAAAJ\"]",{"url":1404,"publisher":1441,"properties":1463},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1442,"slug":663,"properties":1443,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1446,"manageAffiliations":1447,"indexDatabases":1448,"url":26,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":1444,"title":1445},{"VOID":666},{"EN":668},[],[],[1449,1456],{"id":706,"indexDatabase":1450,"url":719,"indexYears":720,"academicFieldIds":1455,"indexDatabaseRanking":725},{"id":708,"createTime":709,"updateTime":710,"relativeEntities":1451,"label":1452,"description":1453,"key":716,"publicationTags":1454,"standard":26},[],{"EN":713,"VI":713},{"EN":713,"VI":715},[718],[722,723,724],{"id":727,"indexDatabase":1457,"url":742,"indexYears":26,"academicFieldIds":1462,"indexDatabaseRanking":26},{"id":729,"createTime":730,"updateTime":731,"relativeEntities":1458,"label":1459,"description":1460,"key":738,"publicationTags":1461,"standard":26},[],{"EN":734,"VI":734},{"VI":736,"EN":737},[740,741],[744,745],{"volume":1464,"pages":1466},{"VOID":1465},"45",{"VOID":1467},"100725",{"total":36,"publishYear":36,"statisticByYear":1469},{},"2022-08-01",2022,"DONE_ANALYZE_CITATION",{"id":1474,"createTime":1475,"updateTime":1476,"relativeEntities":1477,"slug":1478,"properties":1479,"entityType":766,"verifyStatus":25,"verifyTime":1486,"verifyNote":768,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"primaryUrl":1487,"fullTextUrl":26,"authors":1488,"publicationType":809,"publisherRelationship":1518,"citationCount":36,"citationInfo":1546,"publishDate":1548,"publishYear":1549,"citationAnalyzeStatus":1550,"lastCitationAnalyze":1476,"indexDatabases":26,"openAccess":26,"references":1551,"isForceReanalyzing":950},"ebf7be69-4214-435e-804b-fc03e9d42b8d","2023-12-17T13:30:23.967+00:00","2026-06-12T01:43:24.881+00:00",[],"On-cycles-and-the-stable-multi-set-polytope",{"title":1480,"doi":1482,"gsPaper":1484},{"EN":1481},"On cycles and the stable multi-set polytope",{"VOID":1483},"10.1016\u002Fj.disopt.2005.06.004",{"VOID":1485},"[\"7735365100610922681\"]","2024-04-30T07:47:39.012+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS157252860500037X",[1489,1504],{"id":1490,"sortIndex":115,"researcher":26,"roles":1491,"affiliations":1492,"properties":1501},"7dce0363-83a5-4d33-949f-80bea6c04215",[970],[1493],{"id":26,"sortIndex":36,"affiliation":1494,"properties":26},{"id":1495,"createTime":1496,"updateTime":1496,"relativeEntities":1497,"slug":26,"properties":1498,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"ada67a91-15f7-46eb-94a9-75244289a9bd","2023-12-17T13:30:24.573+00:00",[],{"title":1499},{"VI":1500},"Zuse Institute Berlin (ZIB), Takustraße 7, D-14195 Berlin, Germany",{"title":1502},{"VI":1503},"Adrian Zymolka",{"id":1505,"sortIndex":36,"researcher":26,"roles":1506,"affiliations":1507,"properties":1513},"d442c0af-c4a2-402a-9f9f-dd105e347395",[970],[1508],{"id":26,"sortIndex":36,"affiliation":1509,"properties":26},{"id":1495,"createTime":1496,"updateTime":1496,"relativeEntities":1510,"slug":26,"properties":1511,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1512},{"VI":1500},{"title":1514,"gsAuthor":1516},{"VI":1515},"Arie M.C.A. Koster",{"VOID":1517},"[\"AAsK4wwAAAAJ\"]",{"url":1487,"publisher":1519,"properties":1541},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1520,"slug":663,"properties":1521,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1524,"manageAffiliations":1525,"indexDatabases":1526,"url":26,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":1522,"title":1523},{"VOID":666},{"EN":668},[],[],[1527,1534],{"id":706,"indexDatabase":1528,"url":719,"indexYears":720,"academicFieldIds":1533,"indexDatabaseRanking":725},{"id":708,"createTime":709,"updateTime":710,"relativeEntities":1529,"label":1530,"description":1531,"key":716,"publicationTags":1532,"standard":26},[],{"EN":713,"VI":713},{"EN":713,"VI":715},[718],[722,723,724],{"id":727,"indexDatabase":1535,"url":742,"indexYears":26,"academicFieldIds":1540,"indexDatabaseRanking":26},{"id":729,"createTime":730,"updateTime":731,"relativeEntities":1536,"label":1537,"description":1538,"key":738,"publicationTags":1539,"standard":26},[],{"EN":734,"VI":734},{"VI":736,"EN":737},[740,741],[744,745],{"volume":1542,"pages":1544},{"VOID":1543},"2",{"VOID":1545},"241-255",{"total":36,"publishYear":36,"statisticByYear":1547},{},"2005-09-01",2005,"ERROR_IN_ANALYZE_CITATION",[1552,1558,1564,1568,1575,1582,1586,1589,1593,1599,1602,1608,1611],{"id":1553,"text":1554,"url":1555,"identifiers":1556},"17346e26-ea24-4292-ac66-3d24948c93c6","Caprara, 1996, {0,12}-Chvátal-Gomory cuts, Math. Programming, 74, 221, 10.1007\u002FBF02592196","http:\u002F\u002Flink.springer.com\u002F10.1007\u002FBF02592196",{"doi":1557},"10.1007\u002FBF02592196",{"id":1559,"text":1560,"url":1561,"identifiers":1562},"939f08a3-8288-4088-9d0a-8d9f56bc8fc6","Caprara, 2000, On the separation of maximally violated mod-k cuts, Math. Programming, 87, 37, 10.1007\u002Fs101079900107","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs101079900107",{"doi":1563},"10.1007\u002Fs101079900107",{"id":26,"text":1565,"url":26,"identifiers":1566},"Cheng, 2004, A note on the multi-oddity constrained shortest circuits and their separation over the stable multi-set polytope, Oper. Res. Lett., 32, 181, 10.1016\u002Fj.orl.2003.05.001",{"doi":1567},"10.1016\u002Fj.orl.2003.05.001",{"id":26,"text":1569,"url":1570,"identifiers":1571},"Gerards, 1986, Matrices with the Edmonds–Johnson property, Combinatorica, 6, 365, 10.1007\u002FBF02579262","https:\u002F\u002Fdoi.org\u002F10.1007\u002Fbf02579262",{"mag":1572,"openalex":1573,"doi":1574},"2131987076","W2131987076","10.1007\u002Fbf02579262",{"id":26,"text":1576,"url":1577,"identifiers":1578},"Gerards, 1998, The graphs with all subgraphs t-perfect, SIAM J. Discrete Math., 11, 524, 10.1137\u002FS0895480196306361","https:\u002F\u002Fdoi.org\u002F10.1137\u002Fs0895480196306361",{"mag":1579,"openalex":1580,"doi":1581},"2016832430","W2016832430","10.1137\u002Fs0895480196306361",{"id":26,"text":1583,"url":26,"identifiers":1584},"Gijswijt, 2003, On the b-stable set polytope of graphs without bad K4, SIAM J. Discrete Math., 16, 511, 10.1137\u002FS0895480102417343",{"doi":1585},"10.1137\u002FS0895480102417343",{"id":1040,"text":1587,"url":1042,"identifiers":1588},"M. Grötschel, L. Lovász, A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics, vol. 2, Springer, Berlin, 1988.",{"doi":1044},{"id":26,"text":1590,"url":1591,"identifiers":1592},"ILOG, CPLEX version 9.0, http:\u002F\u002Fwww.ilog.com\u002Fproducts\u002Fcplex (2003).","http:\u002F\u002Fwww.ilog.com\u002Fproducts\u002Fcplex",{},{"id":1594,"text":1595,"url":1596,"identifiers":1597},"daabc8ac-c758-4c36-bfc9-7757a94cf982","Koster, 2002, Stable multi-sets, Math. Methods Oper. Res., 56, 45, 10.1007\u002Fs001860200199","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs001860200199",{"doi":1598},"10.1007\u002Fs001860200199",{"id":26,"text":1600,"url":26,"identifiers":1601},"K. Mehlhorn, S. Näher, M. Seel, C. Uhrig, LEDA version 4.1 (2000).",{},{"id":1603,"text":1604,"url":1605,"identifiers":1606},"fb8402fe-977f-4fb6-affa-81e8539a827c","Padberg, 1973, On the facial structure of set packing polyhedra, Math. Programming, 5, 199, 10.1007\u002FBF01580121","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002FBF01580121",{"doi":1607},"10.1007\u002FBF01580121",{"id":1040,"text":1609,"url":1042,"identifiers":1610},"A. Schrijver, Combinatorial Optimization—Polyhedra and Efficiency, Algorithms and Combinatorics, vol. 24, Springer, Berlin, 2003.",{"doi":1044},{"id":26,"text":1612,"url":1613,"identifiers":1614},"The second DIMACS implementation challenge: NP-Hard Problems: Maximum Clique, Graph Coloring, and Satisfiability, See http:\u002F\u002Fdimacs.rutgers.edu\u002FChallenges\u002F or http:\u002F\u002Fmat.gsia.cmu.edu\u002Fchallenge.html (1992–1993).","http:\u002F\u002Fdimacs.rutgers.edu\u002FChallenges\u002Forhttp:\u002F\u002Fmat.gsia.cmu.edu\u002Fchallenge.html",{},{"id":1616,"createTime":1617,"updateTime":1618,"relativeEntities":1619,"slug":1620,"properties":1621,"entityType":766,"verifyStatus":25,"verifyTime":1628,"verifyNote":768,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"primaryUrl":1629,"fullTextUrl":26,"authors":1630,"publicationType":809,"publisherRelationship":1671,"citationCount":36,"citationInfo":1699,"publishDate":1701,"publishYear":1702,"citationAnalyzeStatus":1550,"lastCitationAnalyze":1703,"indexDatabases":26,"openAccess":26,"references":1704,"isForceReanalyzing":950},"63c13753-5bae-4669-8056-a820b2af22a9","2023-12-14T23:18:14.551+00:00","2026-06-08T02:42:37.796+00:00",[],"Cyclical-scheduling-and-multi-shift-scheduling-Complexity-and-approximation-algorithms",{"title":1622,"doi":1624,"gsPaper":1626},{"EN":1623},"Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms",{"VOID":1625},"10.1016\u002Fj.disopt.2006.02.002",{"VOID":1627},"[\"16453233653931270145\"]","2024-05-02T06:40:44.449+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1572528606000454",[1631,1650],{"id":1632,"sortIndex":115,"researcher":26,"roles":1633,"affiliations":1634,"properties":1645},"1d777834-6c3c-4786-b447-e889c1295ac3",[970],[1635],{"id":26,"sortIndex":36,"affiliation":1636,"properties":26},{"id":1637,"createTime":1638,"updateTime":1639,"relativeEntities":1640,"slug":1641,"properties":1642,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"341067d0-086d-42db-b90e-3daa5b2921f2","2024-01-04T20:32:58.407+00:00","2024-09-22T10:39:11.662+00:00",[],"Department-of-Statistics-The-Hebrew-University-Jerusalem-Israel",{"title":1643},{"VI":1644},"Department of Statistics, The Hebrew University, Jerusalem, Israel",{"title":1646,"gsAuthor":1648},{"VI":1647},"Asaf Levin",{"VOID":1649},"[\"cRDZAZoAAAAJ\"]",{"id":1651,"sortIndex":36,"researcher":26,"roles":1652,"affiliations":1653,"properties":1666},"c8f81703-e210-4973-ade2-cbfc011af323",[970],[1654],{"id":1655,"sortIndex":36,"affiliation":1656,"properties":1663},"e3023939-573c-4b77-b431-dd279d9955b5",{"id":1657,"createTime":1658,"updateTime":1658,"relativeEntities":1659,"slug":26,"properties":1660,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"f453b7e4-301c-4666-80b7-67f959758331","2024-01-24T21:13:14.485+00:00",[],{"title":1661},{"VI":1662},"Department of Industrial Engineering and Operations Research and Walter A. Haas School of Business, University of California, Berkeley, USA",{"title":1664},{"VI":1665},"Department of Industrial Engineering and Operations Research and Walter A. Haas School of Business, University of California, Berkeley, United States",{"title":1667,"gsAuthor":1669},{"VI":1668},"Dorit S. Hochbaum",{"VOID":1670},"[\"Cc1JcywAAAAJ\"]",{"url":1629,"publisher":1672,"properties":1694},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1673,"slug":663,"properties":1674,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1677,"manageAffiliations":1678,"indexDatabases":1679,"url":26,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":1675,"title":1676},{"VOID":666},{"EN":668},[],[],[1680,1687],{"id":706,"indexDatabase":1681,"url":719,"indexYears":720,"academicFieldIds":1686,"indexDatabaseRanking":725},{"id":708,"createTime":709,"updateTime":710,"relativeEntities":1682,"label":1683,"description":1684,"key":716,"publicationTags":1685,"standard":26},[],{"EN":713,"VI":713},{"EN":713,"VI":715},[718],[722,723,724],{"id":727,"indexDatabase":1688,"url":742,"indexYears":26,"academicFieldIds":1693,"indexDatabaseRanking":26},{"id":729,"createTime":730,"updateTime":731,"relativeEntities":1689,"label":1690,"description":1691,"key":738,"publicationTags":1692,"standard":26},[],{"EN":734,"VI":734},{"VI":736,"EN":737},[740,741],[744,745],{"volume":1695,"pages":1697},{"VOID":1696},"3",{"VOID":1698},"327-340",{"total":36,"publishYear":36,"statisticByYear":1700},{},"2006-12-01",2006,"2026-06-08T02:42:37.795+00:00",[1705,1708,1714,1717,1725,1732,1739,1744,1747,1750,1756,1763,1767,1774,1777,1784,1787,1791,1798,1805,1811,1818,1821,1825,1832],{"id":26,"text":1706,"url":26,"identifiers":1707},"Adamy, 2002, Call control in rings, vol. 2380, 788",{},{"id":1709,"text":1710,"url":1711,"identifiers":1712},"b807c431-427e-4deb-918a-e1177e8f19a4","Atallah, 1995, An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications, Algorithmica, 14, 15, 10.1007\u002FBF01192049","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002FBF01192049",{"doi":1713},"10.1007\u002FBF01192049",{"id":26,"text":1715,"url":26,"identifiers":1716},"Barnhart, 1999, Crew scheduling, 492",{},{"id":26,"text":1718,"url":1719,"identifiers":1720},"Bartholdi, 1980, Cyclic scheduling via integer programs with circular ones, Operations Research, 28, 1074, 10.1287\u002Fopre.28.5.1074","https:\u002F\u002Fdoi.org\u002F10.1287\u002Fopre.28.5.1074",{"mag":1721,"openalex":1722,"pm":1723,"doi":1724},"2119874970","W2119874970","10249179","10.1287\u002Fopre.28.5.1074",{"id":26,"text":1726,"url":1727,"identifiers":1728},"Bartholdi, 1981, A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering, Operations Research, 29, 501, 10.1287\u002Fopre.29.3.501","https:\u002F\u002Fdoi.org\u002F10.1287\u002Fopre.29.3.501",{"mag":1729,"openalex":1730,"doi":1731},"2079052655","W2079052655","10.1287\u002Fopre.29.3.501",{"id":26,"text":1733,"url":1734,"identifiers":1735},"Chvátal, 1979, A greedy heuristic for the set-covering problem, Mathematics of Operations Research, 4, 233, 10.1287\u002Fmoor.4.3.233","https:\u002F\u002Fdoi.org\u002F10.1287\u002Fmoor.4.3.233",{"mag":1736,"openalex":1737,"doi":1738},"2157054705","W2157054705","10.1287\u002Fmoor.4.3.233",{"id":26,"text":1740,"url":1741,"identifiers":1742},"Dobson, 1982, Worst-case analysis of greedy heuristics for integer programming with non-negative data, Mathematics of Operations Research, 7, 515, 10.1287\u002Fmoor.7.4.515","http:\u002F\u002Fdx.doi.org\u002F10.1287\u002Fmoor.7.4.515",{"doi":1743},"10.1287\u002Fmoor.7.4.515",{"id":26,"text":1745,"url":26,"identifiers":1746},"T. Erlebach, private communication, 2003",{},{"id":26,"text":1748,"url":26,"identifiers":1749},"Garey, 1979",{},{"id":1751,"text":1752,"url":1753,"identifiers":1754},"d5a08638-0438-46bc-9741-63739707deb3","Hall, 1986, A fast approximation algorithm for the multicovering problem, Discrete Applied Mathematics, 15, 35, 10.1016\u002F0166-218X(86)90016-8","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002F0166218X86900168",{"doi":1755},"10.1016\u002F0166-218x(86)90016-8",{"id":26,"text":1757,"url":1758,"identifiers":1759},"Hochbaum, 1990, Convex separable optimization is not much harder than linear optimization, Journal of the ACM, 37, 843, 10.1145\u002F96559.96597","https:\u002F\u002Fdoi.org\u002F10.1145\u002F96559.96597",{"mag":1760,"openalex":1761,"doi":1762},"2053352956","W2053352956","10.1145\u002F96559.96597",{"id":26,"text":1764,"url":26,"identifiers":1765},"Hochbaum, 2002, Minimax problems with bitonic matrices, Networks, 40, 113, 10.1002\u002Fnet.10038",{"doi":1766},"10.1002\u002Fnet.10038",{"id":26,"text":1768,"url":1769,"identifiers":1770},"Hochbaum, 1982, Approximation algorithms for the set covering and vertex cover problems, SIAM Journal on Computing, 11, 555, 10.1137\u002F0211045","https:\u002F\u002Fdoi.org\u002F10.1137\u002F0211045",{"mag":1771,"openalex":1772,"doi":1773},"2088188524","W2088188524","10.1137\u002F0211045",{"id":1040,"text":1775,"url":1042,"identifiers":1776},"Karzanov, 1987, Maximum matching of given weight in complete and complete bipartite graphs, Kibernetika, 1, 7",{"doi":1044},{"id":26,"text":1778,"url":1779,"identifiers":1780},"Koop, 1988, Multiple shift workforce lower bounds, Management Science, 34, 1221, 10.1287\u002Fmnsc.34.10.1221","https:\u002F\u002Fdoi.org\u002F10.1287\u002Fmnsc.34.10.1221",{"mag":1781,"openalex":1782,"doi":1783},"2082640469","W2082640469","10.1287\u002Fmnsc.34.10.1221",{"id":1040,"text":1785,"url":1042,"identifiers":1786},"Kozen, 1985, NC algorithms for comparability graphs, interval gaphs, and testing for unique perfect matching, vol. 206, 496",{"doi":1044},{"id":26,"text":1788,"url":26,"identifiers":1789},"Lau, 1996, Combinatorial approaches for hard problems in manpower scheduling, Journal of the Operations Research Society of Japan, 39, 88, 10.15807\u002Fjorsj.39.88",{"doi":1790},"10.15807\u002Fjorsj.39.88",{"id":26,"text":1792,"url":1793,"identifiers":1794},"Lund, 1994, On the hardness of approximating minimization problems, Journal of the ACM, 41, 960, 10.1145\u002F185675.306789","https:\u002F\u002Fdoi.org\u002F10.1145\u002F185675.306789",{"mag":1795,"openalex":1796,"doi":1797},"2059453880","W2059453880","10.1145\u002F185675.306789",{"id":26,"text":1799,"url":1800,"identifiers":1801},"Morris, 1983, Simple approaches to shift, days off and tour scheduling problems, Management Science, 29, 942, 10.1287\u002Fmnsc.29.8.942","https:\u002F\u002Fdoi.org\u002F10.1287\u002Fmnsc.29.8.942",{"mag":1802,"openalex":1803,"doi":1804},"2107448329","W2107448329","10.1287\u002Fmnsc.29.8.942",{"id":1806,"text":1807,"url":1808,"identifiers":1809},"16c2cbf2-526d-4f3c-80df-348a9be116e1","Mulmuley, 1987, Matching is as easy as matrix inversion, Combinatorica, 7, 105, 10.1007\u002FBF02579206","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002FBF02579206",{"doi":1810},"10.1007\u002FBF02579206",{"id":26,"text":1812,"url":1813,"identifiers":1814},"Orlin, 1993, A faster strongly polynomial minimum cost flow algorithm, Operations Research, 41, 338, 10.1287\u002Fopre.41.2.338","https:\u002F\u002Fdoi.org\u002F10.1287\u002Fopre.41.2.338",{"mag":1815,"openalex":1816,"doi":1817},"2156036190","W2156036190","10.1287\u002Fopre.41.2.338",{"id":26,"text":1819,"url":26,"identifiers":1820},"Schrijver, 2003",{},{"id":26,"text":1822,"url":26,"identifiers":1823},"Veinott, 1962, Optimal capacity scheduling: Parts I and II, Operations Research, 10, 518, 10.1287\u002Fopre.10.4.518",{"doi":1824},"10.1287\u002Fopre.10.4.518",{"id":26,"text":1826,"url":1827,"identifiers":1828},"Vohra, 1988, A quick heuristic for some cyclic staffing problems with breaks, Journal of Operational Research Society, 39, 1057, 10.1057\u002Fpalgrave.jors.0391110","https:\u002F\u002Fdoi.org\u002F10.1057\u002Fjors.1988.177",{"mag":1829,"openalex":1830,"doi":1831},"2042798395","W2042798395","10.1057\u002Fjors.1988.177",{"id":1833,"text":1834,"url":1835,"identifiers":1836},"c0f18ad8-144c-4d97-8c95-cfca83031ed0","Yi, 2002, Matching in colored bipartite networks, Discrete Applied Mathematics, 121, 261, 10.1016\u002FS0166-218X(01)00300-6","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0166218X01003006",{"doi":1837},"10.1016\u002Fs0166-218x(01)00300-6",{"id":1839,"createTime":1840,"updateTime":1841,"relativeEntities":1842,"slug":1843,"properties":1844,"entityType":766,"verifyStatus":25,"verifyTime":1853,"verifyNote":768,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"primaryUrl":1854,"fullTextUrl":26,"authors":1855,"publicationType":809,"publisherRelationship":1904,"citationCount":36,"citationInfo":1932,"publishDate":1934,"publishYear":1471,"citationAnalyzeStatus":1550,"lastCitationAnalyze":1841,"indexDatabases":26,"openAccess":26,"references":26,"isForceReanalyzing":950},"10fb0abf-8b85-4ae6-80f8-cc215e3679f4","2023-12-31T19:47:04.639+00:00","2026-06-05T23:40:26.965+00:00",[],"Parameterized-algorithms-for-generalizations-of-Directed-Feedback-Vertex-Set",{"references":1845,"title":1847,"doi":1849,"gsPaper":1851},{"VOID":1846},"Göke, 2019, Parameterized algorithms for generalizations of directed feedback vertex set, vol. 11458, 249\nKarp, 1972, Reducibility among combinatorial problems, 85\nSeymour, 1995, Packing directed circuits fractionally, Combinatorica, 15, 281, 10.1007\u002FBF01200760\nEven, 1998, Approximating minimum feedback sets and multicuts in directed graphs, Algorithmica, 20, 151, 10.1007\u002FPL00009191\nEven, 2000, Divide-and-conquer approximation algorithms via spreading metrics, J. ACM, 47, 585, 10.1145\u002F347476.347478\nGuruswami, 2011, Beating the random ordering is hard: every ordering CSP is approximation resistant, SIAM J. Comput., 40, 878, 10.1137\u002F090756144\nGuruswami, 2016, Simple proof of hardness of feedback vertex set, Theory Comput., 12, 10.4086\u002Ftoc.2016.v012a006\nSvensson, 2013, Hardness of vertex deletion and project scheduling, Theory Comput., 9, 759, 10.4086\u002Ftoc.2013.v009a024\nD. Lokshtanov, M.S. Ramanujan, S. Saurabh, When recursion is better than iteration: A linear-time algorithm for acyclicity with few error vertices, in: Proc. SODA 2018, 2018, pp. 1916–1933.\nChitnis, 2015, Directed subset feedback vertex set is fixed-parameter tractable, ACM Trans. Algorithms, 11, 10.1145\u002F2700209\nD. Lokshtanov, M. Ramanujan, S. Saurabh, Parameterized Complexity and Approximability of Directed Odd Cycle Transversal, in: Proc. SODA 2020, 2020, pp. 2181–2200.\nGöke, 2020, Hitting long directed cycles is fixed-parameter tractable, vol. 168, 59:1\nCechlárová, 2010, Computing the deficiency of housing markets with duplicate houses, vol. 6478, 72\nMarx, 2012, What’s next? Future directions in parameterized complexity, vol. 7370, 469\nKumar, 2017, A 2ℓk Kernel for ℓ-component order connectivity, vol. 63, 20:1\nXiao, 2017, Linear kernels for separating a graph into components of bounded size, J. Comput. System Sci., 88, 260, 10.1016\u002Fj.jcss.2017.04.004\nChen, 2008, A fixed-parameter algorithm for the directed feedback vertex set problem, J. ACM, 55, 10.1145\u002F1411509.1411511\nFortune, 1980, The directed subgraph homeomorphism problem, Theoret. Comput. Sci., 10, 111, 10.1016\u002F0304-3975(80)90009-2\nBang-Jensen, 2016, DAG-width and circumference of digraphs, J. Graph Theory, 82, 194, 10.1002\u002Fjgt.21894\nChitnis, 2013, Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset, SIAM J. Comput., 42, 1674, 10.1137\u002F12086217X\nCygan, 2014, Parameterized complexity of Eulerian deletion problems, Algorithmica, 68, 41, 10.1007\u002Fs00453-012-9667-x\nBang-Jensen, 2020, Component order connectivity in directed graphs, vol. 180, 2:1\nDrange, 2016, On the computational complexity of vertex integrity and component order connectivity, Algorithmica, 76, 1181, 10.1007\u002Fs00453-016-0127-x\nNeogi, 2020, On the parameterized complexity of deletion to H-free strong components, vol. 170, 75:1",{"EN":1848},"Parameterized algorithms for generalizations of Directed Feedback Vertex Set",{"VOID":1850},"10.1016\u002Fj.disopt.2022.100740",{"VOID":1852},"[\"15245965761918778160\",\"17526122136176151182\"]","2024-05-14T16:46:24.762+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1572528622000457",[1856,1871,1885],{"id":1857,"sortIndex":36,"researcher":26,"roles":1858,"affiliations":1859,"properties":1868},"bf694847-c5b4-4fac-85d5-e7e3a4051ddf",[970],[1860],{"id":26,"sortIndex":36,"affiliation":1861,"properties":26},{"id":1862,"createTime":1863,"updateTime":1863,"relativeEntities":1864,"slug":26,"properties":1865,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"2bcc5bb7-0f80-47ba-8461-874e62bb683c","2024-02-12T05:27:09.696+00:00",[],{"title":1866},{"VI":1867},"Hamburg University of Technology, Institute for Algorithms and Complexity, Hamburg, Germany",{"title":1869},{"VI":1870},"Alexander Göke",{"id":1872,"sortIndex":114,"researcher":26,"roles":1873,"affiliations":1874,"properties":1880},"a9935de9-e1b9-4d63-ba92-23a299029820",[970],[1875],{"id":26,"sortIndex":36,"affiliation":1876,"properties":26},{"id":1862,"createTime":1863,"updateTime":1863,"relativeEntities":1877,"slug":26,"properties":1878,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1879},{"VI":1867},{"title":1881,"gsAuthor":1883},{"VI":1882},"Matthias Mnich",{"VOID":1884},"[\"5LvVxNYAAAAJ\"]",{"id":1886,"sortIndex":115,"researcher":26,"roles":1887,"affiliations":1888,"properties":1899},"f0f2ffca-bda1-4a60-b721-db28d1833081",[970],[1889],{"id":26,"sortIndex":36,"affiliation":1890,"properties":26},{"id":1891,"createTime":1892,"updateTime":1893,"relativeEntities":1894,"slug":1895,"properties":1896,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"05eb7039-33cb-42ed-86b9-88f6e6d36712","2024-01-09T01:54:43.708+00:00","2025-06-11T19:02:56.287+00:00",[],"CISPA-Helmholtz-Center-for-Information-Security-Saarbr%C3%BCcken-Germany",{"title":1897},{"VI":1898},"CISPA Helmholtz Center for Information Security, Saarbrücken, Germany",{"title":1900,"gsAuthor":1902},{"VI":1901},"Dániel Marx",{"VOID":1903},"[\"hY2ibr8AAAAJ\"]",{"url":1854,"publisher":1905,"properties":1927},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1906,"slug":663,"properties":1907,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1910,"manageAffiliations":1911,"indexDatabases":1912,"url":26,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":1908,"title":1909},{"VOID":666},{"EN":668},[],[],[1913,1920],{"id":706,"indexDatabase":1914,"url":719,"indexYears":720,"academicFieldIds":1919,"indexDatabaseRanking":725},{"id":708,"createTime":709,"updateTime":710,"relativeEntities":1915,"label":1916,"description":1917,"key":716,"publicationTags":1918,"standard":26},[],{"EN":713,"VI":713},{"EN":713,"VI":715},[718],[722,723,724],{"id":727,"indexDatabase":1921,"url":742,"indexYears":26,"academicFieldIds":1926,"indexDatabaseRanking":26},{"id":729,"createTime":730,"updateTime":731,"relativeEntities":1922,"label":1923,"description":1924,"key":738,"publicationTags":1925,"standard":26},[],{"EN":734,"VI":734},{"VI":736,"EN":737},[740,741],[744,745],{"volume":1928,"pages":1930},{"VOID":1929},"46",{"VOID":1931},"100740",{"total":36,"publishYear":36,"statisticByYear":1933},{},"2022-11-01",{"id":1936,"createTime":1937,"updateTime":1938,"relativeEntities":1939,"slug":1940,"properties":1941,"entityType":766,"verifyStatus":25,"verifyTime":1948,"verifyNote":768,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"primaryUrl":1949,"fullTextUrl":26,"authors":1950,"publicationType":809,"publisherRelationship":1999,"citationCount":36,"citationInfo":2027,"publishDate":2029,"publishYear":2030,"citationAnalyzeStatus":28,"lastCitationAnalyze":2031,"indexDatabases":26,"openAccess":26,"references":26,"isForceReanalyzing":950},"145d18a2-33f7-4539-8070-6eabcf2a4da0","2024-01-30T21:03:46.899+00:00","2026-04-20T10:38:12.790+00:00",[],"The-inverse-0-1-knapsack-problem-Theory-algorithms-and-computational-experiments",{"title":1942,"doi":1944,"gsPaper":1946},{"EN":1943},"The inverse {0,1}-knapsack problem: Theory, algorithms and computational experiments",{"VOID":1945},"10.1016\u002Fj.disopt.2013.03.001",{"VOID":1947},"[\"8196459345377297325\"]","2024-05-04T00:54:53.985+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1572528613000066",[1951,1968,1982],{"id":1952,"sortIndex":114,"researcher":26,"roles":1953,"affiliations":1954,"properties":1963},"9238f9bb-2ce9-4287-b3a4-fb9003bee673",[970],[1955],{"id":26,"sortIndex":36,"affiliation":1956,"properties":26},{"id":1957,"createTime":1958,"updateTime":1958,"relativeEntities":1959,"slug":26,"properties":1960,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"81c37c24-5f9a-4710-8413-407df8477fc7","2024-01-30T21:03:46.968+00:00",[],{"title":1961},{"VI":1962},"CoDE-SMG, Service de Mathématiques de la Gestion, Ecole Polytechnique de Bruxelles, Université libre de Bruxelles, 50, Av. F. Roosevelt, CP 210\u002F01 B-1050 Brussels, Belgium",{"title":1964,"gsAuthor":1966},{"VI":1965},"Yves De Smet",{"VOID":1967},"[\"XSMyEc4AAAAJ\"]",{"id":1969,"sortIndex":36,"researcher":26,"roles":1970,"affiliations":1971,"properties":1977},"8ad30b07-eb58-410f-bb91-fd22c344c74e",[970],[1972],{"id":26,"sortIndex":36,"affiliation":1973,"properties":26},{"id":1957,"createTime":1958,"updateTime":1958,"relativeEntities":1974,"slug":26,"properties":1975,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1976},{"VI":1962},{"title":1978,"gsAuthor":1980},{"VI":1979},"Julien Roland",{"VOID":1981},"[\"_hnlw18AAAAJ\"]",{"id":1983,"sortIndex":115,"researcher":26,"roles":1984,"affiliations":1985,"properties":1994},"e53b3698-7b87-4c4a-b73c-9c998a23cc89",[970],[1986],{"id":26,"sortIndex":36,"affiliation":1987,"properties":26},{"id":1988,"createTime":1989,"updateTime":1989,"relativeEntities":1990,"slug":26,"properties":1991,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"ec8b59f5-d096-449d-9ed3-c2e5df91fe81","2024-02-12T06:47:46.679+00:00",[],{"title":1992},{"VI":1993},"CEG-IST, Instituto Superior Técnico, Technical University of Lisbon, Av. Rovisco Pais, 1049-001 Lisboa, Portugal",{"title":1995,"gsAuthor":1997},{"VI":1996},"José Rui Figueira",{"VOID":1998},"[\"O1kSM3MAAAAJ\"]",{"url":1949,"publisher":2000,"properties":2022},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2001,"slug":663,"properties":2002,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2005,"manageAffiliations":2006,"indexDatabases":2007,"url":26,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":2003,"title":2004},{"VOID":666},{"EN":668},[],[],[2008,2015],{"id":706,"indexDatabase":2009,"url":719,"indexYears":720,"academicFieldIds":2014,"indexDatabaseRanking":725},{"id":708,"createTime":709,"updateTime":710,"relativeEntities":2010,"label":2011,"description":2012,"key":716,"publicationTags":2013,"standard":26},[],{"EN":713,"VI":713},{"EN":713,"VI":715},[718],[722,723,724],{"id":727,"indexDatabase":2016,"url":742,"indexYears":26,"academicFieldIds":2021,"indexDatabaseRanking":26},{"id":729,"createTime":730,"updateTime":731,"relativeEntities":2017,"label":2018,"description":2019,"key":738,"publicationTags":2020,"standard":26},[],{"EN":734,"VI":734},{"VI":736,"EN":737},[740,741],[744,745],{"volume":2023,"pages":2025},{"VOID":2024},"10",{"VOID":2026},"181-192",{"total":36,"publishYear":36,"statisticByYear":2028},{},"2013-05-01",2013,"2026-04-20T10:38:12.789+00:00",{"id":2033,"createTime":2034,"updateTime":2035,"relativeEntities":2036,"slug":2037,"properties":2038,"entityType":766,"verifyStatus":25,"verifyTime":2047,"verifyNote":768,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":115,"primaryUrl":2048,"fullTextUrl":26,"authors":2049,"publicationType":809,"publisherRelationship":2081,"citationCount":36,"citationInfo":2109,"publishDate":2111,"publishYear":1471,"citationAnalyzeStatus":28,"lastCitationAnalyze":2112,"indexDatabases":26,"openAccess":26,"references":26,"isForceReanalyzing":950},"55872457-76e0-4c4f-80a7-da56c779a9ef","2024-02-12T14:41:53.773+00:00","2026-04-15T07:28:26.456+00:00",[],"Penalty-and-partitioning-techniques-to-improve-performance-of-QUBO-solvers",{"references":2039,"title":2041,"doi":2043,"gsPaper":2045},{"VOID":2040},"Kochenberger, 2014, The unconstrained binary quadratic programming problem: a survey, J. Comb. Optim., 28, 58, 10.1007\u002Fs10878-014-9734-0\nGlover, 2019, Quantum bridge analytics i: a tutorial on formulating and using qubo models, 4OR, 17, 335, 10.1007\u002Fs10288-019-00424-y\nMooney, 2019\nPreskill, 2018, Quantum computing in the nisq era and beyond, Quantum, 2, 79, 10.22331\u002Fq-2018-08-06-79\nCormier, 2019, Unfolding measurement distributions via quantum annealing, J. High Energy Phys., 2019, 128, 10.1007\u002FJHEP11(2019)128\nVyskocil, 2018, Simple constraint embedding for quantum annealers, 1\nVyskocil, 2019, Embedding equality constraints of optimization problems into a quantum annealer, Algorithms, 12, 77, 10.3390\u002Fa12040077\nVyskočil, 2019, Embedding inequality constraints for quantum annealing optimization, 11\nBian, 2016, Mapping constrained optimization problems to quantum annealing with application to fault diagnosis, Front. ICT, 3, 14, 10.3389\u002Ffict.2016.00014\nVerma, 2019, Optimal quadratic reformulations of fourth degree pseudo-boolean functions, Optim. Lett., 1\nGlover, 2002, Solving quadratic knapsack problems by reformulation and tabu search: Single constraint case, 111\nStadler, 2002, Fitness landscapes, 183\nChicano, 2013, Elementary landscape decomposition of the 0-1 unconstrained quadratic optimization, J. Heuristics, 19, 711, 10.1007\u002Fs10732-011-9170-6\nLovász, 2006\nBontempi, 2005, From linearization to lazy learning: a survey of divide-and-conquer techniques for nonlinear control, Int. J. Comput. Cogn., 3\nBeasley, 1990, Or-library: distributing test problems by electronic mail, J. Oper. Res. Soc., 41, 1069, 10.1057\u002Fjors.1990.166\nLewis, 2016, Probabilistic multistart with path relinking for solving the unconstrained binary quadratic problem, Int. J. Oper. Res., 26, 13, 10.1504\u002FIJOR.2016.075647\nWang, 2012, Path relinking for unconstrained binary quadratic programming, European J. Oper. Res., 223, 595, 10.1016\u002Fj.ejor.2012.07.012\n2019\nAngel, 1998, Autocorrelation coefficient for the graph bipartitioning problem, Theoret. Comput. Sci., 191, 229, 10.1016\u002FS0304-3975(97)00176-X\nWeinberger, 1990, Correlated and uncorrelated fitness landscapes and how to tell the difference, Biol. Cybern., 63, 325, 10.1007\u002FBF00202749\nMetropolis, 1949, The monte carlo method, J. Amer. Statist. Assoc., 44, 335, 10.1080\u002F01621459.1949.10483310",{"EN":2042},"Penalty and partitioning techniques to improve performance of QUBO solvers",{"VOID":2044},"10.1016\u002Fj.disopt.2020.100594",{"VOID":2046},"[\"15736012899760202063\"]","2024-05-06T22:43:20.622+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1572528620300281",[2050,2067],{"id":2051,"sortIndex":36,"researcher":26,"roles":2052,"affiliations":2053,"properties":2062},"c7a1ad99-f5b2-4db6-9e2e-d3d382f6e71b",[970],[2054],{"id":26,"sortIndex":36,"affiliation":2055,"properties":26},{"id":2056,"createTime":2057,"updateTime":2057,"relativeEntities":2058,"slug":26,"properties":2059,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"95022695-3b9d-4b17-b208-fc200d91410a","2023-12-14T15:18:01.467+00:00",[],{"title":2060},{"VI":2061},"Craig School of Business, Missouri Western State University, Saint Joseph, MO, 64507, United States",{"title":2063,"gsAuthor":2065},{"VI":2064},"Amit Verma",{"VOID":2066},"[\"ES5pWCYAAAAJ\"]",{"id":2068,"sortIndex":115,"researcher":26,"roles":2069,"affiliations":2070,"properties":2076},"60c98508-7576-4957-959f-13dddf96c848",[970],[2071],{"id":26,"sortIndex":36,"affiliation":2072,"properties":26},{"id":2056,"createTime":2057,"updateTime":2057,"relativeEntities":2073,"slug":26,"properties":2074,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2075},{"VI":2061},{"title":2077,"gsAuthor":2079},{"VI":2078},"Mark Lewis",{"VOID":2080},"[\"iVZMck0AAAAJ\"]",{"url":2048,"publisher":2082,"properties":2104},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2083,"slug":663,"properties":2084,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2087,"manageAffiliations":2088,"indexDatabases":2089,"url":26,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":2085,"title":2086},{"VOID":666},{"EN":668},[],[],[2090,2097],{"id":706,"indexDatabase":2091,"url":719,"indexYears":720,"academicFieldIds":2096,"indexDatabaseRanking":725},{"id":708,"createTime":709,"updateTime":710,"relativeEntities":2092,"label":2093,"description":2094,"key":716,"publicationTags":2095,"standard":26},[],{"EN":713,"VI":713},{"EN":713,"VI":715},[718],[722,723,724],{"id":727,"indexDatabase":2098,"url":742,"indexYears":26,"academicFieldIds":2103,"indexDatabaseRanking":26},{"id":729,"createTime":730,"updateTime":731,"relativeEntities":2099,"label":2100,"description":2101,"key":738,"publicationTags":2102,"standard":26},[],{"EN":734,"VI":734},{"VI":736,"EN":737},[740,741],[744,745],{"volume":2105,"pages":2107},{"VOID":2106},"44",{"VOID":2108},"100594",{"total":36,"publishYear":36,"statisticByYear":2110},{},"2022-05-01","2026-04-15T07:28:26.455+00:00",{"id":2114,"createTime":2115,"updateTime":2116,"relativeEntities":2117,"slug":2118,"properties":2119,"entityType":766,"verifyStatus":25,"verifyTime":2116,"verifyNote":768,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"primaryUrl":2126,"fullTextUrl":26,"authors":2127,"publicationType":809,"publisherRelationship":2173,"citationCount":26,"citationInfo":26,"publishDate":1934,"publishYear":1471,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":26,"isForceReanalyzing":950},"b0027117-cabf-49b9-b227-95d6f090fe16","2024-01-12T13:31:39.204+00:00","2025-02-21T21:00:20.314+00:00",[],"Packing-strong-subgraph-in-digraphs",{"references":2120,"title":2122,"doi":2124},{"VOID":2121},"Henning, 2009, Local Steiner convexity, European J. Combin., 30, 1186, 10.1016\u002Fj.ejc.2008.09.010\nGrötschel, 1997, The Steiner tree packing problem in VLSI design, Math. Program., 78, 265, 10.1007\u002FBF02614374\nSherwani, 1999\nLi, 2016\nBang-Jensen, 2003, Steiner type problems for digraphs that are locally semicomplete or extended semicomplete, J. Graph Theory, 44, 193, 10.1002\u002Fjgt.10140\nWest, 2012, Packing Steiner trees and S-connectors in graphs, J. Combin. Theory Ser. B, 102, 186, 10.1016\u002Fj.jctb.2011.06.003\nBres̆ar, 2011, On a local 3-Steiner convexity, Euro. J. Comb., 32, 1222, 10.1016\u002Fj.ejc.2011.06.001\nK. Berczi, E.R. Kovacs, A note on strongly edge-disjoint arborescences, EGRES TR-2011-04.\nCheriyan, 2006, Hardness and approximation results for packing Steiner trees, Algorithmica, 45, 21, 10.1007\u002Fs00453-005-1188-4\nDeVos, 2016, Packing Steiner trees, J. Combin. Theory Ser. B, 119, 178, 10.1016\u002Fj.jctb.2016.02.002\nKriesell, 2003, Edge-disjoint trees containing some given vertices in a graph, J. Combin. Theory Ser. B, 88, 53, 10.1016\u002FS0095-8956(02)00013-8\nLau, 2007, An approximate max-Steiner-tree-packing min-Steiner-cut theorem, Combinatorica, 27, 71, 10.1007\u002Fs00493-007-0044-3\nSun, 2022, Directed Steiner tree packing and directed tree connectivity, J. Graph Theory\nBang-Jensen, 2020, Arc-disjoint strong spanning subdigraphs of semicomplete compositions, J. Graph Theory, 95, 267, 10.1002\u002Fjgt.22568\nBang-Jensen, 2012, Decomposing locally semicomplete digraphs into strong spanning subdigraphs, J. Combin. Theory Ser. B, 102, 701, 10.1016\u002Fj.jctb.2011.09.001\nBang-Jensen, 2004, Decomposing k-arc-strong tournaments into strong spanning subdigraphs, Combinatorica, 24, 331, 10.1007\u002Fs00493-004-0021-z\nSun, 2019, Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs, Discrete Math., 342, 2297, 10.1016\u002Fj.disc.2019.05.003\nSun, 2019, Strong subgraph k-connectivity, J. Graph Theory, 92, 5, 10.1002\u002Fjgt.22437\nSun, 2021, Strong subgraph connectivity of digraphs, Graphs Combin., 37, 951, 10.1007\u002Fs00373-021-02294-w\nBang-Jensen, 1995, Quasi-transitive digraphs, J. Graph Theory, 20, 141, 10.1002\u002Fjgt.3190200205\nBang-Jensen, 2009\nGaleana-Sánchez, 2018, Quasi-transitive digraphs and their extensions\nHammack, 2018, Digraphs products\nGutin, 1994, Polynomial algorithms for finding Hamiltonian paths and cycles in quasi-transitive digraphs, Australas. J. Combin., 10, 231\nGutin, 2020, Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs, Discrete Math., 343, 10.1016\u002Fj.disc.2020.111816\nL. Lovász, Coverings and colorings of hypergraphs, Coverings and colorings of hypergraphs, in: Proc. 4th Southeastern Conf. on Comb. Utilitas Math, 1973, pp. 3–12.\nFeige, 2002, Approximating the domatic number, SIAM J. Comput., 32, 172, 10.1137\u002FS0097539700380754\nNg, 1997, Hamiltonian decomposition of complete regular multipartite digraphs, Discrete Math., 177, 279, 10.1016\u002FS0012-365X(97)00017-4\nNg, 1998, Hamiltonian decomposition of lexicographic products of digraphs, J. Combin. Theory Ser. B, 73, 119, 10.1006\u002Fjctb.1998.1816\nCamion, 1959, Chemins et circuits hamiltoniens des graphes complets, C. R. Acad. Sci. III, 249, 2151\nBang-Jensen, 1993, Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs, Discrete Appl. Math., 41, 75, 10.1016\u002F0166-218X(93)90246-K",{"EN":2123},"Packing strong subgraph in digraphs",{"VOID":2125},"10.1016\u002Fj.disopt.2022.100745","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1572528622000500",[2128,2143,2158],{"id":2129,"sortIndex":114,"researcher":26,"roles":2130,"affiliations":2131,"properties":2140},"ba6e6e0a-fd4b-4b71-ba2e-0072f670a9a0",[970],[2132],{"id":26,"sortIndex":36,"affiliation":2133,"properties":26},{"id":2134,"createTime":2135,"updateTime":2135,"relativeEntities":2136,"slug":26,"properties":2137,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"79daeb97-05a6-4ce3-922d-788db5b1bf14","2023-12-28T22:53:18.492+00:00",[],{"title":2138},{"VI":2139},"School of Mathematical Science & Institute of Mathematics, Nanjing Normal University, Nanjing, 210023, PR China",{"title":2141},{"VI":2142},"Xiaoyan Zhang",{"id":2144,"sortIndex":115,"researcher":26,"roles":2145,"affiliations":2146,"properties":2155},"f48e2650-c5c0-4767-97eb-756d1c168431",[970],[2147],{"id":26,"sortIndex":36,"affiliation":2148,"properties":26},{"id":2149,"createTime":2150,"updateTime":2150,"relativeEntities":2151,"slug":26,"properties":2152,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"911e1c80-7007-45b2-97f6-517e43af92eb","2024-01-24T22:38:16.695+00:00",[],{"title":2153},{"VI":2154},"Department of Computer Science, Royal Holloway, University of London, Egham, UK",{"title":2156},{"VI":2157},"Gregory Gutin",{"id":2159,"sortIndex":36,"researcher":26,"roles":2160,"affiliations":2161,"properties":2170},"5478b767-9021-4b2a-a322-416c7b971dee",[970],[2162],{"id":26,"sortIndex":36,"affiliation":2163,"properties":26},{"id":2164,"createTime":2165,"updateTime":2165,"relativeEntities":2166,"slug":26,"properties":2167,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"cfdc7f4b-8ca5-4b58-9f87-b40f800da47a","2023-12-20T20:24:30.832+00:00",[],{"title":2168},{"VI":2169},"School of Mathematics and Statistics, Ningbo University, Ningbo 315211, PR China",{"title":2171},{"VI":2172},"Yuefang Sun",{"url":2126,"publisher":2174,"properties":2196},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2175,"slug":663,"properties":2176,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2179,"manageAffiliations":2180,"indexDatabases":2181,"url":26,"thumbnailPath":26,"statistic":26,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":2177,"title":2178},{"VOID":666},{"EN":668},[],[],[2182,2189],{"id":706,"indexDatabase":2183,"url":719,"indexYears":720,"academicFieldIds":2188,"indexDatabaseRanking":725},{"id":708,"createTime":709,"updateTime":710,"relativeEntities":2184,"label":2185,"description":2186,"key":716,"publicationTags":2187,"standard":26},[],{"EN":713,"VI":713},{"EN":713,"VI":715},[718],[722,723,724],{"id":727,"indexDatabase":2190,"url":742,"indexYears":26,"academicFieldIds":2195,"indexDatabaseRanking":26},{"id":729,"createTime":730,"updateTime":731,"relativeEntities":2191,"label":2192,"description":2193,"key":738,"publicationTags":2194,"standard":26},[],{"EN":734,"VI":734},{"VI":736,"EN":737},[740,741],[744,745],{"volume":2197,"pages":2198},{"VOID":1929},{"VOID":2199},"100745"]