Albertson and Berman conjectured that every planar graph has an induced forest on half of its vertices. The best known lower bound, due to Borodin, is that every planar graph has an induced forest on two fifths of its vertices. In a related result, Chartran and Kronk, proved that the vertices of every planar graph can be partitioned into three sets, each of which induce a forest. We show tighte...

Albertson and Berman [1] conjectured that every planar graph has an induced forest on half of its vertices; the current best result, due to Borodin [3], is an induced forest on two fifths of the vertices. We show that the Albertson-Berman conjecture holds, and is tight, for planar graphs of treewidth 3 (and, in fact, for any graph of treewidth at most 3). We also improve on Borodin’s bound for ...

Adriane Fugh-Berman examines documents unsealed in recent litigation to investigate how pharmaceutical companies promoted hormone therapy drugs, including the use of medical writing companies to produce ghostwritten manuscripts and place them into medical journals.

We have compared intubation time and cardiovascular effects of fibrescope-guided orotracheal intubation aided by the Berman 11 Intubating Airway with those of the tongue traction method of fibreoptic intubation and with conventional Macintosh intubation. We studied 75 patients who received a standard general anaesthetic which included non-depolarizing neuromuscular block; they were allocated ra...

Vol. LII (February 2015), 90–104 *Jonathan Z. Berman is Assistant Professor of Marketing, London Business School (e-mail: [email protected]). Emma E. Levine is a doctoral candidate in Operations and Information Management (e-mail: emmased@ wharton. upenn.edu), Alixandra Barasch is a doctoral candidate in Marketing (e-mail: [email protected]), and Deborah A. Small is Associate Professo...

The paper contributes to the systematic study (started by Berman and Karpinski) of explicit approximability lower bounds for small occurrence optimization problems. We present parametrized reductions for some packing and covering problems, including 3-Dimensional Matching, and prove the best known inapproximability results even for highly restricted versions of them. For example, we show that i...

DIsclosure: Dr. Fugh-Berman is the principal investigator on a grant from the Attorney General Consumer and Prescriber Education grant program, created as part of a 2004 settlement between WarnerLambert, a division of Pfizer, Inc., and the Attorneys General of 50 States and the District of Columbia, to settle allegations that WarnerLambert conducted an unlawful marketing campaign for the drug N...

In this paper we extend the notion of the proper splitting of rectangular matrices introduced and investigated in ( Berman, A. and Neumann, M., SIAM J. Appl. Math. 31 (1976), 307–312; and Berman, A. and Plemmons, R. J., SIAM J. Numer. Anal. 11 (1974), 145–154) to g-invertible operators on Banach spaces. Also, we extend and generalize the notion of the index splitting of square matrices introduc...