The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Richard P. Anstee: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Richard P. Anstee, János Demetrovics, Gyula O. H. Katona, Attila Sali
    Low Discrepancy Allocation of Two-Dimensional Data. [Citation Graph (0, 0)][DBLP]
    FoIKS, 2000, pp:1-12 [Conf]
  2. Richard P. Anstee
    Hypergraphs with no special cycles. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1983, v:3, n:2, pp:141-146 [Journal]
  3. Richard P. Anstee, Attila Sali
    Small Forbidden Configurations IV: The 3 Rowed Case. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2005, v:25, n:5, pp:503-518 [Journal]
  4. Richard P. Anstee, Ron Ferguson, Attila Sali
    Small Forbidden Configurations II. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  5. Richard P. Anstee
    Minimum Vertex Weighted Deficiency of (g, f)-Factors: A Greedy Algorithm. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:247-260 [Journal]
  6. Richard P. Anstee, Peter Keevash
    Pairwise intersections and forbidden configurations. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:8, pp:1235-1248 [Journal]
  7. Richard P. Anstee, Lajos Rónyai, Attila Sali
    Shattering News. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:1, pp:59-73 [Journal]
  8. Richard P. Anstee
    A Polynomial Algorithm for b-Matchings: An Alternative Approach. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:3, pp:153-157 [Journal]
  9. Richard P. Anstee, Martin Farber
    Characterizations of Totally Balanced Matrices. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1984, v:5, n:2, pp:215-230 [Journal]
  10. Richard P. Anstee
    An Algorithmic Proof of Tutte's f-Factor Theorem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:1, pp:112-131 [Journal]
  11. Richard P. Anstee
    Properties of (0, 1)-Matrices with No Triangles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1980, v:29, n:2, pp:186-198 [Journal]
  12. Richard P. Anstee
    Properties of (0, 1)-Matrices without Certain Configurations. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1981, v:31, n:3, pp:256-269 [Journal]
  13. Richard P. Anstee
    General Forbidden Configuration Theorems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1985, v:40, n:1, pp:108-124 [Journal]
  14. Richard P. Anstee
    A forbidden configuration theorem of Alon. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1988, v:47, n:1, pp:16-27 [Journal]
  15. Richard P. Anstee, Martin Farber
    On bridged graphs and cop-win graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:44, n:1, pp:22-28 [Journal]
  16. Richard P. Anstee, Ron Ferguson, Jerrold R. Griggs
    Permutations with Low Discrepancy Consecutive k-sums. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2002, v:100, n:2, pp:302-321 [Journal]
  17. Richard P. Anstee, Marshall Hall Jr., John G. Thompson
    Planes of Order 10 Do Not Have a Collineation of Order 5. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1980, v:29, n:1, pp:39-58 [Journal]
  18. Richard P. Anstee
    An analogue of group divisible designs for Moore graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:11-20 [Journal]
  19. Richard P. Anstee
    Triangular (0, 1)-matrices with prescribed row and column sums. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:40, n:1, pp:1-10 [Journal]
  20. Richard P. Anstee
    The network flows approach for matrices with given row and column sums. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:2, pp:125-138 [Journal]
  21. Richard P. Anstee, Uppaluri S. R. Murty
    Matrices with forbidden subconfigurations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:54, n:1, pp:113-116 [Journal]
  22. Richard P. Anstee, Zoltán Füredi
    Forbidden submatrices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:3, pp:225-243 [Journal]
  23. Richard P. Anstee, Yunsun Nam
    More sufficient conditions for a graph to have factors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:184, n:1-3, pp:15-24 [Journal]
  24. Richard P. Anstee, Attila Sali
    Sperner families of bounded VC-dimension. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:175, n:1-3, pp:13-21 [Journal]
  25. Richard P. Anstee, Lou Caccetta
    Orthogonal matchings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:179, n:1-3, pp:37-47 [Journal]
  26. Richard P. Anstee, Jerrold R. Griggs
    An application of matching theory of edge-colourings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:156, n:1-3, pp:253-256 [Journal]
  27. Robert E. L. Aldred, Richard P. Anstee
    On the density of sets of divisors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:137, n:1-3, pp:345-349 [Journal]

  28. Small Forbidden Configurations III. [Citation Graph (, )][DBLP]


  29. Simplified existence theorems for (g, f)-factors. [Citation Graph (, )][DBLP]


  30. Perfect matchings after vertex deletions. [Citation Graph (, )][DBLP]


  31. Latin squares and low discrepancy allocation of two-dimensional data. [Citation Graph (, )][DBLP]


Search in 0.060secs, Finished in 0.062secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002