We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
We describe algorithms to implement fully dynamic and kinetic three-dimensional unconstrained Delaunay triangulations, where the time evolution of the triangulation is not only go...
Given a surface triangulation T of and a subset X of its vertex set V (T), we define a restricted edge contraction as a contraction of an edge connecting X and V (T)−X. Boundar...
In this paper, a new flip-flop called Double-edge triggered Feedback Flip-Flop (DFFF) is proposed. The dynamic power consumption of DFFF is reduced by avoiding unnecessary interna...
S. H. Rasouli, A. Amirabadi, A. Seyedi, Ali Afzali...