Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshta...
Traditional code optimizers have produced significant performance improvements over the past forty years. While promising avenues of research still exist, traditional static and p...
Jason Hiser, Naveen Kumar, Min Zhao, Shukang Zhou,...
The low price of commodity wireless LAN cards and access points (APs) has resulted in the rich proliferation of high density WLANs in enterprise, academic environments, and public ...
In this paper, we consider the problem of mitigating interference and improving network capacity in wireless mesh networks from the angle of temporal-spatial diversity. In a nutsh...
In order to generate high-quality code for modern processors, a compiler must aggressively schedule instructions, maximizing resource utilization for execution efficiency. For a ...
Matthew J. Bridges, Neil Vachharajani, Guilherme O...