Bodlaender's Theorem states that for every k there is a linear-time algorithm that decides
whether an input graph has tree width k and, if so, computes a width-k tree composition …

Assessing trust in online social networks (OSNs) is critical for many applications such as
online marketing and network security. It is a challenging problem, however, due to the …

Assessing multi-hop interpersonal trust in online social networks (OSNs) is critical for many
social network applications such as online marketing but challenging due to the difficulties of …

Scientific workflow management systems are increasingly providing the ability to manage
and query the provenance of data products. However, the problem of differencing the …

We study the complexity of restricted versions of st-connectivity, which is the standard
complete problem for NL. In particular, we focus on different classes of planar graphs, of …

We clarify the computational complexity of planarity testing, by showing that planarity testing
is hard for L, and lies in SL. This nearly settles the question, since it is widely conjectured …

The robustness of multiagent systems can be affected by mistakes or behavioral biases (eg,
risk-aversion, altruism, toll-sensitivity), with some agents playing the" wrong game." This can …

Logspace optimization problems are the logspace analogues of the well-studied polynomial-
time optimization problems. Similarly to them, logspace optimization problems can have …

Cross-domain recommendation has become increasingly popular because it can determine
dependencies and correlations among different domains. However, this type of …

We investigate the st-connectivity problem for directed planar graphs, which is hard for L and
is contained in NL but is not known to be complete. We show that this problem is logspace …