Search

Your search keyword '"Kim, David H."' showing total 1,290 results
Start Over Author "Kim, David H."
1,290 results on '"Kim, David H."'

9. ACR Appropriateness Criteria® Left Lower Quadrant Pain: 2023 Update

Author

Weinstein, Stefanie, Kim, David H., Fowler, Kathryn J., Birkholz, James H., Cash, Brooks D., Cilenti, Elizabeth, Dane, Bari, Horvat, Natally, Kambadakone, Avinash R., Korngold, Elena K., Liu, Peter S., Lo, Bruce M., McCrary, Marion, Mellnick, Vincent, Pietryga, Jason A., Santillan, Cynthia S., Zukotynski, Katherine, and Carucci, Laura R.

Published
2023
Full Text
View/download PDF

10. Update to the structured MRI report for primary staging of rectal cancer: Perspective from the SAR Disease Focused Panel on Rectal and Anal Cancer

Author

Kassam, Zahra, Lang, Rebecca, Arya, Supreeta, Bates, David D. B., Chang, Kevin J., Fraum, Tyler J., Friedman, Kenneth A., Golia Pernicka, Jennifer S., Gollub, Marc J., Harisinghani, Mukesh, Khatri, Gaurav, Korngold, Elena, Lall, Chandana, Lee, Sonia, Magnetta, Michael, Moreno, Courtney, Nougaret, Stephanie, Paroder, Viktoriya, Paspulati, Raj M., Petkovska, Iva, Pickhardt, Perry J., Shaish, Hiram, Sheedy, Shannon, Weiser, Martin R., Xuan, Lisa, and Kim, David H.

Published
2022
Full Text
View/download PDF

11. Appendicitis

Author

Kim, David H., Kao, Lillian S., Zielinski, Martin D., editor, and Guillamondegui, Oscar, editor

Published
2022
Full Text
View/download PDF

13. Rectal cancer lexicon: consensus statement from the society of abdominal radiology rectal & anal cancer disease-focused panel

Author

Hope, Thomas A, Gollub, Marc J, Arya, Supreeta, Bates, David DB, Ganeshan, Dhakshinamoorthy, Harisinghani, Mukesh, Jhaveri, Kartik S, Kassam, Zahra, Kim, David H, Korngold, Elena, Lalwani, Neeraj, Moreno, Courtney C, Nougaret, Stephanie, Paroder, Viktoriya, Paspulati, Raj M, Golia Pernicka, Jennifer S, Petkovska, Iva, Pickhardt, Perry J, Rauch, Gaiane M, Rosenthal, Michael H, Sheedy, Shannon P, and Horvat, Natally

Subjects
Biomedical and Clinical Sciences, Oncology and Carcinogenesis, Cancer, Rare Diseases, Digestive Diseases, Biomedical Imaging, Anal Canal, Anus Neoplasms, Consensus, Humans, Lymphatic Metastasis, Neoplasm Staging, Rectal Neoplasms, Rectum, Societies, Medical, Terminology as Topic, Rectal cancer, Lexicon, Staging, MRI, Society of Abdominal Radiology Rectal & Anal Cancer Disease-Focused Panel, Clinical Sciences, Nuclear Medicine & Medical Imaging, Clinical sciences
Abstract

Standardized terminology is critical to providing consistent reports to referring clinicians. This lexicon aims to provide a reference for terminology frequently used in rectal cancer and reflects the consensus of the Society of Abdominal Radiology Disease Focused Panel in Rectal cancer. This lexicon divided the terms into the following categories: primary tumor staging, nodal staging, treatment response, anal canal anatomy, general anatomy, and treatments.

Published
2019

16. Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary

Author

Chuzhoy, Julia, Kim, David H. K., and Nimavat, Rachit

Subjects
Computer Science - Data Structures and Algorithms, F.2.2
Abstract

