Paper Review Records
All Paper Review Records
22 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.
1,066
days
Roman census: Enumerating and counting Roman dominating functions on graph classes
Authors
Faisal N. Abu-Khzam; Henning Fernau; Kevin MannShow moreShow less
Affiliations
Department of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon; Universität Trier, Fachbereich IV, Informatikwissenschaften, GermanyShow moreShow less
260
days
Can you link up with treewidth?
Authors
Radu Curticapean; Simon Döring; Daniel Neuen; Jiaheng WangShow moreShow less
Affiliations
University of Regensburg, Germany; IT University of Copenhagen, Denmark; Max Planck Institute for Informatics and Saarland University, Germany; TU Dresden, Germany; University of Helsinki, FinlandShow moreShow less
285
days
A linear-delay algorithm for enumerating strongly-connected induced subgraphs based on SSD set system
Authors
Kan Shota; Kazuya HaraguchiShow moreShow less
Affiliations
Graduate School of Informatics, Kyoto University, Yoshida-honmachi, Kyoto, 6068501, JapanShow moreShow less
665
days
A faster algorithm for constructing the frequency difference consensus tree
Authors
Jesper Jansson; Wing-Kin Sung; Seyed Ali Tabatabaee; Yutong YangShow moreShow less
Affiliations
Kyoto 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, CanadaShow moreShow less
100
days
Tree decompositions meet induced matchings: beyond Max Weight Independent Set
Authors
Paloma T. de Lima; Martin Milanič; Peter Muršič; Karolina Okrasa; Paweł Rzążewski; Kenny ŠtorgelShow moreShow less
Affiliations
Norwegian 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, SloveniaShow moreShow less
438
days
Minimizing the weighted number of tardy jobs is W[1]-hard
Authors
Klaus Heeger; Danny HermelinShow moreShow less
Affiliations
Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel; Fraunhofer IOSB-INA, Lemgo, GermanyShow 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