A Pigeonhole Property for Relational Structures. - Anthony Bonato; Dejan Delic (Math. Log. Q., 1999)

On 2-e.c. graphs, tournaments, and hypergraphs. - Anthony Bonato; Kathie Cameron (Electron. Notes Discret. Math., 2000)

Constrained classes closed under unions and ne.c. structures. - Anthony Bonato (Ars Comb., 2001)

Hadamard Matrices and Strongly Regular Graphs with the 3-e.c. Adjacency Property. - Anthony Bonato; Wolf H. Holzmann; Hadi Kharaghani (Electron. J. Comb., 2001)

On an adjacency property of almost all graphs. - Anthony Bonato; Kathie Cameron (Discret. Math., 2001)

Metrically Universal Generic Structures in Free Amalgamation Classes. - Anthony Bonato (Math. Log. Q., 2001)

Skolem arrays and skolem labellings of ladder graphs. - Catherine Baker; Anthony Bonato; Patrick Kergin (Ars Comb., 2002)

A family of universal pseudo-homogeneous G-colourable graphs. - Anthony Bonato (Discret. Math., 2002)

Generalized Pigeonhole Properties of Graphs and Oriented Graphs*1. - Anthony Bonato; Peter J. Cameron; Dejan Delic; Stéphan Thomassé (Eur. J. Comb., 2002)

Homomorphisms and amalgamation. - Anthony Bonato (Discret. Math., 2003)

Infinite Limits of Copying Models of the Web Graph. - Anthony Bonato; Jeannette C. M. Janssen (Internet Math., 2003)

Partitioning a graph into two isomorphic pieces. - Anthony Bonato; Richard J. Nowakowski (J. Graph Theory, 2003)

Large families of mutually embeddable vertex-transitive graphs. - Anthony Bonato; Claude Tardif (J. Graph Theory, 2003)

A Survey of Models of the Web Graph. - Anthony Bonato (CAAN, 2004)

Limits and Power Laws of Models for the Web Graph and Other Networked Information Spaces. - Anthony Bonato; Jeannette C. M. Janssen (CAAN, 2004)

On a Problem of Cameron's on Inexhaustible Graphs. - Anthony Bonato; Dejan Delic (Comb., 2004)

A note on orientations of the infinite random graph. - Anthony Bonato; Dejan Delic (Eur. J. Comb., 2004)

On an adjacency property of almost all tournaments. - Anthony Bonato; Kathie Cameron (Discret. Math., 2006)

Mutually embeddable graphs and the tree alternative conjecture. - Anthony Bonato; Claude Tardif (J. Comb. Theory B, 2006)

Spanning subgraphs of graphs partitioned into two isomorphic pieces. - Anthony Bonato (J. Graph Theory, 2006)

Vertex Pursuit Games in Stochastic Network Models. - Anthony Bonato; Pawel Pralat; Changping Wang (CAAN, 2007)

The cop density of a graph. - Anthony Bonato; Gena Hahn; Changping Wang (Contributions Discret. Math., 2007)

A note on uniquely H-colorable graphs. - Anthony Bonato (Discuss. Math. Graph Theory, 2007)

Infinite Limits and Adjacency Properties of a Generalized Copying Model. - Anthony Bonato; Jeannette C. M. Janssen (Internet Math., 2007)

Pursuit-Evasion in Models of Complex Networks. - Anthony Bonato; Pawel Pralat; Changping Wang (Internet Math., 2007)

Graphs with the n-e.c. adjacency property constructed from affine planes. - C. A. Baker; Anthony Bonato; Julia M. Nowlin Brown; Tamás Szonyi (Discret. Math., 2008)

A note on domination parameters in random graphs. - Anthony Bonato; Changping Wang (Discuss. Math. Graph Theory, 2008)

A Spatial Web Graph Model with Local Influence Regions. - William Aiello; Anthony Bonato; Colin Cooper; Jeannette C. M. Janssen; Pawel Pralat (Internet Math., 2008)

