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.
665
days
A faster algorithm for constructing the frequency difference consensus tree
AuthorsJesper Jansson; Wing-Kin Sung; Seyed Ali Tabatabaee; Yutong Yang
AffiliationsKyoto University, Kyoto, Japan; The Chinese University of Hong Kong, Hong Kong, China; Hong Kong Genome Institute, Hong Kong Science Park, Hong Kong, China; University of British Columbia, Vancouver, Canada
100
days
Tree decompositions meet induced matchings: beyond Max Weight Independent Set
AuthorsPaloma T. de Lima; Martin Milanič; Peter Muršič; Karolina Okrasa; Paweł Rzążewski; Kenny Štorgel
AffiliationsNorwegian School of Economics, Norway; IT University of Copenhagen, Denmark; FAMNIT and IAM, University of Primorska, Slovenia; FAMNIT, University of Primorska, Slovenia; Warsaw University of Technology, Poland; University of Oxford, UK; Warsaw University of Tech. & Univ. of Warsaw, Poland; Faculty of Information Studies in Novo mesto & FAMNIT, Univ. of Primorska, Slovenia
438
days
Minimizing the weighted number of tardy jobs is W[1]-hard
AuthorsKlaus Heeger; Danny Hermelin
AffiliationsDepartment of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel; Fraunhofer IOSB-INA, Lemgo, Germany
650
days
When is a set of phylogenetic trees displayed by a normal network?
AuthorsMagnus Bordewich; Simone Linz; Charles Semple
AffiliationsDepartment of Computer Science, Durham University, United Kingdom; School of Computer Science, University of Auckland, Auckland, New Zealand; School of Mathematics and Statistics, University of Canterbury, Christchurch, New Zealand
924
days
On maximal k-edge-connected subgraphs of undirected graphs
AuthorsLoukas Georgiadis; Giuseppe F. Italiano; Evangelos Kosinas; Debasish Pattanayak
AffiliationsUniversity of Ioannina, Greece; LUISS Guido Carli University, Roma, Italy
347
days
Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests
AuthorsDavid Mestel; Steven Chaplick; Steven Kelk; Ruben Meuwese
AffiliationsDepartment of Advanced Computing Sciences, Maastricht University, the Netherlands
593
days
Parameterized complexity of submodular minimization under uncertainty
AuthorsNaonori Kakimura; Ildikó Schlotter
AffiliationsDepartment of Mathematics, Keio University, 3-14-1, Hiyoshi, Yokohama, 223-8522, Japan; ELTE Centre for Economic and Regional Studies, Budapest, Hungary; Budapest University of Technology and Economics, Budapest, Hungary
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