973 search results - page 76 / 195 » New Bounds on Crossing Numbers |
106
click to vote
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
GD
2005
Springer
15 years 5 months ago
2005
Springer
Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph...
IWPEC
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bou...
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...
ECCC
2010
14 years 12 months ago
2010
We introduce a new approach to characterizing the unobserved portion of a distribution, which provides sublinear-sample additive estimators for a class of properties that includes...