Pawel Pralat

According to our database1, Pawel Pralat authored at least 136 papers between 2006 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Perfect matchings and Hamiltonian cycles in the preferential attachment model.
Random Struct. Algorithms, 2019

2018
Burning number of graph products.
Theor. Comput. Sci., 2018

Subhypergraphs in non-uniform random hypergraphs.
Internet Mathematics, 2018

Randomly twisted hypercubes.
Eur. J. Comb., 2018

Size-Ramsey numbers of cycles versus a path.
Discrete Mathematics, 2018

The robot crawler graph process.
Discrete Applied Mathematics, 2018

Clustering Properties of Spatial Preferential Attachment Model.
CoRR, 2018

Note on the Multicolour Size-Ramsey Number for Paths, .
Electr. J. Comb., 2018

Small on-line Ramsey numbers - a new approach.
Contributions to Discrete Mathematics, 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. Discrete Math., 2017

Rainbow perfect matchings and Hamilton cycles in the random geometric graph.
Random Struct. Algorithms, 2017

Burning Graphs: A Probabilistic Perspective.
Graphs and Combinatorics, 2017

The Game of Overprescribed Cops and Robbers Played on Graphs.
Graphs and Combinatorics, 2017

Modularity in several random graph models.
Electronic Notes in Discrete Mathematics, 2017

The total acquisition number of the randomly weighted path.
Discussiones Mathematicae Graph Theory, 2017

The Total Acquisition Number of Random Geometric Graphs.
Electr. 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. Discrete Math., 2016

Meyniel's conjecture holds for random graphs.
Random Struct. Algorithms, 2016

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

Rainbow Arborescence in Random Digraphs.
Journal of Graph Theory, 2016

Nonuniform Distribution of Nodes in the Spatial Preferential Attachment Model.
Internet Mathematics, 2016

Special Issue on Algorithms and Models for the Web-Graph.
Internet Mathematics, 2016

Game brush number.
Discrete Applied Mathematics, 2016

The set chromatic number of random graphs.
Discrete Applied Mathematics, 2016

The game of Overprescribed Cops and Robbers played on graphs.
CoRR, 2016

The Bondage Number of Random Graphs.
Electr. J. Comb., 2016

The Total Acquisition Number of Random Graphs.
Electr. 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 Mathematics, 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.
Discrete Mathematics, 2015

An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths.
Combinatorics, Probability & Computing, 2015

Lazy Cops and Robbers on Hypercubes.
Combinatorics, Probability & Computing, 2015

Burning graphs - a probabilistic perspective.
CoRR, 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

On-line list colouring of random graphs.
CoRR, 2015

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

Containment Game Played on Random Graphs: Another Zig-Zag Theorem.
Electr. J. Comb., 2015

On-line List Colouring of Random Graphs.
Electr. J. Comb., 2015

Power of k Choices and Rainbow Spanning Trees in Random Graphs.
Electr. J. Comb., 2015

Chasing robbers on percolated random geometric graphs.
Contributions to Discrete Mathematics, 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 Mathematics, 2014

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

Independence densities of hypergraphs.
Eur. J. Comb., 2014

Toppling numbers of complete and random graphs.
Discrete Mathematics & Theoretical Computer Science, 2014

Elimination schemes and lattices.
Discrete Mathematics, 2014

Firefighting on square, hexagonal, and triangular grids.
Discrete Mathematics, 2014

Brushing without capacity restrictions.
Discrete Applied Mathematics, 2014

Chasing robbers on random geometric graphs - An alternative approach.
Discrete Applied Mathematics, 2014

The Role of Visibility in Pursuit / Evasion Games.
CoRR, 2014

The domination number of on-line social networks and random geometric graphs.
CoRR, 2014

Dimensionality of social networks using motifs and eigenvalues.
CoRR, 2014

On the Hyperbolicity of Random Graphs.
Electr. J. Comb., 2014

2013
Cops and invisible robbers: The cost of drunkenness.
Theor. Comput. Sci., 2013

