Pawel Pralat

CoRR, February, 2026

Achievable Burning Densities of Growing Grids.

[BibT_eX]

[DOI]

CoRR, January, 2026

Creating Subgraphs in Semi-Random Hypergraph Games.

[BibT_eX]

[DOI]

Natalie C. Behague

Andrzej Rucinski

Electron. J. Comb., 2026

The Needle is a Thread: Finding Planted Paths in Noisy Process Trees.

[BibT_eX]

[DOI]

Proceedings of the Modelling and Mining Networks - 21st International Workshop, 2026

Twinning Complex Networked Systems: Data-Driven Calibration of the mABCD Synthetic Graph Generator.

[BibT_eX]

[DOI]

Proceedings of the Modelling and Mining Networks - 21st International Workshop, 2026

2025

Multiset Metric Dimension of Binomial Random Graphs.

[BibT_eX]

[DOI]

Austin Eide

CoRR, July, 2025

The Artificial Benchmark for Community Detection with Outliers and Overlapping Communities (ABCD+o2).

[BibT_eX]

[DOI]

CoRR, June, 2025

Perfect Matchings and Loose Hamilton Cycles in the Semirandom Hypergraph Model.

[BibT_eX]

[DOI]

Michael Molloy

Gregory B. Sorkin

Random Struct. Algorithms, March, 2025

Playing Sudoku on random 3-regular graphs.

[BibT_eX]

[DOI]

CoRR, March, 2025

A direct proof of the short-side advantage in random matching markets.

[BibT_eX]

[DOI]

Simon Mauras

Adrian Vetta

Games Econ. Behav., 2025

Building Hamiltonian cycles in the semi-random graph process in less than 2n rounds.

[BibT_eX]

[DOI]

Eur. J. Comb., 2025

The Fagnano Triangle Patrolling Problem.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2025

Hopping forcing number in random d-regular graphs.

[BibT_eX]

[DOI]

Harjas Singh

Discret. Math., 2025

Linear colouring of binomial random graphs.

[BibT_eX]

[DOI]

Austin Eide

Discret. Math., 2025

Counting simplicial pairs in hypergraphs.

[BibT_eX]

[DOI]

J. Complex Networks, 2025

Almost All 9-Regular Graphs Have a Modulo-5 Orientation.

[BibT_eX]

[DOI]

Michelle Delcourt

Reaz Huq

Electron. J. Comb., 2025

The Multilayer Artificial Benchmark for Community Detection (mABCD).

[BibT_eX]

[DOI]

Proceedings of the Modelling and Mining Networks - 20th International Workshop, 2025

The Artificial Benchmark for Community Detection with Outliers and Overlapping Communities ($\mathbf {ABCD{+}o}^2$).

[BibT_eX]

[DOI]

Proceedings of the Modelling and Mining Networks - 20th International Workshop, 2025

Improving Community Detection via Community Association Strength Scores.

[BibT_eX]

[DOI]

Proceedings of the Modelling and Mining Networks - 20th International Workshop, 2025

2024

Predicting properties of nodes via community-aware features.

[BibT_eX]

[DOI]

Soc. Netw. Anal. Min., December, 2024

Optimizing transport frequency in multi-layered urban transportation networks for pandemic prevention.

[BibT_eX]

[DOI]

Public Transp., June, 2024

Rainbow Spanning Trees in Randomly Colored $\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}$.

[BibT_eX]

[DOI]

Deepak Bal

SIAM J. Discret. Math., March, 2024

Unsupervised framework for evaluating and explaining structural node embeddings of graphs.

[BibT_eX]

[DOI]

J. Complex Networks, February, 2024

Cliques, Chromatic Number, and Independent Sets in the Semi-random Process.

[BibT_eX]

[DOI]

David Gamarnik

Mihyun Kang

SIAM J. Discret. Math., 2024

The Erdős-Gyárfás function f(n,4,5)=56n+o(n) - So Gyárfás was right.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2024

Makespan Trade-offs for Visiting Triangle Edges.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2024

Performance of community detection algorithms supported by node embeddings.