We study the classical Node-Disjoint Paths (NDP) problem: given an undirected $n$-vertex graph G, together with a set {(s_1,t_1),...,(s_k,t_k)} of pairs of its vertices, called source-destination, or demand pairs, find a maximum-cardinality set of mutually node-disjoint paths that connect the demand pairs. The best current approximation for the problem is achieved by a simple greedy $O(\sqrt{n})$-approximation algorithm. A special case of the problem called NDP-Grid, where the underlying graph is a grid, has been studied extensively. The best current approximation algorithm for NDP-Grid achieves an $\tilde{O}(n^{1/4})$-approximation factor. On the negative side, a recent result by the authors shows that NDP is hard to approximate to within factor $2^{\Omega(\sqrt{\log n})}$, even if the underlying graph is a sub-graph of a grid, and all source vertices lie on the grid boundary. In a follow-up work, the authors further show that NDP-Grid is hard to approximate to within factor $\Omega(2^{\log^{1-\epsilon}n})$ for any constant $\epsilon$ under standard complexity assumptions, and to within factor $n^{\Omega(1/(\log\log n)^2)}$ under randomized ETH. In this paper we study NDP-Grid, where all source vertices {s_1,...,s_k} appear on the grid boundary. Our main result is an efficient randomized $2^{O(\sqrt{\log n} \cdot \log\log n)}$-approximation algorithm for this problem. We generalize this result to instances where the source vertices lie within a prescribed distance from the grid boundary. Much of the work on approximation algorithms for NDP relies on the multicommodity flow relaxation of the problem, which is known to have an $\Omega(\sqrt n)$ integrality gap, even in grid graphs. Our work departs from this paradigm, and uses a (completely different) linear program only to select the pairs to be routed, while the routing itself is computed by other methods., Comment: To appear in the proceedings of ICALP 2018

Published
2018

17. ACR Appropriateness Criteria® Hernia

Author

Garcia, Evelyn M., Pietryga, Jason A., Kim, David H., Fowler, Kathryn J., Chang, Kevin J., Kambadakone, Avinash R., Korngold, Elena K., Liu, Peter S., Marin, Daniele, Moreno, Courtney Coursey, Panait, Lucian, Santillan, Cynthia S., Weinstein, Stefanie, Wright, Chadwick L., Zreloff, Jennifer, and Carucci, Laura R.

Published
2022
Full Text
View/download PDF

18. ACR Appropriateness Criteria® Right Lower Quadrant Pain: 2022 Update

Author

Kambadakone, Avinash R., Santillan, Cynthia S., Kim, David H., Fowler, Kathryn J., Birkholz, James H., Camacho, Marc A., Cash, Brooks D., Dane, Bari, Felker, Robin A., Grossman, Eric J., Korngold, Elena K., Liu, Peter S., Marin, Daniele, McCrary, Marion, Pietryga, Jason A., Weinstein, Stefanie, Zukotynski, Katherine, and Carucci, Laura R.

Published
2022
Full Text
View/download PDF

19. Almost Polynomial Hardness of Node-Disjoint Paths in Grids

Author

Chuzhoy, Julia, Kim, David H. K., and Nimavat, Rachit

Subjects
Computer Science - Data Structures and Algorithms
Abstract

In the classical Node-Disjoint Paths (NDP) problem, we are given an $n$-vertex graph $G=(V,E)$, and a collection $M=\{(s_1,t_1),\ldots,(s_k,t_k)\}$ of pairs of its vertices, called source-destination, or demand pairs. The goal is to route as many of the demand pairs as possible, where to route a pair we need to select a path connecting it, so that all selected paths are disjoint in their vertices. The best current algorithm for NDP achieves an $O(\sqrt{n})$-approximation, while, until recently, the best negative result was a factor $\Omega(\log^{1/2-\epsilon}n)$-hardness of approximation, for any constant $\epsilon$, unless $NP \subseteq ZPTIME(n^{poly \log n})$. In a recent work, the authors have shown an improved $2^{\Omega(\sqrt{\log n})}$-hardness of approximation for NDP, unless $NP\subseteq DTIME(n^{O(\log n)})$, even if the underlying graph is a subgraph of a grid graph, and all source vertices lie on the boundary of the grid. Unfortunately, this result does not extend to grid graphs. The approximability of the NDP problem on grid graphs has remained a tantalizing open question, with the best current upper bound of $\tilde{O}(n^{1/4})$, and the best current lower bound of APX-hardness. In this paper we come close to resolving the approximability of NDP in general, and NDP in grids in particular. Our main result is that NDP is $2^{\Omega(\log^{1-\epsilon} n)}$-hard to approximate for any constant $\epsilon$, assuming that $NP\not\subseteq RTIME(n^{poly\log n})$, and that it is $n^{\Omega (1/(\log \log n)^2)}$-hard to approximate, assuming that for some constant $\delta>0$, $NP \not \subseteq RTIME(2^{n^{\delta}})$. These results hold even for grid graphs and wall graphs, and extend to the closely related Edge-Disjoint Paths problem, even in wall graphs.

Published
2017

21. ACR Appropriateness Criteria® Staging of Colorectal Cancer: 2021 Update

Author