Pursuit and Evasion from a Distance: Algorithms and Bounds. - Anthony Bonato; Ehsan Chiniforooshan (ANALCO, 2009)

A Dynamic Model for On-Line Social Networks. - Anthony Bonato; Noor Hadi; Paul Horn; Pawel Pralat; Changping Wang (WAW, 2009)

The search for N-e.c. graphs. - Anthony Bonato (Contributions Discret. Math., 2009)

The capture time of a graph. - Anthony Bonato; Petr A. Golovach; Gena Hahn; Jan Kratochvíl (Discret. Math., 2009)

The good, the bad, and the great: Homomorphisms and cores of random graphs. - Anthony Bonato; Pawel Pralat (Discret. Math., 2009)

Open Letter to the Internet Mathematics Community. - Anthony Bonato; Fan Chung Graham (Internet Math., 2009)

Models of Online Social Networks. - Anthony Bonato; Noor Hadi; Paul Horn; Pawel Pralat; Changping Wang (Internet Math., 2009)

The n-ordered graphs: A new graph class. - Anthony Bonato; Jeannette C. M. Janssen; Changping Wang (J. Graph Theory, 2009)

The Geometric Protean Model for On-Line Social Networks. - Anthony Bonato; Jeannette C. M. Janssen; Pawel Pralat (WAW, 2010)

A Geometric Model for On-line Social Networks. - Anthony Bonato; Jeannette C. M. Janssen; Pawel Pralat (WOSN, 2010)

Bounds and constructions for n-e.c. tournaments. - Anthony Bonato; Przemyslaw Gordinowicz; Pawel Pralat (Contributions Discret. Math., 2010)

All countable monoids embed into the monoid of the infinite random graph. - Anthony Bonato; Dejan Delic; Igor Dolinka (Discret. Math., 2010)

Large classes of infinite k-cop-win graphs. - Anthony Bonato; Gena Hahn; Claude Tardif (J. Graph Theory, 2010)

Cops and Robbers from a distance. - Anthony Bonato; Ehsan Chiniforooshan; Pawel Pralat (Theor. Comput. Sci., 2010)

Twins of rayless graphs. - Anthony Bonato; Henning Bruhn; Reinhard Diestel; Philipp Sprüssel (J. Comb. Theory B, 2011)

Infinite Random Geometric Graphs from the Hexagonal Metric. - Anthony Bonato; Jeannette C. M. Janssen (IWOCA, 2012)

Vertex-Pursuit in Hierarchical Social Networks. - Anthony Bonato; Dieter Mitsche; Pawel Pralat (TAMC, 2012)

Distinguishing homomorphisms of infinite graphs. - Anthony Bonato; Dejan Delic (Contributions Discret. Math., 2012)

Almost all cop-win graphs contain a universal vertex. - Anthony Bonato; Graeme Kemkes; Pawel Pralat (Discret. Math., 2012)

Geometric Protean Graphs. - Anthony Bonato; Jeannette C. M. Janssen; Pawel Pralat (Internet Math., 2012)

Introduction to the Special Issue on Algorithms and Models for the Web Graph. - Anthony Bonato; Ravi Kumar 001; D. Sivakumar 001 (Internet Math., 2012)

Fighting constrained fires in graphs. - Anthony Bonato; Margaret-Ellen Messinger; Pawel Pralat (Theor. Comput. Sci., 2012)

The Capture Time of the Hypercube. - Anthony Bonato; Przemyslaw Gordinowicz; Bill Kinnersley; Pawel Pralat (Electron. J. Comb., 2013)

The robber strikes back. - Anthony Bonato; Stephen Finbow; Przemyslaw Gordinowicz; Ali Haidar; William B. Kinnersley; Dieter Mitsche; Pawel Pralat; Ladislav Stacho (CoRR, 2013)

