We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every g...
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the re...
+ Modern network processors employ multi-threading to allow concurrency amongst multiple packet processing tasks. We studied the properties of applications running on the network p...
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...