Finding (bi-)clusters in bipartite graphs is a popular data analysis
app...
In recent years, online social networks have been the target of adversar...
Most media content consumed today is provided by digital platforms that
...
Dynamic programming (DP) is one of the fundamental paradigms in algorith...
Social networks are often modeled using signed graphs, where vertices
co...
We study the clustering of bipartite graphs and Boolean matrix factoriza...
The goal of Boolean Matrix Factorization (BMF) is to approximate a given...
We consider the following online optimization problem. We are given a gr...
Independent set is a fundamental problem in combinatorial optimization. ...
Graph coloring is a fundamental problem in computer science. We study th...
Modern networked systems are increasingly reconfigurable, enabling
deman...
We build upon the recent papers by Weinstein and Yu (FOCS'16), Larsen
(F...
Architectural monitoring and adaptation allows self-management capabilit...
Studying the computational complexity of problems is one of the - if not...