108 search results - page 13 / 22 » siamdm 2008 |
108
click to vote
SIAMDM
2010
14 years 10 months ago
2010
We consider a variation of a problem stated by Erd˝os and Szekeres in 1935 about the existence of a number fES (k) such that any set S of at least fES (k) points in general posit...
SIAMDM
2010
14 years 10 months ago
2010
Given a connected bipartite graph G, we describe a procedure which enumerates and computes all graphs H (if any) for which there is a direct product factorization G ∼= H × K2. W...
SIAMDM
2010
14 years 10 months ago
2010
Let F be an r-uniform hypergraph with f vertices, where f > r ≥ 3. In [12], R. Yuster posed the problem of whether there exists an algorithm which, for a given r-uniform hyper...
SIAMDM
2010
14 years 10 months ago
2010
Let g1, . . . , gk be tropical polynomials in n variables with Newton polytopes P1, . . . , Pk. We study combinatorial questions on the intersection of the tropical hypersurfaces d...
SIAMDM
2010
14 years 10 months ago
2010
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...