In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
This paper proposes a new approach to the synthesis of low coefficient sensitivity digital filters using Genetic Programming (GP). GP is applied to the synthesis problem by establi...
Establishing and accessing a reliable communication infrastructure at crisis site is a challenging research problem. Failure in communication infrastructure and information exchang...
In numerous positional games the identity of the winner is easily determined. In this case one of the more interesting questions is not who wins but rather how fast can one win. T...
Dan Hefetz, Michael Krivelevich, Tibor Szabó...
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...