Odd cycles and a class of facets of the axial 3-index assignment polytope
On co-bicliques
A co-biclique of a simple undirected graph G = (V,E) is the edge-set of two disjoint complete subgraphs of G. (A co-biclique is the complement of a biclique.) A subset F ⊆ E is an independent of G if there is a co-biclique B such that F ⊆ B, otherwise F is a dependent of G. This paper describes the minimal dependents of G. (A minimal dependent is a dependent C such that any proper subset of C is an independent.) It is showed that a minimum-cost dependent set of G can be determined in polynomial...
On stability of some lexicographic multicriteria Boolean problem
On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls.
On the structure of the quadratic Boolean problem polytope
Optimization of unimodal monotone pseudoboolean functions
Original title unknown