Anthony Bonato

J. Graph Theory, 2020

Burning the Plane.

[BibT_eX]

[DOI]

Karen Gunderson

Amy Shaw

Graphs Comb., 2020

The iterated local model for social networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

The localization number of designs.

[BibT_eX]

[DOI]

Melissa A. Huggan

Trent G. Marbach

CoRR, 2020

Probabilistically Faulty Searching on a Half-Line.

[BibT_eX]

[DOI]

Konstantinos Georgiou

Calum MacRury

CoRR, 2020

Iterated Global Models for Complex Networks.

[BibT_eX]

[DOI]

Erin Meger

Proceedings of the Algorithms and Models for the Web Graph - 17th International Workshop, 2020

The Iterated Local Directed Transitivity Model for Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web Graph - 17th International Workshop, 2020

Probabilistically Faulty Searching on a Half-Line - (Extended Abstract).

[BibT_eX]

[DOI]

Konstantinos Georgiou

Calum MacRury

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019

Bounds on the burning numbers of spiders and path-forests.

[BibT_eX]

[DOI]

Thomas Lidbetter

Theor. Comput. Sci., 2019

Hyperopic Cops and Robbers.

[BibT_eX]

[DOI]

Margaret-Ellen Messinger

Theor. Comput. Sci., 2019

Geometric random graphs and Rado sets in sequence spaces.

[BibT_eX]

[DOI]

Anthony Quas

Eur. J. Comb., 2019

Cop throttling number: Bounds, values, and variants.

[BibT_eX]

[DOI]

CoRR, 2019

A Sublinear Bound on the Cop Throttling Number of a Graph.

[BibT_eX]

[DOI]

Sean English

CoRR, 2019

Approximation Algorithms for Graph Burning.

[BibT_eX]

[DOI]

Shahin Kamali

Proceedings of the Theory and Applications of Models of Computation, 2019

Centrality in Dynamic Competition Networks.

[BibT_eX]

[DOI]

Proceedings of the Complex Networks and Their Applications VIII, 2019

2018

The robot crawler graph process.

[BibT_eX]

[DOI]

Rita M. del Río-Chanona

Discret. Appl. Math., 2018

Bounds on the burning number.

[BibT_eX]

[DOI]

Stéphane Bessy

Dieter Rautenbach

Discret. Appl. Math., 2018

Dynamic Competition Networks: Detecting Alliances and Leaders.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web Graph - 15th International Workshop, 2018

2017

The Game of Overprescribed Cops and Robbers Played on Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2017

Cops and Robbers ordinals of cop-win trees.

[BibT_eX]

[DOI]

Gena Hahn

Discret. Math., 2017

Burning a graph is hard.

[BibT_eX]

[DOI]

Stéphane Bessy

Dieter Rautenbach

Discret. Appl. Math., 2017

Topological directions in Cops and Robbers.

[BibT_eX]

[DOI]

Muthukrishnan Senthil Kumar

Bojan Mohar

CoRR, 2017

Introduction to the Special section on Aadvanced Computing in Networking and Intelligent Systems.

[BibT_eX]

[DOI]

Lynn Batten

Comput. Electr. Eng., 2017

Characterizations and algorithms for generalized Cops and Robbers games.

[BibT_eX]

[DOI]

Gary MacGillivray

Contributions Discret. Math., 2017

Common Adversaries Form Alliances: Modelling Complex Networks via Anti-transitivity.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web Graph - 14th International Workshop, 2017

2016

A probabilistic version of the game of Zombies and Survivors on graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

The Structure and Automorphisms of Semi-directed Graphs.

[BibT_eX]

[DOI]

J. Multiple Valued Log. Soft Comput., 2016

How to Burn a Graph.

[BibT_eX]

[DOI]

Internet Math., 2016

Mining and Modeling Character Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web Graph - 13th International Workshop, 2016

2015

Special Issue on Algorithms and Models for the Web-graph.

[BibT_eX]

[DOI]

