This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
This paper discusses investigations of sequences of natural numbers which count the orbits of an in nite permutation group on n-sets or n-tuples. It surveys known results on the g...
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...