Almost all Publications and Papers

[2012]
Michael J. Dinneen and Yun-Bum Kim. A new universality result on P systems. Report CDMTCS-423, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, July 2012.
[2012]
Michael J. Dinneen and Kuai Wei. On the analysis of a (1+1) self-adjusting memetic algorithm. Report CDMTCS-424, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, August 2012. presented at workshop AI + Logic Day, Nov 16, 2012, Auckland University of Technology, Auckland, NZ.
[2012]
David H. Bailey, Jonathon M. Borwein, Cristian S. Calude, Michael J. Dinneen, Monica Dumitrescu, and Alex Yee. An empirical approach to the normality of π. Experimental Mathematics, 21(4):1-10, 2012.
[2012]
Michael J. Dinneen, Masoud Khosravani, and Kuai Wei. A comparative study of parallel algorithms for the girth problem. In Jinjun Chen and Rajiv Ranjan (Editors), Australasian Symposium on Parallel and Distributed Computing (AusPDC 2012), volume 127 of CRPIT, pages 1-8, Melbourne, Australia, 2012. Conferences in Research and Practice in Information Technology (ACS).
[2012]
Michael J. Dinneen, Bakhadyr Khoussainov, and André Nies (Editors). Computation, Physics and Beyond, volume 7160. Springer, Heidelberg, 2012. Festschrift volume in dedication to Cris Calude's 60th birthday.
[2012]
Michael J. Dinneen. A program-size complexity measure for mathematical problems and conjectures. In Michael J. Dinneen, Bakhadyr Khoussainov, and André Nies (Editors), Proceedings of the International Workshop on Theoretical Computer Science (WTCS 2012), volume 7160 of Lecture Notes in Computer Science, pages 81-93. Springer, Heidelberg, 2012.
[2012]
Michael J. Dinneen, Yun-Bum Kim, and Radu Nicolescu. An adaptive algorithm for P system synchronization. In Proceedings of the Twelfth International Conference on Membrane Computing, CMC 2011, volume 7184 of Lecture Notes in Computer Science, pages 139-169. Springer-Verlag Berlin Heidelberg, 2012.
[2011]
Michael J. Dinneen, Yun-Bum Kim, and Radu Nicolescu. Faster synchronization in P systems. Natural Computing, pages 1-9, 2011.
[2011]
Michael J. Dinneen, Yun-Bum Kim, and Radu Nicolescu. An adaptive algorithm for P system synchronization. Report CDMTCS-404, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, May 2011.
[2011]
Radu Nicolescu, Michael J. Dinneen, and Yun-Bum Kim. Using central nodes to improve P system synchronization. In Miguel Ángel Martínez del Amor, Gheorghe Paun, Ignacio Pérez-Hurtado de Menoza, Francisco José Romero Campero, and Luis Valencia Cambrera (Editors), Proceedings of Ninth Brainstorming Week on Membrane Computing (BWMC2010)., pages 125-150. Universidad de Sevilla, January 31-February 4 2011.
[2011]
Michael J. Dinneen, Yun-Bum Kim, and Radu Nicolescu. An adaptive algorithm for P system synchronization. In Proceedings of the Twelfth International Conference on Membrane Computing, CMC12, Fontainebleau, France, pages 127-152, August 23-26 2011.
[2011]
Michael J. Dinneen, Masoud Khosravani, and Andrew Probert. Using opencl for implementing simple parallel graph algorithms. In Hamid R. Arabnia (Editor), Proceedings of the 17th annual conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'11) , part of WORLDCOMP'11, pages 268-273, Las Vegas, Nevada, July 18-21 2011. CSREA Press.
[2011]
Michael J. Dinneen, Zhuying Lin, and Kuai Wei. An intelligent self-adjusting memetic algorithm for solving course scheduling problems. In 2011 3rd International Conference on Information Science and Engineering (ICISE), volume 1, pages 140-144, Yangzhou, China, September 29th-October 1st 2011. IEEE. IEEE Catalog Number CFP1176H-PRT.
[2011]
David H. Bailey, Jonathon M. Borwein, Cristian S. Calude, Michael J. Dinneen, Monica Dumitrescu, and Alex Yee. An empirical approach to the normality of π. Report CDMTCS-413, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, November 2011. accepted to appear: Experimental Mathematics.
[2011]
Sonny Datt and Michael J. Dinneen. Towards practical p systems: Discovery algorithms. Report CDMTCS-414, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, December 2011.
[2011]
Michael J. Dinneen and Masoud Khosravani. Hardness of approximation and IP frameworks for searching for caterpillar trees. In Taso Viglas Alex Potanin (Editor), Proceedings of the 17th Computing: the Australasian Theory Symposium (CATS2011), volume 119, pages 145-150. Conferences in Research and Practice in Information Technology (ACS), January 2011.
[2010]
Cristian S. Calude, Michael J. Dinneen, and Anna M. Gardner. Opening the book of randomness (extended version). Report CDMTCS-393, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, October 2010. 39 pages, extended from article in DIASPAR: A mapping of randomness, a limited edition book by Rafe Copeland.
[2010]
Michael J. Dinneen, Yun-Bum Kim, and Radu Nicolescu. Edge- and node- disjoint paths in P systems. Electronic Proceedings in Theoretical Computer Science (EPTCS), 40:121-141, 2010. http://eptcs.org/.
[2010]
Michael J. Dinneen, Yun-Bum Kim, and Radu Nicolescu. Vertex-disjoint paths in P modules. In Membrane Computing and Biologically Inspired Process Calculi, Fourth Workshop, MeCBIC 2010, Jena, Germany, August 23, 2010, volume 40, pages 117-136, 2010.
[2010]
Cristian S. Calude, Michael J. Dinneen, Monica Dumitrescu, and Karl Svozil. Experimental evidence of quantum randomness incomputability. Physical Review A, 82(2):1-8, August 2010.
[2010]
Michael J. Dinneen, Yun-Bum Kim, and Radu Nicolescu. Toward practical P systems for distributed computing. In Seria Matematica-Informatica (Honor of Solomon Marcus on the Occasion of his 85th Anniversary), pages 23-34. Analele Universitatii din Bucuresti, 2010.
[2010]
Michael J. Dinneen, Yun-Bum Kim, and Radu Nicolescu. A faster P solution for the byzantine agreement problem. In Marian Gheorghe, Thomas Hinze, and Gheorghe Paun (Editors), Proceedings of the Eleventh International Workshop on Membrane Computing, (CMC11), Jena, Germany, pages 167-192. Verlag ProBusiness, Berlin, 2010.
[2010]
Michael J. Dinneen and Masoud Khosravani. A linear time algorithm for the minimum spanning caterpillar problem for bounded treewidth graphs. In Boaz Patt-Shamir and Tinaz Ekim (Editors), Proceedings of the 17th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2010, volume 6058 of Lecture Notes in Computer Science, pages 237-246. Springer, Heidelberg, June 2010.
[2010]
Michael J. Dinneen, Yun-Bum Kim, and Radu Nicolescu. Synchronization in P modules. In Proceedings of the 9th International Conference on Unconventional Computation, UC2010, volume 6079 of Lecture Notes in Computer Science, pages 32-44. Springer-Verlag, Berlin Heidelberg, June 2010.
[2010]
Michael J. Dinneen, Yun-Bum Kim, and Radu Nicolescu. P systems and the Byzantine agreement. Journal of Logic and Algebraic Programming, 79:334-349, 2010.
[2010]
Radu Nicolescu, Michael J. Dinneen, and Yun-Bum Kim. Discovering the membrane topology of hyperdag P systems. In Gheorghe Paun, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez, Grzegorz Rozenberg, and Arto Salomaa (Editors), Revised Selected and Invited papers of 10th International Workshop on Membrane Computing, (WMC 2009), Curtea de Arge s, Romania, volume 5957 of Lecture Notes in Computer Science, pages 410-435. Springer, Heidelberg, 2010.
[2009]
Radu Nicolescu, Michael J. Dinneen, and Yun-Bum Kim. Structured modelling with hyperdag P systems: Part B. Report CDMTCS-373, Centre for Discrete Mathematics and Theoretical Computer Science, The University of Auckland, Auckland, New Zealand, October 2009. 43 pages.
[2009]
Cristian S. Calude, Michael J. Dinneen, Monica Dumitrescu, and Karl Svozil. How random is quantum randomness? (extended version). Report CDMTCS-372, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, December 2009. 83 pages.
[2009]
Michael J. Dinneen, Yun-Bum Kim, and Radu Nicolescu. New solutions to the firing squad synchronization problem for neural and hyperdag P systems. Electronic Proceedings in Theoretical Computer Science (EPTCS), 11:107-122, 2009. (originally appeared in Membrane Computing and Biologically Inspired Process Calculi, Third Workshop, MeCBIC 2009, Bologna, Italy, September 5, 2009, pages 117-130).
[2010]
Radu Nicolescu, Michael J. Dinneen, and Yun-Bum Kim. Towards structured modelling with hyperdag P systems. International Journal of Computers, Communication & Control, V(2):224-237, 2010.
[2009]
Michael J. Dinneen, Nan Rosemary Ke, and Masoud Khosravani. Arithmetic progression graphs. Report CDMTCS-356, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, March 2009. 19 pages.
[2009]
Michael J. Dinneen, Georgy Gimel'farb, and Mark C. Wilson. Introduction to Algorithms, Data Structures and Formal Languages, 2nd Edition. Pearson (Education New Zealand), 2009. ISBN 978-1-4425-1206-1 (pages 264).
[2009]
Radu Nicolescu, Michael J. Dinneen, and Yun-Bum Kim. Structured modelling with hyperdag P systems: Part A. In Rosa Gutiérrez-Escudero, Miguel Angel, Gutiérrez-Naranjo, Gheorghe Paun, and Ignacio Pérez-Hurtado (Editors), Proceedings of Seventh Brainstorming Week on Membrane Computing (BWMC2009)., pages 85-108. Universidad de Sevilla, February 2009.
[2008]
Michael J. Dinneen and Masoud Khosravani. Searching for spanning k-caterpillars and k-trees. Report CDMTCS-336, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, September 2008. 17 pages.
[2008]
Michael J. Dinneen and Aisha J.L. Fenton. A new linear-time dominating number algorithm for graphs of bounded pathwidth. Report CDMTCS-329, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, July 2008. 22 pages.
[2008]
Alistar A. Abbott and Michael J. Dinneen. An investigation of algorithms to aesthetically draw cayley graphs. Report CDMTCS-318, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, March 2008. 52 pages, Graph Drawing E-print Archive (GDEA), report 812.
[2007]
Yun-B. Kim and Michael J. Dinneen. A repository of compound graphs for use in large network design. Report CDMTCS-313, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, November 2007. 15 pages.
[2007]
Michael J. Dinneen and Rongwei Lai. Properties of vertex cover obstructions. Discrete Mathematics, 307:2484-2500, 2007.
[2007]
Cristian S. Calude and Michael .J. Dinneen. Exact approximations of Omega numbers. Intl. J. of Bifurcation and Chaos, 17(6):1937-1954, July 2007.
[2007]
Selim G. Akl, Cristian S. Calude, Michael J. Dinneen, Grzegorz Rozenberg, and H. Todd Wareham (Editors). Unconventional Computation, UC 2007, volume 4618 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2007. ISBN 978-3-540-73553-3.
[2006]
Cristian S. Calude, Michael J. Dinneen, Gheorghe Paün, Grzegorz Rozenberg, and Susan Stepney (Editors). Unconventional Computation, UC'06, volume 4135 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2006. ISBN 3-540-38593-2.
[2006]
Cristian S. Calude, Elena Calude, and Michael J. Dinneen. A new measure of the difficulty of problems. Journal of Multiple-Valued Logic and Soft Computing, 12:285-307, January 2006.
[2005]
Cristian S. Calude and Michael J. Dinneen. Is quantum randomness algorithmic random? a preliminary attack. In S. Bozapalidis, A. Kalampakas, and G. Rahonis (Editors), International Conference on Algebraic Informatics, CAI05, pages 195-196, 2005. Invited Talk (http://www.auth.gr/cai05/), Aristotle University of Thessaloniki, Oct 20-23, 2005.
[2005]
Cristian S. Calude, Michael J. Dinneen, Gheorghe Paün, Mario de Jesus Pérez-Jiménez, and Grzegorz Rozenberg (Editors). Unconventional Computation, UC'05, volume 3699 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2005. ISBN 3-540-i29100-8.
[2005]
Michael J. Dinneen, Ulrich Spiedel, and Desmond Taylor (Editors). Proc. of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW'05, IEEE Information Theory Society. IEEE Catalog Number: 05EX1207C, 2005. ISBN 0-7803-9481-X.
[2005]
Cristian S. Calude, Elena Calude, and Michael J. Dinneen. What is the value of taxicab(6)? an update. Report CDMTCS-261, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, December 2005. 6 pages.
[2004]
Cristian S. Calude, Elena Calude, and Michael J. Dinneen (Editors). Proc. 8th International Conference on Developments in Language Theory, DLT'04, volume 3340 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2004. ISBN 3-540-24014-4.
[2004]
Joshua J. Arulanandham and Michael J. Dinneen. Balance machines: A new formalism for computing. Report CDMTCS-256, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, December 2004. 13 pages.
[2004]
Michael J. Dinneen and Rongwei Lai. Properties of vertex cover obstructions. Report CDMTCS-254, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, November 2004. 23 pages.
[2004]
Cristian S. Calude, Elena Calude, and Michael J. Dinneen (editors). Supplemental papers for DLT04. Report CDMTCS-252, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, November 2004. 72 pages.
[2004]
Michael J. Dinneen and Rongwei Lai. Fixed drawings of some of the vertex cover 6 obstructions, September 2004. Online note: http://www.cs.auckland.ac.nz/ ~ mjd/vacs/fixedvc6figs.pdf.
[2004]
Joshua J. Arulanandham, Cristian S. Calude, and Michael J. Dinneen. A fast natural algorithm for searching. Theoretical Computer Science, 320(1):3-13, 2004. (http://authors.elsevier.com/sd/article/S0304397504001914).
[2004]
Michael J. Dinneen, Georgy Gimel'farb, and Mark C. Wilson. Introduction to Algorithms, Data Structures and Formal Languages. Pearson (Education New Zealand), 2004. ISBN 1-877258-79-2 (pages 253).
[2004]
Joshua J. Arulanandham, Cristian S. Calude, and Michael J. Dinneen. Balance machines: Computing = balancing. In G. Rozenberg N. Jonoska, Gh. Paun (Editor), Aspects of Molecular Computing, volume 2950 of Lecture Notes in Computer Science, pages 36-47. Springer, 2004. A Fetschrift (volume) in honor of Tom Head's 70th birthday, published by Springer in the Natural Computing series.
[2003]
Cristian S. Calude, Elena Calude, and Michael J. Dinneen. What is the value of taxicab(6)? (extended abstract). An. St. Univ. "Ovidius" Constant ta-Mathematics, 1(21):41-44, 2003.
[2003]
Cristian S. Calude, Elena Calude, and Michael J. Dinneen. What is the value of taxicab(6)? Journal of Universal Computer Science, 9(10):1196-1203, October 2003.
[2003]
Joshua J. Arulanandham, Cristian S. Calude, and Michael J. Dinneen. A fast natural algorithm for searching. In K. Margaritis, I. Pitas, Y. Manolopoulos, and P. Spirakis (Editors), 1st South-East European Workshop on Formal Methods (SEEFM'03), volume Proceedings of PCI9 and BCI0, pages 189-199. MLS Multimedia, 2003.
[2003]
Cristian S. Calude, Elena Calude, and Michael J. Dinneen. What is the value of taxicab(6)? Report CDMTCS-217, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, May 2003. 9 pages.
[2003]
Cristian S. Calude, Michael J. Dinneen, and Vincent Vajnovski (Editors). Proc. 4th International Conference DMTCS'03, volume 2731 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2003. ISBN 3-540-40505-4.
[2003]
Cristian S. Calude, Michael J. Dinneen, and Vincent Vajnovszki (editors). Supplemental papers for DMTCS03. Report CDMTCS-215, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, May 2003. 41 pages.
[2003]
Joshua J. Arulanandham, Cristian S. Calude, and Michael J. Dinneen. Solving SAT with bilateral computing. Romanian Journal of Information Science and Technology, 6(1-2):9-18, 2003.
[2003]
Michael J. Dinneen and Nian (Alfred) Zhou. An optimal family of directed, bounded-degree broadcast networks. In James Harland (Editor), Proceedings of the 9th Computing: The Australasian Theory Symposium (CATS'03), volume 78 of Electronic Notes in Theoretical Computer Science, pages 1-12. Elsevier Science Publishers, February 2003.
[2003]
Michael J. Dinneen and Bakhadyr Khoussainov. Update games and update networks. J. Discrete Algorithms, 1(1):53-65, 2003.
[2002]
Jarret Walsh and Michael J. Dinneen. Family membership for subgraphs, minors and topological minors in graphs of bounded pathwidth and treewidth. Report CDMTCS-205, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, December 2002. 22 pages.
[2002]
Joshua J. Arulanandham, Cristian S. Calude, and Michael J. Dinneen. Solving SAT with bilateral computing. Report CDMTCS-199, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, December 2002. 11 pages.
[2002]
Michael J. Dinneen and Liu Xiong. Minor-order obstructions for the graphs of vertex cover 6. J. of Graph Theory, 41(3):163-178, September 2002. Wiley InterScience (www.interscience.wiley.com) DOI 10.1002/jgt.10059.
[2002]
Cristian S. Calude, Michael J. Dinneen, and Ferdinand Peper (Editors). Unconventional Models of Computation, UMC'02, volume 2509 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2002. ISBN 3-540-44311-8.
[2002]
Cristian S. Calude, Michael J. Dinneen, and Chi-Kou Shu. Computing a glimpse of randomness. Experimental Mathematics, 11(2):369-378, 2002.
[2002]
Hans L. Bodlaender, Michael J. Dinneen, and Bakhadyr Khoussainov. Relaxed update and partition network games. Fundamenta Informaticae, 49:301-312, 2002.
[2002]
Michael J. Dinneen, Geoffrey Pritchard, and Mark C. Wilson. Degree- and time- constrained broadcast networks. Networks, 39(3):121-129, March 2002.
[2002]
Joshua J. Arulanandham, Cristian S. Calude, and Michael.J. Dinneen. Bead-sort: A natural sorting algorithm. Bulletin of the European Association for Theoretical Computer Science, 76:153-162, April 2002.
[2001]
Cristian S. Calude, Michael J. Dinneen, and Chi-Kou Shu. Computing a glimpse of randomness. Report CDMTCS-167, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, December 2001. 12 pages. (arXiv preprint archive)
[2001]
S.Y.P. (Sophia) Lee and Michael J. Dinneen. A conference submission web server. Report CDMTCS-157, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, June 2001. 21 pages.
[2001]
Hans L. Bodlaender, Michael J. Dinneen, and Bakhadyr Khoussainov. Relaxed update and partition network games. Technical Report UU-CS-2001-15, Institute for Information and Computing Sciences, Utrecht University, Utrecht, the Netherlands, 2001.
[2001]
Cristian S. Calude, Michael J. Dinneen, and Silviu Sburlan (Editors). Combinatorics, Computability and Logic, Springer Series in Discrete Mathematics and Theoretical Computer Science. Springer-Verlag, London, 2001. ISBN 1-85233-526-2.
[2001]
Cristian S. Calude, Michael J. Dinneen, and Silviu Sburlan (editors). Supplemental abstracts for DMTCS01. Report CDMTCS-152, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, April 2001. 12 pages.
[2001]
Hans L. Bodlaender, Michael J. Dinneen, and Bakhadyr Khoussainov. On game-theoretic models of networks. In Proceedings of the Twelfth Annual International Symposium on Algorithms and Computation (ISAAC'01), volume 2223 of Lecture Notes in Computer Science, pages 550-562. Springer-Verlag, December 2001.
[2001]
Michael J. Dinneen, Kevin Cattell, and Michael R. Fellows. Forbidden minors to graphs with small feedback sets. Discrete Mathematics, 230:215-252, March 2001.
[2000]
Ioannis Antonio, Cristian S. Calude, and Michael J. Dinneen (Editors). Unconventional Models of Computation, UMC'2K, Springer Series in Discrete Mathematics and Theoretical Computer Science. Springer-Verlag, London, 2000. ISBN 1-85233-415-0.
[2000]
Ioannis Antoniou, Cristian S. Calude, and Michael J. Dinneen (editors). Supplemental papers for the 2nd unconventional models of computation conference, UMC2K. Report CDMTCS-147, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, November 2000.
[2000]
Cristian S. Calude, Michael J. Dinneen, and Chi-Kou Shu. Computing 80 initial bits of a Chaitin Omega number. Report CDMTCS-146, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, November 2000. 12 pages.
[2000]
Cristian S. Calude, Michael J. Dinneen, and Gheorghe Paun (editors). Pre-proceedings of the workshop on multiset processing. Report CDMTCS-140, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, August 2000. 316 pages.
[2000]
Cristian S. Calude and Michael J. Dinneen (editors). The 5th Anniversary Workshop on Discrete Mathematics and Theoretical Computer Science. Report CDMTCS-134, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, May 2000. 9 pages.
[2000]
Michael J. Dinneen and Bakhadyr Khoussainov. Update networks and their routing strategies. In Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science, WG2000, volume 1928 of Lecture Notes in Computer Science, pages 127-136. Springer-Verlag, June 2000.
[2000]
Michael J. Dinneen and Liu Xiong. A characterization of graphs with vertex cover 6. In Proceedings of the Sixth Annual International Computing and Combinatorics Conference, COCOON'2000, volume 1858 of Lecture Notes in Computer Science, pages 180-192. Springer-Verlag, July 2000.
[2000]
Kevin Cattell, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, and Michael A. Langston. On computing graph minor obstruction sets. Theoretical Computer Science, 233(1-2):107-127, February 2000.
[2000]
Liu Xiong and Michael J. Dinneen. The feasibility and use of a minor containment algorithm. Technical report 171, Department of Computer Science, University of Auckland, Auckland, New Zealand, February 2000. 25 pages, Presented at the 5th Anniversary Workshop of CDMTCS (May 2000).
[2000]
Michael J. Dinneen and Liu Xiong. The minor-order obstructions for the graphs of vertex cover six. Report CDMTCS-118, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, January 2000. 29 pages.
[2000]
Cristian S. Calude, Michael J. Dinneen, and Karl Svozil. Reflections on quantum computing. Complexity, 6(1):35-37, 2000.
[1999]
Michael J. Dinneen, Jose A. Ventura, Mark C. Wilson, and Golbon Zakeri. Construction of time-relaxed minimal broadcast networks. Parallel Processing Letters, 9(1):53-68, 1999.
[1999]
Michael J. Dinneen, Jose A. Ventura, Mark C. Wilson, and Golbon Zakeri. Compound constructions of minimal broadcast networks. Discrete Applied Mathematics, 93:205-232, January 1999.
[1999]
Michael J. Dinneen and Bakhadyr Khoussainov. Automata with equational constraints. In Proceedings of the Australasian Workshop on Constraint Programming and Applications, CPA-99, pages 42-51, December 1999. (Part of the 12th Australian Joint Conference on AI held at UNSW, Sydney, Australia).
[1999]
Michael J. Dinneen and Bakhadyr Khoussainov. Update games and update networks. In Proceedings of the Tenth Australasian Workshop on Combinatorial Algorithms, AWOCA'99, pages 7-18. Curtin University Press, August 1999. ISBN 1-86342-802-X.
[1999]
See Mu Kim and Michael J. Dinneen. User friendly interface for maintaining BibTeX databases. Technical report 167, Department of Computer Science, University of Auckland, Auckland, New Zealand, June 1999.
[1999]
Liu Xiong and Michael J. Dinneen. A simple but effective web-based report server. Technical report 165, Department of Computer Science, University of Auckland, Auckland, New Zealand, March 1999.
[1999]
Cristian S. Calude, Michael J. Dinneen, and Karl Svozil. Counterfactual effect, the halting problem, and the busy beaver function. Report CDMTCS-107, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, July 1999. 8 pages.
[1999]
Cristian S. Calude and Michael J. Dinneen (Editors). Combinatorics, Complexity and Logic, Springer Series in Discrete Mathematics and Theoretical Computer Science. Springer-Verlag, Singapore, 1999. ISBN: 981-4021-56-3.
[1999]
Cristian S. Calude and Michael J. Dinneen. Breaking the Turing barrier. New Zealand Science Monthly, 10(5):9-10, 1999.
[1998]
Michael J. Dinneen. Abstracts of the 2nd Japan - New Zealand workshop on logic in computer science. Edited report CDMTCS-092, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, October 1998.
[1998]
Michael J. Dinneen, Paul Hafner, Vance Faber, and Dean Prichard. A twisted 4-cube, a (6,2) graph of order 32, 1998. (Los Alamos National Laboratory, Cayley graph layout design).
[1998]
Michael J. Dinneen. Group-theoretic methods for designing networks. Bulletin of the European Association for Theoretical Computer Science, 65:53-59, June 1998. News from New Zealand.
[1998]
Michael J. Dinneen, Geoffrey Pritchard, and Mark C. Wilson. Degree- and time- constrained broadcast networks. Report CDMTCS-080, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, New Zealand, April 1998. 16 pages, Accepted Networks 06/99.
[1998]
Cristian S. Calude, John Casti, and Michael J. Dinneen (Editors). Unconventional Models of Computation, volume 4 of Springer Series in Discrete Mathematics and Theoretical Computer Science. Springer-Verlag, Singapore, 1998. ISBN 981-3083-69-7.
[1997]
Douglas S. Bridges, Cristian S. Calude, Michael J. Dinneen, and Bakh Khoussainov (Editors). Proceedings of The First Japan-New Zealand Workshop: Logic in Computer Science. (J.UCS special issue), volume 3(11). Springer-Verlag, Heidelberg, 1997.
[1997]
Michael J. Dinneen. Too many minor order obstructions (for parameterized lower ideals). Journal of Universal Computer Science, 3(11):1199-1206, December 1997.
[1997]
Michael J. Dinneen. Practical enumeration methods for graphs of bounded pathwidth and treewidth. Report CDMTCS-055, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, New Zealand, September 1997. 32 pages.
[1997]
Michael J. Dinneen, Jose A. Ventura, Mark C. Wilson, and Golbon Zakeri. Construction of time-relaxed minimal broadcast networks. TR139, Department of Computer Science, University of Auckland, New Zealand, February 1997. (Accepted Parallel Processing Letters, 1998).
[1997]
Michael J. Dinneen, Jose A. Ventura, Mark C. Wilson, and Golbon Zakeri. Compound constructions of minimal broadcast networks. Report CDMTCS-026, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, New Zealand, January 1997. 22 pages, (Accepted Discrete Applied Mathematics, 1998).
[1996]
Michael J. Dinneen, Kevin Cattell, and Michael R. Fellows. Forbidden minors to graphs with small feedback sets. Report CDMTCS-019, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, New Zealand, October 1996. 48 pages, (Accepted Discrete Mathematics, 1998).
[1996]
Kevin Cattell, Michael J. Dinneen, and Michael R. Fellows. A simple linear-time algorithm for finding path-decompositions of small width. Information Processing Letters, 57:197-203, 1996.
[1995]
Michael J. Dinneen. Bounded Combinatorial Width and Forbidden Substructures. Ph.D. dissertation, Dept. of Computer Science, University of Victoria, P.O. Box 3055, Victoria, B.C., Canada  V8W 3P6, December 1995. (Library version January 1996).
[1995]
Tony L. Brewster, Michael J. Dinneen, and Vance Faber. A computational attack on the conjectures of graffiti: New counterexamples and proofs. Discrete Mathematics, 147(1-3):35-55, December 1995.
[1995]
Kevin Cattell, Michael J. Dinneen, and Michael R. Fellows. Obstructions to within a few vertices or edges of acyclic. In Proceedings of the Fourth Workshop on Algorithms and Data Structures, WADS'95, volume 955 of Lecture Notes in Computer Science, pages 415-427. Springer-Verlag, August 1995.
[1995]
Michael J. Dinneen. VLSI layouts and DNA physical mappings. Combinatorics report LACES-[05C-95-20], Los Alamos National Laboratory, 1995.
[1995]
Kevin Cattell and Michael J. Dinneen. The VLSI automated compilation system (VACS) technical manual, 1995. Developed at the University of Victoria, Canada (300+ pages).
[1994]
Kevin Cattell and Michael J. Dinneen. Drawing graphs of bounded pathwidth, 1994. Dept. Computer Science Manuscript, University of Victoria, Canada.
[1994]
Michael J. Dinneen and Paul R. Hafner. New results for the degree/diameter problem. Networks, 24:359-367, October 1994.
[1994]
Kevin Cattell and Michael J. Dinneen. A characterization of graphs with vertex cover up to five. In Vincent Bouchitte and Michel Morvan (Editors), Orders, Algorithms and Applications, ORDAL'94, volume 831 of Lecture Notes in Computer Science, pages 86-99. Springer-Verlag, July 1994.
[1994]
Michael J. Dinneen. The complexity of broadcasting in bounded-degree networks. Combinatorics report LACES-[05C-94-31], Los Alamos National Laboratory, 1994.
[1993]
Duane W. DeTemple, Michael J. Dinneen, Kevin L. McAvaney, and Jack M. Robertson. Recent examples in the theory of partition graphs. Discrete Mathematics, 113:255-258, 1993.
[1992]
Michael J. Dinneen. A computational attack on graffiti's matching and chromatic number conjectures. Manuscript, Los Alamos National Laboratory, 1992.
[1992]
Lowell Campbell, Gunnar E. Carlsson, Michael J. Dinneen, Vance Faber, Michael R. Fellows, Michael A. Langston, James W. Moore, Andrew P. Mullhaupt, and Harlan B. Sexton. Small diameter symmetric networks from linear groups. IEEE Transactions on Computers, 41:218-220, 1992.
[1991]
Michael J. Dinneen, Vance Faber, and Michael R. Fellows. Algebraic constructions of efficient broadcast networks. In H. F. Mattson, T. Mora, and T. R. N. Rao (Editors), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, volume 539 of Lecture Notes in Computer Science, pages 150-158. Springer-Verlag, October 1991. Proceedings of the 9th International Symposium, AAECC-9.
[1991]
Michael J. Dinneen. Algebraic methods for efficient network constructions. Master's thesis, Dept. of Computer Science, University of Victoria, P.O. Box 3055, Victoria, B.C., Canada  V8W 3P6, October 1991.


File translated from TEX by TTH, version 3.85.
November 2012.