Zobrazeno 1 - 10
of 123
pro vyhledávání: '"D'Angelo, Anthony"'
Autor:
D'Angelo, Anthony D
Biologics represent an increasing percentage of approved therapies and have the potential for treating numerous diseases such as cancers. While drug delivery vehicles (DDV) are in development for circumventing the poor pharmacokinetic properties of b
Externí odkaz:
http://hdl.handle.net/11375/30462
We consider the problem of finding a geodesic disc of smallest radius containing at least $k$ points from a set of $n$ points in a simple polygon that has $m$ vertices, $r$ of which are reflex vertices. We refer to such a disc as a SKEG disc. We pres
Externí odkaz:
http://arxiv.org/abs/2402.00336
Publikováno v:
J Comb Optim vol 44, issue 4, pg 2893-2918 (2022); Computing and Combinatorics. COCOON 2020. vol 12273, pg 448-459
Given a set $P$ of $n$ points in $\mathbb{R}^2$ and an input line $\gamma$ in $\mathbb{R}^2$, we present an algorithm that runs in optimal $\Theta(n\log n)$ time and $\Theta(n)$ space to solve a restricted version of the $1$-Steiner tree problem. Our
Externí odkaz:
http://arxiv.org/abs/2306.08504
Autor:
Ko, Youngmin, Baird, Michael A., Peng, Xinxing, Ogunfunmi, Tofunmi, Byeon, Young-Woon, Klivansky, Liana M., Kim, Haegyeom, Scott, Mary C., Chen, John, D’Angelo, Anthony J., Chen, Junzheng, Sripad, Shashank, Viswanathan, Venkatasubramanian, Helms, Brett A.
Publikováno v:
In Joule 21 August 2024 8(8):2393-2411
Acquisition research (Graduate School of Business & Public Policy)
MBA Professional Report
The purpose of this study is to examine the applicability of a strategic approach to contingency contracting. Strategic approaches to procurement are
MBA Professional Report
The purpose of this study is to examine the applicability of a strategic approach to contingency contracting. Strategic approaches to procurement are
Externí odkaz:
http://hdl.handle.net/10945/478
In this paper we study the area requirements of planar greedy drawings of triconnected planar graphs. Cao, Strelzoff, and Sun exhibited a family $\cal H$ of subdivisions of triconnected plane graphs and claimed that every planar greedy drawing of the
Externí odkaz:
http://arxiv.org/abs/2003.00556
Autor:
Arseneva, Elena, Bose, Prosenjit, Cano, Pilar, D'Angelo, Anthony, Dujmovic, Vida, Frati, Fabrizio, Langerman, Stefan, Tappini, Alessandra
We study the question whether a crossing-free 3D morph between two straight-line drawings of an $n$-vertex tree can be constructed consisting of a small number of linear morphing steps. We look both at the case in which the two given drawings are two
Externí odkaz:
http://arxiv.org/abs/1808.10738
A graph drawing is $\textit{greedy}$ if, for every ordered pair of vertices $(x,y)$, there is a path from $x$ to $y$ such that the Euclidean distance to $y$ decreases monotonically at every vertex of the path. Greedy drawings support a simple geometr
Externí odkaz:
http://arxiv.org/abs/1612.09277
Autor:
D'Angelo, Anthony Tyler.
Publikováno v:
Access now.
Thesis (Master, History) -- Queen's University, 2009.
Includes bibliographical references (leaves 149-160)
Includes bibliographical references (leaves 149-160)
Externí odkaz:
http://hdl.handle.net/1974/5192