research
∙
02/18/2020
An Upper Bound for Sorting R_n with LRE
A permutation π over alphabet Σ = 1,2,3,...,n, is a sequence where every...
share
research
∙
11/19/2018
Sorting permutations with a transposition tree
The set of all permutations with n symbols is a symmetric group denoted ...
research
∙
10/01/2018
Minimum-Link Rectilinear Covering Tour is NP-hard in R^4
Given a set P of n points in R^d, a tour is a closed simple path that co...
research
∙
11/09/2017
