We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
Abstract-- Multi-agent system is a rapidly developing research area with strong support from both civilian and military applications. One of the essential problems in multi-agent s...
The Ranking web of World Repositories (http://repositories.webometrics.info) is introduced. The objective is to promote Open Access Initiatives supporting the use of repositories ...
This paper presents a novel multiagent approach to automating taxi dispatch that services current bookings in a distributed fashion. The existing system in use by a taxi operator i...