33 search results - page 5 / 7 » gd 2007 |
177
click to vote
GD
2005
Springer
16 years 1 days ago
2005
Springer
We give a drawing of Kn in three dimensions in which vertices are placed at integer grid points and edges are drawn crossing-free with at most one bend per edge in a volume bounde...
163
click to vote
JCC
2007
15 years 6 months ago
2007
Abstract: A new parallel algorithm has been developed for calculating the analytic energy derivatives of full accuracy second order Møller-Plesset perturbation theory (MP2). Its m...
163
click to vote
GD
2007
Springer
16 years 20 days ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
179
click to vote
GD
2007
Springer
16 years 20 days ago
2007
Springer
We consider the following problem known as simultaneous geometric graph embedding (SGE). Given a set of planar graphs on a shared vertex set, decide whether the vertices can be pla...
153
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
Given a finite set of points S in Rd , consider visiting the points in S with a polygonal path which makes a minimum number of turns, or equivalently, has the the minimum number o...