Research Interests

 

         

Conference Publications

Harrigan, M. and Healy, P.; (2011) k-Level Crossing Minimization is NP-Hard for Trees The 5th Workshop on Algorithms and Computation (WALCOM'11) , pp.70-76 [DOI] [Details]

Harrigan, M.; (2010) Using Vector Clocks to Visualize Communication Flow The 2nd International Conference on Social Networks Analysis and Mining (ASONAM'10) , pp.241-247 [DOI] [Details]