default search action
Nándor Sieben
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j24]Nándor Sieben:
Impartial Hypergraph Games. Electron. J. Comb. 30(2) (2023) - [j23]Eddie Nijholt
, Nándor Sieben
Invariant Synchrony and Anti-synchrony Subspaces of Weighted Networks. J. Nonlinear Sci. 33(4): 63 (2023) - 2021
- [j22]Stephanie McCoy, Nándor Sieben:
Impartial achievement games on convex geometries. Comput. Geom. 98: 101786 (2021) - 2020
- [j21]John M. Neuberger, Nándor Sieben, James W. Swift
Invariant Synchrony Subspaces of Sets of Matrices. SIAM J. Appl. Dyn. Syst. 19(2): 964-993 (2020)
2010 – 2019
- 2019
- [j20]John M. Neuberger, Nándor Sieben, James W. Swift:
Synchrony and Antisynchrony for Difference-Coupled Vector Fields on Graph Network Systems. SIAM J. Appl. Dyn. Syst. 18(2): 904-938 (2019) - 2018
- [j19]Dana C. Ernst
Impartial achievement and avoidance games for generating finite groups. Int. J. Game Theory 47(2): 509-542 (2018) - 2017
- [j18]Bret J. Benesh, Dana C. Ernst, Nándor Sieben:
Impartial achievement games for generating generalized dihedral groups. Australas. J Comb. 68: 371-384 (2017) - 2014
- [j17]Nándor Sieben, Ian Norris:
Biased Weak Polyform Achievement Games. Discret. Math. Theor. Comput. Sci. 16(3): 147-172 (2014) - 2013
- [j16]Gyula Y. Katona
Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs. Graphs Comb. 29(3): 535-551 (2013) - [j15]John M. Neuberger, Nándor Sieben, James W. Swift:
Newton's Method and Symmetry for Semilinear Elliptic PDE on the Cube. SIAM J. Appl. Dyn. Syst. 12(3): 1237-1279 (2013) - 2012
- [j14]John M. Neuberger, Nándor Sieben, James W. Swift:
An MPI Implementation of a Self-Submitting Parallel Job Queue. Int. J. Parallel Program. 40(4): 443-464 (2012) - [j13]Ian Douglas, Nándor Sieben:
Edge Animal Weak (1, 2)-Achievement Games. Integers 12: G5 (2012) - [i3]John M. Neuberger, Nándor Sieben, James W. Swift:
An MPI Implementation of a Self-Submitting Parallel Job Queue. CoRR abs/1204.4475 (2012) - 2011
- [j12]Gyula Y. Katona
Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs. Electron. Notes Discret. Math. 38: 487-492 (2011) - [j11]János Engländer
Critical branching random walk in an IID environment. Monte Carlo Methods Appl. 17(2): 169-193 (2011) - [i2]Ian Norris, Nándor Sieben:
Biased Weak Polyform Achievement Games. CoRR abs/1107.1878 (2011) - 2010
- [j10]Gabor Fulep, Nándor Sieben:
Polyiamonds and Polyhexes with Minimum Site-Perimeter and Achievement Games. Electron. J. Comb. 17(1) (2010) - [j9]Nándor Sieben:
A Graph Pebbling Algorithm on Weighted Graphs. J. Graph Algorithms Appl. 14(2): 221-244 (2010) - [i1]Edgar Fisher, Nándor Sieben:
Rectangular Polyomino Set Weak (1,2)-achievement Games. CoRR abs/1010.0424 (2010)
2000 – 2009
- 2009
- [j8]Christopher Belford, Nándor Sieben:
Rubbling and optimal rubbling of graphs. Discret. Math. 309(10): 3436-3446 (2009) - [j7]John M. Neuberger, Nándor Sieben, James W. Swift:
Automated bifurcation Analysis for Nonlinear Elliptic Partial Difference Equations on Graphs. Int. J. Bifurc. Chaos 19(8): 2531-2536 (2009) - 2008
- [j6]Nándor Sieben:
Polyominoes with minimum site-perimeter and full set achievement games. Eur. J. Comb. 29(1): 108-117 (2008) - [j5]Edgar Fisher, Nándor Sieben:
Rectangular polyomino set weak (1, 2)-achievement games. Theor. Comput. Sci. 409(3): 333-340 (2008) - 2006
- [j4]John M. Neuberger, Nándor Sieben, James W. Swift:
Symmetry and Automated Branch Following for a Semilinear Elliptic PDE on a Fractal Region. SIAM J. Appl. Dyn. Syst. 5(3): 476-507 (2006) - 2005
- [j3]Nándor Sieben:
Avoidable Sets in The Bicyclic Inverse Semigroup. Ars Comb. 77 (2005) - [j2]Nándor Sieben, Elaina Deabay:
Polyomino weak achievement games on 3-dimensional rectangular boards. Discret. Math. 290(1): 61-78 (2005) - 2004
- [j1]Nándor Sieben:
Hexagonal polyomino weak (1, 2)-achievement games. Acta Cybern. 16(4): 579-585 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: