We present a fixed parameter algorithm that constructively solves the k-dominating set problem on graphs excluding one of the K5 or K3,3 as a minor in time O(3 6 √ n). In fact, we present our algorithm for any H-minor-free graph where H is a single-crossing graph (can be drawn on the plane with at most one crossing) and obtain the algorithm for K3,3(K5)-minor-free graphs as a special case. As a...

Measurements of the frequency response of head impact points on the exterior and the interior of a car were used to characterize the dynamic behavior of the object that was struck. These points were then arranged in a hierarchy of increasing stiffness. Thirty-two cases in which the distribution of injury to the brain had been recorded were grouped according to the stiffness of the object struck...

the ever increasing rate of power consumption has led to an increase in public exposure to extremely low frequency magnetic fields (elf-mfs) and brought severe concerns about their health effects. considering previous studies and the facts about potential health effects of these fields, the present study aimed to evaluate the elf-mf flux densities from power distribution lines near hospitals i...

the ever increasing rate of power consumption has led to an increase in public exposure to extremely low frequency magnetic fields (elf-mfs) and brought severe concerns about their health effects. considering previous studies and the facts about potential health effects of these fields, the present study aimed to evaluate the elf-mf flux densities from power distribution lines near hospitals in...

A graph H is single-crossing if it can be drawn in the plane with at most one crossing. For any single-crossing graph H, we give an O(n4) time algorithm for counting perfect matchings in graphs excluding H as a minor. The runtime can be lowered to O(n1.5) when G excludes K5 or K3,3 as a minor. This is the first generalization of an algorithm for counting perfect matchings in K3,3free graphs (Li...

We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz’s theorem characterizing the graphs of convex polyhedra, we find graph-theoretic characterizations of three classes of simple orthogonal polyhedra: corner polyhedra, which can be drawn by isometric pro...

The shape of the air flow in the interior is heavily influenced by the air distribution system and the way air enters and exits. By numerically simulating flow by computational fluid dynamics, one can determine the flow pattern and temperature distribution and, with the help of the results, provide an optimal design of the air conditioning system. In this study, a chamber was first constructed ...

In octilinear drawings of planar graphs, every edge is drawn as an alternating sequence of horizontal, vertical and diagonal (45◦) line-segments. In this paper, we study octilinear drawings of low edge complexity, i.e., with few bends per edge. A k-planar graph is a planar graph in which each vertex has degree less or equal to k. In particular, we prove that every 4-planar graph admits a planar...