Michael J. Dinneen

According to our database1, Michael J. Dinneen authored at least 69 papers between 1991 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 



On csauthors.net:


Improved QUBO Formulation of the Graph Isomorphism Problem.
SN Comput. Sci., 2020

Quantum solutions for densest k-subgraph problems.
J. Membr. Comput., 2020

Four Things Everyone Should Know to Improve Batch Normalization.
Proceedings of the 8th International Conference on Learning Representations, 2020

Computing Close to Optimal Weighted Shortest Paths in Practice.
Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

Finding the chromatic sums of graphs using a D-Wave quantum computer.
J. Supercomput., 2019

Improved Adversarial Robustness via Logit Regularization Methods.
CoRR, 2019

Improved Mixed-Example Data Augmentation.
Proceedings of the IEEE Winter Conference on Applications of Computer Vision, 2019

Solving the Hamiltonian Cycle Problem using a Quantum Computer.
Proceedings of the Australasian Computer Science Week Multiconference, 2019

Nat. Comput., 2018

On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width.
Discret. Math. Theor. Comput. Sci., 2018

A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing - Abridged Version.
Proceedings of the 9th International Workshop on Physics and Computation, 2018

A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing.
CoRR, 2018

QUBO formulations for the graph isomorphism problem and related problems.
Theor. Comput. Sci., 2017

An Efficient Algorithm for Mixed Domination on Generalized Series-Parallel Graphs.
CoRR, 2017

Formulating graph covering problems for adiabatic quantum computers.
Proceedings of the Australasian Computer Science Week Multiconference, 2017

Int. J. Unconv. Comput., 2016

A Hybrid Geometric Approach for Measuring Similarity Level Among Documents and Document Clustering.
Proceedings of the Second IEEE International Conference on Big Data Computing Service and Applications, 2016

Guest Column: Adiabatic Quantum Computing Challenges.
SIGACT News, 2015

Runtime analysis to compare best-improvement and first-improvement in memetic algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Runtime analysis comparison of two fitness functions on a memetic algorithm for the Clique Problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2014

Hybridizing the dynamic mutation approach with local searches to overcome local optima.
Proceedings of the IEEE Congress on Evolutionary Computation, 2014

On the analysis of a (1+1) adaptive memetic algorithm.
Proceedings of the 2013 IEEE Workshop on Memetic Computing, 2013

A (1+1) Adaptive Memetic Algorithm for the Maximum Clique Problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

Faster synchronization in P systems.
Nat. Comput., 2012

An Empirical Approach to the Normality of π.
Exp. Math., 2012

A Program-Size Complexity Measure for Mathematical Problems and Conjectures.
Proceedings of the Computation, Physics and Beyond, 2012

An Adaptive Algorithm for P System Synchronization.
Proceedings of the Membrane Computing, 2011

Hardness of Approximation and Integer Programming Frameworks for Searching for Caterpillar Trees.
Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

Nat. Comput., 2010

P systems and the Byzantine agreement.
J. Log. Algebraic Methods Program., 2010

Towards Structured Modelling with Hyperdag P Systems.
Int. J. Comput. Commun. Control, 2010

Edge- and Node-Disjoint Paths in P Systems
Proceedings of the Proceedings Fourth Workshop on Membrane Computing and Biologically Inspired Process Calculi, 2010

Experimental Evidence of Quantum Randomness Incomputability
CoRR, 2010

Synchronization in P Modules.
Proceedings of the Unconventional Computation - 9th International Conference, 2010

A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs.
Proceedings of the Structural Information and Communication Complexity, 2010

A Faster P Solution for the Byzantine Agreement Problem.
Proceedings of the Membrane Computing, 2010

New Solutions to the Firing Squad Synchronization Problems for Neural and Hyperdag P Systems
Proceedings of the Proceedings Third Workshop on Membrane Computing and Biologically Inspired Process Calculi, 2009

Discovering the Membrane Topology of Hyperdag P Systems.
Proceedings of the Membrane Computing, 10th International Workshop, 2009

Exact Approximations of omega Numbers.
Int. J. Bifurc. Chaos, 2007

Properties of vertex cover obstructions.
Discret. Math., 2007

A New Measure of the Difficulty of Problems.
J. Multiple Valued Log. Soft Comput., 2006

A fast natural algorithm for searching.
Theor. Comput. Sci., 2004

Balance Machines: Computing = Balancing.
Proceedings of the Aspects of Molecular Computing, 2004

What is the Value of Taxicab(6)?
J. Univers. Comput. Sci., 2003

Update games and update networks.
J. Discrete Algorithms, 2003

An Optimal Family of Bounded-Degree Broadcast Networks.
Electron. Notes Theor. Comput. Sci., 2003

Degree- and time-constrained broadcast networks.
Networks, 2002

Minor-order obstructions for the graphs of vertex cover 6.
J. Graph Theory, 2002

Relaxed Update and Partition Network Games.
Fundam. Informaticae, 2002

Computing a Glimpse of Randomness.
Exp. Math., 2002

Bead-Sort: A Natural Sorting Algorithm.
Bull. EATCS, 2002

Forbidden minors to graphs with small feedback sets.
Discret. Math., 2001

On Game-Theoretic Models of Networks.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

On computing graph minor obstruction sets.
Theor. Comput. Sci., 2000

Reflections on quantum computing.
Complex., 2000

Update Networks and Their Routing Strategies.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

A Characterization of Graphs with Vertex Cover Six.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

Construction of Time Relaxed Minimal Broadcast Networks.
Parallel Process. Lett., 1999

Compound Constructions of Broadcast Networks.
Discret. Appl. Math., 1999

Too Many Minor Order Obstructions.
J. Univers. Comput. Sci., 1997

Logic in Computer Science.
J. Univers. Comput. Sci., 1997

A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width.
Inf. Process. Lett., 1996

A computational attack on the conjectures of Graffiti: New counterexamples and proofs.
Discret. Math., 1995

Obstructions to Within a Few Vertices or Edges of Acyclic.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

New results for the degree/diameter problem.
Networks, 1994

The complexity of broadcasting in bounded-degree networks.
CoRR, 1994

A Characterization of Graphs with Vertex Cover up to Five.
Proceedings of the Orders, 1994

Small Diameter Symmetric Networks from Linear Groups.
IEEE Trans. Computers, 1992

Algebraic Constructions of Efficient Broadcast Networks.
Proceedings of the Applied Algebra, 1991