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.
650
days
When is a set of phylogenetic trees displayed by a normal network?
Authors
Magnus Bordewich; Simone Linz; Charles SempleShow moreShow less
Affiliations
Department 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 ZealandShow moreShow less
924
days
On maximal k-edge-connected subgraphs of undirected graphs
Authors
Loukas Georgiadis; Giuseppe F. Italiano; Evangelos Kosinas; Debasish PattanayakShow moreShow less
Affiliations
University of Ioannina, Greece; LUISS Guido Carli University, Roma, ItalyShow moreShow less
347
days
Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests
Authors
David Mestel; Steven Chaplick; Steven Kelk; Ruben MeuweseShow moreShow less
Affiliations
Department of Advanced Computing Sciences, Maastricht University, the NetherlandsShow moreShow less
593
days
Parameterized complexity of submodular minimization under uncertainty
Authors
Naonori Kakimura; Ildikó SchlotterShow moreShow less
Affiliations
Department 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, HungaryShow 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.
