#### Filter Results:

- Full text PDF available (3)

#### Publication Year

1989

2017

- This year (1)
- Last 5 years (6)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- W W Lockwood, C Friedman, N Bus, C Pierson, R Gaynes
- The American review of respiratory disease
- 1989

We investigated an increase in the number of patient specimens yielding Mycobacterium terrae in 1986, isolation of M. terrae was associated with specimens obtained from inpatients at our new hospital, but not with specimens referred from other hospitals [37(+)/144 inpatient specimens versus 2(+)/26 referred specimens, p less than 0.05]. By October 31, 1987,… (More)

- Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
- STACS
- 2015

Over the past several decades there has been steady progress towards the goal of polynomial-time approximation schemes (PTAS) for fundamental geometric combinatorial optimization problems. A foremost example is the geometric hitting set problem: given a set P of points and a set D of geometric objects, compute the minimum-sized subset of P that hits all… (More)

- Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
- Comput. Geom.
- 2016

- Norbert Bus, Nabil H. Mustafa, Saurabh Ray
- ESA
- 2015

The geometric hitting set problem is one of the basic geometric com-binatorial optimization problems: given a set P of points, and a set D of geometric objects in the plane, the goal is to compute a small-sized subset of P that hits all objects in D. In 1994, Bronniman and Goodrich [6] made an important connection of this problem to the size of fundamental… (More)

- Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
- ArXiv
- 2015

The geometric hitting set problem is one of the basic geometric combinatorial optimization problems: given a set P of points, and a set D of geometric objects in the plane, the goal is to compute a small-sized subset of P that hits all objects in D. In 1994, Bronniman and Goodrich [5] made an important connection of this problem to the size of fundamental… (More)

- Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
- Discrete & Computational Geometry
- 2017

- Norbert Bus, Nabil H. Mustafa, Venceslas Biri
- Comput. Graph. Forum
- 2015

- ‹
- 1
- ›