Voronoi distance metrics for protein-protein interaction networks O. Daescu, A. Kurdia, M. Zivanic
Proceedings of the 6th International Symposium on Bioinformatics Research and Applications (ISBRA), 2010.
Visiting a Sequence of Points with a Bevel-Tip Needle S.Bitner,Y. K. Cheung, A. F. Cook IV, O. Daescu, A. Kurdia, C. Wenk
Proceedings of the 9th Latin American Theoretical Informatics Symposium (LATIN), 2010.
Towards an optimal algorithm for recognizing Laman graphs O.Daescu, A.Kurdia bib Journal on Graph Algorithms and Applications, 2009.
Polygonal chain simplification with small angle constraints O. Daescu, A. Kurdia bib Proceedings of the 20th Canadian Conference on Computational Geometry, 2008.
A new modeling for finding directions of least damage Y. K. Cheung, O. Daescu, A. Kurdia;
Procedings of the International Conference on Biocomputation, Bioinformatics, and Biomedical Technologies (BIOTECHNO), 2008.
Centrality Measures for the Human Red Blood Cell Interactome A. Kurdia, O. Daescu, L. Ammann, D. Kakhniashvili, S. R. Goodman bib Proceedings of the Engineering in Medicine and Biology Workshop, 2007 IEEE Dallas, 2007.
The Human Red Blood Cell Proteome and Interactome S. R. Goodman, A. Kurdia, L. Ammann, D. Kakhniashvili, O. Daescu bib Experimental Biology and Medicine, Dec. 2007.
Software
CeMeas: a program that computes some centrality characteristics of connected undirected unweighted graphs and its core library.