Paper Review Records
All Paper Review Records
25 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.
661
days
The k‐Radius of 2‐Connected Graphs
Authors
Peter Dankelmann; Paul HornShow moreShow less
Affiliations
1. Department of Mathematics and Applied Mathematics University of Johannesburg Johannesburg South Africa; 2. Department of Mathematics University of Denver Denver Colorado USAShow moreShow less
510
days
B‐Coloring of Planar Graphs
Authors
Jiangxu Kong; Yiqiao Wang; Mengmeng ZhengShow moreShow less
Affiliations
1. School of Mathematics Hangzhou Normal University Hangzhou China; 2. Department of Mathematics Beijing University of Technology Beijing China; 3. School of Mathematical Sciences Zhejiang Normal University Jinhua ChinaShow moreShow less
502
days
Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs
Authors
Stefanie Gerke; Gregory Gutin; Anders Yeo; Yacong ZhouShow moreShow less
Affiliations
1. Department of Mathematics Royal Holloway University of London Egham UK; 2. Department of Computer Science Royal Holloway University of London Egham UK; 3. Department of Mathematics and Computer Science University of Southern Denmark Odense Denmark; 4. Department of Mathematics University of Johannesburg Auckland Park Johannesburg South Africa; 5. Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen ChinaShow moreShow less
524
days
Realizing Degree Sequences With S3‐Connected Graphs
Authors
Rui Guan; Chenglin Jiang; Hong‐Jian Lai; Jiaao Li; Xinyuan LiShow moreShow less
Affiliations
1. School of Mathematical Sciences and LPMC Nankai University Tianjin China; 2. School of Mathematics and Systems Science Guangdong Polytechnic Normal University Guangzhou China; 3. Department of Mathematics West Virginia University Morgantown West Virginia USAShow moreShow less
544
days
On a Clique‐Building Game of Erdős
Authors
Alexandru Malekshahian; Sam SpiroShow moreShow less
Affiliations
1. Department of Mathematics King's College London London England; 2. Mathematical Institute University of Oxford Oxford England; 3. Department of of Mathematics Georgia State University Atlanta Georgia USAShow moreShow less
645
days
On the Hardness of Switching to a Small Number of Edges
Authors
Vít Jelínek; Eva Jelínková; Jan KratochvílShow moreShow less
Affiliations
1. Computer Science Institute Faculty of Mathematics and Physics, Charles University Prague Czech Republic; 2. Department of Mathematics University of Chemistry and Technology Prague Czech Republic; 3. Department of Applied Mathematics Faculty of Mathematics and Physics, Charles University Prague Czech RepublicShow moreShow less
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 review62 days
Median65 days