#### Filter Results:

- Full text PDF available (9)

#### Publication Year

1967

2015

- This year (0)
- Last 5 years (3)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Archie F Wilson, Harold S. Novey, Robert Berke, Edgar Surprenant
- The New England journal of medicine
- 1973

- Robert Berke, E C Hoops, J C Kereiakes, Eugene L. Saenger
- Journal of nuclear medicine : official…
- 1973

- Noga Alon, Robert Berke, +5 authors Philipp Zumstein
- Symposium on Computational Geometry
- 2008

We show that the vertices of any plane graph in which every face is of size at least <i>g</i> can be colored by (3g Àý 5)=4 colors so that every color appears in every face. This is nearly tight, as there are plane graphs that admit no vertex coloring of this type with more than (3g+1)=4 colors. We further show that the problem of determining… (More)

- Robert Berke, Eugene L. Saenger, Guillermo Bahr
- Journal of nuclear medicine : official…
- 1973

- D W Romhilt, Robert J . Adolph, +4 authors Robert Berke
- Circulation
- 1973

Cesium-129 is concentrated in the myocardium after intravenous administration permitting myocardial imaging. The dosage used was 2-2.5 mCi in dogs and 3-4 mCi in patients. Four or more views with 200,000 counts per view were obtained 30 to 90 minutes after administration. Control images were obtained in 30 dogs. In two dogs anatomic landmarks were obtained… (More)

- Robert Berke, R. M. Johnson, George C. Henegar
- The American journal of roentgenology, radium…
- 1967

- Beatrice Setnik, Carl L Roland, +4 authors Veeraindar Goli
- Journal of pain research
- 2015

OBJECTIVE
To compare the investigator assessment of patient risk for prescription opioid misuse, abuse, and diversion with patient self-reports of these activities in a population with chronic pain.
METHODS
As a secondary objective of an open-label, multicenter, primary care-based clinical study to evaluate the success of converting opioid-experienced… (More)

- Robert Berke, Tibor Szabó
- J. Comb. Theory, Ser. B
- 2007

We show that any graph of maximum degree at most has a two-coloring, such that one color-class is an independent set while the other color induces monochromatic components of order at most . On the other hand for any constant we exhibit a -regular graph, such that the deletion of any independent set leaves at least one component of order greater than .… (More)

A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-colorings, such that the order of the induced monochromatic components in one (or both) of the color classes is bounded by a constant. In a (C1, C2)-relaxed coloring of a graph G… (More)

- Robert Berke, Tibor Szabó
- Combinatorics, Probability & Computing
- 2006

We study relaxations of proper two-colorings, such that the order of the induced monochromatic components in one (or both) of the color classes is bounded by a constant. A coloring of a graph G is called (C1, C2)-relaxed if every monochromatic component induced by vertices of the first (second) color is of order at most C1 (C2, resp.). We prove that the… (More)