Sariel Har-Peled

Urbana, IL

http://valis.cs.uiuc.edu/~sariel/

I am a faculty in UIUC working on computational geometry.

top accounts reputation activity subscriptions

Finding good induced subgraph

ds.algorithms graph-theory optimization asked Feb 22, 2012 at 22:44

cstheory.stackexchange.com

14 votes

Reference to lower bound on separator in a grid?

reference-request cg.comp-geom lower-bounds asked Aug 25, 2010 at 23:31

cstheory.stackexchange.com

14 votes

Planar graph via the intersection of fat thingies?

cg.comp-geom planar-graphs asked Apr 14, 2011 at 3:54

cstheory.stackexchange.com

12 votes

Sorting "k-tonic" sequences

ds.algorithms reference-request sorting asked Mar 12, 2012 at 19:40

cstheory.stackexchange.com

12 votes

APX Hardness implies no QPTAS?

cc.complexity-theory reference-request asked Mar 23, 2014 at 17:37

cstheory.stackexchange.com

11 votes

A survey on separators?

reference-request graph-algorithms survey asked Aug 1, 2013 at 17:41

cstheory.stackexchange.com

10 votes

Can we construct a k-wise independent permutation on [n] using only constant time and space?

cc.complexity-theory ds.algorithms cr.crypto-security derandomization k-wise-independence asked May 31, 2015 at 19:14

cstheory.stackexchange.com

9 votes

Another planar separator ref question

reference-request planar-graphs separation asked Jul 12, 2018 at 19:04

cstheory.stackexchange.com

7 votes

Ref question: K-nearest neighbours in a graph

reference-request shortest-path asked Sep 24, 2014 at 2:03

cstheory.stackexchange.com

7 votes

Ref - Implicit selection made quick?

ds.algorithms reference-request asked Sep 1, 2011 at 20:41

cstheory.stackexchange.com

Top Answers

Are there any counterintuitive results in theoretical computer science?

cstheory.stackexchange.com

What is the enlightenment I'm supposed to attain after studying finite automata?

cstheory.stackexchange.com

Geometric problems that are NP-complete in $R^3$ but tractable in $R^2$?

cstheory.stackexchange.com

What papers should everyone read?

cstheory.stackexchange.com

If you have a casual conversation with someone and it leads to a paper, what do you owe them?

cstheory.stackexchange.com

Examples of "Unrelated" Mathematics Playing a Fundamental Role in TCS?

cstheory.stackexchange.com

Testing whether a set of n points in the plane form a convex n polygon in o(nlogn) time

cstheory.stackexchange.com

Hamiltonicity of k-regular graphs

cstheory.stackexchange.com

What Books Should Everyone Read?

cstheory.stackexchange.com

Algorithms from the Book

cstheory.stackexchange.com

Find a largest cube contained in the union of cuboids

cstheory.stackexchange.com

Can we get a sorted list from a sorted matrix in $O(n^2)$

cstheory.stackexchange.com

Are there subexponential algorithms for PLANAR SAT known?

cstheory.stackexchange.com

Parameterized complexity of Hitting Set in finite VC-dimension

cstheory.stackexchange.com

Smallest axis-aligned box that contains $k$ points

cstheory.stackexchange.com

Packing rectangles into convex polygons but without rotations

cstheory.stackexchange.com

Is there a constant factor approximation algorithm for 2D rectangle coloring problem?

cstheory.stackexchange.com

Publishing short and simple results

cstheory.stackexchange.com

Natural (well studied) classes of graphs with treewidth $\Theta(n^\alpha)$ with $1/2 < \alpha < 1$

cstheory.stackexchange.com

Does Approx Carathéodory's theorem implies dimensionality reduction

cstheory.stackexchange.com

Hitting set of pairwise intersecting families

cstheory.stackexchange.com

Finding witness in minkowski sum of integers

cstheory.stackexchange.com

Covering a simple polygon with circles

cstheory.stackexchange.com

Examples where insight from geometry was useful for solving something completely non-geometric

cstheory.stackexchange.com

Massive online collaboration for solving open problem in theoretical computer science

cstheory.stackexchange.com

Calculating the distance to the kth nearest neighbor for all points in the set

cstheory.stackexchange.com

Bisecting a set of points into two optimal subsets

cstheory.stackexchange.com

Tool for translating PDAs to CFGs

cstheory.stackexchange.com

Heterogeneous Hoeffding/McDiarmid

cstheory.stackexchange.com

Is there a natural problem in quasi-polynomial time, but not in polynomial time?

cstheory.stackexchange.com