We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
Vida Dujmovic, Michael R. Fellows, Michael T. Hall...
We consider wait-free implementations of a regular read/ write register for unauthenticated data using a collection of 3t + k base objects, t of which can be subject to Byzantine ...
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
We propose a new low complexity and fast converging frequencydomain adaptive algorithm for sparse system identification. This is achieved by exploiting the MMax and SP tap-select...
Andy W. H. Khong, Xiang Lin, Milos Doroslovacki, P...