160 search results - page 3 / 32 » On Planar Supports for Hypergraphs |
76
Voted
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
We study the following geometric hypergraph coloring problem: given a planar point set and an integer k, we wish to color the points with k colors so that any axis-aligned strip co...
COCO
2010
Springer
15 years 1 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
WADS
2001
Springer
15 years 2 months ago
2001
Springer
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization...
64
Voted
CDC
2009
IEEE
15 years 1 months ago
2009
IEEE
The concept of virtual holonomic constraints is extended to the case of double support, which is characterized by a closed kinematic chain and redundancy in the state variables. An...
ICRA
2006
IEEE
15 years 3 months ago
2006
IEEE
— This paper describes a test-bed for planar micro manipulation tasks and a framework for planning based on quasistatic models of mechanical systems with frictional contacts. We ...