Nándor Sieben

Constraints An Int. J., December, 2024

2023

Invariant Synchrony and Anti-synchrony Subspaces of Weighted Networks.

[BibT_eX]

[DOI]

Eddie Nijholt

J. Nonlinear Sci., August, 2023

Impartial Hypergraph Games.

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

2021

Impartial achievement games on convex geometries.

[BibT_eX]

[DOI]

Stephanie McCoy

Comput. Geom., 2021

2020

Invariant Synchrony Subspaces of Sets of Matrices.

[BibT_eX]

[DOI]

SIAM J. Appl. Dyn. Syst., 2020

2019

Synchrony and Antisynchrony for Difference-Coupled Vector Fields on Graph Network Systems.

[BibT_eX]

[DOI]

SIAM J. Appl. Dyn. Syst., 2019

2018

Impartial achievement and avoidance games for generating finite groups.

[BibT_eX]

[DOI]

Dana C. Ernst

Int. J. Game Theory, 2018

2017

Impartial achievement games for generating generalized dihedral groups.

[BibT_eX]

[DOI]

Bret J. Benesh

Dana C. Ernst

Australas. J Comb., 2017

2014

Biased Weak Polyform Achievement Games.

[BibT_eX]

[DOI]

Ian Norris

Discret. Math. Theor. Comput. Sci., 2014

2013

Newton's Method and Symmetry for Semilinear Elliptic PDE on the Cube.

[BibT_eX]

[DOI]

SIAM J. Appl. Dyn. Syst., 2013

2012

Edge Animal Weak (1, 2)-Achievement Games.

[BibT_eX]

[DOI]

Ian Douglas

Integers, 2012

An MPI Implementation of a Self-Submitting Parallel Job Queue.

[BibT_eX]

[DOI]

Int. J. Parallel Program., 2012

2011

Critical branching random walk in an IID environment.

[BibT_eX]

[DOI]

János Engländer

Monte Carlo Methods Appl., 2011

Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs.

[BibT_eX]

[DOI]

Gyula Y. Katona

Electron. Notes Discret. Math., 2011

2010

A Graph Pebbling Algorithm on Weighted Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2010

Rectangular Polyomino Set Weak (1,2)-achievement Games

[BibT_eX]

[DOI]

Edgar Fisher

CoRR, 2010

Polyiamonds and Polyhexes with Minimum Site-Perimeter and Achievement Games.

[BibT_eX]

[DOI]

Gabor Fulep

Electron. J. Comb., 2010

2009

Automated bifurcation Analysis for Nonlinear Elliptic Partial Difference Equations on Graphs.

[BibT_eX]

[DOI]

Int. J. Bifurc. Chaos, 2009

Rubbling and optimal rubbling of graphs.

[BibT_eX]

[DOI]

Christopher Belford

Discret. Math., 2009

2008

Rectangular polyomino set weak (1, 2)-achievement games.

[BibT_eX]

[DOI]

Edgar Fisher

Theor. Comput. Sci., 2008

Polyominoes with minimum site-perimeter and full set achievement games.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

2006

Symmetry and Automated Branch Following for a Semilinear Elliptic PDE on a Fractal Region.

[BibT_eX]

[DOI]

SIAM J. Appl. Dyn. Syst., 2006

2005

Polyomino weak achievement games on 3-dimensional rectangular boards.

[BibT_eX]

[DOI]

Elaina Deabay

Discret. Math., 2005

Avoidable Sets in The Bicyclic Inverse Semigroup.

[BibT_eX]

Ars Comb., 2005

2004

Hexagonal polyomino weak (1, 2)-achievement games.

[BibT_eX]

[DOI]