Join Our Newsletter

SODA

2012

ACM

8 years 1 days ago
2012

ACM

The Matroid Secretary Problem, introduced by Babaioﬀ et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...

CRYPTO

2012

Springer

8 years 1 days ago
2012

Springer

A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...

GC

2011

Springer

9 years 4 months ago
2011

Springer

The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Tur´an number ex(m,...

ARSCOM

2004

9 years 9 months ago
2004

A set of points in a Steiner triple system (STS(v)) is said to be independent if no three of these points occur in the same block. In this paper we derive for each k 8 a closed f...

JGT

2007

9 years 9 months ago
2007

: Let G be a graph on n vertices in which every induced subgraph on s = log3 n vertices has an independent set of size at least t = log n. What is the largest q = q(n) so that ever...

JSAT

2006

9 years 9 months ago
2006

An independent set of variables is one in which no two variables occur in the same clause in a given k-SAT instance. Recently, independent sets have obtained more attention. Due t...

CORR

2008

Springer

9 years 9 months ago
2008

Springer

We prove that there is an absolute constant C > 0 so that for every natural n there exists a trianglefree regular graph with no independent set of size at least C n log n.

CORR

2010

Springer

9 years 9 months ago
2010

Springer

We study problems of reconguration of shortest paths in graphs. We prove that the shortest reconguration sequence can be exponential in the size of the graph and that it is NP-hard...

SODA

2008

ACM

9 years 11 months ago
2008

ACM

Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...

APPROX

2008

Springer

9 years 11 months ago
2008

Springer

For every fixed 0, we give an algorithm that, given an n-vertex 3-uniform hypergraph containing an independent set of size n, finds an independent set of size n(2 ) . This improv...