Nándor Sieben

According to our database, Nándor Sieben authored at least 24 papers between 2004 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2023

Invariant Synchrony and Anti-synchrony Subspaces of Weighted Networks.

Eddie Nijholt, Nándor Sieben, James W. Swift

J. Nonlinear Sci., August, 2023

Impartial Hypergraph Games.

Nándor Sieben

Electron. J. Comb., 2023

2021

Impartial achievement games on convex geometries.

Stephanie McCoy, Nándor Sieben

Comput. Geom., 2021

2020

Invariant Synchrony Subspaces of Sets of Matrices.

John M. Neuberger, Nándor Sieben, James W. Swift

SIAM J. Appl. Dyn. Syst., 2020

2019

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

John M. Neuberger, Nándor Sieben, James W. Swift

SIAM J. Appl. Dyn. Syst., 2019

2018

Impartial achievement and avoidance games for generating finite groups.

Dana C. Ernst, Nándor Sieben

Int. J. Game Theory, 2018

2017

Impartial achievement games for generating generalized dihedral groups.

Bret J. Benesh, Dana C. Ernst, Nándor Sieben

Australas. J Comb., 2017

2014

Biased Weak Polyform Achievement Games.

Nándor Sieben, Ian Norris

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

2013

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

John M. Neuberger, Nándor Sieben, James W. Swift

SIAM J. Appl. Dyn. Syst., 2013

2012

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

Ian Douglas, Nándor Sieben

Integers, 2012

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

John M. Neuberger, Nándor Sieben, James W. Swift

Int. J. Parallel Program., 2012

2011

Critical branching random walk in an IID environment.

János Engländer, Nándor Sieben

Monte Carlo Methods Appl., 2011

Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs.

Gyula Y. Katona, Nándor Sieben

Electron. Notes Discret. Math., 2011

2010

A Graph Pebbling Algorithm on Weighted Graphs.

Nándor Sieben

J. Graph Algorithms Appl., 2010

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

Edgar Fisher, Nándor Sieben

CoRR, 2010

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

Gabor Fulep, Nándor Sieben

Electron. J. Comb., 2010

2009

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

John M. Neuberger, Nándor Sieben, James W. Swift

Int. J. Bifurc. Chaos, 2009

Rubbling and optimal rubbling of graphs.

Christopher Belford, Nándor Sieben

Discret. Math., 2009

2008

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

Edgar Fisher, Nándor Sieben

Theor. Comput. Sci., 2008

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

Nándor Sieben

Eur. J. Comb., 2008

2006

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

John M. Neuberger, Nándor Sieben, James W. Swift

SIAM J. Appl. Dyn. Syst., 2006

2005

Polyomino weak achievement games on 3-dimensional rectangular boards.

Nándor Sieben, Elaina Deabay

Discret. Math., 2005

Avoidable Sets in The Bicyclic Inverse Semigroup.

Nándor Sieben

Ars Comb., 2005

2004

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

Nándor Sieben

Acta Cybern., 2004