#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2007

2018

- This year (2)
- Last 5 years (5)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Steven R. Goodman, Anastasia Kurdia, Larry P. Ammann, David G Kakhniashvili, Ovidiu Daescu
- Experimental biology and medicine
- 2007

The red blood cell or erythrocyte is easily purified, readily available, and has a relatively simple structure. Therefore, it has become a very well studied cell in terms of protein composition andâ€¦ (More)

- Giovanni Viglietta, Nadia Benbernou, +5 authors Jorge Urrutia
- CCCG
- 2011

We address the question: How many edge guards are needed to guard an orthogonal polyhedron of e edges, r of which are reflex? It was previously established [3] that e/12 are sometimes necessary andâ€¦ (More)

- Marko Zivanic, Ovidiu Daescu, Anastasia Kurdia, S. R. Goodman
- J. Comput. Science
- 2012

Many surgical procedures could benefit from guiding a bevel-tip needle through a sequence of treatment points in a patient. For example, brachytherapy procedures implant radioactive seeds to treatâ€¦ (More)

- Anastasia Kurdia, Ovidiu Daescu, Larry P. Ammann, David G Kakhniashvili, S.R. Goodman
- IEEE Dallas Engineering in Medicine and Biologyâ€¦
- 2007

The red blood cell or erythrocyte is easily purified, readily available, and has a relatively simple structure. Therefore, it has become a very well studied cell in terms of protein composition andâ€¦ (More)

- Ovidiu Daescu, Anastasia Kurdia
- 42nd Hawaii International Conference on Systemâ€¦
- 2009

A graph G with n vertices and m edges is a Laman graph, or equivalently a generically minimally rigid graph, if m = 2n - 3 and every induced subset of k vertices spans at most 2k - 3 edges. Lamanâ€¦ (More)

Many surgical procedures could benefit from guiding a bevel-tip needle along circular arcs to multiple treatment points in a patient. At each treatment point, the needle can inject a radioactiveâ€¦ (More)

- Ovidiu Daescu, Anastasia Kurdia
- CCCG
- 2008

We consider the problem of simplifying an n-vertex polygonal chain with small angle constraints in R and R, thus closing the gap on the range of angles left in previous work on the problem.â€¦ (More)

- Marko Zivanic, Ovidiu Daescu, Anastasia Kurdia
- IEEE International Conference on Bioinformaticsâ€¦
- 2011

We initiate a formal study of correlation between protein structural similarity and similarity of protein rigidity properties. In this paper we combine algorithmic techniques from protein sequenceâ€¦ (More)

- Yam Ki Cheung, Ovidiu Daescu, Anastasia Kurdia
- International Conference on Biocomputationâ€¦
- 2008

We prove that each optimization problem associated with finding an optimal straight line distance between two regions of a weighted planar subdivision can be restated as a two-dimensional sum ofâ€¦ (More)