36781 search results - page 57 / 7357 » Parameterizing by the Number of Numbers |
107
Voted
RSA
1998
15 years 3 months ago
1998
: For a pair of integers 1F␥-r, the ␥-chromatic number of an r-uniform Ž .hypergraph Hs V, E is the minimal k, for which there exists a partition of V into subsets < <T ...
113
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In the framework of prediction with expert advice, we consider a recently introduced kind of regret bounds: the bounds that depend on the effective instead of nominal number of ex...
142
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices ...
105
Voted
EM
2010
14 years 10 months ago
2010
We propose a modification of the predictions of the Cohen
134
Voted
MFCS
2004
Springer
15 years 9 months ago
2004
Springer
It was proved by [Garey and Johnson, 1983] that computing the crossing number of a graph is an NP-hard problem. Their reduction, however, used parallel edges and vertices of very h...