| Using OpenCL for implementing simple parallel graph algorithms MJ Dinneen, M Khosravani, A Probert Proceedings of the 17th annual conference on Parallel and Distributed …, 2011 | 16 | 2011 |
| A linear time algorithm for the minimum spanning caterpillar problem for bounded treewidth graphs MJ Dinneen, M Khosravani Structural Information and Communication Complexity: 17th International …, 2010 | 11 | 2010 |
| Searching for Optimal Caterpillars in General and Bounded Treewidth Graphs M Khosravani PhD Thesis, University of Auckland, 2011 | 7 | 2011 |
| On the upward embedding on the torus A Dolati, SM Hashemi, M Khosravani ROCKY MOUNTAIN JOURNAL OF MATHEMATICS 38 (1), 2008 | 7 | 2008 |
| Hardness of Approximation and Integer Programming Frameworks for Searching for Caterpillar Trees MJ Dinneen, M Khosravani Computing: The Australasian Theory Symposium (CATS 2011), 145-150, 2010 | 5 | 2010 |
| Arithmetic progression graphs M Dinneen, NR Ke, M Khosravani Department of Computer Science, The University of Auckland, New Zealand, 2009 | 1 | 2009 |
| Breaking intractability of spanning caterpillar tree problem: A logical approach M Khosravani AUT Journal of Mathematics and Computing 3 (2), 147-151, 2022 | | 2022 |
| A comparative study of parallel algorithms for the girth problem MJ Dinneen, M Khosravani, K Wei Proceedings of the Tenth Australasian Symposium on Parallel and Distributed …, 2012 | | 2012 |
| and Integer Programming Frameworks for Searching for Caterpillar Trees MJ Dinneen, M Khosravani | | 2010 |
| Searching for Spanning k-Caterpillars and k-Trees M Dinneen, M Khosravani Department of Computer Science, The University of Auckland, New Zealand, 2008 | | 2008 |
Michael J. DinneenComputer Science, University of Auckland, New ZealandVerified email at cs.auckland.ac.nz
