The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighbors in its part as in the other part. This problem was introduced by Gerber and Kobler [GK98, GK00] and further studied by other authors but its complexity remained open until now. We prove in this paper that Satisfac...

Advances in molecular biology are improving the understanding of lung cancer and changing the approach to treatment. A satisfactory biopsy that allows for histologic characterization and mutation analysis is becoming increasingly important. Most patients with lung cancer are diagnosed at an advanced stage, and diagnosis is often based on a small biopsy or cytology specimen. Here, we review the ...

Available routing strategies for traffic networks may be classified as feedback and iterative strategies. Recently, a new predictive feedback strategy has been developed incorporating the advantages of both kinds of strategies and attenuating their disadvantages. The new strategy runs a mathematical model once at each time step and bases its feedback routing decisions on the predicted traffic c...

Abstract—in this paper a concept of generalized theory of instantaneous imaginary power is proposed for a three-phase four-wire system. Unlike instantaneous reactive power theory in which a complex mathematical transformation is used for controlling action of shunt active power filters. The proposed control strategy is simple and further to reduced its complexity the line current vector is deco...