2024
Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\).
SIAM J. Discret. Math., March, 2024
Unsupervised framework for evaluating and explaining structural node embeddings of graphs.
J. Complex Networks, February, 2024
Power of $k$ Choices in the Semi-Random Graph Process.
Electron. J. Comb., 2024
2023
Detecting bots in social-networks using node and structural embeddings.
J. Big Data, December, 2023
Artificial benchmark for community detection with outliers (ABCD+o).
Appl. Netw. Sci., December, 2023
Algorithms for p-Faulty Search on a Half-Line.
Algorithmica, August, 2023
Hypergraph Artificial Benchmark for Community Detection (h-ABCD).
J. Complex Networks, June, 2023
Generative Methods for Social Media Analysis
Springer Briefs in Computer Science, Springer, ISBN: 978-3-031-33616-4, 2023
A variant of the Erdős-Rényi random graph process.
J. Graph Theory, 2023
Localization game for random geometric graphs.
Eur. J. Comb., 2023
Self-similarity of Communities of the ABCD Model.
CoRR, 2023
Linear Colouring of Binomial Random Graphs.
CoRR, 2023
Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than 2n Rounds.
CoRR, 2023
Predicting Properties of Nodes via Community-Aware Features.
CoRR, 2023
Asynchronous Majority Dynamics on Binomial Random Graphs.
CoRR, 2023
The Fagnano Triangle Patrolling Problem.
CoRR, 2023
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process.
CoRR, 2023
Label propagation on binomial random graphs.
CoRR, 2023
Edge and Pair Queries-Random Graphs and Complexity.
Electron. J. Comb., 2023
Modularity Based Community Detection in Hypergraphs.
Proceedings of the Algorithms and Models for the Web Graph - 18th International Workshop, 2023
Unsupervised Framework for Evaluating Structural Node Embeddings of Graphs.
Proceedings of the Algorithms and Models for the Web Graph - 18th International Workshop, 2023
The Fagnano Triangle Patrolling Problem (Extended Abstract).
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023
Classification Supported by Community-Aware Node Features.
Proceedings of the Complex Networks & Their Applications XII, 2023
2022
A multi-purposed unsupervised framework for comparing embeddings of undirected and directed graphs.
Netw. Sci., December, 2022
Modularity of the ABCD random graph model with community structure.
J. Complex Networks, October, 2022
Evaluating node embeddings of complex networks.
J. Complex Networks, June, 2022
Perfect Matchings in the Semirandom Graph Process.
SIAM J. Discret. Math., 2022
Hamilton cycles in the semi-random graph process.
Eur. J. Comb., 2022
Broadcasting on paths and cycles.
Discret. Math., 2022
Localization game for random graphs.
Discret. Appl. Math., 2022
Rainbow spanning trees in randomly coloured G<sub>k-out</sub>.
CoRR, 2022
Tight Bounds on Probabilistic Zero Forcing on Hypercubes and Grids.
Electron. J. Comb., 2022
Properties and Performance of the ABCDe Random Graph Model with Community Structure.
Big Data Res., 2022
Community Detection Supported by Node Embeddings (Searching for a Suitable Method).
Proceedings of the Complex Networks and Their Applications XI, 2022
Outliers in the ABCD Random Graph Model with Community Structure (ABCD+o).
Proceedings of the Complex Networks and Their Applications XI, 2022
A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process.
Proceedings of the Approximation, 2022
2021
Artificial Benchmark for Community Detection (ABCD) - Fast random graph model with community structure.
Netw. Sci., 2021
On-line size Ramsey number for monotone k-uniform ordered paths with uniform looseness.
Eur. J. Comb., 2021
Probabilistic zero forcing on random graphs.
Eur. J. Comb., 2021
On broadcasting time in the model of travelling agents.
Discret. Appl. Math., 2021
Survey of Generative Methods for Social Media Analysis.
CoRR, 2021
Perfect Matchings in the Semi-random Graph Process.
CoRR, 2021
Makespan Trade-offs for Visiting Triangle Edges.
CoRR, 2021
An unsupervised framework for comparing graph embeddings.
J. Complex Networks, 2021
The Unit Acquisition Number of Binomial Random Graphs.
Electron. J. Comb., 2021
Makespan Trade-Offs for Visiting Triangle Edges - (Extended Abstract).
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021
2020
Almost all 5-regular graphs have a 3-flow.
J. Graph Theory, 2020
<i>k</i>-regular subgraphs near the <i>k</i>-core threshold of a random graph.
J. Comb. Theory, Ser. B, 2020
Analyzing, Exploring, and Visualizing Complex Networks via Hypergraphs using SimpleHypergraphs.jl.
Internet Math., 2020
Probabilistically Faulty Searching on a Half-Line.
CoRR, 2020
On the Existence of Hamilton Cycles with a Periodic Pattern in a Random Digraph.
Electron. J. Comb., 2020
A Scalable Unsupervised Framework for Comparing Graph Embeddings.
Proceedings of the Algorithms and Models for the Web Graph - 17th International Workshop, 2020
Probabilistically Faulty Searching on a Half-Line - (Extended Abstract).
Proceedings of the LATIN 2020: Theoretical Informatics, 2020
Community Detection Algorithm Using Hypergraph Modularity.
Proceedings of the Complex Networks & Their Applications IX, 2020
2019
How many zombies are needed to catch the survivor on toroidal grids?
Theor. Comput. Sci., 2019
Parallel execution of schedules with random dependency graph.
Theor. Comput. Sci., 2019
Meyniel's conjecture holds for random d-regular graphs.
Random Struct. Algorithms, 2019
Clique coloring of binomial random graphs.
Random Struct. Algorithms, 2019
Perfect matchings and Hamiltonian cycles in the preferential attachment model.
Random Struct. Algorithms, 2019
Sub-trees of a random tree.
Discret. Appl. Math., 2019
SimpleHypergraphs.jl - Novel Software Framework for Modelling and Analysis of Hypergraphs.
Proceedings of the Algorithms and Models for the Web Graph - 16th International Workshop, 2019
2018
Burning number of graph products.
Theor. Comput. Sci., 2018
Subhypergraphs in non-uniform random hypergraphs.
Internet Math., 2018
Randomly twisted hypercubes.
Eur. J. Comb., 2018
Size-Ramsey numbers of cycles versus a path.
Discret. Math., 2018
The robot crawler graph process.
Discret. Appl. Math., 2018
Clique Colourings of Geometric Graphs.
Electron. J. Comb., 2018
Note on the Multicolour Size-Ramsey Number for Paths, .
Electron. J. Comb., 2018
Small on-line Ramsey numbers - a new approach.
Contributions Discret. Math., 2018
Clustering Properties of Spatial Preferential Attachment Model.
Proceedings of the Algorithms and Models for the Web Graph - 15th International Workshop, 2018
2017
On some Multicolor Ramsey Properties of Random Graphs.
SIAM J. Discret. Math., 2017
Rainbow perfect matchings and Hamilton cycles in the random geometric graph.
Random Struct. Algorithms, 2017
Burning Graphs: A Probabilistic Perspective.
Graphs Comb., 2017
The Game of Overprescribed Cops and Robbers Played on Graphs.
Graphs Comb., 2017
Modularity in several random graph models.
Electron. Notes Discret. Math., 2017
The total acquisition number of the randomly weighted path.
Discuss. Math. Graph Theory, 2017
The Total Acquisition Number of Random Geometric Graphs.
Electron. J. Comb., 2017
Endogenous Differentiation of Consumer Preferences Under Quality Uncertainty in a SPA Network.
Proceedings of the Algorithms and Models for the Web Graph - 14th International Workshop, 2017
Common Adversaries Form Alliances: Modelling Complex Networks via Anti-transitivity.
Proceedings of the Algorithms and Models for the Web Graph - 14th International Workshop, 2017
2016
To catch a falling robber.
Theor. Comput. Sci., 2016
A probabilistic version of the game of Zombies and Survivors on graphs.
Theor. Comput. Sci., 2016
Acquaintance Time of Random Graphs Near Connectivity Threshold.
SIAM J. Discret. Math., 2016
Meyniel's conjecture holds for random graphs.
Random Struct. Algorithms, 2016
Homophily, influence and the decay of segregation in self-organizing networks.
Netw. Sci., 2016
Rainbow Arborescence in Random Digraphs.
J. Graph Theory, 2016
Nonuniform Distribution of Nodes in the Spatial Preferential Attachment Model.
Internet Math., 2016
Discret. Appl. Math., 2016
The set chromatic number of random graphs.
Discret. Appl. Math., 2016
The Bondage Number of Random Graphs.
Electron. J. Comb., 2016
The Total Acquisition Number of Random Graphs.
Electron. J. Comb., 2016
Modularity of Complex Networks Models.
Proceedings of the Algorithms and Models for the Web Graph - 13th International Workshop, 2016
Subgraphs in Non-uniform Random Hypergraphs.
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.
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.
Internet Math., 2015
The acquaintance time of (percolated) random geometric graphs.
Eur. J. Comb., 2015
Almost all k-cop-win graphs contain a dominating set of cardinality k.
Discret. Math., 2015
An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths.
Comb. Probab. Comput., 2015
Lazy Cops and Robbers on Hypercubes.
Comb. Probab. Comput., 2015
Strong-majority bootstrap percolation on regular graphs with low dissemination threshold.
CoRR, 2015
Non-Uniform Distribution of Nodes in the Spatial Preferential Attachment Model.
CoRR, 2015
Containment Game Played on Random Graphs: Another Zig-Zag Theorem.
Electron. J. Comb., 2015
On-line List Colouring of Random Graphs.
Electron. J. Comb., 2015
Power of k Choices and Rainbow Spanning Trees in Random Graphs.
Electron. J. Comb., 2015
Chasing robbers on percolated random geometric graphs.
Contributions Discret. Math., 2015
The Robot Crawler Number of a Graph.
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.
Proceedings of the Theory and Applications of Models of Computation, 2015
Towards dynamic pricing for digital billboard advertising network in smart cities.
Proceedings of the IEEE First International Smart Cities Conference, 2015
2014
Brushing with additional cleaning restrictions.
Theor. Comput. Sci., 2014
The Role of Visibility in Pursuit/Evasion Games.
Robotics, 2014
Some Typical Properties of the Spatial Preferred Attachment Model.
Internet Math., 2014
Graphs with Average Degree Smaller Than $${\frac {30}{11}}$$ Burn Slowly.
Graphs Comb., 2014
Independence densities of hypergraphs.
Eur. J. Comb., 2014
Toppling numbers of complete and random graphs.
Discret. Math. Theor. Comput. Sci., 2014
Elimination schemes and lattices.
Discret. Math., 2014
Firefighting on square, hexagonal, and triangular grids.
Discret. Math., 2014
Brushing without capacity restrictions.
Discret. Appl. Math., 2014
Chasing robbers on random geometric graphs - An alternative approach.
Discret. Appl. Math., 2014
Dimensionality of social networks using motifs and eigenvalues.
CoRR, 2014
On the Hyperbolicity of Random Graphs.
Electron. J. Comb., 2014
2013
Cops and invisible robbers: The cost of drunkenness.
Theor. Comput. Sci., 2013
Sparse Graphs Are Not Flammable.
SIAM J. Discret. Math., 2013
On the Maximum Density of Graphs with Unique-Path Labelings.
SIAM J. Discret. Math., 2013
Vertex-Pursuit in Random Directed Acyclic Graphs.
SIAM J. Discret. Math., 2013
Discovery of Nodal Attributes through a Rank-Based Model of Network Structure.
Internet Math., 2013
Special Issue on Algorithms and Models for the Web Graph.
Internet Math., 2013
Revolutionaries and Spies on Random Graphs.
Comb. Probab. Comput., 2013
Models of on-line social networks.
CoRR, 2013
A Note on the Acquaintance Time of Random Graphs.
Electron. J. Comb., 2013
The Capture Time of the Hypercube.
Electron. J. Comb., 2013
Metric Dimension for Random Graphs.
Electron. J. Comb., 2013
Geometric graph properties of the spatial preferred attachment model.
Adv. Appl. Math., 2013
Asymmetric Distribution of Nodes in the Spatial Preferred Attachment Model.
Proceedings of the Algorithms and Models for the Web Graph - 10th International Workshop, 2013
Broadcasting in Conflict-Aware Multi-channel Networks.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013
2012
Some remarks on cops and drunk robbers.
Theor. Comput. Sci., 2012
polish - Let us play the cleaning game.
Theor. Comput. Sci., 2012
Fighting constrained fires in graphs.
Theor. Comput. Sci., 2012
Cops and Robber with Constraints.
SIAM J. Discret. Math., 2012
Geometric Protean Graphs.
Internet Math., 2012
The first player wins the one-colour triangle avoidance game on 16 vertices.
Discuss. Math. Graph Theory, 2012
Almost all cop-win graphs contain a universal vertex.
Discret. Math., 2012
A Note On Off-Diagonal Small On-Line Ramsey Numbers For Paths.
Ars Comb., 2012
Vertex-Pursuit in Hierarchical Social Networks.
Proceedings of the Theory and Applications of Models of Computation, 2012
2011
An edge deletion model for complex networks.
Theor. Comput. Sci., 2011
Scale-free graphs of increasing degree.
Random Struct. Algorithms, 2011
Geodesics and almost geodesic cycles in random regular graphs.
J. Graph Theory, 2011
Cleaning Random <i>d</i>-Regular Graphs with Brooms.
Graphs Comb., 2011
Connectivity threshold and recovery time in rank-based models for complex networks.
Discret. Math., 2011
Modular Orientations of Random and Quasi-Random Regular Graphs.
Comb. Probab. Comput., 2011
On the threshold for k-regular subgraphs of random graphs.
Comb., 2011
Rank-Based Models of Network Structure and the Discovery of Content.
Proceedings of the Algorithms and Models for the Web Graph - 8th International Workshop, 2011
2010
Cops and Robbers from a distance.
Theor. Comput. Sci., 2010
Rank-Based Attachment Leads to Power Law Graphs.
SIAM J. Discret. Math., 2010
Chasing robbers on random graphs: Zigzag theorem.
Random Struct. Algorithms, 2010
Investigating the Properties of a Social Bookmarking and Tagging Network.
Int. J. Data Warehous. Min., 2010
Parallel cleaning of a network with brushes.
Discret. Appl. Math., 2010
Bounds and constructions for n-e.c. tournaments.
Contributions Discret. Math., 2010
When does a random graph have constant cop number?
Australas. J Comb., 2010
A Geometric Model for On-line Social Networks.
Proceedings of the 3rd Workshop on Online Social Networks, 2010
The Geometric Protean Model for On-Line Social Networks.
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.
Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), 2010
2009
Protean graphs with a variety of ranking schemes.
Theor. Comput. Sci., 2009
Clean the graph before you draw it!
Inf. Process. Lett., 2009
Models of Online Social Networks.
Internet Math., 2009
The good, the bad, and the great: Homomorphisms and cores of random graphs.
Discret. Math., 2009
Cleaning random graphs with brushes.
Australas. J Comb., 2009
A Dynamic Model for On-Line Social Networks.
Proceedings of the Algorithms and Models for the Web-Graph, 6th International Workshop, 2009
2008
Cleaning a network with brushes.
Theor. Comput. Sci., 2008
Cleaning Regular Graphs with Brushes.
SIAM J. Discret. Math., 2008
A Spatial Web Graph Model with Local Influence Regions.
Internet Math., 2008
On-line Ramsey Numbers for Paths and Stars.
Discret. Math. Theor. Comput. Sci., 2008
The diameter of protean graphs.
Discret. Math., 2008
A note on small on-line Ramsey numbers for paths and their generalization.
Australas. J Comb., 2008
Protean Graphs with a Variety of Ranking Schemes.
Proceedings of the Combinatorial Optimization and Applications, 2008
2007
Pursuit-Evasion in Models of Complex Networks.
Internet Math., 2007
Search Algorithms for Unstructured Peer-to-Peer Networks.
Proceedings of the 32nd Annual IEEE Conference on Local Computer Networks (LCN 2007), 2007
Cleaning Random <i>d</i>-Regular Graphs with Brushes Using a Degree-Greedy Algorithm.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007
Vertex Pursuit Games in Stochastic Network Models.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007
2006
