Books by Anthony  Cops and Robbers and A Course on the Web GraphPublications


    Books and Volumes Edited


  1. The 10th Workshop On Algorithms And Models For The Web-Graph (WAW 2013), co-edited with Michael Mitzenmacher and Pawel Pralat, 2013.
  2. Computational Intelligence, Cyber Security and Computational Models (ICC3), co-edited with G. Sai Sundara Krishnan, R. Anitha, R.S. Lekshmi, M, Senthil Kumar, M. Grana, 2013.
  3. The 9th Workshop On Algorithms And Models For The Web-Graph (WAW 2012), co-edited with Jeannette Janssen, 2012.
  4. The Game of Cops and Robbers on Graphs, joint with Richard Nowakowski, AMS Student Mathematical Library, 2011.
  5. A Course on the Web Graph, AMS Graduate Studies in Mathematics Series, and AARMS Monograph Series, 2008.
  6. The 5th Workshop On Algorithms And Models For The Web-Graph (WAW 2007), co-edited with Fan Chung Graham, 2008.

  7. Papers


    See my Google Scholar profile.

    2014

  8. Independence densities of hypergraphs, pdf with Jason Brown, Dieter Mitsche, and P. Pralat, accepted to European Journal of Combinatorics.
  9. On the minimum order of k-cop-win graphs, pdf with William Baird, Andrew Beveridge, Paolo Codenotti, Aaron Maurer, John McCauley, and Silviya Valeva, accepted to Contributions to Discrete Mathematics
  10. A note on bounds for the cop number using tree decompositions, pdf with N.E. Clarke, S. Finbow, S. Fitzpatrick, and M.E. Messinger, accepted to Contributions to Discrete Mathematics.
  11. The structure and automorphisms of semi-directed graphs, pdf with D.Delic and Chanping Wang; accepted to the Journal of Multiple-Valued Logic and Soft Computing.

    2013

  12. The robber strikes back, pdf with Stephen Finbow, Przemyslaw Gordinowicz, Ali Haidar, William B. Kinnersley, Dieter Mitsche, Pawel Pralat, and Ladislav Stacho, In: Proceedings of ICC3, 2013.
  13. Vertex-pursuit in random directed acyclic graphs, pdf with Dieter Mitsche and P. Pralat, SIAM Journal on Discrete Mathematics 27 (2013) 732-756.
  14. Chapter on Complex Networks, with Fan Chung Graham, Handbook of Graph Theory, 2nd Edition, 2013.
  15. The capture time of the hypercube, pdf with William B. Kinnersley, P. Gordinowicz, and P. Pralat, Electronic Journal of Combinatorics, Volume 20, Issue 2, 2013.
  16. Cops and Robbers on graphs based on designs, pdf with Andrea Burgess, Journal of Combinatorial Designs 21 (2013) 359-418.
  17. 2012

  18. Meyniel's conjecture on the cop number: a survey, pdf with William Baird, Journal of Combinatorics 3 (2012) 225-238.
  19. Distinguishing homomorphisms of infinite graphs, pdf with D.Delic; Contributions to Discrete Mathematics. 7 (2012) 44-53.
  20. WHAT IS ... Cop Number? pdf Notices of the American Mathematical Society 59 (2012) 1100-1101.
  21. Adjacency properties of graphs and a conjecture of Erdos, pdf with Alexandru Costea; The Atlantic Electronic Journal of Mathematics 5 (2012) 37-46.
  22. Infinite random geometric graphs from the hexagonal metric, pdf with Jeannette Janssen, Proceedings of IWOCA'12.
  23. Fighting constrained fires in graphs, pdf with M.E. Messinger and P. Pralat; Theoretical Computer Science 434 (2012) 11-22.
  24. Geometric protean graphs, pdf with Jeannette Janssen and P. Pralat, Internet Mathematics 8 (2012) 2-28.
  25. Sketchy Tweets: Ten Minute Conjectures in Graph Theory, pdf with Richard Nowakowski, The Mathematical Intelligencer 34 (2012) 8-15.
  26. Almost all cop-win graphs contain a universal vertex, pdf with Graeme Kemkes, and P. Pralat; Discrete Mathematics 312 (2012) 1652-1657.
  27. Vertex-pursuit in hierarchical social networks, pdf with Dieter Mitsche, and P. Pralat, invited paper Proceedings of TAMC'2012.
  28. 2011

  29. Independence and chromatic densities of graphs, pdf with Jason Brown, Graeme Kemkes, and P. Pralat; Journal of Combinatorics 2 (2011) 397-411.
  30. Infinite random geometric graphs, pdf with Jeannette Janssen Annals of Combinatorics 15 (2011) 597-617.
  31. Topological domination captures key biological processes in molecular networks, pdf T. Milenkovic, V. Memisevic, N. Przulj PLoS ONE 6(8): e23016.
  32. Graph searching and related problems, pdf with B. Yang, invited book chapter in: Handbook of Combinatorial Optimization, editors P. Pardalos, D.Z. Du, R. Graham.
  33. Complex networks and social networks, pdf with A. Tian invited book chapter in: Social Networks, editor E. Kranakis, Springer, Mathematics in Industry series.
  34. Catch me if you can: Cops and Robbers on graphs, pdf invited paper In: Proceedings of the 6th International Conference on Mathematical and Computational Models (ICMCM'11)
  35. Models of on-line social networks, pdf with Noor Hadi, Paul Horn, Pawel Pralat, Changping Wang, Internet Mathematics 6 (2011) 285-313.
  36. Twins of rayless graphs, pdf with Henning Bruhn, Reinhard Diestel and Philipp Sprussel, Journal of Combinatorial Theory, Series B101 (2011) 60-65.
  37. 2010

  38. Open letter to Internet Mathematics community, pdf with Fan Chung Graham, Internet Mathematics 6 (2010) 1-2.
  39. The geometric protean model for on-line social networks, pdf with Jeannette Janssen, and P. Pralat; Proceedings of WAW'2010.
  40. A geometric model for on-line social networks, pdf with with Jeannette Janssen, and P. Pralat; Proceedings of 3rd Workshop on Online Social Networks (WOSN 2010) (electronic only).
  41. Large classes of infinite k-cop-win graphs, pdf with Gena Hahn and Claude Tardif; Journal of Graph Theory 65 (2010) 234-242.
  42. Bounds and constructions for n-e.c. tournaments, pdf with P. Gordinowicz and P. Pralat; Contributions to Discrete Mathematics 5 (2010) 52-66.
  43. Cops and Robbers from a distance, pdf with Ehsan Chiniforooshan and P. Pralat; Theoretical Computer Science 411 (2010) 3834-3844.
  44. Distinguishing number and adjacency properties, pdf with D. Delic; Journal of Combinatorics 1 (2010) 141-148.
  45. All countable monoids embed into the monoid of the infinite random graph, pdf with D. Delic and Igor Dolinka; Discrete Mathematics 310 (2010) 373-375.
  46. 2009

  47. A spatial web graph model with local influence regions, pdf with William Aiello, Colin Cooper, Jeannette Janssen, P. Pralat, Internet Mathematics 5 (2009) 175-196.
  48. The capture time of a graph, pdf with Gena Hahn, Peter Golovach, and Jan Kratochvil; Discrete Mathematics 309 (2009) 5588-5595.
  49. The good, the bad, and the great: homomorphisms and cores of random graphs, pdf with P. Pralat; Discrete Mathematics 309 (2009) 5535-5539.
  50. A survey of properties and models of on-line social networks;, pdf invited paper In: Proceedings of the 5th International Conference on Mathematical and Computational Models (ICMCM'09).
  51. Pursuit and evasion from a distance: algorithms and bounds, pdf with Ehsan Chiniforooshan; Proceedings of ANALCO'09.
  52. Dynamic models of on-line social networks, pdf with Noor Hadi, Paul Horn, Pawel Pralat, Changping Wang; Proceedings of WAW'09.
  53. The search for n-e.c. graphs, pdf Contributions to Discrete Mathematics 4 (2009) 40-53.
  54. Graphs with the n-e.c. adjacency property constructed from resolvable designs, pdf with Cathy Baker, Neil McKay, and Pawel Pralat; Journal of Combinatorial Designs 17 (2009) 294 - 306.
  55. Pursuit-evasion in models of complex networks, pdf with P. Pralat and Changping Wang; Internet Mathematics 4 (2009) 419-436.
  56. Infinite limits and adjacency properties of a generalized copying model , pdf with Jeannette Janssen; Internet Mathematics 4 (2009) 199-223.
  57. The n-ordered graphs - a new graph class, pdf with Jeannette Janssen and Changping Wang; Journal of Graph Theory 60 (2009) 204-218.
  58. 2008

  59. Universal random semi-directed graphs, pdf with D. Delic and Changping Wang; Proceedings of ROGICS'08.
  60. A note on domination parameters in random graphs, pdf with Changping Wang; Discussiones Mathematicae Graph Theory 28 (2008) 335-343.
  61. Graphs with the n-e.c. adjacency property constructed from affine planes, pdf with Cathy Baker, Julia Brown, and Tamas Szonyi; Discrete Mathematics 208 (2008) 901-912.
  62. 2007

  63. Random graph models for the web graph, pdf invited paper In: Proceedings of 4th National Conference on Mathematical and Computational Models (NCMCM07)
  64. A spatial web graph model with local influence regions, pdf with William Aiello, Colin Cooper, Jeannette Janssen, P. Pralat Proceedings of WAW07.
  65. Vertex pursuit games in stochastic network models, pdf with Pawel Pralat and Changping Wang; Proceedings of CAAN07.
  66. The cop density of a graph, pdf with Gena Hahn and Changping Wang; Contributions to Discrete Mathematics 2 (2007) 133-144.
  67. A note on uniquely H-colorable graphs, pdf Discussiones Mathematicae Graph Theory 27 (2007) 39-44.
  68. 2006

  69. Mutually embeddable graphs and the Tree Alternative conjecture, pdf with Claude Tardif, Journal of Combinatorial Theory, Series B 96 (2006) 874-880.
  70. Spanning subgraphs of graphs partitioned into two isomorphic pieces, pdf the Journal of Graph Theory 51 (2006) 123-136.
  71. On an adjacency property of almost all tournaments pdf, with K. Cameron; Discrete Mathematics 306 (2006) 2327-2335.
  72. Matchings defined by local conditions, pdf with Alexandru Costea; Journal of Combinatorial Mathematics and Combinatorial Computing 58 (2006) 41-53.
  73. 2005

  74. Infinite limits of the duplication model and graph folding with Jeannette Janssen; extended abstract accepted to Discrete Mathematics and Theoretical Computer Science for the EUROCOMB05 conference.
  75. 2004

  76. A survey of models of the web graph, pdf invited paper Proceedings of Combinatorial and Algorithmic Aspects of Networking, 2004.
  77. Infinite limits of copying models of the web graph, pdf with J. Janssen, Internet Mathematics 1 (2004) 193-213. .
  78. A note on orientations of the infinite random graph, pdf with; European Journal of Combinatorics 25 (2004) 921-926.
  79. Limits and power laws of models for the web graph and other networked information spaces, pdf with J. Janssen; Proceedings of Combinatorial and Algorithmic Aspects of Networking, 2004.
  80. On a problem of Cameron's on inexhaustible graphs, pdf with D. Delic, Combinatorica 24 (2004) 35-51.
  81. 2003

  82. Large families of mutually embeddable vertex-transitive graphs, pdf with Claude Tardif, the Journal of Graph Theory 43 (2003) 99-106.
  83. Homomorphisms and amalgamation, pdf Discrete Mathematics 270 (2003) 32-41.
  84. Partitioning a graph into two isomorphic pieces, pdf with Richard Nowakowski, Journal of Graph Theory 44 (2003) 1-14.
  85. Graphs with the 3-e.c. adjacency property constructed from affine planes, pdf with C. Baker and J. Brown, the Journal of Combinatorial Mathematics and Combinatorial Computing, 46 (2003) 65-83.
  86. 2002

  87. On retracts of the random graph and their natural order, pdf Monatschefte fur Mathematik, 135 (2002) 1-9.
  88. A family of universal pseudo-homogeneous G-colourable graphs, pdf Discrete Mathematics 247 (2002) 13-23.
  89. Skolem arrays and Skolem labellings of ladder graphs, pdf with C. Baker and P. Kergin; Ars Combinatoria 63 (2002), 97-107.
  90. Generalized pigeonhole properties of graphs and oriented graphs , pdf with P. Cameron, D. Delic, and S. Thomasse, European Journal of Combinatorics 23 (2002) 257-274.
  91. 2001

  92. Hadamard matrices and strongly regular graphs with the 3-e.c. adjacency property , pdf with Wolf Holzmann and Hadi Kharaghani, Electronic Journal of Combinatorics, Vol 8 (1), 2001.
  93. Metrically universal generic structures in free amalgamation classes, pdf Mathematical Logic Quarterly 47 (2001) 147-160.
  94. On an adjacency property of almost all graphs, pdf with K. Cameron, Discrete Mathematics 231 (2001) 103-119.
  95. Finitely constrained classes closed under unions and n-e.c. structures, pdf Ars Combinatoria 59 (2001) 181-192.
  96. On 2-e.c. line-critical graphs, pdf with K. Cameron; the Journal of Combinatorial Mathematics and Combinatorial Computing, 38 (2001) 111-121.
  97. 2000

  98. The monoid of the random graph, pdf with D. Delic, Semigroup Forum 61 (2000) 138-148.
  99. Tournaments and orders with the pigeonhole property, pdf with P.J. Cameron and D. Delic, Canadian Mathematical Bulletin 43 (2000) 397-405.
  100. On 2-e.c. graphs, tournaments, and hypergraphs, pdf with K. Cameron , 6th International Conference on Graph Theory (Marseille, 2000), 4 pp. (electronic), Electron. Notes Discrete Math., 5, Elsevier, Amsterdam, 2000.
  101. 1999

  102. A pigeonhole property for relational structures, pdf with D. Delic Mathematical Logic Quarterly 45 (1999) 3, 409-413.

  103. 1998

  104. The model companion of width-two orders, pdf with D. Delic Order 14 (1998) 87-99.
  105. Continuum many universal Horn classes of graphs of bounded chromatic number, pdf Algebra Universalis 40 (1998), 105-108.

  106. Submitted


  107. Dimensionality matching of social networks using motifs and eigenvalues, with D.F. Gleich, M. Kim, Dieter Mitsche, P. Pralat, A. Tian, S.J. Young, submitted.
  108. Lazy Cops and Robbers played on graphs, pdf with Deepak Bal, William B. Kinnersley, P. Pralat, submitted to Combinatorics, Probability, and Computing.
  109. Infinite geometric graphs and a new property of metrics, pdf with J. Janssen, submitted to Annals of Combinatorics.
  110. The toppling number of complete and random graphs, pdf with William B. Kinnersley and P. Pralat, submitted to Discrete Mathematics and Theoretical Computer Science.
  111. A general framework for discrete-time pursuit games, pdf with G. MacGillivray; preprint.

Theses


Voce Unica: Mary di Michele, an essay by Lisa Bonato, Mary di Michele: Essays on Her Works, ed. J. Pivato (Toronto: Guernica Editions, 2005).