The following pages link to Nándor Sieben (Q214756):
Displaying 45 items.
- Polyiamonds and polyhexes with minimum site-perimeter and achievement games (Q976716) (← links)
- Rubbling and optimal rubbling of graphs (Q1025979) (← links)
- Polyomino weak achievement games on 3-dimensional rectangular boards (Q1764904) (← links)
- Impartial achievement and avoidance games for generating finite groups (Q1791287) (← links)
- Impartial achievement games on convex geometries (Q2230406) (← links)
- Bounds on the rubbling and optimal rubbling numbers of graphs (Q2376084) (← links)
- Rectangular polyomino set weak \((1,2)\)-achievement games (Q2378512) (← links)
- Impartial achievement games for generating nilpotent groups (Q2414568) (← links)
- Polyominoes with minimum site-perimeter and full set achievement games (Q2462322) (← links)
- Computing eigenfunctions on the Koch snowflake: a new grid and symmetry. (Q2490722) (← links)
- A note on primitive equivalence (Q2747282) (← links)
- The \(t\)-pebbling number of the complete graph with a missing edge (Q2799867) (← links)
- Edge animal weak \((1,2)\)-achievement games (Q2855570) (← links)
- Bounds on the rubbling and optimal rubbling numbers of graphs (Q2857393) (← links)
- Newton's method and symmetry for semilinear elliptic PDE on the cube (Q2871363) (← links)
- Biased weak polyform achievement games (Q2928588) (← links)
- (Q2985065) (← links)
- A Graph Pebbling Algorithm on Weighted Graphs (Q3075605) (← links)
- Critical branching random walk in an IID environment (Q3087047) (← links)
- Avoidable Sets in The Bicyclic Inverse Semigroup (Q3408852) (← links)
- Cayley color graphs of inverse semigroups and groupoids (Q3624910) (← links)
- Proof trees for weak achievement games (Q3629029) (← links)
- AUTOMATED BIFURCATION ANALYSIS FOR NONLINEAR ELLIPTIC PARTIAL DIFFERENCE EQUATIONS ON GRAPHS (Q3647683) (← links)
- (Q4254417) (← links)
- C*-crossed products by partial actions and actions of inverse semigroups (Q4361774) (← links)
- C*-Crossed Products by Twisted Inverse Semigroup Actions (Q4529288) (← links)
- (Q4533147) (← links)
- Impartial achievement games for generating generalized dihedral groups (Q4595238) (← links)
- (Q4823517) (← links)
- (Q4831500) (← links)
- Invariant Synchrony Subspaces of Sets of Matrices (Q5109373) (← links)
- Synchrony and Antisynchrony for Difference-Coupled Vector Fields on Graph Network Systems (Q5238216) (← links)
- Symmetry and Automated Branch Following for a Semilinear Elliptic PDE on a Fractal Region (Q5309749) (← links)
- Perfect Pairs of Ideals and Duals in Numerical Semigroups (Q5491379) (← links)
- (Q5694621) (← links)
- IMPARTIAL AVOIDANCE AND ACHIEVEMENT GAMES FOR GENERATING SYMMETRIC AND ALTERNATING GROUPS (Q5741638) (← links)
- Morita equivalence of \(C^*\)-crossed products by inverse semigroup actions and partial actions (Q5948874) (← links)
- Impartial hypergraph games (Q6046219) (← links)
- Optimal t-rubbling on complete graphs and paths (Q6063837) (← links)
- Cayley line graphs of transitive groupoids (Q6103415) (← links)
- Invariant synchrony and anti-synchrony subspaces of weighted networks (Q6174594) (← links)
- The spectrum of nim-values for achievement games for generating finite groups (Q6507489) (← links)
- The spectrum of nim-values for achievement games for generating finite groups (Q6546712) (← links)
- A bifurcation lemma for invariant subspaces (Q6592248) (← links)
- Invariant Polydiagonal Subspaces of Matrices and Constraint Programming (Q6753758) (← links)
