A binary matrix is fully nested if its columns form a chain of subsets; that is, any two columns are ordered by the subset relation, where we view each column as a subset of the r...
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the net...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid M...