Social networks are the substrate upon which we make and evaluate many of our daily decisions: our costs and benefits depend on whether--or how many of, or which of--our friends ar...
Joshua R. Davis, Zachary Goldman, Jacob Hilty, Eli...
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutio...
We consider standard algorithms of finite graph theory, like for instance shortest path algorithms. We present two general methods to polynomially extend these algorithms to infi...
In this paper, we study the complexity of model-checking formulas of three important real-time logics (MTL, MITL, and TCTL) over restricted sets of timed paths. The classes of rest...
Abstract. The paper describes a problem of multi-agent path planning in environment with obstacles. Novel approach to multi-agent optimal path planning, using graph representation ...