1 |
Constructing clustered trees of hypergraphs,such that each cluster induces a path Advisor(s): Nili Beck and Michal Stern |
2 |
Finding Maximum perfect matching using Manhattan Topology Advisor(s): Nili Beck and Michal Stern |