[BibT_eX]

[DOI]

Bartosz Pankratz

J. Complex Networks, 2024

Power of $k$ Choices in the Semi-Random Graph Process.

[BibT_eX]

[DOI]

Harjas Singh

Electron. J. Comb., 2024

Subgraph Games in the Semi-Random Graph Process and Its Generalization to Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2024

Network Embedding Exploration Tool (NEExT).

[BibT_eX]

[DOI]

Ashkan Dehghan

Proceedings of the Modelling and Mining Networks - 19th International Workshop, 2024

Self-similarity of Communities of the ABCD Model.

[BibT_eX]

[DOI]

Proceedings of the Modelling and Mining Networks - 19th International Workshop, 2024

Impact of Market Design and Trading Network Structure on Market Efficiency.

[BibT_eX]

[DOI]

Proceedings of the Modelling and Mining Networks - 19th International Workshop, 2024

Asynchronous Majority Dynamics on Binomial Random Graphs.

[BibT_eX]

[DOI]

Divyarthi Mohan

Proceedings of the Approximation, 2024

2023

Artificial benchmark for community detection with outliers (ABCD+o).

[BibT_eX]

[DOI]

Appl. Netw. Sci., December, 2023

Algorithms for p-Faulty Search on a Half-Line.

[BibT_eX]

[DOI]

Algorithmica, August, 2023

Hypergraph Artificial Benchmark for Community Detection (h-ABCD).

[BibT_eX]

[DOI]

J. Complex Networks, June, 2023

Generative Methods for Social Media Analysis

[BibT_eX]

[DOI]

Springer Briefs in Computer Science, Springer, ISBN: 978-3-031-33616-4, 2023

A variant of the Erdős-Rényi random graph process.

[BibT_eX]

[DOI]

Adam Logan

Michael Molloy

J. Graph Theory, 2023

Localization game for random geometric graphs.

[BibT_eX]

[DOI]

Lyuben Lichev

Eur. J. Comb., 2023

Label propagation on binomial random graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Edge and Pair Queries-Random Graphs and Complexity.

[BibT_eX]

[DOI]

Dariusz Dereniowski

Electron. J. Comb., 2023

Modularity Based Community Detection in Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web Graph - 18th International Workshop, 2023

Unsupervised Framework for Evaluating Structural Node Embeddings of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web Graph - 18th International Workshop, 2023

The Fagnano Triangle Patrolling Problem (Extended Abstract).

[BibT_eX]

[DOI]

Arash Dehghan-Kooshkghazi

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023

Classification Supported by Community-Aware Node Features.

[BibT_eX]

[DOI]

Proceedings of the Complex Networks & Their Applications XII, 2023

2022

A multi-purposed unsupervised framework for comparing embeddings of undirected and directed graphs.

[BibT_eX]

[DOI]

Netw. Sci., December, 2022

Evaluating node embeddings of complex networks.

[BibT_eX]

[DOI]

J. Complex Networks, June, 2022

Perfect Matchings in the Semirandom Graph Process.

[BibT_eX]

[DOI]

Pu Gao

SIAM J. Discret. Math., 2022

Hamilton cycles in the semi-random graph process.

[BibT_eX]

[DOI]

Eur. J. Comb., 2022

Broadcasting on paths and cycles.

[BibT_eX]

[DOI]

Reaz Huq

Discret. Math., 2022

Localization game for random graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Rainbow spanning trees in randomly coloured Gk-out.

[BibT_eX]

[DOI]

Deepak Bal

CoRR, 2022

Tight Bounds on Probabilistic Zero Forcing on Hypercubes and Grids.

[BibT_eX]

[DOI]

Natalie C. Behague

Trent G. Marbach

Electron. J. Comb., 2022

Properties and Performance of the ABCDe Random Graph Model with Community Structure.

[BibT_eX]

[DOI]

Big Data Res., 2022

Detecting Bots in Social-networks using Node and Structural Embeddings.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Data Science, 2022

Community Detection Supported by Node Embeddings (Searching for a Suitable Method).