Internet Math., 2015

Lazy Cops and Robbers on Hypercubes.

[BibT_eX]

[DOI]

Deepak Bal

Comb. Probab. Comput., 2015

The Robot Crawler Number of a Graph.

[BibT_eX]

[DOI]

Rita M. del Río-Chanona

Proceedings of the Algorithms and Models for the Web Graph - 12th International Workshop, 2015

The Domination Number of On-line Social Networks and Random Geometric Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2015

2014

Independence densities of hypergraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

Toppling numbers of complete and random graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2014

Dimensionality of social networks using motifs and eigenvalues.

[BibT_eX]

[DOI]

CoRR, 2014

A note on bounds for the cop number using tree decompositions.

[BibT_eX]

[DOI]

Nancy E. Clarke

Stephen Finbow

Shannon L. Fitzpatrick

Margaret-Ellen Messinger

Contributions Discret. Math., 2014

On the minimum order of $k$-cop win graphs.

[BibT_eX]

[DOI]

Contributions Discret. Math., 2014

Burning a Graph as a Model of Social Contagion.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web Graph - 11th International Workshop, 2014

2013

Vertex-Pursuit in Random Directed Acyclic Graphs.

[BibT_eX]

[DOI]

Dieter Mitsche

SIAM J. Discret. Math., 2013

Models of on-line social networks.

[BibT_eX]

[DOI]

CoRR, 2013

The robber strikes back.

[BibT_eX]

[DOI]

Stephen Finbow

Ali Haidar

Dieter Mitsche

Ladislav Stacho

CoRR, 2013

The Capture Time of the Hypercube.

[BibT_eX]

[DOI]

Bill Kinnersley

Electron. J. Comb., 2013

2012

Fighting constrained fires in graphs.

[BibT_eX]

[DOI]

Margaret-Ellen Messinger

Theor. Comput. Sci., 2012

Introduction to the Special Issue on Algorithms and Models for the Web Graph.

[BibT_eX]

[DOI]

Ravi Kumar

D. Sivakumar

Internet Math., 2012

Geometric Protean Graphs.

[BibT_eX]

[DOI]

Internet Math., 2012

Almost all cop-win graphs contain a universal vertex.

[BibT_eX]

[DOI]

Graeme Kemkes

Discret. Math., 2012

Distinguishing homomorphisms of infinite graphs.

[BibT_eX]

[DOI]

Contributions Discret. Math., 2012

Vertex-Pursuit in Hierarchical Social Networks.

[BibT_eX]

[DOI]

Dieter Mitsche

Proceedings of the Theory and Applications of Models of Computation, 2012

Infinite Random Geometric Graphs from the Hexagonal Metric.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012

2011

Twins of rayless graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2011

2010

Cops and Robbers from a distance.

[BibT_eX]

[DOI]

Ehsan Chiniforooshan

Theor. Comput. Sci., 2010

Large classes of infinite k-cop-win graphs.

[BibT_eX]

[DOI]

Gena Hahn

Claude Tardif

J. Graph Theory, 2010

All countable monoids embed into the monoid of the infinite random graph.

[BibT_eX]

[DOI]

Igor Dolinka

Discret. Math., 2010

Bounds and constructions for n-e.c. tournaments.

[BibT_eX]

[DOI]

Contributions Discret. Math., 2010

A Geometric Model for On-line Social Networks.

[BibT_eX]

[DOI]

Proceedings of the 3rd Workshop on Online Social Networks, 2010

The Geometric Protean Model for On-Line Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web-Graph - 7th International Workshop, 2010

2009

The n-ordered graphs: A new graph class.

[BibT_eX]

[DOI]

J. Graph Theory, 2009

Models of Online Social Networks.

[BibT_eX]

[DOI]

Internet Math., 2009

Open Letter to the Internet Mathematics Community.

[BibT_eX]

[DOI]

Fan Chung Graham

Internet Math., 2009

The good, the bad, and the great: Homomorphisms and cores of random graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

The capture time of a graph.

[BibT_eX]

[DOI]

Discret. Math., 2009

The search for N-e.c. graphs.

[BibT_eX]

[DOI]

Contributions Discret. Math., 2009

A Dynamic Model for On-Line Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web-Graph, 6th International Workshop, 2009

Pursuit and Evasion from a Distance: Algorithms and Bounds.

[BibT_eX]

[DOI]

Ehsan Chiniforooshan

Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, 2009

2008

A note on domination parameters in random graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2008

Graphs with the n-e.c. adjacency property constructed from affine planes.

[BibT_eX]

[DOI]

C. A. Baker

Julia M. Nowlin Brown

Tamás Szonyi

Discret. Math., 2008

2007

Pursuit-Evasion in Models of Complex Networks.

[BibT_eX]

[DOI]

Internet Math., 2007

Infinite Limits and Adjacency Properties of a Generalized Copying Model.

[BibT_eX]

[DOI]

Internet Math., 2007

A note on uniquely H-colorable graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2007

The cop density of a graph.

[BibT_eX]

[DOI]

Gena Hahn

Contributions Discret. Math., 2007

A Spatial Web Graph Model with Local Influence Regions.

[BibT_eX]

[DOI]

William Aiello

Colin Cooper

Proceedings of the Algorithms and Models for the Web-Graph, 5th International Workshop, 2007

Vertex Pursuit Games in Stochastic Network Models.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007

2006

Spanning subgraphs of graphs partitioned into two isomorphic pieces.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

Mutually embeddable graphs and the tree alternative conjecture.

[BibT_eX]

[DOI]

Claude Tardif

J. Comb. Theory B, 2006

On an adjacency property of almost all tournaments.

[BibT_eX]

[DOI]

Kathie Cameron

Discret. Math., 2006

2004

A note on orientations of the infinite random graph.

[BibT_eX]

[DOI]

Eur. J. Comb., 2004

On a Problem of Cameron's on Inexhaustible Graphs.

[BibT_eX]

[DOI]

Comb., 2004

Limits and Power Laws of Models for the Web Graph and Other Networked Information Spaces.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

A Survey of Models of the Web Graph.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

2003

Large families of mutually embeddable vertex-transitive graphs.

[BibT_eX]

[DOI]

Claude Tardif

J. Graph Theory, 2003

Partitioning a graph into two isomorphic pieces.

[BibT_eX]

[DOI]

Richard J. Nowakowski

J. Graph Theory, 2003

Infinite Limits of Copying Models of the Web Graph.

[BibT_eX]

[DOI]

Internet Math., 2003

Homomorphisms and amalgamation.

[BibT_eX]

[DOI]

Discret. Math., 2003

2002

Generalized Pigeonhole Properties of Graphs and Oriented Graphs*1.

[BibT_eX]

[DOI]

Eur. J. Comb., 2002

A family of universal pseudo-homogeneous G-colourable graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

Skolem arrays and skolem labellings of ladder graphs.

[BibT_eX]

Catherine Baker

Patrick Kergin

Ars Comb., 2002

2001

Metrically Universal Generic Structures in Free Amalgamation Classes.

[BibT_eX]

[DOI]

Math. Log. Q., 2001

On an adjacency property of almost all graphs.

[BibT_eX]

[DOI]

Kathie Cameron

Discret. Math., 2001

Hadamard Matrices and Strongly Regular Graphs with the 3-e.c. Adjacency Property.

[BibT_eX]

[DOI]

Wolf H. Holzmann

Hadi Kharaghani

Electron. J. Comb., 2001

Constrained classes closed under unions and ne.c. structures.

[BibT_eX]

Ars Comb., 2001

2000

On 2-e.c. graphs, tournaments, and hypergraphs.

[BibT_eX]

[DOI]

Kathie Cameron

Electron. Notes Discret. Math., 2000

1999

A Pigeonhole Property for Relational Structures.

[BibT_eX]

[DOI]