Skip to search formSkip to main contentSemantic Scholar

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

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

2011

2011

Discretization methods for semi-infinite programming do not provide a feasible point in a finite number of iterations. We propose… Expand

Is this relevant?

2010

2010

Biomass of winter £ounder Pseudopleuronectes americanus, a target species of both recreational and commercial ¢sheries, is at an… Expand

Is this relevant?

2007

2007

In an article published in 1979, Kainen and Bernhart [1] laid the groundwork for further study of book embeddings of graphs. They… Expand

Is this relevant?

2005

2005

In this paper we deal with the problem of computing upward two-page book embeddings of Two Terminal Series-Parallel (TTSP… Expand

Is this relevant?

2003

2003

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iv

Is this relevant?

2001

2001

A book embedding of a graph consists of a linear ordering of the vertices along a line in 3-space (the spine), and an assignment… Expand

Is this relevant?

1999

1999

In a topological book embedding of a graph, the graph is drawn in a topological book by placing the vertices along the spine of… Expand

Is this relevant?

Highly Cited

1989

Highly Cited

1989

A book embedding of a graph consists of an embedding of its nodes along the spine of a book (i.e., a linear ordering of the nodes… Expand

Is this relevant?

1984

Highly Cited

1979

Highly Cited

1979

Abstract The book thickness bt ( G ) of a graph G is defined, its basic properties are delineated, and relations are given with… Expand

Is this relevant?