3471 search results - page 125 / 695 » Obstacle Numbers of Graphs |
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
DATE
2002
IEEE
14 years 2 months ago
2002
IEEE
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
This paper presents a coordination algorithm for mobile autonomous robots. Relying upon distributed sensing, the robots achieve rendezvous, that is, they move to a common location....
ICRA
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract— Computing a motion that enables a mobile manipulator to open a door is challenging because it requires tight coordination between the motions of the arm and the base. H...
DM
2008
13 years 9 months ago
2008
Let G = (V, E) be a graph. A set S V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in V - S. The restrained domination numb...