Journal Selection & Manuscript Polishing Services
Computer Science
Computer Science
Paper Review Records
All Paper Review Records
17 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.
248
days
Piecewise rational affine maps, multidimensional generalized shifts, and computation over the real numbers
AuthorsDaniel S. Graça
AffiliationsUniversidade 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
429
days
Monotone classification with relative approximations
AuthorsYufei Tao
AffiliationsCUHK, Hong Kong
629
days
Structural parameters for dense temporal graphs
AuthorsJessica Enright; Samuel D. Hand; Laura Larios-Jones; Kitty Meeks
AffiliationsSchool of Computing Science, University of Glasgow, Sir Alwyn Williams Building, Glasgow, G12 8RZ, Scotland, UK
631
days
The Shannon capacity and a new lower bound for multicolored Ramsey numbers of graphs
AuthorsMengya He; Shengjin Ji; Ralf Klasing; Yaping Mao; Bo Ning
AffiliationsSchool 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
194
days
Some sharp upper bounds on the eliminating feedback number of regular hypergraphs
AuthorsZhongzheng Tang; Haoyang Zou; Zhuo Diao
AffiliationsSchool 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
193
days
An improved FPT approximation algorithm for diversity-aware l-centrum
AuthorsJunteng Song; Shuilian Liu; Yicheng Xu; Yong Zhang
AffiliationsShenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China; University of Chinese Academy of Sciences, Beijing, China
1,455
days
Job shop scheduling problem with competing agents
AuthorsAbdenour Azerine; Mourad Boudhar; Djamal Rebaine
AffiliationsLaboratoire 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
1,066
days
Roman census: Enumerating and counting Roman dominating functions on graph classes
AuthorsFaisal N. Abu-Khzam; Henning Fernau; Kevin Mann
AffiliationsDepartment of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon; Universität Trier, Fachbereich IV, Informatikwissenschaften, Germany
260
days
Can you link up with treewidth?
AuthorsRadu Curticapean; Simon Döring; Daniel Neuen; Jiaheng Wang
AffiliationsUniversity of Regensburg, Germany; IT University of Copenhagen, Denmark; Max Planck Institute for Informatics and Saarland University, Germany; TU Dresden, Germany; University of Helsinki, Finland
285
days
A linear-delay algorithm for enumerating strongly-connected induced subgraphs based on SSD set system
AuthorsKan Shota; Kazuya Haraguchi
AffiliationsGraduate School of Informatics, Kyoto University, Yoshida-honmachi, Kyoto, 6068501, Japan
Expert Matching · Case Demo
Turn Your Submission Goalsinto a Verifiable Journal Plan
Share your field, deadline, and author profile. CrushSCI uses real review records to suggest a title direction, shortlist journals, and estimate timelines.
Client
I work in environmental engineering and need an SCI paper published within three months. I have no grant funding or prominent co-author. Which journals could I target?
CrushSCI
Yes. We will first screen for feasibility against the 90-day deadline, then identify comparable papers without grant support or prominent co-authors. The final shortlist will prioritize research quality and journal scope.
- Suggested title
- Machine Learning and Life-Cycle Assessment for Predicting and Optimizing Carbon Emissions in Urban Wastewater Treatment
- Database shortlist
- Environmental Technology & Innovation
SampleLatest 5 valid paper samples from 2026
Average review96.4 days
Median77 days