Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Elena Prieto
2010 – today
- 2010
[j5]Elena Prieto, Josep María Martí-Climent, Javier Arbizu, Puy Garrastachu, Inés Domínguez-Prado, Gemma Quincoces, M. José García-Velloso, P. Lecumberri, M. Gómez-Fernández, José Ángel Richter: Evaluation of spatial resolution of a PET scanner through the simulation and experimental measurement of the recovery coefficient. Comp. in Bio. and Med. 40(1): 75-80 (2010)
2000 – 2009
- 2009
[j4]M. Collantes, Elena Prieto, I. Peñuelas, J. Blesa, C. Juri, Josep María Martí-Climent, Gemma Quincoces, Javier Arbizu, M. Riverol, J. L. Zubieta, M. C. Rodriguez-Oroz, M. R. Luquin, José Ángel Richter, J. A. Obeso: New MRI, 18F-DOPA and 11C-(+)-α-dihydrotetrabenazine templates for Macaca fascicularis neuroimaging: Advantages to improve PET quantification. NeuroImage 47(2): 533-539 (2009)- 2006
[j3]
[c5]Frank K. H. A. Dehne, Michael R. Fellows, Henning Fernau, Elena Prieto, Frances A. Rosamond: NONBLOCKER: Parameterized Algorithmics for minimum dominating set. SOFSEM 2006: 237-245- 2005
[j2]Elena Prieto, Christian Sloper: Reducing to Independent Set Structure -- the Case of k-Internal Spanning Tree. Nord. J. Comput. 12(3): 308-318 (2005)
[c4]- 2004
[c3]Luke Mathieson, Elena Prieto, Peter Shaw: Packing Edge Disjoint Triangles: A Parameterized View. IWPEC 2004: 127-137
[c2]- 2003
[j1]Rodney G. Downey, Vladimir Estivill-Castro, Michael R. Fellows, Elena Prieto, Frances A. Rosamond: Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems. Electr. Notes Theor. Comput. Sci. 78: 209-222 (2003)
[c1]Elena Prieto, Christian Sloper: Either/Or: Using Vertex Cover Structure in Designing FPT-Algorithms - The Case of k-Internal Spanning Tree. WADS 2003: 474-483
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 20:42 CET by the dblp team



