Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

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

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

2017

2017

We studied a potential petroleum source rock deposited in a clastic-dominated ramp environment: the Argiles de Châtillon… Expand

2014

2014

A morph between two drawings of the same graph can be thought of as a continuous deformation between the two given drawings. A… Expand

2014

2014

A d-realizer is a collection R = {π1, . . . , πd} of d permutations of a set V representing an antichain in R. We use R to define… Expand

2013

2013

In a proportional contact representation of a planar graph, each vertex is represented by a simple polygon with area proportional… Expand

2013

2013

Geometric routing is an elegant way for solving network routing problems. The essence of this routing scheme is the following… Expand

2012

2012

Geometric routing by using virtual locations is an elegant way for solving network routing problems. Greedy routing, where a… Expand

2011

2011

We give an alternate proof of Schnyder’s Theorem, that the incidence poset of a graph G has dimension at most three if and only… Expand

2010

2010

Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees… Expand

2005

2005

Abstract
We study the properties of Schnyder’s realizers and canonical ordering trees of plane graphs. Based on these newly… Expand

2003

2003

We study the properties of Schnyder’s realizers and canonical ordering trees of plane graphs. Based on these newly discovered… Expand