One proves that certain numbers occurring in a problem of paths enumeration, studied by Niederhausen in [7] (see also [10]), are top intersection numbers in the cohomology ring of...
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
In this article, a hybrid optimization method has been proposed consisting of modified ant colony systems (ACSs) and constrained nonlinear programming (NLP) to solve the problems ...
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...