92 citations · 612 across the 42 of their papers we have counts for
Showing 2006Show all
2 papers · 1 filter
cs.DM2006
Generalizations of the Hanoi Towers Problem
Sergey Benditkis, Illya Safro
Our theme bases on the classical Hanoi Towers Problem. In this paper we will define a new problem, permitting some positions, that were not legal in the classical problem. Our goal…
cs.DM2006★ 2 cited
The minimum linear arrangement problem on proper interval graphs
Ilya Safro
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs