Paper Review Records
All Paper Review Records
20 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.
400
days
A short proof and experimental study of the approximation algorithm for label s - t cut
AuthorsPeng Zhang
Affiliations1. School of Software, Shandong University, Jinan, China
324
days
Total-neighbor-distinguishing coloring by sums of fractals of generalized Sierpiński graphs
AuthorsMiguel Del-Rio-Palma; Carlos Arturo Rodriguez Palma; Simone Dantas
Affiliations1. IME, Universidade Federal Fluminense, Niterói, Brazil; 2. CCET, Universidade Federal do Maranhão, São Luís, Brazil; 3. UIS, Universidad Industrial de Santander, Bucaramanga, Colombia
789
days
Shortest longest-path graph orientations
AuthorsYuichi Asahiro; Jesper Jansson; Avraham A. Melkman; Eiji Miyano; Hirotaka Ono; Quan Xue; Shay Zakov
Affiliations1. Kyushu Sangyo University, Fukuoka, Japan; 2. Kyoto University, Kyoto, Japan; 3. Stein Faculty of Computer and Information Science, Ben Gurion University of the Negev, Be’er Sheva, Israel; 4. Kyushu Institute of Technology, Iizuka, Japan; 5. Nagoya University, Nagoya, Japan; 6. The University of Hong Kong, Hong Kong, China; 7. Ruppin Academic Center, Kfar Monash, Israel
525
days
Perfect hierarchical matchings in graphs
AuthorsIan G. Ludden; Ellen Veomett; Sheldon H. Jacobson
Affiliations1. Department of Computer Science and Software Engineering, Rose-Hulman Institute of Technology, Terre Haute, USA; 2. Department of Computer Science, University of San Francisco, San Francisco, USA; 3. Siebel School of Computing and Data Science, University of Illinois Urbana-Champaign, Urbana, USA
226
days
Uncertainty-aware multi-objective optimization for rebalancing bike shared systems
AuthorsDiego Daniel Pedroza-Perez; Gabriel Luque; Sergio Nesmachnow; Jamal Toutouh
Affiliations1. ITIS Software, Universidad de Málaga, Malaga, Spain; 2. Universidad de la República, Montevideo, Uruguay
447
days
Branch and price algorithm for the stop number minimization problem
AuthorsVictor Nascimento; Luidi Simonetti
Affiliations1. Systems Engineering and Computer Science, Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brasil
555
days
Maximum linear arrangement: exact algorithms for specific classes of graphs and approximation algorithms for wide classes of graphs
AuthorsLluís Alemany-Puig; Juan Luis Esteban; Ramon Ferrer-i-Cancho
Affiliations1. Quantitative, Mathematical and Computational Linguistics Research Group, Department of Computer Science, Universitat Politècnica de Catalunya, Barcelona, Spain
300
days
Routing among Convex Polygonal Obstacles in the Plane using a Simplified Domain
AuthorsSiddharth Gaur; R. Inkulu
Affiliations1. Department of Computer Science and Engineering, Indian Institute of Technology Guwahati, Guwahati, India
808
days
Partial Fitch graphs: characterization, satisfiability and complexity
AuthorsMarc Hellmuth; Annachiara Korchmaros; José Antonio Ramírez-Rafael; Bruno Schmidt; Peter F. Stadler; Sandhya Thekkumpadan Puthiyaveedu
Affiliations1. Theoretical Computer Science Group, Department of Computer Science, Universität Leipzig, Leipzig, Germany; 2. Department of Mathematics, Faculty of Science, Stockholm University, Stockholm, Sweden; 3. Bioinformatics Group, Department of Computer Science & Interdisciplinary Center for Bioinformatics, Universität Leipzig, Leipzig, Germany; 4. Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany; 5. Facultad de Ciencias, Universidad National de Colombia, Bogotá, Colombia; 6. Competence Center for Scalable Data Services and Solutions Dresden/Leipzig (scaDS.AI), School of Embedded and Compositive Artificial Intelligence, Universität Leipzig, Leipzig, Germany; 7. Department of Theoretical Chemistry, University of Vienna, Wien, Austria; 8. Center for Non-coding RNA in Technology and Health, University of Copenhagen, Frederiksberg C, Denmark; 9. Santa Fe Institute, Santa Fe, USA
1,179
days
Efficient algorithms for computing the edit distance with non-overlapping inversions
AuthorsKuan-Lin Lai; Shie-Yan Lee; Chang-Biau Yang; Kuo-Tsung Tseng
Affiliations1. Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan; 2. Department of Shipping and Transportation Management, National Kaohsiung University of Science and Technology, Kaohsiung, Taiwan
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