Sparse Graphs Are Not Flammable.
SIAM J. Discrete Math., 2013

On the Maximum Density of Graphs with Unique-Path Labelings.
SIAM J. Discrete Math., 2013

Vertex-Pursuit in Random Directed Acyclic Graphs.
SIAM J. Discrete Math., 2013

Discovery of Nodal Attributes through a Rank-Based Model of Network Structure.
Internet Mathematics, 2013

Special Issue on Algorithms and Models for the Web Graph.
Internet Mathematics, 2013

Revolutionaries and Spies on Random Graphs.
Combinatorics, Probability & Computing, 2013

The capture time of the hypercube.
CoRR, 2013

Models of on-line social networks.
CoRR, 2013

The robber strikes back.
CoRR, 2013

A Note on the Acquaintance Time of Random Graphs.
Electr. J. Comb., 2013

The Capture Time of the Hypercube.
Electr. J. Comb., 2013

Metric Dimension for Random Graphs.
Electr. J. Comb., 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. Discrete Math., 2012

Geometric Protean Graphs.
Internet Mathematics, 2012

The first player wins the one-colour triangle avoidance game on 16 vertices.
Discussiones Mathematicae Graph Theory, 2012

Almost all cop-win graphs contain a universal vertex.
Discrete Mathematics, 2012

Cops and Invisible Robbers: the Cost of Drunkenness
CoRR, 2012

A Note On Off-Diagonal Small On-Line Ramsey Numbers For Paths.
Ars Comb., 2012

Some Typical Properties of the Spatial Preferred Attachment Model.
Proceedings of the Algorithms and Models for the Web Graph - 9th International Workshop, 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.
Journal of Graph Theory, 2011

Cleaning Random d-Regular Graphs with Brooms.
Graphs and Combinatorics, 2011

Cleaning with Brooms.
Graphs and Combinatorics, 2011

Connectivity threshold and recovery time in rank-based models for complex networks.
Discrete Mathematics, 2011

Modular Orientations of Random and Quasi-Random Regular Graphs.
Combinatorics, Probability & Computing, 2011

Geometric Graph Properties of the Spatial Preferred Attachment model
CoRR, 2011

Geometric protean graphs
CoRR, 2011

Some remarks on cops and drunk robbers
CoRR, 2011

On the threshold for k-regular subgraphs of random graphs.
Combinatorica, 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. Discrete Math., 2010

Chasing robbers on random graphs: Zigzag theorem.
Random Struct. Algorithms, 2010

Investigating the Properties of a Social Bookmarking and Tagging Network.
IJDWM, 2010

Parallel cleaning of a network with brushes.
Discrete Applied Mathematics, 2010

Bounds and constructions for n-e.c. tournaments.
Contributions to Discrete Mathematics, 2010

When does a random graph have constant cop number?
Australasian J. Combinatorics, 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

A geometric model for on-line social networks.
Proceedings of the International Workshop on Modeling Social Media, 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 Mathematics, 2009

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

Cleaning random graphs with brushes.
Australasian J. Combinatorics, 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. Discrete Math., 2008

A Spatial Web Graph Model with Local Influence Regions.
Internet Mathematics, 2008

On-line Ramsey Numbers for Paths and Stars.
Discrete Mathematics & Theoretical Computer Science, 2008

The diameter of protean graphs.
Discrete Mathematics, 2008

R(3, 4)=17.
Electr. J. Comb., 2008

A note on small on-line Ramsey numbers for paths and their generalization.
Australasian J. Combinatorics, 2008

Protean Graphs with a Variety of Ranking Schemes.
Proceedings of the Combinatorial Optimization and Applications, 2008

2007
Growing Protean Graphs.
Internet Mathematics, 2007

Pursuit-Evasion in Models of Complex Networks.
Internet Mathematics, 2007

A Spatial Web Graph Model with Local Influence Regions.
Proceedings of the Algorithms and Models for the Web-Graph, 5th International Workshop, 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 d-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
Protean Graphs.
Internet Mathematics, 2006


  Loading...