Richard P. Anstee

According to our database1, Richard P. Anstee authored at least 53 papers between 1980 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Multivalued matrices and forbidden configurations.
Discret. Math., September, 2023

2022
Shattering and More: Extending the Complete Object.
Electron. J. Comb., 2022

2017
Forbidden Berge Hypergraphs.
Electron. J. Comb., 2017

2014
Forbidden Configurations and Product Constructions.
Graphs Comb., 2014

Forbidden families of configurations.
Australas. J Comb., 2014

2013
Repeated Columns and an Old Chestnut.
Electron. J. Comb., 2013

Forbidden Submatrices: Some New Bounds and Constructions.
Electron. J. Comb., 2013

2012
Evidence for a forbidden configuration conjecture: One more case solved.
Discret. Math., 2012

2011
Perfect Matchings in Grid Graphs after Vertex Deletions.
SIAM J. Discret. Math., 2011

Forbidden Configurations: Boundary Cases.
Electron. Notes Discret. Math., 2011

Forbidden configurations and repeated induction.
Discret. Math., 2011

Genetic Algorithms Applied to Problems of Forbidden Configurations.
Electron. J. Comb., 2011

Linear algebra methods for forbidden configurations.
Comb., 2011

2010
Two refinements of the bound of Sauer, Perles and Shelah, and of Vapnik and Chervonenkis.
Discret. Math., 2010

Forbidden Configurations: Exact Bounds Determined by Critical Substructures.
Electron. J. Comb., 2010

2007
Latin squares and low discrepancy allocation of two-dimensional data.
Eur. J. Comb., 2007

Perfect matchings after vertex deletions.
Discret. Math., 2007

Small Forbidden Configurations III.
Electron. J. Comb., 2007

2006
Pairwise intersections and forbidden configurations.
Eur. J. Comb., 2006

2005
Small Forbidden Configurations IV: The 3 Rowed Case.
Comb., 2005

2002
Permutations with Low Discrepancy Consecutive k-sums.
J. Comb. Theory, Ser. A, 2002

Shattering News.
Graphs Comb., 2002

2001
Small Forbidden Configurations II.
Electron. J. Comb., 2001

2000
Low Discrepancy Allocation of Two-Dimensional Data.
Proceedings of the Foundations of Information and Knowledge Systems, 2000

1999
Convexity of degree sequences.
J. Graph Theory, 1999

1998
More sufficient conditions for a graph to have factors.
Discret. Math., 1998

Orthogonal matchings.
Discret. Math., 1998

1997
Small Forbidden Configurations.
Graphs Comb., 1997

Sperner families of bounded VC-dimension.
Discret. Math., 1997

1996
Dividing a graph by degrees.
J. Graph Theory, 1996

An application of matching theory of edge-colourings.
Discret. Math., 1996

Recognizing Diameter Critical Graphs.
Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

1995
Forbidden configurations: Induction and linear algebra.
Eur. J. Comb., 1995

On the density of sets of divisors.
Discret. Math., 1995

1993
Minimum Vertex Weighted Deficiency of (<i>g, f</i>)-Factors: A Greedy Algorithm.
Discret. Appl. Math., 1993

1990
Forbidden Configurations, Discrepancy and Determinants.
Eur. J. Comb., 1990

Simplified existence theorems for (g, f)-factors.
Discret. Appl. Math., 1990

1988
On bridged graphs and cop-win graphs.
J. Comb. Theory, Ser. B, 1988

A forbidden configuration theorem of Alon.
J. Comb. Theory, Ser. A, 1988

1987
A Polynomial Algorithm for b-Matchings: An Alternative Approach.
Inf. Process. Lett., 1987

1986
Forbidden submatrices.
Discret. Math., 1986

Invariant sets of arcs in network flow problems.
Discret. Appl. Math., 1986

1985
General Forbidden Configuration Theorems.
J. Comb. Theory, Ser. A, 1985

An Algorithmic Proof of Tutte's f-Factor Theorem.
J. Algorithms, 1985

Matrices with forbidden subconfigurations.
Discret. Math., 1985

1984
Characterizations of Totally Balanced Matrices.
J. Algorithms, 1984

1983
The network flows approach for matrices with given row and column sums.
Discret. Math., 1983

Hypergraphs with no special cycles.
Comb., 1983

1982
Triangular (0, 1)-matrices with prescribed row and column sums.
Discret. Math., 1982

1981
An analogue of group divisible designs for Moore graphs.
J. Comb. Theory, Ser. B, 1981

Properties of (0, 1)-Matrices without Certain Configurations.
J. Comb. Theory, Ser. A, 1981

1980
Planes of Order 10 Do Not Have a Collineation of Order 5.
J. Comb. Theory, Ser. A, 1980

Properties of (0, 1)-Matrices with No Triangles.
J. Comb. Theory, Ser. A, 1980


  Loading...