Algorithmica

The classical and extensively-studied Fréchet distance between two curves is defined as an inf max, where the infimum is over all traversals of the curves, and the maximum is over all concurrent positions of the two agents. In this article we ...

In the allocation of indivisible goods, a prominent fairness notion is envy-freeness up to one good (EF1). We initiate the study of reachability problems in fair division by investigating the problem of whether one EF1 allocation can be reached ...

We study a new combinatorial problem based on the famous Minimum Common String Partition problem, which we call Permutation-constrained Common String Partition (PCSP for short). In PCSP, we are given two sequences/genomes s and t with the same ...$$$$$$$$$$$$

This work revisits quantum algorithms for the well-known welded tree problem, proposing a succinct quantum algorithm based on the simple coined quantum walks. It iterates the naturally defined coined quantum walk operator for a classically ...

Depth first search is a natural algorithmic technique for constructing a closed route that visits all vertices of a graph. The length of such a route equals, in an edge-weighted tree, twice the total weight of all edges of the tree and this is ...${}_{\mathrm{}}{}_{}$${}_{}$${}_{\mathrm{}}$${}_{}$${}_{}$${}_{}$