ALGOSENSORS
2004
Springer
13 years 10 months ago
2004
Springer
We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
RISE
2005
Springer
13 years 11 months ago
2005
Springer
Design by ContractTM is commonly cited as an example of the “crosscutting” concerns that aspect-oriented programming can address. We test this conjecture by attempting to imple...
CADE
2007
Springer
13 years 11 months ago
2007
Springer
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...
COMPGEOM
2009
ACM
13 years 12 months ago
2009
ACM
A topological graph is a graph drawn in the plane with vertices represented by points and edges as arcs connecting its vertices. A k-grid in a topological graph is a pair of edge ...