Michael J. Dinneen - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

2007

Unconventional Computation, 6th International Conference, UC 2007, Kingston, Canada, August 13-17, 2007, ProceedingsSelim G. Akl, Cristian S. Calude, Michael J. Dinneen, Grzegorz Rozenberg, Todd Wareham, editors, Volume 4618 of Lecture Notes in Computer Science, Springer, 2007.

Exact Approximations of omega NumbersCristian S. Calude, Michael J. Dinneen. IJBC, 17(6):1937-1954, 2007. [doi]

Properties of vertex cover obstructionsMichael J. Dinneen, Rongwei Lai. DM, 307(21):2484-2500, 2007. [doi]

2006

Unconventional Computation, 5th International Conference, UC 2006, York, UK, September 4-8, 2006, ProceedingsCristian S. Calude, Michael J. Dinneen, Gheorghe Paun, Grzegorz Rozenberg, Susan Stepney, editors, Volume 4135 of Lecture Notes in Computer Science, Springer, 2006.

2005

Unconventional Computation, 4th International Conference, UC 2005, Sevilla, Spain, October 3-7, 2005, ProceedingsCristian Calude, Michael J. Dinneen, Gheorghe Paun, Mario J. Pérez-Jiménez, Grzegorz Rozenberg, editors, Volume 3699 of Lecture Notes in Computer Science, Springer, 2005.

2004

A fast natural algorithm for searchingJoshua J. Arulanandham, Cristian Calude, Michael J. Dinneen. TCS, 320(1):3-13, 2004. [doi]

Balance Machines: Computing = BalancingJoshua J. Arulanandham, Cristian Calude, Michael J. Dinneen. BIRTHDAY 2004: 36-48 [doi]

Developments in Language Theory, 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, 2004, ProceedingsCristian Calude, Elena Calude, Michael J. Dinneen, editors, Volume 3340 of Lecture Notes in Computer Science, Springer, 2004.

2003

What is the Value of Taxicab(6)?Cristian Calude, Elena Calude, Michael J. Dinneen. jucs, 9(10):1196-1203, 2003. [doi]

Discrete Mathematics and Theoretical Computer Science, 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003. ProceedingsCristian Calude, Michael J. Dinneen, Vincent Vajnovszki, editors, Volume 2731 of Lecture Notes in Computer Science, Springer, 2003.

Update games and update networksMichael J. Dinneen, Bakhadyr Khoussainov. jda, 1(1):53-65, 2003. [doi]

An Optimal Family of Bounded-Degree Broadcast NetworksMichael J. Dinneen, Nian Zhou. ENTCS, 78, 2003. [doi]

2002

Bead-Sort: A Natural Sorting AlgorithmJoshua J. Arulanandham, Cristian Calude, Michael J. Dinneen. eatcs, 76:153-161, 2002.

Relaxed Update and Partition Network GamesHans Leo Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov. FUIN, 49(4):301-312, 2002.

Unconventional Models of Computation, Third International Conference, UMC 2002, Kobe, Japan, October 15-19, 2002, ProceedingsCristian Calude, Michael J. Dinneen, Ferdinand Peper, editors, Volume 2509 of Lecture Notes in Computer Science, Springer, 2002.

Degree- and time-constrained broadcast networksMichael J. Dinneen, Geoffrey Pritchard, Mark C. Wilson. networks, 39(3):121-129, 2002. [doi]

2001

Unconventional Models of Computation, UMC 2K, Proceedings of the Second International Conference, Brussel, Belgium, 13-16 December 2000Ioannis Antoniou, Cristian Calude, Michael J. Dinneen, editors, Springer, 2001.

On Game-Theoretic Models of NetworksHans Leo Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov. isaac 2001: 550-561 [doi]

Forbidden minors to graphs with small feedback setsMichael J. Dinneen, Kevin Cattell, Michael R. Fellows. DM, 230(1-3):215-252, 2001. [doi]

2000

On computing graph minor obstruction setsKevin Cattell, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, Michael A. Langston. TCS, 233(1-2):107-127, 2000. [doi]

A Characterization of Graphs with Vertex Cover SixMichael J. Dinneen, Liu Xiong. cocoon 2000: 180-192 [doi]

Update Networks and Their Routing StrategiesMichael J. Dinneen, Bakhadyr Khoussainov. criwg 2000: 127-136 [doi]

1999

Compound Constructions of Broadcast NetworksMichael J. Dinneen, Jose A. Ventura, Mark C. Wilson, Golbon Zakeri. DAM, 93(2-3):205-232, 1999. [doi]

Construction of Time Relaxed Minimal Broadcast NetworksMichael J. Dinneen, Jose A. Ventura, Mark C. Wilson, Golbon Zakeri. ppl, 9(1):53-68, 1999.

1997

Logic in Computer ScienceDouglas S. Bridges, Cristian Calude, Michael J. Dinneen, Bakhadyr Khoussainov. jucs, 3(11):1133, 1997. [doi]

Too Many Minor Order ObstructionsMichael J. Dinneen. jucs, 3(11):1199-1206, 1997. [doi]

1996

A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small WidthKevin Cattell, Michael J. Dinneen, Michael R. Fellows. ipl, 57(4):197-203, 1996. [doi]

1995

A computational attack on the conjectures of Graffiti: New counterexamples and proofsTony L. Brewster, Michael J. Dinneen, Vance Faber. DM, 147(1-3):35-55, 1995. [doi]

Obstructions to Within a Few Vertices or Edges of AcyclicKevin Cattell, Michael J. Dinneen, Michael R. Fellows. wads 1995: 415-427

Bounded Combinatorial Width and Forbidden SubstructuresMichael J. Dinneen. PhD thesis, Dept. of Computer Science, University of Victoria, P.O. Box 3055, Victoria, B.C., Canada~~V8W~3P6, dec 1995.

1994

A Characterization of Graphs with Vertex Cover up to FiveKevin Cattell, Michael J. Dinneen. ordal 1994: 86-99

1993

Recent examples in the theory of partition graphsD. W. DeTemple, Michael J. Dinneen, J. M. Robertson, K. L. McAvaney. DM, 113(1-3):255-258, 1993. [doi]

1992

Small Diameter Symmetric Networks from Linear GroupsLowell Campbell, Gunnar E. Carlsson, Michael J. Dinneen, Vance Faber, Michael R. Fellows, Michael A. Langston, James W. Moore, Andrew P. Mullhaupt, Harlan B. Sexton. TC, 41(2):218-220, 1992.

1991

Algebraic Methods for Efficient Network ConstructionsMichael J. Dinneen. Master's Thesis, Dept. of Computer Science, University of Victoria, P.O. Box 3055, Victoria, B.C., Canada~~V8W~3P6, oct 1991.

Algebraic Constructions of Efficient Broadcast NetworksMichael J. Dinneen, Michael R. Fellows, Vance Faber. AAECC 1991: 152-158