Distance and Routing Labeling Schemes in Graphs Feodor F. Dragan Computer Science Department Kent State University dragan.
Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and (Local) Treewidth MohammadTaghi Hajiaghayi CS & AI Lab M.I.T. Joint work mainly.
