CIAC
2010
Springer
14 years 7 months ago
2010
Springer
The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. In 1984, Akiyama et al. [1] stated the Linear Arboricity Conjecture...
CIAC
2010
Springer
14 years 7 months ago
2010
Springer
The problem of sharing the cost of a common infrastructure among a set of strategic and cooperating players has been the subject of intensive research in recent years. However, mos...
CIAC
2010
Springer
14 years 7 months ago
2010
Springer
CIAC
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
STOC
2010
ACM
14 years 7 months ago
2010
ACM
We ask the question ? how can websites and data aggregators continually release updated statistics, and meanwhile preserve each individual user's privacy? We propose a differ...
STOC
2010
ACM
14 years 7 months ago
2010
ACM
STOC
2010
ACM
14 years 7 months ago
2010
ACM
STOC
2010
ACM
14 years 7 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
STOC
2010
ACM
14 years 7 months ago
2010
ACM
STOC
2010
ACM
14 years 7 months ago
2010
ACM