A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
Evaggelos Lappas, Stavros D. Nikolopoulos, Leonida...
Abstract. Differential repetitive processes are a distinct class of continuous-discrete twodimensional linear systems of both systems theoretic and applications interest. These pr...
Michael Dymkov, Eric Rogers, Siarhei Dymkou, Krzys...
The paper discusses the digital artwork series Impossible Geographies, works that weave dynamic cartographies of invisible, fragile and hybrid spaces. Impossible Geographies 01: M...
We propose an algorithm for contouring k-manifolds (k = 1, 2) embedded in an arbitrary n-dimensional space. We assume (n−k) geometric constraints are represented as polynomial e...
With the rapid development of electronic and computing technology, multi-view video is attracting extensive interest recently due to its greatly enhanced viewing experience. In th...