107
click to vote
COMGEO
1998
ACM
15 years 12 days ago
1998
ACM
A common task in automated manufacturing processes is to orient parts prior to assembly. We consider sensorless orientation of a polygonal part by a sequence of fences. We show th...
77
Voted
COMGEO
1998
ACM
15 years 12 days ago
1998
ACM
104
Voted
COMGEO
1998
ACM
15 years 12 days ago
1998
ACM
Let P be a set of polygonal pseudodiscs in the plane with n edges in total translating with xed velocities in xed directions. We prove that the maximumnumber of combinatorial chan...
COMGEO
2002
ACM
15 years 13 days ago
2002
ACM
82
Voted
GC
2002
Springer
15 years 14 days ago
2002
Springer
Let G
79
Voted
GC
2002
Springer
15 years 14 days ago
2002
Springer
It is shown that the Hilbert series of the face ring of a clique complex (equivalently, flag complex) of a graph G is, up to a factor, just a specialization of SG (x, y), the subg...
98
Voted
GC
2002
Springer
15 years 14 days ago
2002
Springer
The main result of the papzer is that any planar graph with odd girth at least 10k
118
Voted
GC
2002
Springer
15 years 14 days ago
2002
Springer
A mixed hypergraph is a triple H = (X, C, D), where X is the vertex set, and each of C, D is a list of subsets of X. A strict k-coloring of H is a surjection c : X {1, . . . , k}...
132
Voted
GC
2002
Springer
15 years 14 days ago
2002
Springer
Given a graph on n vertices which is the union of two comparability graphs on the same vertex set, it always contains a clique or independent set of size n 1 3 . On the other hand...
92
Voted
GC
2002
Springer
15 years 14 days ago
2002
Springer
One of the classical problems concerning the peg solitaire game is the feasibility issue. Tools used to show the infeasibility of various peg games include valid inequalities, know...