| Publication | Date of Publication | Type |
|---|
Self-similarity of communities of the ABCD model
Theoretical Computer Science | 2025-01-08 | Paper |
Linear colouring of binomial random graphs
Discrete Mathematics | 2024-12-02 | Paper |
Hypergraph artificial benchmark for community detection (h-ABCD)
Journal of Complex Networks | 2024-11-08 | Paper |
Unsupervised framework for evaluating and explaining structural node embeddings of graphs
Journal of Complex Networks | 2024-10-22 | Paper |
Performance of community detection algorithms supported by node embeddings
Journal of Complex Networks | 2024-10-22 | Paper |
Classification supported by community-aware node features
| 2024-10-18 | Paper |
The Erdős-Gyárfás function \(f(n, 4, 5) = \frac{5}{6} n + o(n)\) -- so Gyárfás was right
Journal of Combinatorial Theory. Series B | 2024-10-08 | Paper |
Subgraph games in the semi-random graph process and its generalization to hypergraphs
The Electronic Journal of Combinatorics | 2024-10-07 | Paper |
Cliques, chromatic number, and independent sets in the semi-random process
SIAM Journal on Discrete Mathematics | 2024-08-28 | Paper |
A fully adaptive strategy for Hamiltonian cycles in the semi-random graph process
| 2024-08-22 | Paper |
Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\)
SIAM Journal on Discrete Mathematics | 2024-03-14 | Paper |
Power of \(k\) choices in the semi-random graph process
The Electronic Journal of Combinatorics | 2024-02-19 | Paper |
SimpleHypergraphs.jl -- novel software framework for modelling and analysis of hypergraphs
Lecture Notes in Computer Science | 2024-02-16 | Paper |
Self-similarity of Communities of the ABCD Model
| 2023-11-30 | Paper |
Linear Colouring of Binomial Random Graphs
| 2023-11-14 | Paper |
Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than $2n$ Rounds
| 2023-11-09 | Paper |
Predicting Properties of Nodes via Community-Aware Features
| 2023-11-08 | Paper |
A variant of the Erdős–Rényi random graph process
Journal of Graph Theory | 2023-10-06 | Paper |
Modularity based community detection in hypergraphs
Lecture Notes in Computer Science | 2023-10-04 | Paper |
Asynchronous Majority Dynamics on Binomial Random Graphs
| 2023-09-09 | Paper |
Algorithms for \(p\)-Faulty Search on a half-line
Algorithmica | 2023-08-17 | Paper |
Edge and pair queries-random graphs and complexity
The Electronic Journal of Combinatorics | 2023-06-15 | Paper |
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process
| 2023-03-23 | Paper |
Modularity of the ABCD random graph model with community structure
Journal of Complex Networks | 2023-03-10 | Paper |
Clustering Properties of Spatial Preferential Attachment Model
Lecture Notes in Computer Science | 2023-03-09 | Paper |
Label propagation on binomial random graphs
| 2023-02-07 | Paper |
Artificial Benchmark for Community Detection with Outliers (ABCD+o)
| 2023-01-13 | Paper |
Localization game for random geometric graphs
European Journal of Combinatorics | 2022-12-01 | Paper |
Common adversaries form alliances: modelling complex networks via anti-transitivity
Lecture Notes in Computer Science | 2022-11-04 | Paper |
Endogenous differentiation of consumer preferences under quality uncertainty in a SPA network
Lecture Notes in Computer Science | 2022-11-04 | Paper |
Hypergraph Artificial Benchmark for Community Detection (h-ABCD)
| 2022-10-26 | Paper |
Almost all 9-regular graphs have a modulo-5 orientation
| 2022-10-21 | Paper |
A Scalable Unsupervised Framework for Comparing Graph Embeddings
Lecture Notes in Computer Science | 2022-10-14 | Paper |
Probabilistically faulty searching on a half-line (extended abstract)
| 2022-10-13 | Paper |
The Erd\H{o}s-Gy\'arf\'as function $f(n, 4, 5) = \frac 56 n + o(n)$ -- so Gy\'arf\'as was right
| 2022-07-06 | Paper |
Perfect matchings in the semirandom graph process
SIAM Journal on Discrete Mathematics | 2022-06-03 | Paper |
Broadcasting on paths and cycles
Discrete Mathematics | 2022-05-17 | Paper |
A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process
| 2022-05-04 | Paper |
Properties and Performance of the ABCDe Random Graph Model with Community Structure
| 2022-03-28 | Paper |
Makespan trade-offs for visiting triangle edges (extended abstract)
| 2022-03-22 | Paper |
Modularity of the ABCD Random Graph Model with Community Structure
| 2022-03-02 | Paper |
Tight bounds on probabilistic zero forcing on hypercubes and grids
The Electronic Journal of Combinatorics | 2022-02-01 | Paper |
An unsupervised framework for comparing graph embeddings
Journal of Complex Networks | 2022-01-19 | Paper |
Localization game for random graphs
Discrete Applied Mathematics | 2022-01-13 | Paper |
Mining complex networks
| 2021-11-08 | Paper |
Hamilton cycles in the semi-random graph process
European Journal of Combinatorics | 2021-10-28 | Paper |
The unit acquisition number of binomial random graphs
The Electronic Journal of Combinatorics | 2021-08-09 | Paper |
Local clustering coefficient of spatial preferential attachment model
Journal of Complex Networks | 2021-06-04 | Paper |
Some typical properties of the spatial preferred attachment model
Internet Mathematics | 2021-04-23 | Paper |
Nonuniform distribution of nodes in the spatial preferential attachment model
Internet Mathematics | 2021-03-26 | Paper |
On broadcasting time in the model of travelling agents
Discrete Applied Mathematics | 2021-03-25 | Paper |
Probabilistic zero forcing on random graphs
European Journal of Combinatorics | 2021-02-08 | Paper |
On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness
European Journal of Combinatorics | 2021-02-08 | Paper |
Zero-forcing in random regular graphs
Journal of Combinatorics | 2021-02-08 | Paper |
On the existence of Hamilton cycles with a periodic pattern in a random digraph
The Electronic Journal of Combinatorics | 2020-12-03 | Paper |
Tight Bounds on the Probabilistic Zero Forcing on Hypercubes and Grids
| 2020-11-30 | Paper |
Broadcasting on Paths and Cycles
| 2020-11-24 | Paper |
Almost all 5-regular graphs have a 3-flow
Journal of Graph Theory | 2020-05-21 | Paper |
On Broadcasting Time in the Model of Travelling Agents
| 2020-03-18 | Paper |
Meyniel's conjecture holds for random \(d\)-regular graphs
Random Structures & Algorithms | 2019-11-28 | Paper |
How many zombies are needed to catch the survivor on toroidal grids?
Theoretical Computer Science | 2019-10-16 | Paper |
Sub-trees of a random tree
Discrete Applied Mathematics | 2019-09-19 | Paper |
Clique coloring of binomial random graphs
Random Structures & Algorithms | 2019-08-14 | Paper |
Parallel execution of schedules with random dependency graph
Theoretical Computer Science | 2019-08-13 | Paper |
Perfect matchings and Hamiltonian cycles in the preferential attachment model
Random Structures & Algorithms | 2019-05-02 | Paper |
Small on-line Ramsey numbers -- a new approach
| 2019-03-05 | Paper |
Clique colourings of geometric graphs
The Electronic Journal of Combinatorics | 2019-03-05 | Paper |
Clustering coefficient of a spatial preferential attachment model
Doklady Mathematics | 2018-11-01 | Paper |
Modularity of complex networks models
| 2018-10-26 | Paper |
Clustering via Hypergraph Modularity
| 2018-10-10 | Paper |
Burning number of graph products
Theoretical Computer Science | 2018-09-27 | Paper |
Note on the multicolour size-Ramsey number for paths
The Electronic Journal of Combinatorics | 2018-09-07 | Paper |
The robot crawler graph process
Discrete Applied Mathematics | 2018-09-06 | Paper |
Size-Ramsey numbers of cycles versus a path
Discrete Mathematics | 2018-05-24 | Paper |
Randomly twisted hypercubes
European Journal of Combinatorics | 2018-04-25 | Paper |
Modularity in several random graph models
| 2018-01-18 | Paper |
Rainbow perfect matchings and Hamilton cycles in the random geometric graph
Random Structures & Algorithms | 2017-12-13 | Paper |
The total acquisition number of the randomly weighted path
Discussiones Mathematicae Graph Theory | 2017-10-13 | Paper |
The game of overprescribed Cops and Robbers played on graphs
Graphs and Combinatorics | 2017-10-11 | Paper |
An alternative proof of the linearity of the size-Ramsey number of paths
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
Lazy cops and robbers on hypercubes
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
Graph searching games and probabilistic methods
| 2017-09-19 | Paper |
On some multicolor Ramsey properties of random graphs
SIAM Journal on Discrete Mathematics | 2017-09-18 | Paper |
The total acquisition number of random geometric graphs
The Electronic Journal of Combinatorics | 2017-09-08 | Paper |
Strong-majority bootstrap percolation on regular graphs with low dissemination threshold
Stochastic Processes and their Applications | 2017-09-07 | Paper |
Burning graphs: a probabilistic perspective
Graphs and Combinatorics | 2017-08-10 | Paper |
Subhypergraphs in non-uniform random hypergraphs
| 2017-03-22 | Paper |
A probabilistic version of the game of zombies and survivors on graphs
Theoretical Computer Science | 2016-11-29 | Paper |
Lazy cops and robbers played on random graphs and graphs on surfaces
Journal of Combinatorics | 2016-11-22 | Paper |
Rainbow arborescence in random digraphs
Journal of Graph Theory | 2016-11-16 | Paper |
The set chromatic number of random graphs
Discrete Applied Mathematics | 2016-10-07 | Paper |
The total acquisition number of random graphs
The Electronic Journal of Combinatorics | 2016-07-06 | Paper |
Brushing with additional cleaning restrictions
Theoretical Computer Science | 2016-06-27 | Paper |
Game brush number
Discrete Applied Mathematics | 2016-06-01 | Paper |
The bondage number of random graphs
The Electronic Journal of Combinatorics | 2016-05-11 | Paper |
Acquaintance time of random graphs near connectivity threshold
SIAM Journal on Discrete Mathematics | 2016-04-07 | Paper |
To catch a falling robber
Theoretical Computer Science | 2016-04-01 | Paper |
Meyniel's conjecture holds for random graphs
Random Structures & Algorithms | 2016-03-22 | Paper |
The Robot Crawler Number of a Graph
Lecture Notes in Computer Science | 2016-01-08 | Paper |
The domination number of on-line social networks and random geometric graphs
Lecture Notes in Computer Science | 2015-09-30 | Paper |
scientific article; zbMATH DE number 6476716 (Why is no real title available?)
| 2015-08-28 | Paper |
On-line list colouring of random graphs
The Electronic Journal of Combinatorics | 2015-08-26 | Paper |
Bounds and constructions for \(n\)-e.c. tournaments
| 2015-07-24 | Paper |
Containment game played on random graphs: another zig-zag theorem
The Electronic Journal of Combinatorics | 2015-06-02 | Paper |
The acquaintance time of (percolated) random geometric graphs
European Journal of Combinatorics | 2015-06-02 | Paper |
Power of \(k\) choices and rainbow spanning trees in random graphs
The Electronic Journal of Combinatorics | 2015-02-19 | Paper |
Toppling numbers of complete and random graphs
| 2015-02-09 | Paper |
Asymmetric Distribution of Nodes in the Spatial Preferred Attachment Model
Lecture Notes in Computer Science | 2015-01-13 | Paper |
Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\)
Discrete Mathematics | 2014-11-07 | Paper |
Firefighting on square, hexagonal, and triangular grids
Discrete Mathematics | 2014-10-31 | Paper |
Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly
Graphs and Combinatorics | 2014-09-19 | Paper |
Chasing robbers on random geometric graphs-an alternative approach
Discrete Applied Mathematics | 2014-09-12 | Paper |
On the hyperbolicity of random graphs
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Independence densities of hypergraphs
European Journal of Combinatorics | 2014-08-28 | Paper |
A note on the acquaintance time of random graphs
The Electronic Journal of Combinatorics | 2014-08-14 | Paper |
Metric dimension for random graphs
The Electronic Journal of Combinatorics | 2014-08-14 | Paper |
Brushing without capacity restrictions
Discrete Applied Mathematics | 2014-05-06 | Paper |
Elimination schemes and lattices
Discrete Mathematics | 2014-05-06 | Paper |
Cops and robbers playing on edges
Journal of Combinatorics | 2014-04-30 | Paper |
Sparse graphs are not flammable
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
On the maximum density of graphs with unique-path labelings
SIAM Journal on Discrete Mathematics | 2014-01-21 | Paper |
A note on off-diagonal small on-line Ramsey numbers for paths.
Ars Combinatoria | 2013-12-06 | Paper |
Cops and invisible robbers: the cost of drunkenness
Theoretical Computer Science | 2013-11-29 | Paper |
Vertex-pursuit in random directed acyclic graphs
SIAM Journal on Discrete Mathematics | 2013-09-26 | Paper |
The robber strikes back
| 2013-08-13 | Paper |
Chipping away at the edges: how long does it take?
Journal of Combinatorics | 2013-07-12 | Paper |
Discovery of nodal attributes through a rank-based model of network structure
Internet Mathematics | 2013-06-28 | Paper |
The capture time of the hypercube
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
Revolutionaries and Spies on Random Graphs
Combinatorics, Probability and Computing | 2013-05-13 | Paper |
Broadcasting in conflict-aware multi-channel networks
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Emergence of segregation in evolving social networks
Proceedings of the National Academy of Sciences | 2013-02-02 | Paper |
Geometric graph properties of the spatial preferred attachment model
Advances in Applied Mathematics | 2013-01-18 | Paper |
Some remarks on cops and drunk robbers
Theoretical Computer Science | 2013-01-07 | Paper |
\textsc{polish} -- Let us play the cleaning game
Theoretical Computer Science | 2013-01-07 | Paper |
On the Maximum Density of Graphs with Good Edge-Labellings
| 2012-11-12 | Paper |
Cops and robber with constraints
SIAM Journal on Discrete Mathematics | 2012-09-12 | Paper |
The first player wins the one-colour triangle avoidance game on 16 vertices
Discussiones Mathematicae. Graph Theory | 2012-09-05 | Paper |
Geometric protean graphs
Internet Mathematics | 2012-08-29 | Paper |
Independence and chromatic densities of graphs
Journal of Combinatorics | 2012-08-28 | Paper |
Some Typical Properties of the Spatial Preferred Attachment Model
Lecture Notes in Computer Science | 2012-07-23 | Paper |
Vertex-Pursuit in Hierarchical Social Networks
Lecture Notes in Computer Science | 2012-07-16 | Paper |
Fighting constrained fires in graphs
Theoretical Computer Science | 2012-06-25 | Paper |
Almost all cop-win graphs contain a universal vertex
Discrete Mathematics | 2012-05-30 | Paper |
On the threshold for \(k\)-regular subgraphs of random graphs
Combinatorica | 2012-04-26 | Paper |
Models of online social networks
Internet Mathematics | 2012-04-18 | Paper |
Cleaning with brooms
Graphs and Combinatorics | 2012-01-24 | Paper |
Cleaning random \(d\)-regular graphs with brooms
Graphs and Combinatorics | 2012-01-24 | Paper |
An edge deletion model for complex networks
Theoretical Computer Science | 2011-10-10 | Paper |
Scale-free graphs of increasing degree
Random Structures & Algorithms | 2011-08-09 | Paper |
The search for the smallest 3-E.C. graphs
| 2011-07-06 | Paper |
Rank-based models of network structure and the discovery of content
Lecture Notes in Computer Science | 2011-06-08 | Paper |
A note on the one-colour avoidance game on graphs
| 2011-05-31 | Paper |
Connectivity threshold and recovery time in rank-based models for complex networks
Discrete Mathematics | 2011-05-16 | Paper |
Modular orientations of random and quasi-random regular graphs
Combinatorics, Probability and Computing | 2011-05-11 | Paper |
Rank-based attachment leads to power law graphs
SIAM Journal on Discrete Mathematics | 2011-04-15 | Paper |
Geodesics and almost geodesic cycles in random regular graphs
Journal of Graph Theory | 2011-03-07 | Paper |
Pursuit-evasion in models of complex networks
Internet Mathematics | 2011-02-28 | Paper |
A spatial web graph model with local influence regions
Internet Mathematics | 2011-02-28 | Paper |
The geometric protean model for on-line social networks
Algorithms and Models for the Web-Graph | 2011-01-21 | Paper |
Chasing robbers on random graphs: zigzag theorem
Random Structures & Algorithms | 2010-12-14 | Paper |
Cops and robbers from a distance
Theoretical Computer Science | 2010-11-11 | Paper |
Clean the graph before you draw it!
Information Processing Letters | 2010-08-16 | Paper |
On-line Ramsey numbers for paths and stars
| 2010-07-27 | Paper |
Graphs with the \(n\)-e.c. adjacency property constructed from resolvable designs
Journal of Combinatorial Designs | 2010-07-13 | Paper |
When does a random graph have constant cop number?
| 2010-06-07 | Paper |
Parallel cleaning of a network with brushes
Discrete Applied Mathematics | 2010-05-05 | Paper |
Cleaning regular graphs with brushes
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
The good, the bad, and the great: homomorphisms and cores of random graphs
Discrete Mathematics | 2009-12-15 | Paper |
Protean graphs with a variety of ranking schemes
Theoretical Computer Science | 2009-11-25 | Paper |
Growing Protean Graphs
Internet Mathematics | 2009-04-28 | Paper |
\(R(3,4)=17\)
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Cleaning random graphs with brushes
| 2009-03-16 | Paper |
A Dynamic Model for On-Line Social Networks
Algorithms and Models for the Web-Graph | 2009-02-10 | Paper |
Protean Graphs with a Variety of Ranking Schemes
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
The diameter of protean graphs
Discrete Mathematics | 2008-07-11 | Paper |
Cleaning a network with brushes
Theoretical Computer Science | 2008-06-24 | Paper |
Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm
Combinatorial and Algorithmic Aspects of Networking | 2008-04-15 | Paper |
Vertex Pursuit Games in Stochastic Network Models
Combinatorial and Algorithmic Aspects of Networking | 2008-04-15 | Paper |
A Spatial Web Graph Model with Local Influence Regions
Algorithms and Models for the Web-Graph | 2008-04-11 | Paper |
scientific article; zbMATH DE number 5247083 (Why is no real title available?)
| 2008-03-11 | Paper |
Protean Graphs
Internet Mathematics | 2007-04-19 | Paper |
Subgraph Games in the Semi-Random Graph Process and Its Generalization to Hypergraphs
| N/A | Paper |
Matchings and loose cycles in the semirandom hypergraph model
| N/A | Paper |
Burning Random Trees
| N/A | Paper |
