Results 1  10
of
108
Bandwidth and pathwidth of threedimensional grids
 Discrete Mathematics 311(10–11) (2011), 881–887. DOI: 10.1016/j.disc.2011.02.019
"... ar ..."
Pathwidth and ThreeDimensional StraightLine Grid Drawings of Graphs
"... We prove that every nvertex graph G with pathwidth pw(G) has a threedimensional straightline grid drawing with O(pw(G) n) volume. Thus for ..."
Abstract

Cited by 23 (12 self)
 Add to MetaCart
We prove that every nvertex graph G with pathwidth pw(G) has a threedimensional straightline grid drawing with O(pw(G) n) volume. Thus for
Parameterized Complexity
, 1998
"... the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs ..."
Abstract

Cited by 1218 (75 self)
 Add to MetaCart
the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs into the toolkit of every algorithm designer. The purpose of the seminar was to bring together leading experts from all over the world, and from the diverse areas of computer science that have been attracted to this new framework. The seminar was intended as the rst larger international meeting with a specic focus on parameterized complexity, and it hopefully serves as a driving force in the development of the eld. 1 We had 49 participants from Australia, Canada, India, Israel, New Zealand, USA, and various European countries. During the workshop 25 lectures were given. Moreover, one night session was devoted to open problems and Thursday was basically used for problem discussion
Queue Layouts and ThreeDimensional StraightLine Grid Drawings
, 2002
"... A famous result due to de Fraysseix, Pach, and Pollack [Combinatorica, 1990] and Schnyder [Order, 1989] states that every nvertex planar graph has a (twodimensional) straightline grid drawing with O(n2) area. A threedimensional straightline grid drawing of a graph represents the vertices by gri ..."
Abstract
 Add to MetaCart
A famous result due to de Fraysseix, Pach, and Pollack [Combinatorica, 1990] and Schnyder [Order, 1989] states that every nvertex planar graph has a (twodimensional) straightline grid drawing with O(n2) area. A threedimensional straightline grid drawing of a graph represents the vertices
Queue layouts, treewidth, and threedimensional graph drawing
 Proc. 22nd Foundations of Software Technology and Theoretical Computer Science (FST TCS '02
, 2002
"... Abstract. A threedimensional (straightline grid) drawing of a graph represents the vertices by points in Z 3 and the edges by noncrossing line segments. This research is motivated by the following open problem due to Felsner, Liotta, and Wismath [Graph Drawing ’01, Lecture Notes in Comput. Sci., ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
Abstract. A threedimensional (straightline grid) drawing of a graph represents the vertices by points in Z 3 and the edges by noncrossing line segments. This research is motivated by the following open problem due to Felsner, Liotta, and Wismath [Graph Drawing ’01, Lecture Notes in Comput. Sci
Layout of Graphs with Bounded TreeWidth
 2002, SUBMITTED. STACKS, QUEUES AND TRACKS: LAYOUTS OF GRAPH SUBDIVISIONS 41
, 2004
"... A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum number of queues in a queue layout of a graph is its queuenumber. A threedimensional (straightline grid) drawing of a gra ..."
Abstract

Cited by 31 (23 self)
 Add to MetaCart
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum number of queues in a queue layout of a graph is its queuenumber. A threedimensional (straightline grid) drawing of a
TouringMachines: An Architecture for Dynamic, Rational, Mobile Agents
, 1992
"... ionPartitioned Evaluator (APE) architecture which has been tested in a simulated, singleagent, indoor navigation domain [SH90]. The APE architecture is composed of a number of concurrent, hierarchically abstract action control layers, each representing and reasoning about some particular aspect o ..."
Abstract

Cited by 84 (10 self)
 Add to MetaCart
ionPartitioned Evaluator (APE) architecture which has been tested in a simulated, singleagent, indoor navigation domain [SH90]. The APE architecture is composed of a number of concurrent, hierarchically abstract action control layers, each representing and reasoning about some particular aspect of the agent's task domain. Implemented as a parallel blackboardbased planner, the five layers  sensor/motor, spatial, temporal, causal, and conventional (general knowledge)  effectively partition the agent's data processing duties along a number of dimensions including temporal granularity, information/resource use, and functional abstraction. Perceptual information flows strictly from the agent sensors (connected to the sensor /motor level) toward the higher levels, while command or goalachievement information flows strictly downward towards the agent's effectors (also connected to the sensor/motor level). Besides mechanisms for communicating with other layers, each layer in the AP...
New Results in Graph Layout
 School of Computer Science, Carleton Univ
, 2003
"... A track layout of a graph consists of a vertex colouring, an edge colouring, and a total order of each vertex colour class such that between each pair of vertex colour classes, there is no monochromatic pair of crossing edges. This paper studies track layouts and their applications to other models o ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
, and Toth [Proc. Graph Drawing, 1997] concerning threedimensional straightline grid drawings. We initiate the study of threedimensional polyline grid drawings and establish volume bounds within a logarithmic factor of optimal.
Tight Bounds for Low Dimensional Star Stencils in the External Memory Model
"... Abstract. Stencil computations on low dimensional grids are kernels of many scientific applications including finite difference methods used to solve partial differential equations. On typical modern computer architectures such stencil computations are limited by the performance of the memory subsy ..."
Abstract
 Add to MetaCart
Abstract. Stencil computations on low dimensional grids are kernels of many scientific applications including finite difference methods used to solve partial differential equations. On typical modern computer architectures such stencil computations are limited by the performance of the memory
Results 1  10
of
108