Let G be a bipartite graph, and let e, i be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one p...
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
—In this paper, we investigate a second order consensus problem in a directed graph with non-uniform time delay. This problem arises naturally in real multi-agent systems such as...
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
J. Joseph Fowler, Carsten Gutwenger, Michael J&uum...
Abstract— This paper studies robotic sensor networks performing coverage optimization tasks with area constraints. The network coverage of the environment is a function of the ro...