Korngold, Elena K., Moreno, Courtney, Kim, David H., Fowler, Kathryn J., Cash, Brooks D., Chang, Kevin J., Gage, Kenneth L., Gajjar, Aakash H., Garcia, Evelyn M., Kambadakone, Avinash R., Liu, Peter S., Macomber, Meghan, Marin, Daniele, Pietryga, Jason A., Santillan, Cynthia S., Weinstein, Stefanie, Zreloff, Jennifer, and Carucci, Laura R.

Published
2022
Full Text
View/download PDF

22. New Hardness Results for Routing on Disjoint Paths

Author

Chuzhoy, Julia, Kim, David H. K., and Nimavat, Rachit

Subjects
Computer Science - Data Structures and Algorithms
Abstract

In the classical Node-Disjoint Paths (NDP) problem, the input consists of an undirected $n$-vertex graph $G$, and a collection $\mathcal{M}=\{(s_1,t_1),\ldots,(s_k,t_k)\}$ of pairs of its vertices, called source-destination, or demand, pairs. The goal is to route the largest possible number of the demand pairs via node-disjoint paths. The best current approximation for the problem is achieved by a simple greedy algorithm, whose approximation factor is $O(\sqrt n)$, while the best current negative result is an $\Omega(\log^{1/2-\delta}n)$-hardness of approximation for any constant $\delta$, under standard complexity assumptions. Even seemingly simple special cases of the problem are still poorly understood: when the input graph is a grid, the best current algorithm achieves an $\tilde O(n^{1/4})$-approximation, and when it is a general planar graph, the best current approximation ratio of an efficient algorithm is $\tilde O(n^{9/19})$. The best currently known lower bound on the approximability of both these versions of the problem is APX-hardness. In this paper we prove that NDP is $2^{\Omega(\sqrt{\log n})}$-hard to approximate, unless all problems in NP have algorithms with running time $n^{O(\log n)}$. Our result holds even when the underlying graph is a planar graph with maximum vertex degree $3$, and all source vertices lie on the boundary of a single face (but the destination vertices may lie anywhere in the graph). We extend this result to the closely related Edge-Disjoint Paths problem, showing the same hardness of approximation ratio even for sub-cubic planar graphs with all sources lying on the boundary of a single face.

Published
2016

24. ACR Appropriateness Criteria® Anorectal Disease

Author

Levy, Angela D., Liu, Peter S., Kim, David H., Fowler, Kathryn J., Bharucha, Adil E., Chang, Kevin J., Cilenti, Elizabeth, Gage, Kenneth L., Garcia, Evelyn M., Kambadakone, Avinash R., Korngold, Elena K., Marin, Daniele, Moreno, Courtney, Pietryga, Jason A., Santillan, Cynthia S., Weinstein, Stefanie, Wexner, Steven D., and Carucci, Laura R.

Published
2021
Full Text
View/download PDF

29. Improved Approximation for Node-Disjoint Paths in Planar Graphs

Author

Chuzhoy, Julia, Kim, David H. K., and Li, Shi

Subjects
Computer Science - Data Structures and Algorithms
Abstract

We study the classical Node-Disjoint Paths (NDP) problem: given an $n$-vertex graph $G$ and a collection $M=\{(s_1,t_1),\ldots,(s_k,t_k)\}$ of pairs of vertices of $G$ called demand pairs, find a maximum-cardinality set of node-disjoint paths connecting the demand pairs. NDP is one of the most basic routing problems, that has been studied extensively. Despite this, there are still wide gaps in our understanding of its approximability: the best currently known upper bound of $O(\sqrt n)$ on its approximation ratio is achieved via a simple greedy algorithm, while the best current negative result shows that the problem does not have a better than $\Omega(\log^{1/2-\delta}n)$-approximation for any constant $\delta$, under standard complexity assumptions. Even for planar graphs no better approximation algorithms are known, and to the best of our knowledge, the best negative bound is APX-hardness. Perhaps the biggest obstacle to obtaining better approximation algorithms for NDP is that most currently known approximation algorithms for this type of problems rely on the standard multicommodity flow relaxation, whose integrality gap is $\Omega(\sqrt n)$ for NDP, even in planar graphs. In this paper, we break the barrier of $O(\sqrt n)$ on the approximability of the NDP problem in planar graphs and obtain an $\tilde O(n^{9/19})$-approximation. We introduce a new linear programming relaxation of the problem, and a number of new techniques, that we hope will be helpful in designing more powerful algorithms for this and related problems.

Published
2016

31. Pedicle Screw-Associated Violation of the Adjacent Unfused Facet Joint: Clinical Outcomes and Fusion Rates.

Author

Sinz, Nathan J., Hwang, Raymond W., Lee, Gyu-Ho, Baker, Kevin C., Arnold, Paul, Sasso, Rick, Park, Daniel, Fischgrund, Jeffrey, Niu, Ruijia, and Kim, David H.

