Author of the publication

Auspicious Tatami Mat Arrangements.

, , , and . COCOON, volume 6196 of Lecture Notes in Computer Science, page 288-297. Springer, (2010)

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.

 

Other publications of authors with the same name

Collaborative problem solving: integrating theory and practice in the classroom., , , , , , and . WCCCE, page 15:1-15:5. ACM, (2010)Monomino-Domino Tatami Coverings.. University of Victoria, Canada, (2013)Improved routing algorithms in the dual-port datacenter networks HCN and BCN., , , and . Future Gener. Comput. Syst., (2017)The influence of datacenter usage on symmetry in datacenter network design., and . J. Supercomput., 74 (6): 2276-2313 (2018)Enumerating Tatami Mat Arrangements of Square Grids., and . IWOCA, volume 7056 of Lecture Notes in Computer Science, page 223-235. Springer, (2011)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)Connectivity Graphs of Uncertainty Regions, , , , , , , , , and . Algorithmica, 78 (3): 990--1019 (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)Routing Algorithms for Recursively-Defined Data Centre Networks., , , and . TrustCom/BigDataSE/ISPA (3), page 84-91. IEEE, (2015)978-1-4673-7952-6.