default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIan Anderson 0001
Person information
- affiliation: University of Glasgow, School of Mathematics and Statistics
- not to be confused with: Ian G. Anderson
Other persons with the same name
- Ian Anderson 0002 — University of Bristol, Department of Computer Science
- Ian Anderson 0003 — Spotify, New York, NY, USA
- Ian Anderson 0004 — University of California, School of Information, Berkeley, CA, USA
- Ian Anderson 0005 — Glance, Bangalore, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2001
[b1]Ian Anderson:
A first course in discrete mathematics. Springer undergraduate mathematics series, Springer 2001, ISBN 1852332360, pp. I-VIII, 1-200
Journal Articles
- 2017
- [j25]Ian Anderson, Matthew A. Ollis, Donald A. Preece:
On Power-Sequence and Matryoshka Terraces for ℤn. Bull. ICA 81: 98-117 (2017) - 2012
- [j24]Donald A. Preece, Ian Anderson:
Obtaining All or Half of Un as 〈 x 〉 x 〈 x+1 〉. Integers 12: A52 (2012) - 2011
- [j23]R. Julian R. Abel, Ian Anderson, Norman J. Finizio:
Necessary conditions for the existence of two classes of ZCPS-Wh(v). Discret. Appl. Math. 159(8): 848-851 (2011) - 2010
- [j22]Ian Anderson, Donald A. Preece:
Combinatorially fruitful properties of 3.2-1 and 3.2-2 modulo p. Discret. Math. 310(2): 312-324 (2010) - 2008
- [j21]Ian Anderson, Leigh H. M. Ellison:
Z-Cyclic Directed Moore (2, 6) Generalised Whist Tournament Designs on p elements where p = 7 (mod 12). Ars Comb. 87 (2008) - [j20]Ian Anderson, Donald A. Preece:
Some da capo directed power-sequence Zn+1 terraces with n an odd prime power. Discret. Math. 308(2-3): 192-206 (2008) - [j19]Ian Anderson, Donald A. Preece:
A general approach to constructing power-sequence terraces for Zn. Discret. Math. 308(5-6): 631-644 (2008) - [j18]Ian Anderson, Leigh H. M. Ellison:
Further results on logarithmic terraces. Discret. Math. 308(5-6): 684-695 (2008) - [j17]Ian Anderson, Donald A. Preece:
Some I terraces from I power-sequences, n being an odd prime. Discret. Math. 308(18): 4086-4107 (2008) - 2005
- [j16]Ian Anderson, Leigh H. M. Ellison:
Z-cyclic ordered triplewhist tournaments on p elements, where p=5 (mod 8). Discret. Math. 293(1-3): 11-17 (2005) - [j15]Ian Anderson, Norman J. Finizio:
Some new Z-cyclic whist tournament designs. Discret. Math. 293(1-3): 19-28 (2005) - [j14]Ian Anderson, Donald A. Preece:
Some power-sequence terraces for Zpq with as few segments as possible. Discret. Math. 293(1-3): 29-59 (2005) - 2004
- [j13]Ian Anderson, Donald A. Preece:
Narcissistic half-and-half power-sequence terraces for Zn with n=pqt. Discret. Math. 279(1-3): 33-60 (2004) - 2003
- [j12]Ian Anderson, Donald A. Preece:
Power-sequence terraces for where n is an odd prime power. Discret. Math. 261(1-3): 31-58 (2003) - 1999
- [j11]Ian Anderson:
On the construction of balanced room squares. Discret. Math. 197-198: 53-60 (1999) - [j10]Ian Anderson, Norman J. Finizio, Philip A. Leonard:
New Product Theorems for Z-Cyclic Whist Tournaments. J. Comb. Theory A 88(1): 162-166 (1999) - 1995
- [j9]Ian Anderson, Norman J. Finizio:
Cohen's theorem and Z-cycle whist tournaments. Ars Comb. 41 (1995) - [j8]Ian Anderson, S. D. Cohen, Norman J. Finizio:
An existence theorem for cyclic triplewhist tournaments. Discret. Math. 138(1-3): 31-41 (1995) - 1994
- [j7]Ian Anderson, Norman J. Finizio:
Cyclic whist tournaments. Discret. Math. 125(1-3): 5-10 (1994) - 1988
- [j6]Ian Anderson:
An Erdös-Ko-Rado theorem for multisets. Discret. Math. 69(1): 1-9 (1988) - 1982
- [j5]Ian Anderson:
On the toroidal thickness of graphs. J. Graph Theory 6(2): 177-184 (1982) - 1981
- [j4]Ian Anderson:
Quadrilateral embeddings of bipartite graphs. J. Graph Theory 5(4): 355-361 (1981) - 1979
- [j3]Ian Anderson:
Infinite families of biembedding numbers. J. Graph Theory 3(3): 263-268 (1979) - 1978
- [j2]Ian Anderson, Arthur T. White:
Current graphs and bi-embeddings. J. Graph Theory 2(3): 231-239 (1978) - 1976
- [j1]Ian Anderson:
Intersection theorems and a lemma of Kleitman. Discret. Math. 16(3): 181-185 (1976)
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-06-10 21:22 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:
