We exhibit a polynomial time computable plane curve Γ that has finite length, does not intersect itself, and is smooth except at one endpoint, but has the following property. For...
We study the problem how to draw a planar graph such that every vertex is incident to an angle greater than π. In general a straightline embedding cannot guarantee this property....
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
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...
Two-stage stochastic mixed-integer programming (SMIP) problems with recourse are generally difficult to solve. This paper presents a first computational study of a disjunctive cut...