Pub Date : 2026-01-11DOI: 10.1007/s10878-025-01382-4
Manoj Kumar, Kranti Kumar
{"title":"Hytranet: a deep learning model for traffic congestion prediction in road networks","authors":"Manoj Kumar, Kranti Kumar","doi":"10.1007/s10878-025-01382-4","DOIUrl":"https://doi.org/10.1007/s10878-025-01382-4","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"3 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145947380","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-11DOI: 10.1007/s10878-025-01383-3
Ivan Damnjanović, Anran Xu, Kexiang Xu
{"title":"On the transmission irregular trees with the maximum Wiener index","authors":"Ivan Damnjanović, Anran Xu, Kexiang Xu","doi":"10.1007/s10878-025-01383-3","DOIUrl":"https://doi.org/10.1007/s10878-025-01383-3","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"46 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2026-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145947438","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-28DOI: 10.1007/s10878-025-01361-9
Patrick De Causmaecker, Lennart Van Hirtum
{"title":"Solving systems of equations on antichains for the computation of the ninth Dedekind Number","authors":"Patrick De Causmaecker, Lennart Van Hirtum","doi":"10.1007/s10878-025-01361-9","DOIUrl":"https://doi.org/10.1007/s10878-025-01361-9","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"166 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2025-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145847299","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-28DOI: 10.1007/s10878-025-01363-7
Amirhossein Noormohammadi, Seyed Ali MirHassani, Farnaz Hooshmand Khaligh
{"title":"Distributionally robust one-class support vector machine for anomaly detection under uncertainty","authors":"Amirhossein Noormohammadi, Seyed Ali MirHassani, Farnaz Hooshmand Khaligh","doi":"10.1007/s10878-025-01363-7","DOIUrl":"https://doi.org/10.1007/s10878-025-01363-7","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"31 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2025-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145847343","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-28DOI: 10.1007/s10878-025-01374-4
Tan D. Tran, Canh V. Pham
{"title":"Fast approximation algorithm for non-monotone DR-submodular maximization under size constraint","authors":"Tan D. Tran, Canh V. Pham","doi":"10.1007/s10878-025-01374-4","DOIUrl":"https://doi.org/10.1007/s10878-025-01374-4","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"23 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2025-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145847342","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An integer model for optimizing dynamic allocation of medical supplies during the COVID-19","authors":"Hongqiang Fan, Shuyao Duan, Xun Weng, Jingtian Zhang, Lifen Yun","doi":"10.1007/s10878-025-01380-6","DOIUrl":"https://doi.org/10.1007/s10878-025-01380-6","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"24 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2025-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145807834","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-22DOI: 10.1007/s10878-025-01377-1
Wei-Tian Li, Po-Wen Yang
{"title":"Constructing the antimagic labelings for double stars union paths on three vertices","authors":"Wei-Tian Li, Po-Wen Yang","doi":"10.1007/s10878-025-01377-1","DOIUrl":"https://doi.org/10.1007/s10878-025-01377-1","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"5 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2025-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145807833","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-21DOI: 10.1007/s10878-025-01381-5
Runze Wang
{"title":"Strong edge-coloring of graphs with maximum edge weight seven","authors":"Runze Wang","doi":"10.1007/s10878-025-01381-5","DOIUrl":"https://doi.org/10.1007/s10878-025-01381-5","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"20 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2025-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145796142","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-19DOI: 10.1007/s10878-025-01372-6
Guantao Chen, Guangming Jing, Wenan Zang
{"title":"Publisher Correction: Proof of the Goldberg–Seymour conjecture on edge–colorings of multigraphs","authors":"Guantao Chen, Guangming Jing, Wenan Zang","doi":"10.1007/s10878-025-01372-6","DOIUrl":"https://doi.org/10.1007/s10878-025-01372-6","url":null,"abstract":"","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"151 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2025-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145796143","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-05DOI: 10.1007/s10878-025-01378-0
Dekel Tsur
In the 3-Leaf Power Vertex Deletion (resp., 3-Leaf Power Edge Deletion ) problem, the input is a graph G and an integer k , and the goal is to decide whether there is a set of at most k vertices (resp., edges) whose removal from G results in a graph that is a 3-leaf power. In this paper we give $$O^*(4.237^k)$$ -time algorithms for 3-Leaf Power Vertex Deletion and 3-Leaf Power Edge Deletion .
在三叶幂顶点删除（3-Leaf Power Vertex Deletion）中。（3-Leaf Power Edge Deletion, 3-Leaf Power Edge Deletion）问题，输入是一个图G和一个整数k，目标是决定是否存在一组最多包含k个顶点的集合。（边），将其从G中移除会得到一个3叶幂图。本文给出了三叶幂顶点删除和三叶幂边删除的$$O^*(4.237^k)$$时间算法。
{"title":"Faster algorithms for 3-leaf power modification problems","authors":"Dekel Tsur","doi":"10.1007/s10878-025-01378-0","DOIUrl":"https://doi.org/10.1007/s10878-025-01378-0","url":null,"abstract":"In the <jats:sc>3-Leaf Power Vertex Deletion</jats:sc> (resp., <jats:sc>3-Leaf Power Edge Deletion</jats:sc> ) problem, the input is a graph <jats:italic>G</jats:italic> and an integer <jats:italic>k</jats:italic> , and the goal is to decide whether there is a set of at most <jats:italic>k</jats:italic> vertices (resp., edges) whose removal from <jats:italic>G</jats:italic> results in a graph that is a 3-leaf power. In this paper we give <jats:inline-formula> <jats:tex-math>$$O^*(4.237^k)$$</jats:tex-math> </jats:inline-formula> -time algorithms for <jats:sc>3-Leaf Power Vertex Deletion</jats:sc> and <jats:sc>3-Leaf Power Edge Deletion</jats:sc> .","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"161 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2025-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145680179","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：