#### Filter Results:

- Full text PDF available (46)

#### Publication Year

1997

2019

- This year (9)
- Last 5 years (32)
- Last 10 years (63)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
- J. Comb. Theory, Ser. B
- 2005

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and… (More)

- Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
- STOC
- 2002

A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curves intersect. We… (More)

- Marcus Schaefer, Daniel Stefankovic
- Theory of Computing Systems
- 2015

We introduce the complexity class ∃ ℝ $\exists \mathbb {R}$ based on the existential theory of the reals. We show that the definition of ∃ ℝ $\exists \mathbb {R}$ is robust in the sense that even the… (More)

- Daniel Stefankovic, Santosh S. Vempala, Eric Vigoda
- FOCS
- 2007

- Andreas Galanis, Daniel Stefankovic, Eric Vigoda
- Combinatorics, Probability & Computing
- 2016

Recent inapproximability results of Sly (2010), together with an approximation algorithm presented by Weitz (2006) establish a beautiful picture for the computational complexity of approximating the… (More)

- Daniel Stefankovic, Santosh S. Vempala, Eric Vigoda
- SIAM J. Comput.
- 2012

Given n elements with nonnegative integer weights w1, . . . , wn and an integer capacity C, we consider the counting version of the classic knapsack problem: find the number of distinct subsets whose… (More)

- Qi Ge, Daniel Stefankovic
- Combinatorics, Probability & Computing
- 2012

- Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
- Discrete & Computational Geometry
- 2008

The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the number of pairs of… (More)

- Marcus Schaefer, Daniel Stefankovic
- J. Comput. Syst. Sci.
- 2004