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. Dimensionality matching of social networks using motifs and eigenvalues, with D.F. Gleich, M. Kim, Dieter Mitsche, P. Pralat, A. Tian, S.J. Young, PLoS ONE 9(9): e106052. .
  9. Burning a graph as a model of social contagion, with J. Janssen, E. Roshanbin, accepted to the Proceedings of WAW'14.
  10. Lazy Cops and Robbers played on hypercubes, with Deepak Bal, William B. Kinnersley, P. Pralat, accepted to Combinatorics, Probability, and Computing.
  11. Independence densities of hypergraphs, with Jason Brown, Dieter Mitsche, and P. Pralat, European Journal of Combinatorics 40 (2014) 124-136.
  12. On the minimum order of k-cop-win graphs, with William Baird, Andrew Beveridge, Paolo Codenotti, Aaron Maurer, John McCauley, Silviya Valeva, Contributions to Discrete Mathematics 9 (2014) 70-84.
  13. A note on bounds for the cop number using tree decompositions, with N.E. Clarke, S. Finbow, S. Fitzpatrick, and M.E. Messinger, accepted to Contributions to Discrete Mathematics.
  14. The structure and automorphisms of semi-directed graphs, with D.Delic and Chanping Wang; accepted to the Journal of Multiple-Valued Logic and Soft Computing.

    2013

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

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

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

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

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

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

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

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

  77. 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.
  78. 2004

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

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

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

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

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

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

  106. 1998

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

  109. Submitted


  110. Burning a graph is hard, with J. Janssen, E. Roshanbin, submitted to the Proceedings of ANALCO'15.
  111. Lazy Cops and Robbers played on random graphs and graphs on surfaces, with Deepak Bal, William B. Kinnersley, P. Pralat, submitted to Journal of Combinatorics.
  112. Infinite geometric graphs and a new property of metrics, with J. Janssen, submitted to Annals of Combinatorics.
  113. The toppling number of complete and random graphs, with William B. Kinnersley and P. Pralat, submitted to Discrete Mathematics and Theoretical Computer Science.
  114. A general framework for discrete-time pursuit games, 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).