Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Christophe Crespelle, Anthony Perez 0001, Ioan Todinca. An O(n2) time algorithm for the minimal permutation completion problem. Discrete Applied Mathematics, 254:80-95, 2019. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: 2)O(n2)-time algorithm for the minimal interval completion problemChristophe Crespelle, Ioan Todinca. TCS, 494:75-85, 2013. [doi] O(n^2) Time Algorithm for the Minimal Permutation Completion ProblemChristophe Crespelle, Anthony Perez, Ioan Todinca. wg 2016: 103-115 [doi] An ::::O::::(::::n:::::::2:::){/mathcal{O}}(n^2)-time Algorithm for the Minimal Interval Completion ProblemChristophe Crespelle, Ioan Todinca. tamc 2010: 175-186 [doi]
The following publications are possibly variants of this publication: