![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
George I. Bell
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [j9]Djangir A. Babayev, George I. Bell, Urfat G. Nuriyev
:
The bandpass problem: combinatorial optimization and library of problems. J. Comb. Optim. 18(2): 151-172 (2009) - [i8]George I. Bell:
Notes on solving and playing peg solitaire on a computer. CoRR abs/0903.3696 (2009) - 2008
- [j8]George I. Bell, David L. Bruhwiler
, Alexei Fedotov, Andrey Sobol, Richard S. Busby, Peter Stoltz, Dan T. Abell
, Peter Messmer, Ilan Ben-Zvi
, Vladimir Litvinenko:
Simulating the dynamical friction force on ions due to a briefly co-propagating electron beam. J. Comput. Phys. 227(19): 8714-8735 (2008) - [i7]George I. Bell:
The mathematics of Septoku. CoRR abs/0801.3697 (2008) - [i6]George I. Bell:
The shortest game of Chinese Checkers and related problems. CoRR abs/0803.1245 (2008) - 2007
- [i5]George I. Bell:
Triangular Peg Solitaire Unlimited. CoRR abs/0711.0486 (2007) - [i4]George I. Bell:
Diamond Solitaire. CoRR abs/0711.2749 (2007) - [i3]George I. Bell:
Solving Triangular Peg Solitaire. CoRR abs/math/0703865 (2007) - 2006
- [i2]George I. Bell:
Diagonal Peg Solitaire. CoRR abs/math/0606122 (2006) - [i1]George I. Bell, Daniel S. Hirschberg, Pablo Guerrero-García:
The minimum size required of a solitaire army. CoRR abs/math/0612612 (2006) - 2001
- [j7]Djangir A. Babayev, George I. Bell:
An Optimization Problem with a Separable Non-Convex Objective Function and a Linear Constraint. J. Heuristics 7(2): 169-184 (2001)
1990 – 1999
- 1996
- [j6]George I. Bell:
Evolution of Simple Sequence Repeats. Comput. Chem. 20(1): 41-48 (1996) - 1993
- [j5]George I. Bell, David C. Torney:
Repetitive DNA Sequences: Some Considerations for Simple Sequence Repeats. Comput. Chem. 17(2): 185-190 (1993) - 1992
- [j4]George I. Bell:
Roles of Repetitive Sequences. Comput. Chem. 16(2): 135-143 (1992)
1980 – 1989
- 1987
- [j3]G. T. Mullenbach, A. Tabrizi, B. D. Irvine, George I. Bell, R. A. Hallewell:
Sequence of a cDNA coding for human glutathione peroxidase confirms TGA encodes active site selenocysteine. Nucleic Acids Res. 15(13): 5484 (1987) - [j2]N. K. Hayward, D. J. Nancarrow, George I. Bell:
A Taq I polymorphism for the human transforming growth factor alpha gene (TGFA). Nucleic Acids Res. 15(13): 5503 (1987) - 1986
- [j1]George I. Bell, R. C. Najarian, G. T. Mullenbach, R. A. Hallewell:
cDNA sequence coding for human kidney catalase. Nucleic Acids Res. 14(13): 5561-5562 (1986)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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-05-08 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint