Michael J. Dinneen

Patrice Delmas

Future Gener. Comput. Syst., 2024

2023

Sublinear P system solutions to NP-complete problems.

[BibT_eX]

[DOI]

Alec Henderson

Theor. Comput. Sci., May, 2023

Programmable and parallel water computing.

[BibT_eX]

[DOI]

J. Membr. Comput., March, 2023

A QUBO formulation for the Tree Containment problem.

[BibT_eX]

[DOI]

Pankaj S. Ghodla

Simone Linz

Theor. Comput. Sci., 2023

2022

Logarithmic SAT Solution with Membrane Computing.

[BibT_eX]

[DOI]

Axioms, 2022

2021

Turing completeness of water computing.

[BibT_eX]

[DOI]

J. Membr. Comput., 2021

Close Euclidean Shortest Path Crossing an Ordered 3D Skew Segment Sequence.

[BibT_eX]

[DOI]

Nguyet Tran

Proceedings of the Geometry and Vision - First International Symposium, 2021

Nondeterminism and Instability in Neural Network Optimization.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

2020

Improved QUBO Formulation of the Graph Isomorphism Problem.

[BibT_eX]

[DOI]

SN Comput. Sci., 2020

Solving a PSPACE-complete problem with cP systems.

[BibT_eX]

[DOI]

Alec Henderson

J. Membr. Comput., 2020

Quantum solutions for densest k-subgraph problems.

[BibT_eX]

[DOI]

J. Membr. Comput., 2020

Four Things Everyone Should Know to Improve Batch Normalization.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Learning Representations, 2020

Close Weighted Shortest Paths on 3D Terrain Surfaces.

[BibT_eX]

[DOI]

Nguyet Tran

Simone Linz

Proceedings of the SIGSPATIAL '20: 28th International Conference on Advances in Geographic Information Systems, 2020

Computing Close to Optimal Weighted Shortest Paths in Practice.

[BibT_eX]

[DOI]

Nguyet Tran

Simone Linz

Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

2019

Finding the chromatic sums of graphs using a D-Wave quantum computer.

[BibT_eX]

[DOI]

Anuradha Mahasinghe

Kai Liu

J. Supercomput., 2019

Improved Adversarial Robustness via Logit Regularization Methods.

[BibT_eX]

[DOI]

CoRR, 2019

Improved Mixed-Example Data Augmentation.

[BibT_eX]

[DOI]

Proceedings of the IEEE Winter Conference on Applications of Computer Vision, 2019

Solving the Hamiltonian Cycle Problem using a Quantum Computer.

[BibT_eX]

[DOI]

Proceedings of the Australasian Computer Science Week Multiconference, 2019

2018

Preface.

[BibT_eX]

[DOI]

Mohammad Reza Hooshmandasl

Ulrich Speidel

Nat. Comput., 2018

On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width.

[BibT_eX]

[DOI]

M. Rajaati

Ali Shakiba

Discret. Math. Theor. Comput. Sci., 2018

A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing - Abridged Version.

[BibT_eX]

[DOI]

Proceedings of the 9th International Workshop on Physics and Computation, 2018

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

[BibT_eX]

[DOI]

CoRR, 2018

2017

QUBO formulations for the graph isomorphism problem and related problems.

[BibT_eX]

[DOI]

Mohammad Reza Hooshmandasl

Theor. Comput. Sci., 2017

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

[BibT_eX]

[DOI]

M. Rajaati

Pouyeh Sharifani

Ali Shakiba

CoRR, 2017

Formulating graph covering problems for adiabatic quantum computers.

[BibT_eX]

[DOI]

Proceedings of the Australasian Computer Science Week Multiconference, 2017

2016

Editorial.

[BibT_eX]

[DOI]

Int. J. Unconv. Comput., 2016

A Hybrid Geometric Approach for Measuring Similarity Level Among Documents and Document Clustering.

[BibT_eX]

[DOI]

Arash Heidarian

Proceedings of the Second IEEE International Conference on Big Data Computing Service and Applications, 2016

2015

Guest Column: Adiabatic Quantum Computing Challenges.

[BibT_eX]

[DOI]

Elena Calude

SIGACT News, 2015

2014

Runtime analysis to compare best-improvement and first-improvement in memetic algorithms.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Runtime analysis comparison of two fitness functions on a memetic algorithm for the Clique Problem.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2014

Hybridizing the dynamic mutation approach with local searches to overcome local optima.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2014

2013

On the analysis of a (1+1) adaptive memetic algorithm.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE Workshop on Memetic Computing, 2013

A (1+1) Adaptive Memetic Algorithm for the Maximum Clique Problem.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2013

2012

Faster synchronization in P systems.

[BibT_eX]

[DOI]

Nat. Comput., 2012

An Empirical Approach to the Normality of π.

[BibT_eX]

[DOI]

Exp. Math., 2012

A Program-Size Complexity Measure for Mathematical Problems and Conjectures.

[BibT_eX]

[DOI]

Proceedings of the Computation, Physics and Beyond, 2012

2011

An Adaptive Algorithm for P System Synchronization.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2011

Hardness of Approximation and Integer Programming Frameworks for Searching for Caterpillar Trees.

[BibT_eX]

[DOI]

Masoud Khosravani

Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2010

Foreword.

[BibT_eX]

[DOI]

Nat. Comput., 2010

P systems and the Byzantine agreement.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2010

Towards Structured Modelling with Hyperdag P Systems.

[BibT_eX]

[DOI]

Int. J. Comput. Commun. Control, 2010

Edge- and Node-Disjoint Paths in P Systems

[BibT_eX]

[DOI]

Proceedings of the Proceedings Fourth Workshop on Membrane Computing and Biologically Inspired Process Calculi, 2010

Experimental Evidence of Quantum Randomness Incomputability

[BibT_eX]

[DOI]

CoRR, 2010

Synchronization in P Modules.

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computation - 9th International Conference, 2010

A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs.

[BibT_eX]

[DOI]

Masoud Khosravani

Proceedings of the Structural Information and Communication Complexity, 2010

A Faster P Solution for the Byzantine Agreement Problem.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2010

2009

New Solutions to the Firing Squad Synchronization Problems for Neural and Hyperdag P Systems

[BibT_eX]

[DOI]

Proceedings of the Proceedings Third Workshop on Membrane Computing and Biologically Inspired Process Calculi, 2009

Discovering the Membrane Topology of Hyperdag P Systems.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 10th International Workshop, 2009

2007

Exact Approximations of omega Numbers.

[BibT_eX]

[DOI]

Int. J. Bifurc. Chaos, 2007

Properties of vertex cover obstructions.

[BibT_eX]

[DOI]

Rongwei Lai

Discret. Math., 2007

2006

A New Measure of the Difficulty of Problems.

[BibT_eX]

[DOI]

Elena Calude

J. Multiple Valued Log. Soft Comput., 2006

2004

A fast natural algorithm for searching.

[BibT_eX]

[DOI]

Joshua J. Arulanandham

Theor. Comput. Sci., 2004

Balance Machines: Computing = Balancing.

[BibT_eX]

[DOI]

Joshua J. Arulanandham

Proceedings of the Aspects of Molecular Computing, 2004

2003

What is the Value of Taxicab(6)?

[BibT_eX]

[DOI]

Elena Calude

J. Univers. Comput. Sci., 2003

Update games and update networks.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2003

An Optimal Family of Bounded-Degree Broadcast Networks.

[BibT_eX]

[DOI]

Nian Zhou

Proceedings of the Computing: the Australasian Theory Symposiumm, 2003

2002

Degree- and time-constrained broadcast networks.

[BibT_eX]

[DOI]

Geoffrey Pritchard

Mark C. Wilson

Networks, 2002

Minor-order obstructions for the graphs of vertex cover 6.

[BibT_eX]

[DOI]

Liu Xiong

J. Graph Theory, 2002

Relaxed Update and Partition Network Games.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Fundam. Informaticae, 2002

Computing a Glimpse of Randomness.

[BibT_eX]

[DOI]

Chi-Kou Shu

Exp. Math., 2002

Bead-Sort: A Natural Sorting Algorithm.

[BibT_eX]

Joshua J. Arulanandham

Bull. EATCS, 2002

2001

Forbidden minors to graphs with small feedback sets.

[BibT_eX]

[DOI]

Discret. Math., 2001

On Game-Theoretic Models of Networks.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000

On computing graph minor obstruction sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Reflections on quantum computing.

[BibT_eX]

[DOI]

Karl Svozil

Complex., 2000

Update Networks and Their Routing Strategies.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

A Characterization of Graphs with Vertex Cover Six.

[BibT_eX]

[DOI]

Liu Xiong

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999

Construction of Time Relaxed Minimal Broadcast Networks.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1999

Compound Constructions of Broadcast Networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

1997

Too Many Minor Order Obstructions.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1997

Logic in Computer Science.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1997

1996

A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

1995

Bounded combinatorial width and forbidden substructures.

[BibT_eX]

[DOI]

PhD thesis, 1995

A computational attack on the conjectures of Graffiti: New counterexamples and proofs.

[BibT_eX]

[DOI]

Tony L. Brewster

Vance Faber

Discret. Math., 1995

Obstructions to Within a Few Vertices or Edges of Acyclic.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

1994

New results for the degree/diameter problem.

[BibT_eX]

[DOI]

Paul R. Hafner

Networks, 1994

The complexity of broadcasting in bounded-degree networks.

[BibT_eX]

[DOI]

CoRR, 1994

A Characterization of Graphs with Vertex Cover up to Five.

[BibT_eX]

[DOI]

Proceedings of the Orders, 1994

1992

Small Diameter Symmetric Networks from Linear Groups.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1992

1991

Algebraic Constructions of Efficient Broadcast Networks.

[BibT_eX]

[DOI]