计算机科学
Paper Review Records
全部论文审稿周期
17 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期;保留 PDF/DOI/网页源链接
Piecewise rational affine maps, multidimensional generalized shifts, and computation over the real numbers
作者Daniel S. Graça
作者单位Universidade do Algarve, C. Gambelas, 8005-139 Faro, Portugal; Center for Research and Development in Mathematics and Applications (CIDMA), Department of Mathematics, University of Aveiro, 3810-193 Aveiro, Portugal
The Shannon capacity and a new lower bound for multicolored Ramsey numbers of graphs
作者Mengya He; Shengjin Ji; Ralf Klasing; Yaping Mao; Bo Ning
作者单位School of Mathematics and Statistics, Qinghai Normal University, Xining, Qinghai 810008, China; School of Mathematics and Statistics, Shandong University of Technology, Zibo, Shandong 255049, China; Université de Bordeaux, Bordeaux INP, CNRS, LaBRI, UMR 5800, Talence, France; Faculty of Environment and Information Sciences, Yokohama National University, 79-2 Tokiwadai, Hodogaya-ku, Yokohama 240-8501, Japan; School of Computer Science, Nankai University, Tianjin, 300350, China
Some sharp upper bounds on the eliminating feedback number of regular hypergraphs
作者Zhongzheng Tang; Haoyang Zou; Zhuo Diao
作者单位School of Mathematical Sciences, Beijing University of Posts and Telecommunications, Beijing, 100876, China; Key Laboratory of Mathematics and Information Networks (Beijing University of Posts and Telecommunications), Ministry of Education, Beijing, 100876, China; School of Statistics and Mathematics, Central University of Finance and Economics, Beijing, 100081, China
Job shop scheduling problem with competing agents
作者Abdenour Azerine; Mourad Boudhar; Djamal Rebaine
作者单位Laboratoire RECITS, Faculté de Mathématiques, Université des Sciences et de la Technologie Houari Boumedienne, Alger, Algeria; Département d'informatique et de mathématique, Université du Québec à Chicoutimi, Saguenay (Québec), Canada
Roman census: Enumerating and counting Roman dominating functions on graph classes
作者Faisal N. Abu-Khzam; Henning Fernau; Kevin Mann
作者单位Department of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon; Universität Trier, Fachbereich IV, Informatikwissenschaften, Germany
Can you link up with treewidth?
作者Radu Curticapean; Simon Döring; Daniel Neuen; Jiaheng Wang
作者单位University of Regensburg, Germany; IT University of Copenhagen, Denmark; Max Planck Institute for Informatics and Saarland University, Germany; TU Dresden, Germany; University of Helsinki, Finland
Expert Matching · Case Demo
把投稿要求,转成可验证的期刊方案
说清专业、时限和作者背景,CrushSCI 结合真实审稿样本,给出拟题方向、期刊初筛与周期判断。