Essentiality is an important notion closely related to injectivity. Depending on a class M of morphisms of a category A, three different types of essentiality are considered in lit...
Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete bipartite subgraph with k vertices in each of its classes. Then G(C) has ...
This paper proposes a new semidefinite programming relaxation for the satisfiability problem. This relaxation is an extension of previous relaxations arising from the paradigm of ...
In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are ...
In this paper we study a warranty servicing policy for a class of multi-state deteriorating and repairable products. The manufacturer's decision to repair or replace a failed...