Models of on-line social networks. - Anthony Bonato; Noor Hadi; Paul Horn; Pawel Pralat; Changping Wang (CoRR, 2013)

Vertex-Pursuit in Random Directed Acyclic Graphs. - Anthony Bonato; Dieter Mitsche; Pawel Pralat (SIAM J. Discret. Math., 2013)

Burning a Graph as a Model of Social Contagion. - Anthony Bonato; Jeannette C. M. Janssen; Elham Roshanbin (WAW, 2014)

On the minimum order of $k$-cop win graphs. - William Baird; Andrew Beveridge; Anthony Bonato; Paolo Codenotti; Aaron Maurer; John McCauley; Silviya Valeva (Contributions Discret. Math., 2014)

A note on bounds for the cop number using tree decompositions. - Anthony Bonato; Nancy E. Clarke; Stephen Finbow; Shannon L. Fitzpatrick; Margaret-Ellen Messinger (Contributions Discret. Math., 2014)

Dimensionality of social networks using motifs and eigenvalues. - Anthony Bonato; David F. Gleich; Myunghwan Kim 002; Dieter Mitsche; Pawel Pralat; Amanda Tian; Stephen J. Young (CoRR, 2014)

Toppling numbers of complete and random graphs. - Anthony Bonato; William B. Kinnersley; Pawel Pralat (Discret. Math. Theor. Comput. Sci., 2014)

Independence densities of hypergraphs. - Anthony Bonato; Jason I. Brown; Dieter Mitsche; Pawel Pralat (Eur. J. Comb., 2014)

The Domination Number of On-line Social Networks and Random Geometric Graphs. - Anthony Bonato; Marc Lozier; Dieter Mitsche; Xavier Pérez-Giménez; Pawel Pralat (TAMC, 2015)

The Robot Crawler Number of a Graph. - Anthony Bonato; Rita M. del Río-Chanona; Calum MacRury; Jake Nicolaidis; Xavier Pérez-Giménez; Pawel Pralat; Kirill Ternovsky (WAW, 2015)

Lazy Cops and Robbers on Hypercubes. - Deepak Bal; Anthony Bonato; William B. Kinnersley; Pawel Pralat (Comb. Probab. Comput., 2015)

Mining and Modeling Character Networks. - Anthony Bonato; David Ryan D'Angelo; Ethan R. Elenberg; David F. Gleich; Yangyang Hou (WAW, 2016)

How to Burn a Graph. - Anthony Bonato; Jeannette C. M. Janssen; Elham Roshanbin (Internet Math., 2016)

Special Issue on Algorithms and Models for the Web-Graph. - Anthony Bonato; Pawel Pralat (Internet Math., 2016)

The Structure and Automorphisms of Semi-directed Graphs. - Anthony Bonato; Dejan Delic; Changping Wang (J. Multiple Valued Log. Soft Comput., 2016)

A probabilistic version of the game of Zombies and Survivors on graphs. - Anthony Bonato; Dieter Mitsche; Xavier Pérez-Giménez; Pawel Pralat (Theor. Comput. Sci., 2016)

Common Adversaries Form Alliances: Modelling Complex Networks via Anti-transitivity. - Anthony Bonato; Ewa J. Infeld; Hari Pokhrel; Pawel Pralat (WAW, 2017)

Characterizations and algorithms for generalized Cops and Robbers games. - Anthony Bonato; Gary MacGillivray (Contributions Discret. Math., 2017)

Introduction to the Special section on Aadvanced Computing in Networking and Intelligent Systems. - Muthukrishnan Senthil Kumar; Anthony Bonato; Lynn Batten (Comput. Electr. Eng., 2017)

Topological directions in Cops and Robbers. - Anthony Bonato; Bojan Mohar (CoRR, 2017)

Burning a graph is hard. - Stéphane Bessy; Anthony Bonato; Jeannette C. M. Janssen; Dieter Rautenbach; Elham Roshanbin (Discret. Appl. Math., 2017)

