Michael J. Dinneen

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 35

Top Topics

Minimization Problems

Graph Isomorphism

Regularization Method

Top Venues

Theor. Comput. Sci.

J. Membr. Comput.

IEEE Congress on Evolutionary Computation

Publications

Shahrokh Heidari, Michael J. Dinneen, Patrice Delmas
Quantum Annealing for Computer Vision minimization problems. Future Gener. Comput. Syst. 160 (2024)
José Manuel Agüero Trejo, Cristian S. Calude, Michael J. Dinneen, Arkady Fedorov, Anatoly Kulikov, Rohit Navarathna, Karl Svozil
How real is incomputability in physics? Theor. Comput. Sci. 1003 (2024)
Michael J. Dinneen, Alec Henderson, Radu Nicolescu
Sublinear P system solutions to NP-complete problems. Theor. Comput. Sci. 958 (2023)
Shahrokh Heidari, Michael J. Dinneen, Patrice Delmas
Quantum Annealing for Computer Vision Minimization Problems. CoRR (2023)
Michael J. Dinneen, Pankaj S. Ghodla, Simone Linz
A QUBO formulation for the Tree Containment problem. Theor. Comput. Sci. 940 (Part) (2023)
Alec Henderson, Radu Nicolescu, Michael J. Dinneen, T. N. Chan, Hendrik Happe, Thomas Hinze
Programmable and parallel water computing. J. Membr. Comput. 5 (1) (2023)
José Manuel Agüero Trejo, Cristian S. Calude, Michael J. Dinneen, Arkady Fedorov, Anatoly Kulikov, Rohit Navarathna, Karl Svozil
How Real is Incomputability in Physics? CoRR (2023)
Michael J. Dinneen, Pankaj S. Ghodla, Simone Linz
A QUBO formulation for the Tree Containment problem. CoRR (2022)
Radu Nicolescu, Michael J. Dinneen, James Cooper, Alec Henderson, Yezhou Liu
Logarithmic SAT Solution with Membrane Computing. Axioms 11 (1) (2022)
Nguyet Tran, Michael J. Dinneen
Close Euclidean Shortest Path Crossing an Ordered 3D Skew Segment Sequence. ISGV (2021)
Cecilia Summers, Michael J. Dinneen
Nondeterminism and Instability in Neural Network Optimization. CoRR (2021)
Alec Henderson, Radu Nicolescu, Michael J. Dinneen, T. N. Chan, Hendrik Happe, Thomas Hinze
Turing completeness of water computing. J. Membr. Comput. 3 (3) (2021)
Cecilia Summers, Michael J. Dinneen
Nondeterminism and Instability in Neural Network Optimization. ICML (2021)
Nguyet Tran, Michael J. Dinneen, Simone Linz
Close Weighted Shortest Paths on 3D Terrain Surfaces. SIGSPATIAL/GIS (2020)
Richard Hua, Michael J. Dinneen
Improved QUBO Formulation of the Graph Isomorphism Problem. SN Comput. Sci. 1 (1) (2020)
Cristian S. Calude, Michael J. Dinneen, Richard Hua
Quantum solutions for densest k-subgraph problems. J. Membr. Comput. 2 (1) (2020)
Nguyet Tran, Michael J. Dinneen, Simone Linz
Computing Close to Optimal Weighted Shortest Paths in Practice. ICAPS (2020)
Cecilia Summers, Michael J. Dinneen
Four Things Everyone Should Know to Improve Batch Normalization. ICLR (2020)
Alec Henderson, Radu Nicolescu, Michael J. Dinneen
Solving a PSPACE-complete problem with cP systems. J. Membr. Comput. 2 (4) (2020)
Michael J. Dinneen, Anuradha Mahasinghe, Kai Liu
Finding the chromatic sums of graphs using a D-Wave quantum computer. J. Supercomput. 75 (8) (2019)
Cecilia Summers, Michael J. Dinneen
Improved Adversarial Robustness via Logit Regularization Methods. CoRR (2019)
Cecilia Summers, Michael J. Dinneen
Four Things Everyone Should Know to Improve Batch Normalization. CoRR (2019)
Cecilia Summers, Michael J. Dinneen
Improved Mixed-Example Data Augmentation. WACV (2019)
Anuradha Mahasinghe, Richard Hua, Michael J. Dinneen, Rajni Goyal
Solving the Hamiltonian Cycle Problem using a Quantum Computer. ACSW (2019)
Cecilia Summers, Michael J. Dinneen
Improved Mixed-Example Data Augmentation. CoRR (2018)
Alastair A. Abbott, Cristian S. Calude, Michael J. Dinneen, Richard Hua
A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing. CoRR (2018)
Michael J. Dinneen, Ulrich Speidel
Preface. Nat. Comput. 17 (2) (2018)
M. Rajaati, Mohammad Reza Hooshmandasl, Michael J. Dinneen, Ali Shakiba
On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width. Discret. Math. Theor. Comput. Sci. 20 (2) (2018)
Alastair A. Abbott, Cristian S. Calude, Michael J. Dinneen, Richard Hua
A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing - Abridged Version. PC@UCNC (2018)
M. Rajaati, Pouyeh Sharifani, Ali Shakiba, Mohammad Reza Hooshmandasl, Michael J. Dinneen
An Efficient Algorithm for Mixed Domination on Generalized Series-Parallel Graphs. CoRR (2017)
Michael J. Dinneen, Richard Hua
Formulating graph covering problems for adiabatic quantum computers. ACSW (2017)
Cristian S. Calude, Michael J. Dinneen, Richard Hua
QUBO formulations for the graph isomorphism problem and related problems. Theor. Comput. Sci. 701 (2017)
Arash Heidarian, Michael J. Dinneen
A Hybrid Geometric Approach for Measuring Similarity Level Among Documents and Document Clustering. BigDataService (2016)
Cristian S. Calude, Michael J. Dinneen
Editorial. Int. J. Unconv. Comput. 12 (1) (2016)
M. Rajaati, Mohammad Reza Hooshmandasl, Michael J. Dinneen, Ali Shakiba
On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width. CoRR (2016)
Cristian S. Calude, Elena Calude, Michael J. Dinneen
Guest Column: Adiabatic Quantum Computing Challenges. SIGACT News 46 (1) (2015)
Kuai Wei, Michael J. Dinneen
Runtime analysis comparison of two fitness functions on a memetic algorithm for the Clique Problem. IEEE Congress on Evolutionary Computation (2014)
Kuai Wei, Michael J. Dinneen
Runtime analysis to compare best-improvement and first-improvement in memetic algorithms. GECCO (2014)
Kuai Wei, Michael J. Dinneen
Hybridizing the dynamic mutation approach with local searches to overcome local optima. IEEE Congress on Evolutionary Computation (2014)
Michael J. Dinneen, Kuai Wei
A (1+1) Adaptive Memetic Algorithm for the Maximum Clique Problem. IEEE Congress on Evolutionary Computation (2013)
Michael J. Dinneen, Kuai Wei
On the analysis of a (1+1) adaptive memetic algorithm. Memetic Computing (2013)
Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu
Faster synchronization in P systems. Nat. Comput. 11 (1) (2012)
Michael J. Dinneen
A Program-Size Complexity Measure for Mathematical Problems and Conjectures. Computation, Physics and Beyond (2012)
David H. Bailey, Jonathan M. Borwein, Cristian S. Calude, Michael J. Dinneen, Monica Dumitrescu, Alex Yee
An Empirical Approach to the Normality of π. Exp. Math. 21 (4) (2012)
Michael J. Dinneen, Masoud Khosravani
Hardness of Approximation and Integer Programming Frameworks for Searching for Caterpillar Trees. CATS (2011)
Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu
An Adaptive Algorithm for P System Synchronization. Int. Conf. on Membrane Computing (2011)
Michael J. Dinneen, Masoud Khosravani
A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs. SIROCCO (2010)
Michael J. Dinneen
Foreword. Nat. Comput. 9 (2) (2010)
Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu
A Faster P Solution for the Byzantine Agreement Problem. Int. Conf. on Membrane Computing (2010)
Cristian S. Calude, Michael J. Dinneen, Monica Dumitrescu, Karl Svozil
Experimental Evidence of Quantum Randomness Incomputability CoRR (2010)
Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu
Edge- and Node-Disjoint Paths in P Systems MeCBIC (2010)
Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu
Towards Structured Modelling with Hyperdag P Systems. Int. J. Comput. Commun. Control 5 (2) (2010)
Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu
Synchronization in P Modules. UC (2010)
Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu
P systems and the Byzantine agreement. J. Log. Algebraic Methods Program. 79 (6) (2010)
Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu
New Solutions to the Firing Squad Synchronization Problems for Neural and Hyperdag P Systems MeCBIC (2009)
Radu Nicolescu, Michael J. Dinneen, Yun-Bum Kim
Discovering the Membrane Topology of Hyperdag P Systems. Workshop on Membrane Computing (2009)
Cristian S. Calude, Michael J. Dinneen
Exact Approximations of omega Numbers. Int. J. Bifurc. Chaos 17 (6) (2007)
Michael J. Dinneen, Rongwei Lai
Properties of vertex cover obstructions. Discret. Math. 307 (21) (2007)
Cristian S. Calude, Elena Calude, Michael J. Dinneen
A New Measure of the Difficulty of Problems. J. Multiple Valued Log. Soft Comput. 12 (3-4) (2006)
Joshua J. Arulanandham, Cristian Calude, Michael J. Dinneen
Balance Machines: Computing = Balancing. Aspects of Molecular Computing (2004)
Joshua J. Arulanandham, Cristian Calude, Michael J. Dinneen
A fast natural algorithm for searching. Theor. Comput. Sci. 320 (1) (2004)
Michael J. Dinneen, Nian Zhou
An Optimal Family of Bounded-Degree Broadcast Networks. Electron. Notes Theor. Comput. Sci. 78 (2003)
Michael J. Dinneen, Bakhadyr Khoussainov
Update games and update networks. J. Discrete Algorithms 1 (1) (2003)
Cristian Calude, Elena Calude, Michael J. Dinneen
What is the Value of Taxicab(6)? J. Univers. Comput. Sci. 9 (10) (2003)
Joshua J. Arulanandham, Cristian Calude, Michael J. Dinneen
Bead-Sort: A Natural Sorting Algorithm. Bull. EATCS 76 (2002)
Cristian S. Calude, Michael J. Dinneen, Chi-Kou Shu
Computing a Glimpse of Randomness. Exp. Math. 11 (3) (2002)
Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov
Relaxed Update and Partition Network Games. Fundam. Informaticae 49 (4) (2002)
Michael J. Dinneen, Liu Xiong
Minor-order obstructions for the graphs of vertex cover 6. J. Graph Theory 41 (3) (2002)
Michael J. Dinneen, Geoffrey Pritchard, Mark C. Wilson
Degree- and time-constrained broadcast networks. Networks 39 (3) (2002)
Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov
On Game-Theoretic Models of Networks. ISAAC (2001)
Michael J. Dinneen, Kevin Cattell, Michael R. Fellows
Forbidden minors to graphs with small feedback sets. Discret. Math. 230 (1-3) (2001)
Kevin Cattell, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, Michael A. Langston
On computing graph minor obstruction sets. Theor. Comput. Sci. 233 (1-2) (2000)
Michael J. Dinneen, Bakhadyr Khoussainov
Update Networks and Their Routing Strategies. WG (2000)
Michael J. Dinneen, Liu Xiong
A Characterization of Graphs with Vertex Cover Six. COCOON (2000)
Cristian S. Calude, Michael J. Dinneen, Karl Svozil
Reflections on quantum computing. Complex. 6 (1) (2000)
Michael J. Dinneen, Jose A. Ventura, Mark C. Wilson, Golbon Zakeri
Construction of Time Relaxed Minimal Broadcast Networks. Parallel Process. Lett. 9 (1) (1999)
Michael J. Dinneen, Jose A. Ventura, Mark C. Wilson, Golbon Zakeri
Compound Constructions of Broadcast Networks. Discret. Appl. Math. 93 (2-3) (1999)
Douglas S. Bridges, Cristian Calude, Michael J. Dinneen, Bakhadyr Khoussainov
Logic in Computer Science. J. Univers. Comput. Sci. 3 (11) (1997)
Michael J. Dinneen
Too Many Minor Order Obstructions. J. Univers. Comput. Sci. 3 (11) (1997)
Kevin Cattell, Michael J. Dinneen, Michael R. Fellows
A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width. Inf. Process. Lett. 57 (4) (1996)
Kevin Cattell, Michael J. Dinneen, Michael R. Fellows
Obstructions to Within a Few Vertices or Edges of Acyclic. WADS (1995)
Tony L. Brewster, Michael J. Dinneen, Vance Faber
A computational attack on the conjectures of Graffiti: New counterexamples and proofs. Discret. Math. 147 (1-3) (1995)
Kevin Cattell, Michael J. Dinneen
A Characterization of Graphs with Vertex Cover up to Five. ORDAL (1994)
Michael J. Dinneen, Paul R. Hafner
New results for the degree/diameter problem. Networks 24 (7) (1994)
Michael J. Dinneen
The complexity of broadcasting in bounded-degree networks. CoRR (1994)
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
Small Diameter Symmetric Networks from Linear Groups. IEEE Trans. Computers 41 (2) (1992)
Michael J. Dinneen, Michael R. Fellows, Vance Faber
Algebraic Constructions of Efficient Broadcast Networks. AAECC (1991)