98 citations · 133 across the 9 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2017★ 5 cited
On the Triangle Clique Cover and Clique Cover Problems
Hoang Dau, Olgica Milenkovic, Gregory J. Puleo
An edge clique cover of a graph is a set of cliques that covers all edges of the graph. We generalize this concept to " clique cover", i.e. a set of cliques that covers all co…
math.CO2017★ 17 cited
MaxMinSum Steiner Systems for Access-Balancing in Distributed Storage
Hoang Dau, Olgica Milenkovic
Many code families such as low-density parity-check codes, fractional repetition codes, batch codes and private information retrieval codes with low storage overhead rely on the us…
math.CO2016
Latent Network Features and Overlapping Community Discovery via Boolean Intersection Representations
Son Hoang Dau, Olgica Milenkovic
We propose a new latent Boolean feature model for complex networks that captures different types of node interactions and network communities. The model is based on a new concept i…