We study the following general stabbing problem from a parameterized complexity point of view: Given a set S of n translates of an object in R, find a set of k lines with the property that every object in S is ”stabbed” (intersected) by at least one line. We show that when S consists of axis-parallel unit squares in R the (decision) problem of stabbing S with axis-parallel lines is W[1]-hard wi...

We give an example of a set P of 3n points in R3 such that, for any partition of P into triples, there exists a line stabbing Ω( √ n) of the triangles determined by the triples.

It is known that for every dimension d ≥ 2 and k < there exists a constant c , > 0 such n -point set X ⊂ R -flat intersects at least + 1 − o ( ) of the -dimensional simplices spanned by . However, optimal values constants are mostly unknown. The case = (stabbing point) has received great deal attention. In this paper we focus on line). Specifically, try to determine upper bounds yielded two poi...

Idiopathic stabbing headache (ISH) is a primary headache syndrome characterized by transient, sharp, stabbing pains located in the first division of the trigeminal nerve. Reports of pediatric ISH are rare, and extracephalic pain in pediatric ISH is extremely rare. Here we report the case of a 7-year-old male patient suffering from frequent, short, stabbing headache, which was occasionally assoc...