@article{CattellDDFL00,
  title = {On computing graph minor obstruction sets},
  author = {Kevin Cattell and Michael J. Dinneen and Rodney G. Downey and Michael R. Fellows and Michael A. Langston},
  year = {2000},
  doi = {http://dx.doi.org/10.1016/S0304-3975(97)00300-9},
  tags = { obstruction sets, forbidden minors, graph minors, graph-rewriting, rewriting, search},
  researchr = {http://researchr.org/publication/CattellDDFL00},
  cites = {0},
  citedby = {0},
  journal = {TCS},
  volume = {233},
  number = {1-2},
  pages = {107-127},
}

@article{DinneenVWZ99,
  title = {Construction of Time Relaxed Minimal Broadcast Networks},
  author = {Michael J. Dinneen and Jose A. Ventura and Mark C. Wilson and Golbon Zakeri},
  year = {1999},
  tags = { time relaxed, constraints, C++, broadcast networks},
  researchr = {http://researchr.org/publication/DinneenVWZ99},
  cites = {0},
  citedby = {0},
  journal = {ppl},
  volume = {9},
  number = {1},
  pages = {53-68},
}

@article{ArulanandhamCD04:0,
  title = {A fast natural algorithm for searching},
  author = {Joshua J. Arulanandham and Cristian Calude and Michael J. Dinneen},
  year = {2004},
  doi = {http://dx.doi.org/10.1016/j.tcs.2004.03.040},
  tags = {beads, search},
  researchr = {http://researchr.org/publication/ArulanandhamCD04%3A0},
  cites = {0},
  citedby = {0},
  journal = {TCS},
  volume = {320},
  number = {1},
  pages = {3-13},
}

@article{DinneenL07,
  title = {Properties of vertex cover obstructions},
  author = {Michael J. Dinneen and Rongwei Lai},
  year = {2007},
  doi = {http://dx.doi.org/10.1016/j.disc.2007.01.003},
  tags = {vertexcover, graph-rewriting, C++, rewriting},
  researchr = {http://researchr.org/publication/DinneenL07},
  cites = {0},
  citedby = {0},
  journal = {DM},
  volume = {307},
  number = {21},
  pages = {2484-2500},
}

@inproceedings{DinneenK00,
  title = {Update Networks and Their Routing Strategies},
  author = {Michael J. Dinneen and Bakhadyr Khoussainov},
  year = {2000},
  doi = {http://link.springer.de/link/service/series/0558/bibs/1928/19280127.htm},
  tags = { finite graphs, networks, meta-model, update games, strategies, graph-rewriting, information models, Meta-Environment, rewriting, routing,  infinite games, rewriting strategies},
  researchr = {http://researchr.org/publication/DinneenK00},
  cites = {0},
  citedby = {0},
  pages = {127-136},
  booktitle = {criwg},
}

@inproceedings{CattellD94,
  title = {A Characterization of Graphs with Vertex Cover up to Five},
  author = {Kevin Cattell and Michael J. Dinneen},
  year = {1994},
  tags = { vertex cover, forbidden minors, graph minors, graph-rewriting,  obstructions, rewriting},
  researchr = {http://researchr.org/publication/CattellD94},
  cites = {0},
  citedby = {0},
  pages = {86-99},
  booktitle = {ordal},
}

@article{BrewsterDF95,
  title = {A computational attack on the conjectures of Graffiti: New counterexamples and proofs},
  author = {Tony L. Brewster and Michael J. Dinneen and Vance Faber},
  year = {1995},
  doi = {http://dx.doi.org/10.1016/0012-365X(94)00227-A},
  tags = {graffiti, testing, graph-rewriting, database, rewriting,  automated math proving},
  researchr = {http://researchr.org/publication/BrewsterDF95},
  cites = {0},
  citedby = {0},
  journal = {DM},
  volume = {147},
  number = {1-3},
  pages = {35-55},
}

@article{CattellDF96,
  title = {A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width},
  author = {Kevin Cattell and Michael J. Dinneen and Michael R. Fellows},
  year = {1996},
  doi = {http://dx.doi.org/10.1016/0020-0190(95)00190-5},
  tags = {graph-rewriting, algorithm, pathwidth, rewriting},
  researchr = {http://researchr.org/publication/CattellDF96},
  cites = {0},
  citedby = {0},
  journal = {ipl},
  volume = {57},
  number = {4},
  pages = {197-203},
}

@article{DinneenZ03,
  title = {An Optimal Family of Bounded-Degree Broadcast Networks},
  author = {Michael J. Dinneen and Nian Zhou},
  year = {2003},
  doi = {http://www1.elsevier.com/gej-ng/31/29/23/134/23/show/Products/notes/index.htt#013},
  tags = {design science, constraints, optimal broadcast networks, e-science, design},
  researchr = {http://researchr.org/publication/DinneenZ03},
  cites = {0},
  citedby = {0},
  journal = {ENTCS},
  volume = {78},
}

@article{DinneenCF01,
  title = {Forbidden minors to graphs with small feedback sets},
  author = {Michael J. Dinneen and Kevin Cattell and Michael R. Fellows},
  year = {2001},
  doi = {http://dx.doi.org/10.1016/S0012-365X(00)00083-2},
  tags = {forbidden minors,  feedback vertex, graph-rewriting,  feedback edge, rewriting},
  researchr = {http://researchr.org/publication/DinneenCF01},
  cites = {0},
  citedby = {0},
  journal = {DM},
  volume = {230},
  number = {1-3},
  pages = {215-252},
}

@article{ArulanandhamCD02,
  title = {Bead-Sort: A Natural Sorting Algorithm},
  author = {Joshua J. Arulanandham and Cristian Calude and Michael J. Dinneen},
  year = {2002},
  tags = {design complexity, source-to-source, beadsort, design, open-source},
  researchr = {http://researchr.org/publication/ArulanandhamCD02},
  cites = {0},
  citedby = {0},
  journal = {eatcs},
  volume = {76},
  pages = {153-161},
}

@article{CampbellCDFFLMMS92,
  title = {Small Diameter Symmetric Networks from Linear Groups},
  author = {Lowell Campbell and Gunnar E. Carlsson and Michael J. Dinneen and Vance Faber and Michael R. Fellows and Michael A. Langston and James W. Moore and Andrew P. Mullhaupt and Harlan B. Sexton},
  year = {1992},
  tags = { Cayley graphs, degree,  diameter, graph-rewriting, rewriting},
  researchr = {http://researchr.org/publication/CampbellCDFFLMMS92},
  cites = {0},
  citedby = {0},
  journal = {TC},
  volume = {41},
  number = {2},
  pages = {218-220},
}

@article{CaludeCD03,
  title = {What is the Value of Taxicab(6)?},
  author = {Cristian Calude and Elena Calude and Michael J. Dinneen},
  year = {2003},
  doi = {http://www.jucs.org/jucs_9_10/what_is_the_value},
  tags = {taxicab, programming},
  researchr = {http://researchr.org/publication/CaludeCD03},
  cites = {0},
  citedby = {0},
  journal = {jucs},
  volume = {9},
  number = {10},
  pages = {1196-1203},
}

@article{DinneenVWZ99:0,
  title = {Compound Constructions of Broadcast Networks},
  author = {Michael J. Dinneen and Jose A. Ventura and Mark C. Wilson and Golbon Zakeri},
  year = {1999},
  doi = {http://dx.doi.org/10.1016/S0166-218X(99)00043-8},
  tags = {graph-rewriting, C++,  compound graphs, rewriting, broadcast networks},
  researchr = {http://researchr.org/publication/DinneenVWZ99%3A0},
  cites = {0},
  citedby = {0},
  journal = {DAM},
  volume = {93},
  number = {2-3},
  pages = {205-232},
}

@article{DinneenK03,
  title = {Update games and update networks},
  author = {Michael J. Dinneen and Bakhadyr Khoussainov},
  year = {2003},
  doi = {http://dx.doi.org/10.1016/S1570-8667(03)00006-6},
  tags = {meta-model, modeling, update games, graph-rewriting, Meta-Environment, rewriting, process modeling},
  researchr = {http://researchr.org/publication/DinneenK03},
  cites = {0},
  citedby = {0},
  journal = {jda},
  volume = {1},
  number = {1},
  pages = {53-65},
}

@article{DinneenPW02,
  title = {Degree- and time-constrained broadcast networks},
  author = {Michael J. Dinneen and Geoffrey Pritchard and Mark C. Wilson},
  year = {2002},
  doi = {http://dx.doi.org/10.1002/net.10018},
  tags = {empirical, rule-based, testing, graph-rewriting, C++, rewriting, search, broadcast networks},
  researchr = {http://researchr.org/publication/DinneenPW02},
  cites = {0},
  citedby = {0},
  journal = {networks},
  volume = {39},
  number = {3},
  pages = {121-129},
}

@inproceedings{CattellDF95,
  title = {Obstructions to Within a Few Vertices or Edges of Acyclic},
  author = {Kevin Cattell and Michael J. Dinneen and Michael R. Fellows},
  year = {1995},
  tags = {rule-based, forbidden minors, graph-rewriting, rewriting, search,  feedback edge set,  feedback vertex set, systematic-approach, rewriting strategies},
  researchr = {http://researchr.org/publication/CattellDF95},
  cites = {0},
  citedby = {0},
  pages = {415-427},
  booktitle = {wads},
}

@article{DeTempleDRM93,
  title = {Recent examples in the theory of partition graphs},
  author = {D. W. DeTemple and Michael J. Dinneen and J. M. Robertson and K. L. McAvaney},
  year = {1993},
  doi = {http://dx.doi.org/10.1016/0012-365X(93)90520-4},
  tags = {partition graphs, graph-rewriting, rewriting, partitioning},
  researchr = {http://researchr.org/publication/DeTempleDRM93},
  cites = {0},
  citedby = {0},
  journal = {DM},
  volume = {113},
  number = {1-3},
  pages = {255-258},
}

@inproceedings{BodlaenderDK01,
  title = {On Game-Theoretic Models of Networks},
  author = {Hans Leo Bodlaender and Michael J. Dinneen and Bakhadyr Khoussainov},
  year = {2001},
  doi = {http://link.springer.de/link/service/series/0558/bibs/2223/22230550.htm},
  tags = { finite graphs, case study, meta-model, modeling, graph-rewriting, game networks, Meta-Environment, rewriting,  infinite games, process modeling, rewriting strategies},
  researchr = {http://researchr.org/publication/BodlaenderDK01},
  cites = {0},
  citedby = {0},
  pages = {550-561},
  booktitle = {isaac},
}

@phdthesis{DiPhd95,
  title = {Bounded Combinatorial Width and Forbidden Substructures},
  author = {Michael J. Dinneen},
  year = {1995},
  month = {dec},
  note = {(Library version January 1996)},
  tags = {parsing algorithm, program analysis, classification, case study, forbidden minors, testing, analysis, planar graph, graph-rewriting,  obstructions,  algebra, programming, type theory, history, rewriting, search, parsing, systematic-approach},
  researchr = {http://researchr.org/publication/DiPhd95},
  cites = {0},
  citedby = {0},
  school = {Dept. of Computer Science, University of Victoria},
  address = {P.O. Box 3055, Victoria, B.C., Canada~~V8W~3P6},
  advisor = {Michael R. Fellows},
}

@article{BridgesCDK97,
  title = {Logic in Computer Science},
  author = {Douglas S. Bridges and Cristian Calude and Michael J. Dinneen and Bakhadyr Khoussainov},
  year = {1997},
  doi = {http://www.jucs.org/jucs_3_11/logic_in_computer_science},
  tags = {automata theory, e-science, logic},
  researchr = {http://researchr.org/publication/BridgesCDK97},
  cites = {0},
  citedby = {0},
  journal = {jucs},
  volume = {3},
  number = {11},
  pages = {1133},
}

@article{BodlaenderDK02,
  title = {Relaxed Update and Partition Network Games},
  author = {Hans Leo Bodlaender and Michael J. Dinneen and Bakhadyr Khoussainov},
  year = {2002},
  tags = {case study, meta-model, relaxed update network games, graph-rewriting, Meta-Environment, rewriting, partitioning, process modeling, rewriting strategies},
  researchr = {http://researchr.org/publication/BodlaenderDK02},
  cites = {0},
  citedby = {0},
  journal = {FUIN},
  volume = {49},
  number = {4},
  pages = {301-312},
}

@inproceedings{DinneenFF91,
  title = {Algebraic Constructions of Efficient Broadcast Networks},
  author = {Michael J. Dinneen and Michael R. Fellows and Vance Faber},
  year = {1991},
  tags = { network design,  Cayley graphs, graph-rewriting,  algebra, rewriting, systematic-approach},
  researchr = {http://researchr.org/publication/DinneenFF91},
  cites = {0},
  citedby = {0},
  pages = {152-158},
  booktitle = {AAECC},
}

@inproceedings{DinneenX00,
  title = {A Characterization of Graphs with Vertex Cover Six},
  author = {Michael J. Dinneen and Liu Xiong},
  year = {2000},
  doi = {http://link.springer.de/link/service/series/0558/bibs/1858/18580180.htm},
  tags = {completeness,  vertex cover, forbidden minors, graph-rewriting, rewriting, search},
  researchr = {http://researchr.org/publication/DinneenX00},
  cites = {0},
  citedby = {0},
  pages = {180-192},
  booktitle = {cocoon},
}

@mastersthesis{DiMasters91,
  title = {Algebraic Methods for Efficient Network Constructions},
  author = {Michael J. Dinneen},
  year = {1991},
  month = {oct},
  tags = {process algebra, algebraic network design, constraints,  algebra, design},
  researchr = {http://researchr.org/publication/DiMasters91},
  cites = {0},
  citedby = {0},
  school = {Dept. of Computer Science, University of Victoria},
  type = {Master's Thesis},
  address = {P.O. Box 3055, Victoria, B.C., Canada~~V8W~3P6},
  advisor = {Michael R. Fellows},
}

@article{CaludeD07,
  title = {Exact Approximations of omega Numbers},
  author = {Cristian S. Calude and Michael J. Dinneen},
  year = {2007},
  doi = {http://dx.doi.org/10.1142/S0218127407018130},
  tags = {Java, omega, programming},
  researchr = {http://researchr.org/publication/CaludeD07},
  cites = {0},
  citedby = {0},
  journal = {IJBC},
  volume = {17},
  number = {6},
  pages = {1937-1954},
}

@inproceedings{ArulanandhamCD04,
  title = {Balance Machines: Computing = Balancing},
  author = {Joshua J. Arulanandham and Cristian Calude and Michael J. Dinneen},
  year = {2004},
  doi = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2950&spage=36},
  tags = {meta-model, modeling, balance machines, logic, Meta-Environment},
  researchr = {http://researchr.org/publication/ArulanandhamCD04},
  cites = {0},
  citedby = {0},
  pages = {36-48},
  booktitle = {BIRTHDAY},
}

@article{Dinneen97,
  title = {Too Many Minor Order Obstructions},
  author = {Michael J. Dinneen},
  year = {1997},
  doi = {http://www.jucs.org/jucs_3_11/too_many_minor_order},
  tags = {rule-based, completeness, forbidden minors, graph-rewriting,  obstructions, rewriting, minor order},
  researchr = {http://researchr.org/publication/Dinneen97},
  cites = {0},
  citedby = {0},
  journal = {jucs},
  volume = {3},
  number = {11},
  pages = {1199-1206},
}
@proceedings{umc:2002,
  title = {Unconventional Models of Computation, Third International Conference, UMC 2002, Kobe, Japan, October 15-19, 2002, Proceedings},
  year = {2002},
  researchr = {http://researchr.org/publication/umc%3A2002},
  cites = {0},
  citedby = {0},
  booktitle = {Unconventional Models of Computation, Third International Conference, UMC 2002, Kobe, Japan, October 15-19, 2002, Proceedings},
  conference = {umc},
  editor = {Cristian Calude and Michael J. Dinneen and Ferdinand Peper},
  volume = {2509},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-44311-8},
}

@proceedings{dmtcs:2003,
  title = {Discrete Mathematics and Theoretical Computer Science, 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003. Proceedings},
  year = {2003},
  tags = {e-science},
  researchr = {http://researchr.org/publication/dmtcs%3A2003},
  cites = {0},
  citedby = {0},
  booktitle = {Discrete Mathematics and Theoretical Computer Science, 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003. Proceedings},
  conference = {dmtcs},
  editor = {Cristian Calude and Michael J. Dinneen and Vincent Vajnovszki},
  volume = {2731},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-40505-4},
}

@proceedings{dlt:2004,
  title = {Developments in Language Theory, 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, 2004, Proceedings},
  year = {2004},
  researchr = {http://researchr.org/publication/dlt%3A2004},
  cites = {0},
  citedby = {0},
  booktitle = {Developments in Language Theory, 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, 2004, Proceedings},
  conference = {dlt},
  editor = {Cristian Calude and Elena Calude and Michael J. Dinneen},
  volume = {3340},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-24014-4},
}

@proceedings{uc:2006,
  title = {Unconventional Computation, 5th International Conference, UC 2006, York, UK, September 4-8, 2006, Proceedings},
  year = {2006},
  researchr = {http://researchr.org/publication/uc%3A2006},
  cites = {0},
  citedby = {0},
  booktitle = {Unconventional Computation, 5th International Conference, UC 2006, York, UK, September 4-8, 2006, Proceedings},
  editor = {Cristian S. Calude and Michael J. Dinneen and Gheorghe Paun and Grzegorz Rozenberg and Susan Stepney},
  volume = {4135},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-38593-2},
}

@proceedings{uc:2007,
  title = {Unconventional Computation, 6th International Conference, UC 2007, Kingston, Canada, August 13-17, 2007, Proceedings},
  year = {2007},
  researchr = {http://researchr.org/publication/uc%3A2007},
  cites = {0},
  citedby = {0},
  booktitle = {Unconventional Computation, 6th International Conference, UC 2007, Kingston, Canada, August 13-17, 2007, Proceedings},
  editor = {Selim G. Akl and Cristian S. Calude and Michael J. Dinneen and Grzegorz Rozenberg and Todd Wareham},
  volume = {4618},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-73553-3},
}

@proceedings{uc:2005,
  title = {Unconventional Computation, 4th International Conference, UC 2005, Sevilla, Spain, October 3-7, 2005, Proceedings},
  year = {2005},
  researchr = {http://researchr.org/publication/uc%3A2005},
  cites = {0},
  citedby = {0},
  booktitle = {Unconventional Computation, 4th International Conference, UC 2005, Sevilla, Spain, October 3-7, 2005, Proceedings},
  editor = {Cristian Calude and Michael J. Dinneen and Gheorghe Paun and Mario J. Pérez-Jiménez and Grzegorz Rozenberg},
  volume = {3699},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-29100-8},
}

@proceedings{umc:2000,
  title = {Unconventional Models of Computation, UMC 2K, Proceedings of the Second International Conference, Brussel, Belgium, 13-16 December 2000},
  year = {2001},
  researchr = {http://researchr.org/publication/umc%3A2000},
  cites = {0},
  citedby = {0},
  booktitle = {Unconventional Models of Computation, UMC 2K, Proceedings of the Second International Conference, Brussel, Belgium, 13-16 December 2000},
  conference = {umc},
  editor = {Ioannis Antoniou and Cristian Calude and Michael J. Dinneen},
  publisher = {Springer},
  isbn = {1-85233-415-0},
}