( en | de | ru )

 

Disambiguation of "Erickson, Alejandro"

Author of the publication

copydeleteadd this publication to your clipboard
Connectivity Graphs of Uncertainty Regions

, , , , , , , , , and . Algorithmica, 78 (3): 990--1019 (2017)
DOI: 10.1007/s00453-016-0191-2

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sandra Erickson

Alejandro Alfaro

In situ hybridization of the feline major satellite DNA FA-SAT in feline fibrosarcoma cell lines and feline fibrosarcoma tissue sections. Uni Gießen, (2009)

Susan J Erickson

Alejandro Rosas

Alejandro Aron

 

Other publications of authors with the same name

Monomino-Domino Tatami Coverings.. University of Victoria, Canada, (2013)Collaborative problem solving: integrating theory and practice in the classroom., , , , , , and . WCCCE, page 15:1-15:5. ACM, (2010)Improved routing algorithms in the dual-port datacenter networks HCN and BCN., , , and . Future Gener. Comput. Syst., (2017)Auspicious Tatami Mat Arrangements., , , and . COCOON, volume 6196 of Lecture Notes in Computer Science, page 288-297. Springer, (2010)Connectivity Graphs of Uncertainty Regions., , , , , , , , , and . ISAAC (2), volume 6507 of Lecture Notes in Computer Science, page 434-445. Springer, (2010)Enumerating Tatami Mat Arrangements of Square Grids., and . IWOCA, volume 7056 of Lecture Notes in Computer Science, page 223-235. Springer, (2011)Connectivity Graphs of Uncertainty Regions, , , , , , , , , and . Algorithmica, 78 (3): 990--1019 (2017)An Efficient Shortest-Path Routing Algorithm in the Data Centre Network DPillar., , , and . COCOA, volume 9486 of Lecture Notes in Computer Science, page 209-220. Springer, (2015)Routing Algorithms for Recursively-Defined Data Centre Networks., , , and . TrustCom/BigDataSE/ISPA (3), page 84-91. IEEE, (2015)978-1-4673-7952-6.Domino Tatami Covering Is NP-Complete., and . IWOCA, volume 8288 of Lecture Notes in Computer Science, page 140-149. Springer, (2013)