Following a disaster-strike, rapid and reliable communication between relief/rescue workers
in the affected regions, and the control stations located at a distance, is essential. This is to …

We initiate the study of fairness among classes of agents in online bipartite matching where
there is a given set of offline vertices (aka agents) and another set of vertices (aka items) that …

We propose a new variant of the group activity selection problem (GASP), where the agents
are placed on a social network and activities can only be assigned to connected subgroups …

We consider a fair division setting in which items arrive one by one and are allocated to
agents via two existing mechanisms: LIKE and BALANCED LIKE. The LIKE mechanism is …

Meeting the exponential increase in the global demand for bandwidth has become a major
concern for today's data centers. The scalability of any data center is defined by the …

We study the approximation complexity of the Minimum Edge Dominating Set problem in
everywhere ϵ-dense and average ϵ̄-dense graphs. More precisely, we consider the …

Matching of vertices in social networks and other complex networks needs to take into
consideration the weight of the vertices (like degree) that are matched; arbitrary matching of …

Given an undirected graph, the problem of finding a maximal matching that has minimum
total weight is NP-hard. This problem has been studied extensively from a graph theoretical …

We analyze the simple greedy algorithm that iteratively removes the endpoints of a
maximum-degree edge in a graph, where the degree of an edge is the sum of the degrees of …

A technique for design of unknown inputs observers is presented, applied to the solution of
fault detection problem. The proposed technique is mainly based on observation of error …