Leonard Yves, R Ust, +43 authorsBernhard Von Stengel

2007

The goal of this thesis is to give a better understanding of the linear complementarity problem with a P-matrix (PLCP). Finding a polynomial time algorithm for the PLCP is a longstanding openâ€¦ (More)

We show that there is a constant Î± > 0 such that, for any set P of n â‰¥ 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at random contains, inâ€¦ (More)

For a planar point set we consider the graph of crossing-free straight-line spanning trees where two spanning trees are adjacent in the graph if their union is crossing-free. An upper bound on theâ€¦ (More)