1153 search results - page 135 / 231 » The Complexity of Revision, Revised |
143
click to vote
JGAA
2006
15 years 5 months ago
2006
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...
149
click to vote
JGAA
2006
15 years 5 months ago
2006
Three classes of graphs, simplicial, upper bound, and middle graphs, have been known for some time, but many of their algorithmic properties have not been published. The definitio...
160
click to vote
PRESENCE
2006
15 years 5 months ago
2006
This paper describes the design, application, and refinement of a qualitative tool designed to study sense of place. The Place Probe incorporates a range of stimuli and techniques...
169
click to vote
AIR
2005
15 years 5 months ago
2005
A desired capability of automatic problem solvers is that they can explain the results. Such explanations should justify that the solution proposed by the problem solver arises fr...
139
click to vote
AML
2005
15 years 5 months ago
2005
Under certain cardinal arithmetic assumptions, we prove that for every large enough regular cardinal, for many regular < , many stationary subsets of concentrating on cofinali...