[BibT_eX]

[DOI]

Bartosz Pankratz

Proceedings of the Complex Networks and Their Applications XI, 2022

Outliers in the ABCD Random Graph Model with Community Structure (ABCD+o).

[BibT_eX]

[DOI]

Proceedings of the Complex Networks and Their Applications XI, 2022

Modularity of the ABCD Random Graph Model with Community Structure.

[BibT_eX]

[DOI]

Proceedings of the Complex Networks and Their Applications XI, 2022

A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process.

[BibT_eX]

[DOI]

Pu Gao

Proceedings of the Approximation, 2022

2021

Artificial Benchmark for Community Detection (ABCD) - Fast random graph model with community structure.

[BibT_eX]

[DOI]

Netw. Sci., 2021

On-line size Ramsey number for monotone k-uniform ordered paths with uniform looseness.

[BibT_eX]

[DOI]

Douglas B. West

Eur. J. Comb., 2021

Probabilistic zero forcing on random graphs.

[BibT_eX]

[DOI]

Sean English

Eur. J. Comb., 2021

On broadcasting time in the model of travelling agents.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Survey of Generative Methods for Social Media Analysis.

[BibT_eX]

[DOI]

CoRR, 2021

Perfect Matchings in the Semi-random Graph Process.

[BibT_eX]

[DOI]

Pu Gao

CoRR, 2021

An unsupervised framework for comparing graph embeddings.

[BibT_eX]

[DOI]

J. Complex Networks, 2021

The Unit Acquisition Number of Binomial Random Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

Makespan Trade-Offs for Visiting Triangle Edges - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020

Almost all 5-regular graphs have a 3-flow.

[BibT_eX]

[DOI]

Nick Wormald

J. Graph Theory, 2020

k-regular subgraphs near the k-core threshold of a random graph.

[BibT_eX]

[DOI]

Michael Molloy

J. Comb. Theory B, 2020

Analyzing, Exploring, and Visualizing Complex Networks via Hypergraphs using SimpleHypergraphs.jl.

[BibT_eX]

[DOI]

Internet Math., 2020

Probabilistically Faulty Searching on a Half-Line.

[BibT_eX]

[DOI]

CoRR, 2020

On the Existence of Hamilton Cycles with a Periodic Pattern in a Random Digraph.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

A Scalable Unsupervised Framework for Comparing Graph Embeddings.

[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]

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Community Detection Algorithm Using Hypergraph Modularity.

[BibT_eX]

[DOI]

Proceedings of the Complex Networks & Their Applications IX, 2020

2019

How many zombies are needed to catch the survivor on toroidal grids?

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Parallel execution of schedules with random dependency graph.

[BibT_eX]

[DOI]

Tomasz Olczak

Theor. Comput. Sci., 2019

Meyniel's conjecture holds for random d-regular graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2019

Clique coloring of binomial random graphs.

[BibT_eX]

[DOI]

Colin McDiarmid

Random Struct. Algorithms, 2019

Perfect matchings and Hamiltonian cycles in the preferential attachment model.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2019

Sub-trees of a random tree.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

SimpleHypergraphs.jl - Novel Software Framework for Modelling and Analysis of Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web Graph - 16th International Workshop, 2019

2018

Burning number of graph products.

[BibT_eX]

[DOI]

Elham Roshanbin

Theor. Comput. Sci., 2018

Subhypergraphs in non-uniform random hypergraphs.

[BibT_eX]

[DOI]

Internet Math., 2018

Randomly twisted hypercubes.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

Size-Ramsey numbers of cycles versus a path.

[BibT_eX]

[DOI]

Farideh Khoeini

Discret. Math., 2018

The robot crawler graph process.

[BibT_eX]

[DOI]

Rita M. del Río-Chanona

Discret. Appl. Math., 2018

Clique Colourings of Geometric Graphs.

[BibT_eX]

[DOI]

Colin McDiarmid

Electron. J. Comb., 2018

Note on the Multicolour Size-Ramsey Number for Paths, .

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

Small on-line Ramsey numbers - a new approach.

