default search action
Richard P. Anstee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j52]Richard P. Anstee, Jeffrey Dawson, Linyuan Lu
, Attila Sali
Multivalued matrices and forbidden configurations. Discret. Math. 346(9): 113492 (2023) - 2022
- [j51]Richard P. Anstee, N. A. Nikov:
Shattering and More: Extending the Complete Object. Electron. J. Comb. 29(2) (2022)
2010 – 2019
- 2017
- [j50]Richard P. Anstee, Santiago Salazar:
Forbidden Berge Hypergraphs. Electron. J. Comb. 24(1): 1 (2017) - 2014
- [j49]Richard P. Anstee, Christina Koch:
Forbidden families of configurations. Australas. J Comb. 59: 361-377 (2014) - [j48]Richard P. Anstee, Miguel Raggi, Attila Sali:
Forbidden configurations: Boundary cases. Eur. J. Comb. 35: 51-66 (2014) - [j47]Richard P. Anstee, Christina Koch
Forbidden Configurations and Product Constructions. Graphs Comb. 30(6): 1325-1349 (2014) - 2013
- [j46]Richard P. Anstee, Ruiyuan Chen
Forbidden Submatrices: Some New Bounds and Constructions. Electron. J. Comb. 20(1): 5 (2013) - [j45]Richard P. Anstee, Linyuan Lu:
Repeated Columns and an Old Chestnut. Electron. J. Comb. 20(4): 2 (2013) - 2012
- [j44]Richard P. Anstee, Miguel Raggi, Attila Sali:
Evidence for a forbidden configuration conjecture: One more case solved. Discret. Math. 312(17): 2720-2729 (2012) - 2011
- [j43]Richard P. Anstee, Balin Fleming:
Linear algebra methods for forbidden configurations. Comb. 31(1): 1-19 (2011) - [j42]Richard P. Anstee, Miguel Raggi:
Genetic Algorithms Applied to Problems of Forbidden Configurations. Electron. J. Comb. 18(1) (2011) - [j41]Richard P. Anstee, C. G. W. Meehan:
Forbidden configurations and repeated induction. Discret. Math. 311(20): 2187-2197 (2011) - [j40]Richard P. Anstee, Miguel Raggi, Attila Sali:
Forbidden Configurations: Boundary Cases. Electron. Notes Discret. Math. 38: 43-48 (2011) - [j39]Richard P. Anstee, Jonathan Blackman, Hangjun Yang:
Perfect Matchings in Grid Graphs after Vertex Deletions. SIAM J. Discret. Math. 25(4): 1754-1767 (2011) - 2010
- [j38]Richard P. Anstee, Steven N. Karp
Forbidden Configurations: Exact Bounds Determined by Critical Substructures. Electron. J. Comb. 17(1) (2010) - [j37]Richard P. Anstee, Balin Fleming:
Two refinements of the bound of Sauer, Perles and Shelah, and of Vapnik and Chervonenkis. Discret. Math. 310(23): 3318-3323 (2010)
2000 – 2009
- 2007
- [j36]Richard P. Anstee, N. Kamoosi:
Small Forbidden Configurations III. Electron. J. Comb. 14(1) (2007) - [j35]Robert E. L. Aldred, Richard P. Anstee, Stephen C. Locke
Perfect matchings after vertex deletions. Discret. Math. 307(23): 3048-3054 (2007) - [j34]Richard P. Anstee, Attila Sali:
Latin squares and low discrepancy allocation of two-dimensional data. Eur. J. Comb. 28(8): 2115-2124 (2007) - 2006
- [j33]Richard P. Anstee, Peter Keevash:
Pairwise intersections and forbidden configurations. Eur. J. Comb. 27(8): 1235-1248 (2006) - 2005
- [j32]Richard P. Anstee, Attila Sali:
Small Forbidden Configurations IV: The 3 Rowed Case. Comb. 25(5): 503-518 (2005) - 2002
- [j31]Richard P. Anstee, Lajos Rónyai, Attila Sali:
Shattering News. Graphs Comb. 18(1): 59-73 (2002) - [j30]Richard P. Anstee, Ron Ferguson, Jerrold R. Griggs:
Permutations with Low Discrepancy Consecutive k-sums. J. Comb. Theory A 100(2): 302-321 (2002) - 2001
- [j29]Richard P. Anstee, Ron Ferguson, Attila Sali:
Small Forbidden Configurations II. Electron. J. Comb. 8(1) (2001) - 2000
- [c2]Richard P. Anstee, János Demetrovics, Gyula O. H. Katona, Attila Sali:
Low Discrepancy Allocation of Two-Dimensional Data. FoIKS 2000: 1-12
1990 – 1999
- 1999
- [j28]Richard P. Anstee, Yunsun Nam:
Convexity of degree sequences. J. Graph Theory 30(2): 147-156 (1999) - 1998
- [j27]Richard P. Anstee, Lou Caccetta:
Orthogonal matchings. Discret. Math. 179(1-3): 37-47 (1998) - [j26]Richard P. Anstee, Yunsun Nam:
More sufficient conditions for a graph to have factors. Discret. Math. 184(1-3): 15-24 (1998) - 1997
- [j25]Richard P. Anstee, Attila Sali:
Sperner families of bounded VC-dimension. Discret. Math. 175(1-3): 13-21 (1997) - [j24]Richard P. Anstee, Jerrold R. Griggs, Attila Sali:
Small Forbidden Configurations. Graphs Comb. 13(2): 97-118 (1997) - 1996
- [j23]Richard P. Anstee, Jerrold R. Griggs:
An application of matching theory of edge-colourings. Discret. Math. 156(1-3): 253-256 (1996) - [j22]Richard P. Anstee:
Dividing a graph by degrees. J. Graph Theory 23(4): 377-384 (1996) - [c1]Richard P. Anstee, Lou Caccetta:
Recognizing Diameter Critical Graphs. DMTCS 1996: 105-112 - 1995
- [j21]Robert E. L. Aldred, Richard P. Anstee:
On the density of sets of divisors. Discret. Math. 137(1-3): 345-349 (1995) - [j20]Richard P. Anstee:
Forbidden configurations: Induction and linear algebra. Eur. J. Comb. 16(5): 427-438 (1995) - 1993
- [j19]Richard P. Anstee:
Minimum Vertex Weighted Deficiency of (g, f)-Factors: A Greedy Algorithm. Discret. Appl. Math. 44(1-3): 247-260 (1993) - 1990
- [j18]Richard P. Anstee:
Simplified existence theorems for (g, f)-factors. Discret. Appl. Math. 27(1-2): 29-38 (1990) - [j17]Richard P. Anstee:
Forbidden Configurations, Discrepancy and Determinants. Eur. J. Comb. 11(1): 15-19 (1990)
1980 – 1989
- 1988
- [j16]Richard P. Anstee, Martin Farber:
On bridged graphs and cop-win graphs. J. Comb. Theory B 44(1): 22-28 (1988) - [j15]Richard P. Anstee:
A forbidden configuration theorem of Alon. J. Comb. Theory A 47(1): 16-27 (1988) - 1987
- [j14]Richard P. Anstee:
A Polynomial Algorithm for b-Matchings: An Alternative Approach. Inf. Process. Lett. 24(3): 153-157 (1987) - 1986
- [j13]Richard P. Anstee:
Invariant sets of arcs in network flow problems. Discret. Appl. Math. 13(1): 1-7 (1986) - [j12]Richard P. Anstee, Zoltán Füredi:
Forbidden submatrices. Discret. Math. 62(3): 225-243 (1986) - 1985
- [j11]Richard P. Anstee, Uppaluri S. R. Murty:
Matrices with forbidden subconfigurations. Discret. Math. 54(1): 113-116 (1985) - [j10]Richard P. Anstee:
An Algorithmic Proof of Tutte's f-Factor Theorem. J. Algorithms 6(1): 112-131 (1985) - [j9]Richard P. Anstee:
General Forbidden Configuration Theorems. J. Comb. Theory A 40(1): 108-124 (1985) - 1984
- [j8]Richard P. Anstee, Martin Farber:
Characterizations of Totally Balanced Matrices. J. Algorithms 5(2): 215-230 (1984) - 1983
- [j7]Richard P. Anstee:
Hypergraphs with no special cycles. Comb. 3(2): 141-146 (1983) - [j6]Richard P. Anstee:
The network flows approach for matrices with given row and column sums. Discret. Math. 44(2): 125-138 (1983) - 1982
- [j5]Richard P. Anstee:
Triangular (0, 1)-matrices with prescribed row and column sums. Discret. Math. 40(1): 1-10 (1982) - 1981
- [j4]Richard P. Anstee:
An analogue of group divisible designs for Moore graphs. J. Comb. Theory B 30(1): 11-20 (1981) - [j3]Richard P. Anstee:
Properties of (0, 1)-Matrices without Certain Configurations. J. Comb. Theory A 31(3): 256-269 (1981) - 1980
- [j2]Richard P. Anstee, Marshall Hall Jr., John G. Thompson:
Planes of Order 10 Do Not Have a Collineation of Order 5. J. Comb. Theory A 29(1): 39-58 (1980) - [j1]Richard P. Anstee:
Properties of (0, 1)-Matrices with No Triangles. J. Comb. Theory A 29(2): 186-198 (1980)
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 20:29 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: