Algebraic Constructions of Efficient Broadcast Networks. - Michael J. Dinneen; Michael R. Fellows; Vance Faber (AAECC, 1991)

Small Diameter Symmetric Networks from Linear Groups. - Lowell Campbell; Gunnar E. Carlsson; Michael J. Dinneen; Vance Faber; Michael R. Fellows; Michael A. Langston; James W. Moore; Andrew P. Mullhaupt; Harlan B. Sexton (IEEE Trans. Computers, 1992)

A Characterization of Graphs with Vertex Cover up to Five. - Kevin Cattell; Michael J. Dinneen (ORDAL, 1994)

The complexity of broadcasting in bounded-degree networks. - Michael J. Dinneen (CoRR, 1994)

New results for the degree/diameter problem. - Michael J. Dinneen; Paul R. Hafner (Networks, 1994)

Obstructions to Within a Few Vertices or Edges of Acyclic. - Kevin Cattell; Michael J. Dinneen; Michael R. Fellows (WADS, 1995)

A computational attack on the conjectures of Graffiti: New counterexamples and proofs. - Tony L. Brewster; Michael J. Dinneen; Vance Faber (Discret. Math., 1995)

Bounded combinatorial width and forbidden substructures. - Michael J. Dinneen (1995)

A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width. - Kevin Cattell; Michael J. Dinneen; Michael R. Fellows (Inf. Process. Lett., 1996)

Logic in Computer Science. - Douglas S. Bridges; Cristian Calude; Michael J. Dinneen; Bakhadyr Khoussainov (J. Univers. Comput. Sci., 1997)

Too Many Minor Order Obstructions. - Michael J. Dinneen (J. Univers. Comput. Sci., 1997)

Compound Constructions of Broadcast Networks. - Michael J. Dinneen; José A. Ventura; Mark C. Wilson; Golbon Zakeri (Discret. Appl. Math., 1999)

Construction of Time Relaxed Minimal Broadcast Networks. - Michael J. Dinneen; José A. Ventura; Mark C. Wilson; Golbon Zakeri (Parallel Process. Lett., 1999)

A Characterization of Graphs with Vertex Cover Six. - Michael J. Dinneen; Liu Xiong (COCOON, 2000)

Update Networks and Their Routing Strategies. - Michael J. Dinneen; Bakhadyr Khoussainov (WG, 2000)

Reflections on quantum computing. - Cristian S. Calude; Michael J. Dinneen; Karl Svozil (Complex., 2000)

On computing graph minor obstruction sets. - Kevin Cattell; Michael J. Dinneen; Rodney G. Downey; Michael R. Fellows; Michael A. Langston (Theor. Comput. Sci., 2000)

On Game-Theoretic Models of Networks. - Hans L. Bodlaender; Michael J. Dinneen; Bakhadyr Khoussainov (ISAAC, 2001)

Forbidden minors to graphs with small feedback sets. - Michael J. Dinneen; Kevin Cattell; Michael R. Fellows (Discret. Math., 2001)

Bead-Sort: A Natural Sorting Algorithm. - Joshua J. Arulanandham; Cristian Calude; Michael J. Dinneen (Bull. EATCS, 2002)

Computing a Glimpse of Randomness. - Cristian S. Calude; Michael J. Dinneen; Chi-Kou Shu (Exp. Math., 2002)

Relaxed Update and Partition Network Games. - Hans L. Bodlaender; Michael J. Dinneen; Bakhadyr Khoussainov (Fundam. Informaticae, 2002)

Minor-order obstructions for the graphs of vertex cover 6. - Michael J. Dinneen; Liu Xiong (J. Graph Theory, 2002)

Degree- and time-constrained broadcast networks. - Michael J. Dinneen; Geoffrey Pritchard; Mark C. Wilson (Networks, 2002)

An Optimal Family of Bounded-Degree Broadcast Networks. - Michael J. Dinneen; Nian Zhou (CATS, 2003)

Update games and update networks. - Michael J. Dinneen; Bakhadyr Khoussainov (J. Discrete Algorithms, 2003)

What is the Value of Taxicab(6)? - Cristian Calude; Elena Calude; Michael J. Dinneen (J. Univers. Comput. Sci., 2003)

Balance Machines: Computing = Balancing. - Joshua J. Arulanandham; Cristian Calude; Michael J. Dinneen (Aspects of Molecular Computing, 2004)

A fast natural algorithm for searching. - Joshua J. Arulanandham; Cristian Calude; Michael J. Dinneen (Theor. Comput. Sci., 2004)

A New Measure of the Difficulty of Problems. - Cristian S. Calude; Elena Calude; Michael J. Dinneen (J. Multiple Valued Log. Soft Comput., 2006)

Properties of vertex cover obstructions. - Michael J. Dinneen; Rongwei Lai (Discret. Math., 2007)

Exact Approximations of omega Numbers. - Cristian S. Calude; Michael J. Dinneen (Int. J. Bifurc. Chaos, 2007)

Discovering the Membrane Topology of Hyperdag P Systems. - Radu Nicolescu; Michael J. Dinneen; Yun-Bum Kim (Workshop on Membrane Computing, 2009)

New Solutions to the Firing Squad Synchronization Problems for Neural and Hyperdag P Systems - Michael J. Dinneen; Yun-Bum Kim; Radu Nicolescu (MeCBIC, 2009)

A Faster P Solution for the Byzantine Agreement Problem. - Michael J. Dinneen; Yun-Bum Kim; Radu Nicolescu (Int. Conf. on Membrane Computing, 2010)

A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs. - Michael J. Dinneen; Masoud Khosravani (SIROCCO, 2010)

Synchronization in P Modules. - Michael J. Dinneen; Yun-Bum Kim; Radu Nicolescu (UC, 2010)

Experimental Evidence of Quantum Randomness Incomputability - Cristian S. Calude; Michael J. Dinneen; Monica Dumitrescu; Karl Svozil (CoRR, 2010)

Edge- and Node-Disjoint Paths in P Systems - Michael J. Dinneen; Yun-Bum Kim; Radu Nicolescu (MeCBIC, 2010)

Towards Structured Modelling with Hyperdag P Systems. - Michael J. Dinneen; Yun-Bum Kim; Radu Nicolescu (Int. J. Comput. Commun. Control, 2010)

P systems and the Byzantine agreement. - Michael J. Dinneen; Yun-Bum Kim; Radu Nicolescu (J. Log. Algebraic Methods Program., 2010)

Foreword. - Michael J. Dinneen (Nat. Comput., 2010)

Hardness of Approximation and Integer Programming Frameworks for Searching for Caterpillar Trees. - Michael J. Dinneen; Masoud Khosravani (CATS, 2011)

An Adaptive Algorithm for P System Synchronization. - Michael J. Dinneen; Yun-Bum Kim; Radu Nicolescu (Int. Conf. on Membrane Computing, 2011)

A Program-Size Complexity Measure for Mathematical Problems and Conjectures. - Michael J. Dinneen (Computation, Physics and Beyond, 2012)

An Empirical Approach to the Normality of π. - David H. Bailey; Jonathan M. Borwein; Cristian S. Calude; Michael J. Dinneen; Monica Dumitrescu; Alex Yee (Exp. Math., 2012)

Faster synchronization in P systems. - Michael J. Dinneen; Yun-Bum Kim; Radu Nicolescu (Nat. Comput., 2012)

A (1+1) Adaptive Memetic Algorithm for the Maximum Clique Problem. - Michael J. Dinneen; Kuai Wei (IEEE Congress on Evolutionary Computation, 2013)

On the analysis of a (1+1) adaptive memetic algorithm. - Michael J. Dinneen; Kuai Wei (Memetic Computing, 2013)

Hybridizing the dynamic mutation approach with local searches to overcome local optima. - Kuai Wei; Michael J. Dinneen (IEEE Congress on Evolutionary Computation, 2014)

Runtime analysis comparison of two fitness functions on a memetic algorithm for the Clique Problem. - Kuai Wei; Michael J. Dinneen (IEEE Congress on Evolutionary Computation, 2014)

Runtime analysis to compare best-improvement and first-improvement in memetic algorithms. - Kuai Wei; Michael J. Dinneen (GECCO, 2014)

Guest Column: Adiabatic Quantum Computing Challenges. - Cristian S. Calude; Elena Calude; Michael J. Dinneen (SIGACT News, 2015)

A Hybrid Geometric Approach for Measuring Similarity Level Among Documents and Document Clustering. - Arash Heidarian; Michael J. Dinneen (BigDataService, 2016)

Editorial. - Cristian S. Calude; Michael J. Dinneen (Int. J. Unconv. Comput., 2016)

Formulating graph covering problems for adiabatic quantum computers. - Michael J. Dinneen; Richard Hua (ACSW, 2017)

An Efficient Algorithm for Mixed Domination on Generalized Series-Parallel Graphs. - M. Rajaati; Pouyeh Sharifani; Ali Shakiba; Mohammad Reza Hooshmandasl; Michael J. Dinneen (CoRR, 2017)

QUBO formulations for the graph isomorphism problem and related problems. - Cristian S. Calude; Michael J. Dinneen; Richard Hua (Theor. Comput. Sci., 2017)

A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing. - Alastair A. Abbott; Cristian S. Calude; Michael J. Dinneen; Richard Hua (CoRR, 2018)

A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing - Abridged Version. - Alastair A. Abbott; Cristian S. Calude; Michael J. Dinneen; Richard Hua (PC@UCNC, 2018)

On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width. - M. Rajaati; Mohammad Reza Hooshmandasl; Michael J. Dinneen; Ali Shakiba (Discret. Math. Theor. Comput. Sci., 2018)

Preface. - Michael J. Dinneen; Ulrich Speidel (Nat. Comput., 2018)

Solving the Hamiltonian Cycle Problem using a Quantum Computer. - Anuradha Mahasinghe; Richard Hua; Michael J. Dinneen; Rajni Goyal (ACSW, 2019)

Improved Mixed-Example Data Augmentation. - Cecilia Summers; Michael J. Dinneen (WACV, 2019)

Improved Adversarial Robustness via Logit Regularization Methods. - Cecilia Summers; Michael J. Dinneen (CoRR, 2019)

Finding the chromatic sums of graphs using a D-Wave quantum computer. - Michael J. Dinneen; Anuradha Mahasinghe; Kai Liu (J. Supercomput., 2019)

Computing Close to Optimal Weighted Shortest Paths in Practice. - Nguyet Tran; Michael J. Dinneen; Simone Linz (ICAPS, 2020)

Close Weighted Shortest Paths on 3D Terrain Surfaces. - Nguyet Tran; Michael J. Dinneen; Simone Linz (SIGSPATIAL/GIS, 2020)

Four Things Everyone Should Know to Improve Batch Normalization. - Cecilia Summers; Michael J. Dinneen (ICLR, 2020)

Quantum solutions for densest k-subgraph problems. - Cristian S. Calude; Michael J. Dinneen; Richard Hua (J. Membr. Comput., 2020)

Solving a PSPACE-complete problem with cP systems. - Alec Henderson; Radu Nicolescu; Michael J. Dinneen (J. Membr. Comput., 2020)

Improved QUBO Formulation of the Graph Isomorphism Problem. - Richard Hua; Michael J. Dinneen (SN Comput. Sci., 2020)

Nondeterminism and Instability in Neural Network Optimization. - Cecilia Summers; Michael J. Dinneen (ICML, 2021)

Close Euclidean Shortest Path Crossing an Ordered 3D Skew Segment Sequence. - Nguyet Tran; Michael J. Dinneen (ISGV, 2021)

Turing completeness of water computing. - Alec Henderson; Radu Nicolescu; Michael J. Dinneen; T. N. Chan; Hendrik Happe; Thomas Hinze (J. Membr. Comput., 2021)

Logarithmic SAT Solution with Membrane Computing. - Radu Nicolescu; Michael J. Dinneen; James Cooper; Alec Henderson; Yezhou Liu (Axioms, 2022)

A QUBO formulation for the Tree Containment problem. - Michael J. Dinneen; Pankaj S. Ghodla; Simone Linz (Theor. Comput. Sci., 2023)

Programmable and parallel water computing. - Alec Henderson; Radu Nicolescu; Michael J. Dinneen; T. N. Chan; Hendrik Happe; Thomas Hinze (J. Membr. Comput., 2023)

Sublinear P system solutions to NP-complete problems. - Michael J. Dinneen; Alec Henderson; Radu Nicolescu (Theor. Comput. Sci., 2023)

Quantum Annealing for Computer Vision minimization problems. - Shahrokh Heidari; Michael J. Dinneen; Patrice Delmas (Future Gener. Comput. Syst., 2024)

How real is incomputability in physics? - José Manuel Agüero Trejo; Cristian S. Calude; Michael J. Dinneen; Arkady Fedorov; Anatoly Kulikov; Rohit Navarathna; Karl Svozil (Theor. Comput. Sci., 2024)

Solving QUBO problems with cP systems. - Lucie Ciencialová; Michael J. Dinneen; Radu Nicolescu; Ludek Cienciala (J. Membr. Comput., 2024)