[BibT_eX]

[DOI]

Liudmila Ostroumova Prokhorenkova

Contributions Discret. Math., 2018

Clustering Properties of Spatial Preferential Attachment Model.

[BibT_eX]

[DOI]

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

2017

On some Multicolor Ramsey Properties of Random Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Rainbow perfect matchings and Hamilton cycles in the random geometric graph.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2017

Burning Graphs: A Probabilistic Perspective.

[BibT_eX]

[DOI]

Liudmila Ostroumova Prokhorenkova

Elham Roshanbin

Graphs Comb., 2017

The Game of Overprescribed Cops and Robbers Played on Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2017

Modularity in several random graph models.

[BibT_eX]

[DOI]

Andrei M. Raigorodskii

Electron. Notes Discret. Math., 2017

The total acquisition number of the randomly weighted path.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2017

The Total Acquisition Number of Random Geometric Graphs.

[BibT_eX]

[DOI]

Ewa J. Infeld

Electron. J. Comb., 2017

Endogenous Differentiation of Consumer Preferences Under Quality Uncertainty in a SPA Network.

[BibT_eX]

[DOI]

Tomasz Olczak

Proceedings of the Algorithms and Models for the Web Graph - 14th International Workshop, 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

To catch a falling robber.

[BibT_eX]

[DOI]

Douglas B. West

Theor. Comput. Sci., 2016

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Acquaintance Time of Random Graphs Near Connectivity Threshold.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Meyniel's conjecture holds for random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2016

Homophily, influence and the decay of segregation in self-organizing networks.

[BibT_eX]

[DOI]

Adam Douglas Henry

Netw. Sci., 2016

Rainbow Arborescence in Random Digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2016

Nonuniform Distribution of Nodes in the Spatial Preferential Attachment Model.

[BibT_eX]

[DOI]

Internet Math., 2016

Game brush number.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

The set chromatic number of random graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

The Bondage Number of Random Graphs.

[BibT_eX]

[DOI]

Liudmila Ostroumova Prokhorenkova

Electron. J. Comb., 2016

The Total Acquisition Number of Random Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

Modularity of Complex Networks Models.

[BibT_eX]

[DOI]

Andrei M. Raigorodskii

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

Subgraphs in Non-uniform Random Hypergraphs.

[BibT_eX]

[DOI]

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

News Article Position Recommendation Based on the Analysis of Article's Content - Time Matters.

[BibT_eX]

[DOI]

Proceedings of the 3rd Workshop on New Trends in Content-Based Recommender Systems co-located with ACM Conference on Recommender Systems (RecSys 2016), 2016

2015

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

[BibT_eX]

[DOI]

Internet Math., 2015

The acquaintance time of (percolated) random geometric graphs.

[BibT_eX]

[DOI]

Tobias Müller

Eur. J. Comb., 2015

Almost all k-cop-win graphs contain a dominating set of cardinality k.

[BibT_eX]

[DOI]

Discret. Math., 2015

An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2015

Lazy Cops and Robbers on Hypercubes.

[BibT_eX]

[DOI]

Deepak Bal

Comb. Probab. Comput., 2015

Strong-majority bootstrap percolation on regular graphs with low dissemination threshold.

[BibT_eX]

[DOI]

CoRR, 2015

Non-Uniform Distribution of Nodes in the Spatial Preferential Attachment Model.

[BibT_eX]

[DOI]

CoRR, 2015

Containment Game Played on Random Graphs: Another Zig-Zag Theorem.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

On-line List Colouring of Random Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

Power of k Choices and Rainbow Spanning Trees in Random Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

Chasing robbers on percolated random geometric graphs.

[BibT_eX]

[DOI]

Anshui Li

Tobias Müller

Contributions Discret. Math., 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

Towards dynamic pricing for digital billboard advertising network in smart cities.

[BibT_eX]

[DOI]

Proceedings of the IEEE First International Smart Cities Conference, 2015

2014

Brushing with additional cleaning restrictions.

[BibT_eX]

[DOI]

Piotr Borowiecki

Dariusz Dereniowski