Cops and Robbers ordinals of cop-win trees. - Anthony Bonato; Przemyslaw Gordinowicz; Gena Hahn (Discret. Math., 2017)

The Game of Overprescribed Cops and Robbers Played on Graphs. - Anthony Bonato; Xavier Pérez-Giménez; Pawel Pralat; Benjamin Reiniger (Graphs Comb., 2017)

Dynamic Competition Networks: Detecting Alliances and Leaders. - Anthony Bonato; Nicole Eikmeier; David F. Gleich; Rehan Malik (WAW, 2018)

Bounds on the burning number. - Stéphane Bessy; Anthony Bonato; Jeannette C. M. Janssen; Dieter Rautenbach; Elham Roshanbin (Discret. Appl. Math., 2018)

The robot crawler graph process. - Anthony Bonato; Rita M. del Río-Chanona; Calum MacRury; Jake Nicolaidis; Xavier Pérez-Giménez; Pawel Pralat; Kirill Ternovsky (Discret. Appl. Math., 2018)

Centrality in Dynamic Competition Networks. - Anthony Bonato; Nicole Eikmeier; David F. Gleich; Rehan Malik (COMPLEX NETWORKS (2), 2019)

Approximation Algorithms for Graph Burning. - Anthony Bonato; Shahin Kamali (TAMC, 2019)

A Sublinear Bound on the Cop Throttling Number of a Graph. - Anthony Bonato; Sean English (CoRR, 2019)

Cop throttling number: Bounds, values, and variants. - Anthony Bonato; Jane Breen; Boris Brimkov; Joshua Carlson; Sean English; Jesse Geneson; Leslie Hogben; K. E. Perry; Carolyn Reinhart (CoRR, 2019)

Geometric random graphs and Rado sets in sequence spaces. - Anthony Bonato; Jeannette C. M. Janssen; Anthony Quas (Eur. J. Comb., 2019)

Hyperopic Cops and Robbers. - Anthony Bonato; Nancy E. Clarke; Danielle Cox; Stephen Finbow; Fionn Mc Inerney; Margaret-Ellen Messinger (Theor. Comput. Sci., 2019)

Bounds on the burning numbers of spiders and path-forests. - Anthony Bonato; Thomas Lidbetter (Theor. Comput. Sci., 2019)

Probabilistically Faulty Searching on a Half-Line - (Extended Abstract). - Anthony Bonato; Konstantinos Georgiou; Calum MacRury; Pawel Pralat (LATIN, 2020)

The Iterated Local Directed Transitivity Model for Social Networks. - Anthony Bonato; Daniel W. Cranston; Melissa A. Huggan; Trent G. Marbach; Raja Mutharasan (WAW, 2020)

Iterated Global Models for Complex Networks. - Anthony Bonato; Erin Meger (WAW, 2020)

Probabilistically Faulty Searching on a Half-Line. - Anthony Bonato; Konstantinos Georgiou; Calum MacRury; Pawel Pralat (CoRR, 2020)

The localization number of designs. - Anthony Bonato; Melissa A. Huggan; Trent G. Marbach (CoRR, 2020)

The iterated local model for social networks. - Anthony Bonato; Huda Chuangpishit; Sean English; Bill Kay; Erin Meger (Discret. Appl. Math., 2020)

Burning the Plane. - Anthony Bonato; Karen Gunderson; Amy Shaw (Graphs Comb., 2020)

Bounds on the localization number. - Anthony Bonato; William B. Kinnersley (J. Graph Theory, 2020)

Small Number of Communities in Twitter Keyword Networks. - Linda Abraham; Anthony Bonato; Alexander Nazareth (COMPLEX NETWORKS, 2021)

A survey of graph burning. - Anthony Bonato (Contributions Discret. Math., 2021)

