away concepts from the surface form of the text. The authors argue that while there has been research into automatic classification, general classification schemes are unsuitable f...
This note extends results of Fern´andez, Leighton, and L´opez-Presa on the uniqueness of rth roots for disconnected graphs with respect to the Cartesian product to other product...
We report a remarkable success of nested pricing rules over major pivot rules commonly used in practice, such as Dantzig's original rule as well as the steepest-edge rule and ...
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomi...
We establish new lower and upper bounds for the real number graph labelling problem. As an application, we completely determine the optimum spans of L(p, q)-labellings of the infin...