Theor. Comput. Sci., 2014

The Role of Visibility in Pursuit/Evasion Games.

[BibT_eX]

[DOI]

Athanasios Kehagias

Robotics, 2014

Graphs with Average Degree Smaller Than $${\frac {30}{11}}$$ Burn Slowly.

[BibT_eX]

[DOI]

Graphs Comb., 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

Elimination schemes and lattices.

[BibT_eX]

[DOI]

Discret. Math., 2014

Firefighting on square, hexagonal, and triangular grids.

[BibT_eX]

[DOI]

Tomas Gavenciak

Jan Kratochvíl

Discret. Math., 2014

Brushing without capacity restrictions.

[BibT_eX]

[DOI]

Darryn E. Bryant

Nevena Francetic

David A. Pike

Discret. Appl. Math., 2014

Chasing robbers on random geometric graphs - An alternative approach.

[BibT_eX]

[DOI]

Noga Alon

Discret. Appl. Math., 2014

Dimensionality of social networks using motifs and eigenvalues.

[BibT_eX]

[DOI]

CoRR, 2014

On the Hyperbolicity of Random Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

2013

Cops and invisible robbers: The cost of drunkenness.

[BibT_eX]

[DOI]

Athanasios Kehagias

Theor. Comput. Sci., 2013

Sparse Graphs Are Not Flammable.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

On the Maximum Density of Graphs with Unique-Path Labelings.

[BibT_eX]

[DOI]

Abbas Mehrabian

SIAM J. Discret. Math., 2013

Vertex-Pursuit in Random Directed Acyclic Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Discovery of Nodal Attributes through a Rank-Based Model of Network Structure.

[BibT_eX]

[DOI]

Adam Douglas Henry

Internet Math., 2013

Special Issue on Algorithms and Models for the Web Graph.

[BibT_eX]

[DOI]

Paul Horn

Internet Math., 2013

Revolutionaries and Spies on Random Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2013

Models of on-line social networks.

[BibT_eX]

[DOI]

CoRR, 2013

The robber strikes back.

[BibT_eX]

[DOI]

Stephen Finbow

Ali Haidar

Ladislav Stacho

CoRR, 2013

A Note on the Acquaintance Time of Random Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

The Capture Time of the Hypercube.

[BibT_eX]

[DOI]

Bill Kinnersley

Electron. J. Comb., 2013

Metric Dimension for Random Graphs.

[BibT_eX]

[DOI]

Béla Bollobás

Electron. J. Comb., 2013

Geometric graph properties of the spatial preferred attachment model.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2013

Asymmetric Distribution of Nodes in the Spatial Preferred Attachment Model.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web Graph - 10th International Workshop, 2013

Broadcasting in Conflict-Aware Multi-channel Networks.

[BibT_eX]

[DOI]

Francisco Claude

Reza Dorrigiv

Shahin Kamali

Alejandro López-Ortiz

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

2012

Some remarks on cops and drunk robbers.

[BibT_eX]

[DOI]

Athanasios Kehagias

Theor. Comput. Sci., 2012

polish - Let us play the cleaning game.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Fighting constrained fires in graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Cops and Robber with Constraints.

[BibT_eX]

[DOI]

Fedor V. Fomin

Petr A. Golovach

SIAM J. Discret. Math., 2012

Geometric Protean Graphs.

[BibT_eX]

[DOI]

Internet Math., 2012

The first player wins the one-colour triangle avoidance game on 16 vertices.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2012

Almost all cop-win graphs contain a universal vertex.

[BibT_eX]

[DOI]

Graeme Kemkes

Discret. Math., 2012

A Note On Off-Diagonal Small On-Line Ramsey Numbers For Paths.

[BibT_eX]

Ars Comb., 2012

Some Typical Properties of the Spatial Preferred Attachment Model.

[BibT_eX]

[DOI]

Colin Cooper

Proceedings of the Algorithms and Models for the Web Graph - 9th International Workshop, 2012

Vertex-Pursuit in Hierarchical Social Networks.

[BibT_eX]

[DOI]

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

