34 search results - page 6 / 7 » Adding one edge to planar graphs makes crossing number hard |
SODA
2004
ACM
13 years 6 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
IWCMC
2009
ACM
13 years 9 months ago
2009
ACM
Autoconfiguration of the radio parameters is a key feature for next generation mobile networks. Especially for LTE the NGMN Forum has brought it up as a major requirement. It is ...
PODC
2005
ACM
13 years 10 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
CONEXT
2009
ACM
13 years 6 months ago
2009
ACM
Building on the popularity of online social networks (OSNs) such as Facebook, social content-sharing applications allow users to form communities around shared interests. Millions...
SIGECOM
2006
ACM
13 years 11 months ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...