Abstract

Study Design: Retrospective review of a prospective randomized trial. Objectives: To compare outcome scores and fusion rates in patients with and without pedicle screw-associated facet joint violation (FJV) after a single-level lumbar fusion. Methods: Clinical outcomes data and computed tomography (CT) imaging were reviewed for 157 patients participating in a multicenter prospective trial. Post-operative CT scans at 12-months follow-up were examined for fusion status and FJV. Patient-reported outcomes (PROs) included Oswestry Disability Index (ODI) and Visual Analog Scale (VAS) for leg and low back pain. Chi-square test of independence was used to compare proportions between groups on categorical measures. Two-sample t-test was used to identify differences in mean patient outcome scores. Logistic regression models were performed to determine association between FJV and fusion rates. Results: Of the 157 patients included, there were 18 (11.5%) with FJV (Group A) and 139 (88.5%) without FJV (Group B). Patients with FJV experienced less improvement in ODI (P =.004) and VAS back pain scores (P =.04) vs patients without FJV. There was no difference in mean VAS leg pain (P =.4997). The rate of fusion at 12-months for patients with FJV (27.8%) was lower compared to those without FJV (71.2%) (P =.0002). Patients with FJV were 76% less likely to have a successful fusion at 12-months. Conclusion: Pedicle screw-associated violation of the adjacent unfused facet joint during single-level lumbar fusion is associated with less improvement in back pain, back pain-associated disability, and a lower fusion rate at 1-year after surgery. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

33. ACR Appropriateness Criteria® Crohn Disease

Author

Kim, David H., Chang, Kevin J., Fowler, Kathryn J., Cash, Brooks D., Garcia, Evelyn M., Kambadakone, Avinash R., Levy, Angela D., Liu, Peter S., Mace, Sharon E., Marin, Daniele, Moreno, Courtney, Peterson, Christine M., Pietryga, Jason A., Solnes, Lilja Bjork, Weinstein, Stefanie, and Carucci, Laura R.

Published
2020
Full Text
View/download PDF

34. ACR Appropriateness Criteria® Suspected Small-Bowel Obstruction

Author

Chang, Kevin J., Marin, Daniele, Kim, David H., Fowler, Kathryn J., Camacho, Marc A., Cash, Brooks D., Garcia, Evelyn M., Hatten, Benjamin W., Kambadakone, Avinash R., Levy, Angela D., Liu, Peter S., Moreno, Courtney, Peterson, Christine M., Pietryga, Jason A., Siegel, Alan, Weinstein, Stefanie, and Carucci, Laura R.

Published
2020
Full Text
View/download PDF

41. ACR Appropriateness Criteria® Left Lower Quadrant Pain-Suspected Diverticulitis

Author

Galgano, Samuel J., McNamara, Michelle M., Peterson, Christine M., Kim, David H., Fowler, Kathryn J., Camacho, Marc A., Cash, Brooks D., Chang, Kevin J., Feig, Barry W., Gage, Kenneth L., Garcia, Evelyn M., Kambadakone, Avinash R., Levy, Angela D., Liu, Peter S., Marin, Daniele, Moreno, Courtney, Pietryga, Jason A., Smith, Martin P., Weinstein, Stefanie, and Carucci, Laura R.

Published
2019
Full Text
View/download PDF

42. ACR Appropriateness Criteria® Dysphagia

Author

Levy, Angela D., Carucci, Laura R., Bartel, Twyla B., Cash, Brooks D., Chang, Kevin J., Feig, Barry W., Fowler, Kathryn J., Garcia, Evelyn M., Kambadakone, Avinash R., Lambert, Drew L., Marin, Daniele, Moreno, Courtney, Peterson, Christine M., Scheirey, Christopher D., Smith, Martin P., Weinstein, Stefanie, and Kim, David H.

Published
2019
Full Text
View/download PDF

50. Undoing Western Hegemony, Unpacking the Particulars: A Review of Bryan Van Norden's Taking Back Philosophy: A Multicultural Manifesto

Author

Kim, David H.

Subjects
Taking Back Philosophy: A Multicultural Manifesto (Nonfiction work) -- Van Norden, Bryan -- Book reviews, Books -- Book reviews, Philosophy and religion
Abstract

As the title suggests, Taking Back Philosophy: A Multicultural Manifesto offers a critique of the profession of philosophy and an inclusive vision for its future. Importantly, unlike many philosophical critiques [...]

Published
2019

Catalog

Books, media, physical & digital resources
See catalog results