2011

An edge deletion model for complex networks.

[BibT_eX]

[DOI]

Changping Wang

Theor. Comput. Sci., 2011

Scale-free graphs of increasing degree.

[BibT_eX]

[DOI]

Colin Cooper

Random Struct. Algorithms, 2011

Geodesics and almost geodesic cycles in random regular graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

Cleaning Random d-Regular Graphs with Brooms.

[BibT_eX]

[DOI]

Graphs Comb., 2011

Cleaning with Brooms.

[BibT_eX]

[DOI]

Graphs Comb., 2011

Connectivity threshold and recovery time in rank-based models for complex networks.

[BibT_eX]

[DOI]

Discret. Math., 2011

Modular Orientations of Random and Quasi-Random Regular Graphs.

[BibT_eX]

[DOI]

Noga Alon

Comb. Probab. Comput., 2011

On the threshold for k-regular subgraphs of random graphs.

[BibT_eX]

[DOI]

Jacques Verstraëte

Comb., 2011

Rank-Based Models of Network Structure and the Discovery of Content.

[BibT_eX]

[DOI]

Adam Douglas Henry

Proceedings of the Algorithms and Models for the Web Graph - 8th International Workshop, 2011

2010

Cops and Robbers from a distance.

[BibT_eX]

[DOI]

Ehsan Chiniforooshan

Theor. Comput. Sci., 2010

Rank-Based Attachment Leads to Power Law Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Chasing robbers on random graphs: Zigzag theorem.

[BibT_eX]

[DOI]

Tomasz Luczak

Random Struct. Algorithms, 2010

Investigating the Properties of a Social Bookmarking and Tagging Network.

[BibT_eX]

[DOI]

Int. J. Data Warehous. Min., 2010

Parallel cleaning of a network with brushes.

[BibT_eX]

[DOI]

Serge Gaspers

Discret. Appl. Math., 2010

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

[BibT_eX]

[DOI]

Contributions Discret. Math., 2010

When does a random graph have constant cop number?

[BibT_eX]

[DOI]

Australas. J Comb., 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

Estimating node similarity from co-citation in a spatial graph model.

[BibT_eX]

[DOI]

Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), 2010

2009

Protean graphs with a variety of ranking schemes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Clean the graph before you draw it!

[BibT_eX]

[DOI]

Serge Gaspers

Inf. Process. Lett., 2009

Models of Online Social Networks.

[BibT_eX]

[DOI]

Internet Math., 2009

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

[BibT_eX]

[DOI]

Discret. Math., 2009

Cleaning random graphs with brushes.

[BibT_eX]

[DOI]

Australas. J Comb., 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

2008

Cleaning a network with brushes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Cleaning Regular Graphs with Brushes.

[BibT_eX]

[DOI]

Noga Alon

SIAM J. Discret. Math., 2008

On-line Ramsey Numbers for Paths and Stars.

[BibT_eX]

[DOI]

Jaroslaw Grytczuk

Hal A. Kierstead

Discret. Math. Theor. Comput. Sci., 2008

The diameter of protean graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

R(3, 4)=17.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

A note on small on-line Ramsey numbers for paths and their generalization.

[BibT_eX]

[DOI]

Australas. J Comb., 2008

Protean Graphs with a Variety of Ranking Schemes.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2008

2007

Growing Protean Graphs.

[BibT_eX]

[DOI]

Internet Math., 2007

Pursuit-Evasion in Models of Complex Networks.

[BibT_eX]

[DOI]

Changping Wang

Internet 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

Search Algorithms for Unstructured Peer-to-Peer Networks.

[BibT_eX]

[DOI]

Reza Dorrigiv

Alejandro López-Ortiz

Proceedings of the 32nd Annual IEEE Conference on Local Computer Networks (LCN 2007), 2007

Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm.

[BibT_eX]

[DOI]

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

Vertex Pursuit Games in Stochastic Network Models.

[BibT_eX]

[DOI]

Changping Wang

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

2006

Protean Graphs.

[BibT_eX]

[DOI]

Tomasz Luczak