Pursuit-evasion games on latin square graphs. - Shreya Ahirwar; Anthony Bonato; Leanna Gittins; Alice Huang; Trent G. Marbach; Tomer Zaidman (CoRR, 2021)

Improved Bounds for Burning Fence Graphs. - Anthony Bonato; Sean English; Bill Kay; Daniel Moghbel (Graphs Comb., 2021)

The game of Cops and Eternal Robbers. - Anthony Bonato; Melissa A. Huggan; Trent G. Marbach; Fionn Mc Inerney (Theor. Comput. Sci., 2021)

An Evolving Network Model from Clique Extension. - Anthony Bonato; Ryan Cushman; Trent G. Marbach; Zhiyuan Zhang (COCOON, 2022)

Winner Does Not Take All: Contrasting Centrality in Adversarial Networks. - Anthony Bonato; Joey Kapusin; Jiajie Yuan (COMPLEX NETWORKS (2), 2022)

Distinguishing Number of Universal Homogeneous Urysohn Metric Spaces. - Anthony Bonato; Claude Laflamme; M. Pawliuk; Norbert Sauer (Electron. J. Comb., 2022)

Iterative models for complex networks formed by extending cliques. - Anthony Bonato; Ryan Cushman; Trent G. Marbach; Zhiyuan Zhang (CoRR, 2022)

The localization capture time of a graph. - Natalie C. Behague; Anthony Bonato; Melissa A. Huggan; Trent G. Marbach; Brittany Pittman (Theor. Comput. Sci., 2022)

The Iterated Local Transitivity Model for Tournaments. - Anthony Bonato; Ketan Chaudhary (WAW, 2023)

The localization number and metric dimension of graphs of diameter 2. - Anthony Bonato; Melissa A. Huggan; Trent G. Marbach (Contributions Discret. Math., 2023)

Improved Pyrotechnics: Closer to the Burning Number Conjecture. - Paul Bastide 002; Marthe Bonamy; Anthony Bonato; Pierre Charbit; Shahin Kamali; Théo Pierron; Mikaël Rabie (Electron. J. Comb., 2023)

Algorithms for p-Faulty Search on a Half-Line. - Anthony Bonato; Konstantinos Georgiou; Calum MacRury; Pawel Pralat (Algorithmica, 2023)

The iterated local transitivity model for hypergraphs. - Natalie C. Behague; Anthony Bonato; Melissa A. Huggan; Rehan Malik; Trent G. Marbach (Discret. Appl. Math., 2023)

The localization game on oriented graphs. - Anthony Bonato; Ryan Cushman; Trent G. Marbach; Brittany Pittman (Discret. Appl. Math., 2023)

The one-visibility localization game. - Anthony Bonato; Trent G. Marbach; Michael Molnar; JD Nir (Theor. Comput. Sci., 2023)

How to Cool a Graph. - Anthony Bonato; Holden Milne; Trent G. Marbach; Teddy Mishura (WAW, 2024)

Clique Counts for Network Similarity. - Anthony Bonato; Zhiyuan Zhang (WAW, 2024)

Enhancing Anti-Money Laundering Efforts with Network-Based Algorithms. - Anthony Bonato; Juan Sebastian Chavez Palan; Adam Szava (CoRR, 2024)

The frustum network model based on clique extension. - Anthony Bonato; Ryan Cushman; Trent G. Marbach; Zhiyuan Zhang (J. Comb. Optim., 2024)

Analysis and Predictability of Centrality Measures in Competition Networks. - Anthony Bonato; Mariam Walaa (WAW, 2025)

Hypergraph burning, matchings, and zero forcing. - Anthony Bonato; Caleb Jones; Trent G. Marbach; Teddy Mishura; Zhiyuan Zhang (Theor. Comput. Sci., 2025)

Network Analysis of Global Banking Systems and Detection of Suspicious Transactions. - Anthony Bonato; Juan Sebastian Chavez Palan; Adam Szava (CoRR, 2025)