We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerur...
In this paper we present in detail a new efficient linear time and space suffix array construction algorithm(SACA), called the D-CriticalSubstring algorithm. The algorithm is built...
Given two sets of points in the plane, we are interested in locating a highway h such that an objective function on the city distance between points of the two sets is minimized (w...
We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called Angel-Daemon games. Those games were introduced to asses the goodness of a web or g...
In this paper we give a new algorithm to compute Liouvillian solutions of linear difference equations. Compared to the prior algorithm by Hendriks and Singer, our main contributi...