In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, when the set of colours is itself some class of lattice paths, we establish bijections be...
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...
Protein structure comparison is important for elucidation of evolutionary relationships, function and functionally important amino acid residues. We propose Geometric Invariant bas...