Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
SIAMDM
2010
91views more  SIAMDM 2010»
9 years 11 months ago
Embedding into Bipartite Graphs
Abstract. The conjecture of Bollob
Julia Böttcher, Peter Heinig, Anusch Taraz
CPC
2000
58views more  CPC 2000»
10 years 4 months ago
Packing Ferrers Shapes
Answering a question of Wilf, we show that if n is sufficiently large, then one cannot cover an n
Noga Alon, Miklós Bóna, Joel Spencer
JGT
2006
81views more  JGT 2006»
10 years 4 months ago
A Ramsey-type result for the hypercube
We prove that for every fixed k and 5 and for sufficiently large n, every edge coloring of the hypercube Qn with k colors contains a monochromatic cycle of length 2 . This answer...
Noga Alon, Rados Radoicic, Benny Sudakov, Jan Vond...
JCT
2006
102views more  JCT 2006»
10 years 4 months ago
Hamiltonicity in 3-connected claw-free graphs
Kuipers and Veldman conjectured that any 3-connected claw-free graph with order and minimum degree +6 10 is Hamiltonian for sufficiently large. In this paper, we prove that if...
Hong-Jian Lai, Yehong Shao, Mingquan Zhan
JCT
2008
109views more  JCT 2008»
10 years 4 months ago
Spanning 3-colourable subgraphs of small bandwidth in dense graphs
A conjecture by Bollob
Julia Böttcher, Mathias Schacht, Anusch Taraz
DM
2006
89views more  DM 2006»
10 years 4 months ago
On set systems with a threshold property
For n, k and t such that 1 < t < k < n, a set F of subsets of [n] has the (k, t)threshold property if every k-subset of [n] contains at least t sets from F and every (k -...
Zoltán Füredi, Robert H. Sloan, Ken Ta...
CCCG
2009
10 years 5 months ago
Every Large Point Set contains Many Collinear Points or an Empty Pentagon
We prove the following generalised empty pentagon theorem: for every integer 2, every sufficiently large set of points in the plane contains collinear points or an empty pentagon...
Zachary Abel, Brad Ballinger, Prosenjit Bose, S&ea...
ESORICS
1994
Springer
10 years 7 months ago
Aggregation in Relational Databases: Controlled Disclosure of Sensitive Information
It has been observed that often the release of a limited part of an information resource poses no security risks, but the relase of a sufficiently large part of that resource might...
Amihai Motro, Donald G. Marks, Sushil Jajodia
DEM
2001
Springer
198views GIS» more  DEM 2001»
10 years 8 months ago
Modeling of Ecosystems as a Data Source for Real-Time Terrain Rendering
With the advances in rendering hardware, it is possible to render very complex scenes in real-time. In general, computers do not have enough memory to store all the necessary infor...
Johan Hammes
GECCO
2005
Springer
119views Optimization» more  GECCO 2005»
10 years 10 months ago
Improving GA search reliability using maximal hyper-rectangle analysis
In Genetic algorithms it is not easy to evaluate the confidence level in whether a GA run may have missed a complete area of good points, and whether the global optimum was found....
Chongshan Zhang, Khaled Rasheed
books