Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Michael Kopreski"'
Autor:
Michael Kopreski, Gexin Yu
Publikováno v:
Discrete Mathematics. 340:2528-2530
We say a graph is $(d, d, \ldots, d, 0, \ldots, 0)$-colorable with $a$ of $d$'s and $b$ of $0$'s if $V(G)$ may be partitioned into $b$ independent sets $O_1,O_2,\ldots,O_b$ and $a$ sets $D_1, D_2,\ldots, D_a$ whose induced graphs have maximum degree
Autor:
Gary Hudes, Naomi Haas, Gwen Yeslow, Thomas Gillon, Per Olov Gunnarsson, Marianne Ellman, Orjan Nordle, Brigitta Eriksson, Langdon Miller, Laura Cisar, Michael Kopreski, Donatella Viaro, Beryl Hartley-Asp
Publikováno v:
Journal of clinical oncology : official journal of the American Society of Clinical Oncology. 20(4)
PURPOSE: To determine the dose-limiting toxicities, maximum-tolerated dose, and pharmacokinetics of intravenous estramustine phosphate (IV EMP). PATIENTS AND METHODS: A total of 31 patients with hormone-refractory prostate cancer received IV EMP as a