Abstract: Computing maximum matchings in bipartite graphs is an important problem with applications in domains such as resource allocation, chemical analysis, and bioinformatics. The leading ...

Abstract: Minimizing the decoding delay, the completion time, or the delivery time of instantly decodable network coding (IDNC) can all be approximated to a maximum weight clique (MWC) problem, which ...

The new school year is here. Teachers are meeting fresh faces, setting up their classrooms, and laying out lesson plans. But the reality? Michigan doesn’t have enough teachers. Prep hours are ...