Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2014

Highly Cited

2014

We give algorithms for geometric graph problems in the modern parallel models such as MapReduce. For example, for the Minimum… Expand

Is this relevant?

Highly Cited

2011

Highly Cited

2011

We consider the following dynamic Boolean model introduced by van den Berg et al. (Stoch. Process. Appl. 69:247–257, 1997). At… Expand

Is this relevant?

2011

2011

We present a procedural method for generating hierarchical road networks connecting cities, towns and villages over large… Expand

Is this relevant?

2006

2006

We consider the consensus problem for stochastic discretetime linear dynamical systems. The underlying graph of such systems at a… Expand

Is this relevant?

2002

2002

Let V be a set of n points in R2. The θ-graph of V is a geometric graph with vertex set V that has been studied extensively and… Expand

Is this relevant?

Highly Cited

1997

Highly Cited

1997

Let G = (V,E) be a n-vertex connected graph with positive edge weights, and let t > 1 be a real constant. A subgraph G' is a t… Expand

Is this relevant?

Highly Cited

1992

Highly Cited

1992

LetS be a set ofN points in the Euclidean plane, and letd(p, q) be the Euclidean distance between pointsp andq inS. LetG(S) be a… Expand

Is this relevant?

1990

1990

Note: Professor Pach's number: [092] Reference DCG-CHAPTER-2008-008 Record created on 2008-11-18, modified on 2017-05-12

Is this relevant?

Highly Cited

1989

Highly Cited

1989

Let p and q be a pair of points in a set S of N points in the plane. Let d(p,q) be the Euclidean distance between p and q and let… Expand

Is this relevant?

Highly Cited

1988

Highly Cited

1988

We introduce the notion of geometric constructions in Rm governed by a directed graph G and by similarity ratios which are… Expand

Is this relevant?