I Pawel Pralat - home page

Research Area: Modelling and Mining Complex Networks

Currently, we experience a rapid growth of research done in the intersection of mining and modelling of social networks. My research program concentrates on problems from this intersection related to random graphs.

There are two main reasons to include random graph models in mining complex networks:

  • Synthetic models. Many important algorithms (such as community detection algorithms) are unsupervised in nature. Moreover, despite the fact that the research community gets better with exchanging datasets (see, for example, Stanford Large Network Dataset Collection) there are still very few publicly available networks with known underlying structure, the so-called ground truth. Hence, to test, benchmark, and properly tune unsupervised algorithms, one may use random graphs to produce synthetic "playground": graphs with known ground truth (such as the community structure in the context of community detection algorithms).
  • Null models. Null­-model is a random object that matches one specific property P of a given object but is otherwise taken, unbiasedly, at random from the family of objects that have property P. As a result, the null-models can be used to test whether a given object exhibits some "surprising" property that is not expected on the basis of chance alone or as an implication of the fact that the object has property P.

It is expected that both applications of random graphs will continue to gain their importance. My experience with industrial projects allows me to identify missing tools and algorithms that are of interest to the practitioners. On the other hand, my pure research background allows me to better understand processes that shape self-organizing complex networks and, as a result, to be better prepared to design efficient algorithms that work on data collected from real-world applications.


Research Support

Total amount received: $3,989,220
Total amount received for research: $3,661,000
Total amount received for service: $328,220

Since I moved to Toronto Metropolitan University (2011), my research was supported by the following grants:

  • $90,000, 2024-25, Graph-Driven Strategic Intelligence: Innovations in Forecasting, Delisting, and Marketing Optimization (Mitacs Accelerate Umbrella Award with Unilever Canada)
  • $6,000, 2024, Classical and Structural Embeddings of Networks and Their Applications in Various ML Tasks (Mitacs Globalink Research Award)
  • $194,000, 2022-24, Modelling and Mining Complex Networks as Hypergraphs (NSERC Alliance International Collaboration Grant)
  • $212,500, 2023-24, Modelling and Mining Complex Networks as Hypergraphs (Tutte Institute for Mathematics and Computing complemented with Fields Institute)
  • $100,000, NAWA - Machine learning models and tools for mining complex networks; part of a larger, $570,000 project: Scientific and educational cooperation between SHG Warsaw School of Economics and its partners — applications in data analytics (Polish National Agency for Academic Exchange, International Academic Partnerships), co-PI
  • $205,000, 2022-27, Modelling and Mining Complex Networks (NSERC Discovery)
  • $100,000, 2021-22, Detecting and Responding to Hostile Information Activities: unsupervised methods for measuring the quality of graph embeddings (Canadian Department of National Defense project with Patagona Technologies)
  • $50,000, 2020-21, COVID-19: Agent-based framework for modelling pandemics in urban environment (NSERC Alliance with Security Compass, complemented with SOSCIP COVID-19 Response Program)
  • $6,000, 2020, Embedding Complex Networks (Mitacs Research Training Award)
  • $15,000, 2019, Improved transductive regression using interconnected data (Mitacs Accelerate with Tesseraqt Optimization Inc)
  • $1,171,000, 2018-2020, Secure and Smart Connected Cars (NXM Technologies and Fields–CQAM) and Quantum-Resistance and Efficiency of Communications in Connected and Autonomous Vehicles (NXM Technologies and NSERC CRD), co-PI
  • $25,000, 2018-19, Online Detection of Users' Anomalous Activities on Confidential File Sharing Platform (NSERC Engage with TitanFile)
  • $175,000, NAWA - Hypergraphs theory and their applications in modelling social and economic systems; part of a larger, $700,000 project: Strengthening and development of scientific and educational cooperation between SHG Warsaw School of Economics and its partners (Polish National Agency for Academic Exchange, International Academic Partnerships), co-PI
  • $25,000, 2018-19, Automatic Personality Insights from Speech (OCE, Voucher for Innovation and Productivity with IMC Business Architecture)
  • $160,000, 2018-20, Computational Methods in Industrial Mathematics (Fields--CQAM Lab, The Fields Institute)
  • $25,000, 2018, Agent-based simulation modelling of out-of-home advertising viewing opportunity (OCE, Voucher for Innovation and Productivity with Environics Analytics)
  • $25,000, 2017, Cognitive Claims AI (NSERC Engage with IMC Business Architecture)
  • $5,600, 2017, Research visit to Nice, France (Nice, Labex)
  • $115,000, 2017-2022, Modelling and Mining Complex Networks (NSERC Discovery)
  • $25,000, 2016-17, Modelling of Homophily and Social Influence via Random Graphs (NSERC Engage with Alcatel-Lucent)
  • $4,500, 2016, Modelling Complex Networks Using Hypergraphs (NSERC USRA)
  • $25,000, 2015-16, Relationship Mapping Analytics for Fundraising and Sales Prospect Research (NSERC Engage with Charter Press Ltd.)
  • $99,600, 2015-16, Hypergraph Theory and Applications (The Tutte Institute for Mathematics and Computing)
  • $4,500, 2015, Complex Networks and Modelling of Social Learning (NSERC USRA)
  • $57,500, 2014-15, Web Visitor Engagement Measurement and Maximization (OCE Talent Edge Fellowship Program with The Globe and Mail)
  • $25,000, 2014-15, Utilizing big data for business-to-business matching and recommendation system (NSERC Engage with ComLinked Corp.)
  • $25,000, 2014, A self-organizing dynamic network model increasing the efficiency of outdoor digital billboards (NSERC Engage with KEEN Projection Media Ltd. (KPM))
  • $25,000, 2014, Exploiting Big Data for Customized Online News Recommendation System (NSERC Engage with The Globe and Mail)
  • $25,000, 2013-14, Personalized Mobile Recommender System (NSERC Engage with BlackBerry)
  • $1,500, 2013, Travel grant (Office for Science and Technology of the Embassy of France in Canada)
  • $25,000, 2012-13, Intelligent Rating System (NSERC Engage with Mako)
  • $25,000, 2012, Dynamic clustering and prediction of taxi service demand (NSERC Engage with Winston)
  • $100,000, 2012-2017, Modelling and Searching Networks (NSERC Discovery)
  • $5,000 2011-2012, Modelling and Mining of Network Information Spaces (MPrime)
  • since 2011, Various Internal Grants (Ryerson)

In the past, I used to receive support from MITACS, National Security Agency, SUN/ACEnet, and West Virginia University.


Refereed Publications

    Books

  1. S. Matwin, A. Milios, P. Pralat, A. Soares, and F. Theberge, Generative Methods for Social Media Analysis, SpringerBriefs in Computer Science, Springer, 2023.
  2. B. Kaminski, P. Pralat, and F. Theberge, Mining Complex Networks, CRC Press, 2021.
  3. B. Kaminski and P. Pralat, Train Your Brain---Challenging Yet Elementary Mathematics, CRC Press, 2020.
  4. A. Bonato and P. Pralat, Graph Searching Games and Probabilistic Methods, CRC Press, 2017.
  5. Book Chapters

  6. B. Kaminski and P. Pralat, Mathematical Foundations of Decision Trees; in Modeling Decision Trees with SilverDecisions by B. Kamiński, M. Jakubczyk, and P. Szufel, SGH Publishing House, Warsaw, 2022.
  7. Volumes Edited

  8. M. Dewar, B. Kaminski, D. Kaszynski, L. Krainski, P. Pralat, F. Theberge, and M. Wrzosek (eds.), Proceedings of the 19th Workshop on Modelling and Mining Networks (WAW 2024), Lecture Notes in Computer Science 14671, Springer, 2024.
  9. M. Dewar, P. Pralat, P. Szufel, F. Theberge, and M. Wrzosek (eds.), Proceedings of the 18th Workshop on Algorithms and Models for the Web Graph (WAW 2023), Lecture Notes in Computer Science 13894, Springer, 2023.
  10. B. Kaminski, P. Pralat, and P. Szufel (eds.), Proceedings of the 17th Workshop on Algorithms and Models for the Web Graph (WAW 2020), Lecture Notes in Computer Science 12091, Springer, 2020.
  11. K. Avrachenkov, P. Pralat, and N. Ye (eds.), Proceedings of the 16th Workshop on Algorithms and Models for the Web Graph (WAW 2019), Lecture Notes in Computer Science 11631, Springer, 2019.
  12. A. Bonato, P. Pralat, and A. Raigorodskii (eds.), Proceedings of the 15th Workshop on Algorithms and Models for the Web Graph (WAW 2018), Lecture Notes in Computer Science 10836, Springer, 2018.
  13. A. Bonato, F. Chung Graham, and P. Pralat (eds.), Proceedings of the 14th Workshop on Algorithms and Models for the Web Graph (WAW 2017), Lecture Notes in Computer Science 10519, Springer, 2017.
  14. A. Bonato, F. Chung Graham, and P. Pralat (eds.), Proceedings of the 13th Workshop on Algorithms and Models for the Web Graph (WAW 2016), Lecture Notes in Computer Science 10088, Springer, 2016.
  15. A. Bonato, F. Chung Graham, and P. Pralat (eds.), Proceedings of the 11th Workshop on Algorithms and Models for the Web Graph (WAW 2014), Lecture Notes in Computer Science 8882, Springer, 2014.
  16. A. Bonato, M. Mitzenmacher, and P. Pralat (eds.), Proceedings of the 10th Workshop on Algorithms and Models for the Web Graph (WAW 2013), Lecture Notes in Computer Science 8305, Springer, 2013.
  17. A. Frieze, P. Horn, and P. Pralat (eds.), Proceedings of the 8th Workshop on Algorithms and Models for the Web Graph (WAW 2011), Lecture Notes in Computer Science 6732, Springer, 2011.
  18. J. Janssen and P. Pralat (eds.), Proceedings of the 4th Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN2007), Lecture Notes in Computer Science 4852, Springer, 2007.
  19. Submitted Papers

  20. L. Devroye, A. Eide, and P. Pralat, Burning Random Trees, Electronic Communications in Probability, 11pp.
  21. J. Barrett, B. Kaminski, P. Pralat, and F. Theberge, Self-similarity of Communities of the ABCD Model, Discrete Applied Mathematics, 29pp.
  22. M. Molloy, P. Pralat, and G. Sorkin, Matchings and loose cycles in the semirandom hypergraph model, Random Structures and Algorithms, 20pp.
  23. B. Pakratz, B. Kaminski, and P. Pralat, Performance of Community Detection Algorithms Supported by Node Embeddings, Journal of Complex Networks, 27pp.
  24. A. Eide and P. Pralat, Linear Colouring of Binomial Random Graphs, Discrete Mathematics, 15pp.
  25. A. Frieze, P. Gao, C. MacRury, P. Pralat, and G. Sorkin, Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than 2n Rounds, European Journal of Combinatorics, 28pp.
  26. B. Kaminski, P. Pralat, F. Theberge, and S. Zajac, Predicting Properties of Nodes via Community-Aware Features, Social Network Analysis and Mining, 26pp.
  27. D. Mohan and P. Pralat, Asynchronous Majority Dynamics on Binomial Random Graphs, Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP 2024), 26pp.
  28. M. Antosiewicz, P. Szufel, A. Skorupka, B. Kaminski, P. Pralat, and A. Mashatan, Clustering Problem in Self-Organizing Networks on the Example of Smart Vehicle Transportation System, EURO Journal on Transportation and Logistics, 28pp.
  29. M. Opalski, P. Szufel, B. Kaminski, A. Mashatan, and P. Pralat, Optimal roadworks schedule in multi-agent transportation models, European Journal of Transport and Infrastructure Research, 18pp.
  30. D. Gamarnik, M. Kang, and P. Pralat, Cliques, Chromatic Number, and Independent Sets in the Semi-random Process, SIAM Journal on Discrete Mathematics, 21pp.
  31. M. Kiwi, L. Lichev, D. Mitsche, and P. Pralat, Label propagation on binomial random graphs, Electronic Journal of Probability, 36pp.
  32. M. Delcourt, R. Huq, and P. Pralat, Almost all 9-regular graphs have a modulo-5 orientation, Electronic Journal of Combinatorics, 18pp (Maple worksheets).
  33. P. Bennett, R. Cushman, A. Dudek, and P. Pralat, The Erdos-Gyarfas function f(n,4,5) = 5n/6 + o(n) --- so Gyarfas was right, Journal of Combinatorial Theory, Series B, 35pp.
  34. K. Georgiou, S. Kundu, and P. Pralat, Makespan Trade-offs for Visiting Triangle Edges, Discrete Mathematics & Theoretical Computer Science, 47pp.
  35. N.C. Behague, T. Marbach, P. Pralat, and A. Rucinski, Subgraph Games in the Semi-Random Graph Process and Its Generalization to Hypergraphs, Electronic Journal of Combinatorics, 18pp.
  36. Accepted Papers

  37. C. MacRury, N. Polituchyi, P. Pralat, K. Siuta, and P. Szufel, Optimizing transport frequency in multi-layered urban transportation networks for pandemic prevention, Public Transport, 32pp.
  38. N. Arnosti, B. Kaminski, P. Pralat, and M. Zawisza, Impact of Market Design and Trading Network Structure on Market Efficiency, Proceedings of the 19th Workshop on Modelling and Mining Networks (WAW 2024), 15pp.
  39. A. Dehghan, P. Pralat, and F. Theberge, Network Embedding Exploration Tool (NEExT), Proceedings of the 19th Workshop on Modelling and Mining Networks (WAW 2024), 15pp.
  40. J. Barrett, B. Kaminski, P. Pralat, and F. Theberge, Self-similarity of Communities of the ABCD Model, Proceedings of the 19th Workshop on Modelling and Mining Networks (WAW 2024), 15pp.
  41. 2024

  42. B. Kaminski, P. Pralat, F. Theberge, and S. Zajac, Classification Supported by Community-Aware Node Features, Proceedings of the 12th International Conference on Complex Networks and their Applications, Studies in Computational Intelligence 1142, Springer, 2024, 133-145.
  43. D. Bal, A. Frieze, and P. Pralat, Rainbow spanning trees in randomly coloured G_{k-out}, SIAM Journal on Discrete Mathematics 38(1) (2024), 867-882.
  44. A. Dehghan, K. Siuta, A. Skorupka, A. Betlen, D. Miller, B. Kaminski, and P. Pralat, Unsupervised Framework for Evaluating and Explaining Structural Node Embeddings of Graphs, Journal of Complex Networks 12(2) (2024), cnae003.
  45. P. Pralat and H. Singh, Power of k Choices in the Semi-Random Graph Process, Electronic Journal of Combinatorics 31(1) (2024), #P1.11 (Maple worksheets).
  46. 2023

  47. K. Georgiou, S. Kundu, and P. Pralat, The Fagnano Triangle Patrolling Problem, Proceedings of the 25th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2023), Lecture Notes in Computer Science 14310, Springer, 2023, 157-171.
  48. B. Kaminski, P. Pralat, and F. Theberge, Hypergraph Artificial Benchmark for Community Detection (h-ABCD), Journal of Complex Networks 11(4) (2023), cnad028.
  49. A. Bonato, K. Georgiou, C. MacRury, and P. Pralat, Probabilistically Faulty Searching on a Half-Line, Algorithmica 85 (2023), 2485-2514.
  50. A. Dehghan, K. Siuta, A. Skorupka, A. Dubey, A. Betlen, D. Miller, W. Xu, B. Kaminski, and P. Pralat, Detecting Bots in Social-Networks Using Node and Structural Embeddings, Journal of Big Data 10 (2023), 119.
  51. D. Dereniowski, P. Gordinowicz, and P. Pralat, Edge and Pair Queries---Random Graphs and Complexity, Electronic Journal of Combinatorics 30(2) (2023), #P2.34.
  52. B. Kaminski, P. Pralat, and F. Theberge, Artificial Benchmark for Community Detection with Outliers (ABCD+o), Applied Network Science 8 (2023), 25.
  53. B. Kaminski, P. Misiorek, P. Pralat, and F. Theberge, Modularity Based Community Detection in Hypergraphs, Proceedings of the 18th Workshop on Algorithms and Models for the Web Graph (WAW 2023), Lecture Notes in Computer Science 13894, Springer, 2023, 52-67.
  54. A. Dehghan, K. Siuta, A. Skorupka, A. Betlen, D. Miller, B. Kaminski, and P. Pralat, Unsupervised Framework for Evaluating Structural Node Embeddings of Graphs, Proceedings of the 18th Workshop on Algorithms and Models for the Web Graph (WAW 2023), Lecture Notes in Computer Science 13894, Springer, 2023, 36-51.
  55. B. Pankratz, B. Kaminski, and P. Pralat, Community Detection Supported by Node Embeddings (Searching For a Suitable Method), Proceedings of the 11th International Conference on Complex Networks and their Applications, Studies in Computational Intelligence 1078, Springer, 2023, 221-232.
  56. B. Kaminski, P. Pralat, and F. Theberge, Outliers in the ABCD Random Graph Model with Community Structure (ABCD+o), Proceedings of the 11th International Conference on Complex Networks and their Applications, Studies in Computational Intelligence 1078, Springer, 2023, 163-174.
  57. B. Kaminski, B. Pankratz, P. Pralat, and F. Theberge, Modularity of the ABCD Random Graph Model with Community Structure, Proceedings of the 11th International Conference on Complex Networks and their Applications, Studies in Computational Intelligence 1078, Springer, 2023, 3-15.
  58. L. Lichev, D. Mitsche, and P. Pralat, Localization Game for Random Geometric Graphs, European Journal of Combinatorics 108 (2023), 103616.
  59. A. Logan, M. Molloy, and P. Pralat, A variant of the Erdos-Renyi random graph process, Journal of Graph Theory 102(2) (2023), 322-345.
  60. 2022

  61. B. Kaminski, L. Krainski, P. Pralat, and F. Theberge, A Multi-purposed Unsupervised Framework for Comparing Embeddings of Undirected and Directed Graphs, Network Science 10(4) (2022), 323-346.
  62. B. Kaminski, B. Pankratz, P. Pralat, and F. Theberge, Modularity of the ABCD Random Graph Model with Community Structure, Journal of Complex Networks 10(6) (2022), cnac050.
  63. B. Kaminski, T. Olczak, B. Pankratz, P. Pralat, and F. Theberge, Properties and Performance of the ABCDe Random Graph Model with Community Structure, Big Data Research 30 (2022), 100348.
  64. P. Gao, C. MacRury, and P. Pralat, A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process, Proceedings of the 26th International Conference on Randomization and Computation (RANDOM 2022), Leibniz International Proceedings in Informatics (LIPIcs) 245, Schloss Dagstuhl, 2022, 29:1--29:22 (Julia programs).
  65. A. Dehghan-Kooshkghazi, B. Kaminski, L. Krainski, P. Pralat, and F. Theberge, Evaluating Node Embeddings of Complex Networks, Journal of Complex Networks 10(4) (2022), cnac030.
  66. A. Dehghan, K. Siuta, A. Skorupka, A. Dubey, A. Betlen, D. Miller, W. Xu, B. Kaminski, and P. Pralat, Detecting Bots in Social-Networks Using Node and Structural Embeddings, Proceedings of the 11th International Conference on Data Science, Technology and Applications (DATA 2022), (2022), 50--61.
  67. P. Gao, C. MacRury, and P. Pralat, Perfect Matchings in the Semi-random Graph Process, SIAM Journal on Discrete Mathematics 36(2) (2022), 1274-1290 (Maple worksheets).
  68. P. Szufel, B. Pankratz, A. Szczurek, B. Kaminski, and P. Pralat, Vehicle Routing Simulation for Prediction of Commuter's Behaviour, Journal of Advanced Transportation Volume 2022, Article ID 1604303 (2022), 17 pages.
  69. R. Huq and P. Pralat, Broadcasting on Paths and Cycles, Discrete Mathematics 345 (2022), 112883.
  70. N.C. Behague, T. Marbach, and P. Pralat, Tight Bounds on Probabilistic Zero Forcing on Hypercubes and Grids, Electronic Journal of Combinatorics 29(1) (2022), #P1.3 (Julia programs).
  71. A. Dudek, S. English, A. Frieze, C. MacRury, and P. Pralat, Localization Game for Random Graphs, Discrete Applied Mathematics 309 (2022), 202-214.
  72. P. Gao, B. Kaminski, C. MacRury, and P. Pralat, Hamilton Cycles in the Semi-random Graph Process, European Journal of Combinatorics 99 (2022), 103423 (Maple/Julia worksheets).
  73. 2021

  74. K. Georgiou, S. Kundu, and P. Pralat, The Unit Acquisition Number of Binomial Random Graphs, Electronic Journal of Combinatorics 28(3) (2021), #P3.34.
  75. K. Georgiou, S. Kundu, and P. Pralat, Makespan Trade-offs for Visiting Triangle Edges, Proceedings of the 32nd International Workshop on Combinatorial Algorithms (IWOCA 2021), Lecture Notes in Computer Science 12757, Springer, 2021, 340-355 (long version).
  76. B. Kaminski, P. Pralat, and F. Theberge, Artificial Benchmark for Community Detection (ABCD) --- Fast Random Graph Model with Community Structure, Network Science 9(2) (2021), 153-178.
  77. J. Filipowski, B. Kaminski, A. Mashatan, P. Pralat, and P. Szufel, Optimization of the cost of urban traffic through an online bidding platform for commuters, Economics of Transportation, 25 (2021), 100208.
  78. D. Bal, P. Bennett, S. English, C. MacRury, and P. Pralat, Zero Forcing Number of Random Regular Graphs, Journal of Combinatorics 12(1) (2021), 85-116 (Maple/Julia worksheet).
  79. R. Huq, B. Kaminski, A. Mashatan, P. Pralat, and P. Szufel, On Broadcasting Time in the Model of Travelling Agents, Discrete Applied Mathematics 291 (2021), 246-263.
  80. B. Kaminski, P. Pralat, and F. Theberge, Community Detection Algorithm Using Hypergraph Modularity, Proceedings of the 9th International Conference on Complex Networks and their Applications, Studies in Computational Intelligence 943, Springer, 2021, 152-163.
  81. X. Perez-Gimenez, P. Pralat, and D. West, On-line size Ramsey number for monotone k-uniform ordered paths with uniform looseness, European Journal of Combinatorics 92 (2021), 103242.
  82. S. English, C. MacRury, and P. Pralat, Probabilistic Zero Forcing on Random Graphs, European Journal of Combinatorics 91 (2021), 103207.
  83. 2020

  84. B. Kaminski, P. Pralat, and F. Theberge, An Unsupervised Framework for Comparing Graph Embeddings, Journal of Complex Networks 8(5) (2020), cnz043.
  85. A. Bonato, K. Georgiou, C. MacRury, and P. Pralat, Probabilistically Faulty Searching on a Half-Line, Proceedings of the 14th Latin American Theoretical Informatics Symposium (LATIN 2021), Lecture Notes in Computer Science 12118, Springer, 2020, 168-180.
  86. A. Frieze, X. Perez-Gimenez, and P. Pralat, On the existence of Hamilton cycles with a periodic pattern in a random digraph, Electronic Journal of Combinatorics 27(4) (2020), #P4.30.
  87. B. Kaminski, P. Pralat, and F. Theberge, A Scalable Unsupervised Framework for Comparing Graph Embeddings, Proceedings of the 17th Workshop on Algorithms and Models for the Web Graph (WAW 2020), Lecture Notes in Computer Science 12091, Springer, 2020, 52-67 (unpublished, long version).
  88. A. Antelmi, G. Cordasco, B. Kaminski, P. Pralat, V. Scarano, C. Spagnuolo, and P. Szufel, Analyzing, Exploring, and Visualizing Complex Networks via Hypergraphs using SimpleHypergraphs.jl, Internet Mathematics (2020), 32pp.
  89. L. Iskhakov, B. Kaminski, M. Mironov, L. Ostroumova Prokhorenkova, and P. Pralat, Local Clustering Coefficient of Spatial Preferential Attachment Model, Journal of Complex Networks 8(1) (2020), cnz019.
  90. D. Mitsche, M. Molloy, and P. Pralat, k-regular subgraphs near the k-core threshold of a random graph, Journal of Combinatorial Theory, Series B 142 (2020), 106-143.
  91. B. Kaminski, L. Krainski, A. Mashatan, P. Pralat, and P. Szufel, Multi-agent routing simulation with partial smart vehicles penetration, Journal of Advanced Transportation, Volume 2020, Article ID 3152020 (2020), 11 pages.
  92. P. Pralat and N. Wormald, Almost all 5-regular graphs have a 3-flow, Journal of Graph Theory 93(2) (2020), 147-156.
  93. 2019

  94. B. Kaminski, V. Poulin, P. Pralat, P. Szufel, and F. Theberge, Clustering via Hypergraph Modularity, PLoS ONE 14(11): e0224307 (GitHub gist repository).
  95. P. Pralat, How many zombies are needed to catch the survivor on toroidal grids?, Theoretical Computer Science 794 (2019), 3-11.
  96. B. Kaminski and P. Pralat, Subtrees of a random tree, Discrete Applied Mathematics 268 (2019), 119-129.
  97. P. Pralat and N. Wormald, Meyniel's conjecture holds for random d-regular graphs, Random Structures and Algorithms 55(3) (2019), 719-741.
  98. A. Antelmi, G. Cordasco, B. Kaminski, P. Pralat, V. Scarano, C. Spagnuolo, and P. Szufel, SimpleHypergraphs.jl --- Novel Software Framework for Modelling and Analysis of Hypergraphs, Proceedings of the 16th Workshop on Algorithms and Models for the Web Graph (WAW 2019), Lecture Notes in Computer Science 11631, Springer, 2019, 115-129.
  99. B. Kaminski, T. Olczak, and P. Pralat, Parallel Execution of Schedules with Random Dependency Graph, Theoretical Computer Science 784 (2019), 113-132.
  100. C. McDiarmid, D. Mitsche, and P. Pralat, Clique colouring of binomial random graphs, Random Structures and Algorithms 54(4) (2019), 589-614.
  101. A. Frieze, X. Perez-Gimenez, P. Pralat, and B. Reiniger, Perfect matchings and Hamiltonian cycles in the preferential attachment model, Random Structures and Algorithms 54(2) (2019), 258-288.
  102. 2018

  103. P. Gordinowicz and P. Pralat, Small online Ramsey numbers---a new approach, Contributions to Discrete Mathematics 13(2) (2018), 101-111 (supplementary files).
  104. C. McDiarmid, D. Mitsche, and P. Pralat, Clique colourings of geometric graphs, Electronic Journal of Combinatorics 25(4) (2018), #P4.56.
  105. H.M. Morgan, B. Kaminski, and P. Pralat, Cognition, Network Structure and Learning in Top Managers' Interpersonal Networks, Academy of Management Proceedings Vol. 2018, No. 1.
  106. D. Mitsche, P. Pralat, and E. Roshanbin, Burning number of graph products, Theoretical Computer Science 746 (2018), 124-135.
  107. Л. Исхаков, М. Миронов, Л. Прохоренкова, Б. Камински, П. Пралат, Кластерный коэффициент в модели пространственного предпочтительного присоединения, Доклады Академии Наук 2018, том 481, №1, с. 10--14.
  108. A. Dudek and P. Pralat, Note on the multicolour size-Ramsey number for paths, Electronic Journal of Combinatorics 25(3) (2018), #P3.35.
  109. A. Bonato, R.M. del Rio-Chanona, C. MacRury, J. Nicolaidis, X. Perez-Gimenez, P. Pralat, and K. Ternovsky, The robot crawler graph process, Discrete Applied Mathematics 247 (2018), 23-36.
  110. L. Iskhakov, B. Kaminski, M. Mironov, L. Ostroumova Prokhorenkova, and P. Pralat, Clustering Properties of Spatial Preferential Attachment Model, Proceedings of the 15th Workshop on Algorithms and Models for the Web Graph (WAW 2018), Lecture Notes in Computer Science 10836, Springer, 2018, 30-43.
  111. A. Dudek, F. Khoeini, and P. Pralat, Size-Ramsey numbers of cycles versus a path, Discrete Mathematics 341 (2018), 2095-2103.
  112. M. Dewar, J. Healy, X. Perez-Gimenez, P. Pralat, J. Proos, B. Reiniger, and K. Ternovsky, Subhypergraphs in non-uniform random hypergraphs, Internet Mathematics (2018), 23pp (supplementary files).
  113. A. Dudek, X. Perez-Gimenez, P. Pralat, H. Qi, D. West, X. Zhu, Randomly Twisted Hypercubes, European Journal of Combinatorics 70 (2018), 364-373.
  114. 2017

  115. D. Bal, P. Bennett, X. Perez-Gimenez, and P. Pralat, Rainbow perfect matchings and Hamilton cycles in the random geometric graph, Random Structures and Algorithms 51(4) (2017), 587-606.
  116. A. Dudek and P. Pralat, On some multicolour Ramsey properties of random graphs, SIAM Journal on Discrete Mathematics 31(3) (2017), 2079-2092.
  117. B. Kaminski, T. Olczak, and P. Pralat, Endogenous Differentiation of Consumer Preferences Under Quality Uncertainty in a SPA Network, Proceedings of the 14th Workshop on Algorithms and Models for the Web Graph (WAW 2017), Lecture Notes in Computer Science 10519, Springer, 2017, 42-59.
  118. A. Bonato, E. Infeld, H. Pokhrel, and P. Pralat, Common adversaries form alliances: modelling complex networks via anti-transitivity, Proceedings of the 14th Workshop on Algorithms and Models for the Web Graph (WAW 2017), Lecture Notes in Computer Science 10519, Springer, 2017, 16-26.
  119. L. Ostroumova Prokhorenkova, P. Pralat, and A. Raigorodskii, Modularity in several random graph models, Electronic Notes in Discrete Mathematics 61 (2017), 947-953.
  120. D. Mitsche, X. Perez-Gimenez, and P. Pralat, Strong-majority bootstrap percolation on regular graphs with low dissemination threshold, Stochastic Processes and its Applications 127(9) (2017), 3110-3134.
  121. E. Infeld, D. Mitsche, and P. Pralat, The Total Acquisition Number of Random Geometric Graphs, Electronic Journal of Combinatorics 24(3) (2017), #P3.31.
  122. L. Ostroumova Prokhorenkova, P. Pralat, and A. Raigorodskii, Modularity of complex networks models, Internet Mathematics (2017), 23pp.
  123. A. Godbole, E. Kelley, E. Kurtz, P. Pralat, and Y. Zhang, The Total Acquisition Number of the Randomly Weighted Path, Discussiones Mathematicae Graph Theory 37 (2017), 919-934 (programs in C/C++).
  124. A. Bonato, X. Perez-Gimenez, P. Pralat, and B. Reiniger, The game of Overprescribed Cops and Robbers played on graphs, Graphs and Combinatorics 33(4) (2017), 801-815.
  125. D. Mitsche, P. Pralat, and E. Roshanbin, Burning graphs---a probabilistic perspective, Graphs and Combinatorics 33(2) (2017), 449-471.
  126. 2016

  127. A. Bonato, D. Mitsche, X. Perez-Gimenez, and P. Pralat, A probabilistic version of the game of Zombies and Survivors on graphs, Theoretical Computer Science 655 (2016), 2-14.
  128. M. Dewar, J. Healy, X. Perez-Gimenez, P. Pralat, J. Proos, B. Reiniger, and K. Ternovsky, Subgraphs in non-uniform random hypergraphs, Proceedings of the 13th Workshop on Algorithms and Models for the Web Graph (WAW 2016), Lecture Notes in Computer Science 10088, Springer, 2016, 140-151.
  129. L. Ostroumova Prokhorenkova, P. Pralat, and A. Raigorodskii, Modularity of complex networks models, Proceedings of the 13th Workshop on Algorithms and Models for the Web Graph (WAW 2016), Lecture Notes in Computer Science 10088, Springer, 2016, 115-126.
  130. A. Bener, B. Caglayan, A. Henry, and P. Pralat, Empirical Models of Social Learning in a Large, Evolving Network, PLoS ONE 11(10): e0160307.
  131. A. Dudek, D. Mitsche, and P. Pralat, The set chromatic number of random graphs, Discrete Applied Mathematics 215 (2016), 61-70.
  132. D. Bal, P. Bennett, C. Cooper, A. Frieze, and P. Pralat, Rainbow arborescence in random digraphs, Journal of Graph Theory 83(3) (2016), 251-265.
  133. P. Lak, C. Babaoglu, A. Bener, and P. Pralat, News Article Position Recommendation Based on The Analysis of Article's Content --- Time Matters, Proceedings of the 10th ACM Conference on Recommender Systems (RecSys 2016), CEUR Workshop Proceedings 1673 (2016), 11-14.
  134. D. Bal, A. Bonato, W. Kinnersley, and P. Pralat, Lazy Cops and Robbers played on random graphs and graphs on surfaces, Journal of Combinatorics 7(4) (2016), 627-642.
  135. D. Bal, P. Bennett, A. Dudek, and P. Pralat, The Total Acquisition Number of Random Graphs, Electronic Journal of Combinatorics 23(2) (2016), #P2.55.
  136. W. Kinnersley and P. Pralat, Game brush number, Discrete Applied Mathematics 207 (2016), 1-14.
  137. D. Mitsche, X. Perez-Gimenez, and P. Pralat, The bondage number of random graphs, Electronic Journal of Combinatorics 23(2) (2016), #P2.13.
  138. P. Lak, A. Kocak, P. Pralat, A. Bener, and A. Samarikhalaj, Towards Dynamic Pricing for Digital Billboard Advertising Network in Smart Cities, Proceedings of the 1st IEEE International Smart Cities Conference (ISC2-2015) (2016), 6pp.
  139. A. Dudek and P. Pralat, Acquaintance time of random graphs near connectivity threshold, SIAM Journal on Discrete Mathematics 30(1) (2016), 555-568.
  140. W. Kinnersley, P. Pralat, and D. West, To Catch a Falling Robber, Theoretical Computer Science 627 (2016), 107-111.
  141. A. Henry, D. Mitsche, and P. Pralat, Homophily, influence and the decay of segregation in self-organizing networks, Network Science 4(1) (2016), 81-116.
  142. J. Janssen, P. Pralat, and R. Wilson, Non-Uniform Distribution of Nodes in the Spatial Preferential Attachment Model, Internet Mathematics 12(1-2) (2016), 121-144.
  143. P. Pralat and N. Wormald, Meyniel's conjecture holds for random graphs, Random Structures and Algorithms 48(2) (2016), 396-421.
  144. 2015

  145. P. Pralat, Variants of the game of cops and robbers, Research Perspectives CRM Barcelona, 4pp.
  146. A. Bonato, R.M. del Rio-Chanona, C. MacRury, J. Nicolaidis, X. Perez-Gimenez, P. Pralat, and K. Ternovsky, The robot crawler number of a graph, Proceedings of the 12th Workshop on Algorithms and Models for the Web Graph (WAW 2015), Lecture Notes in Computer Science 9479, Springer, 2015, 132-147.
  147. D. Bal, A. Bonato, W. Kinnersley, and P. Pralat, Lazy Cops and Robbers on hypercubes, Combinatorics, Probability and Computing 24(6) (2015), 829-837.
  148. A. Li, T. Muller, and P. Pralat, Chasing robbers on percolated random geometric graphs, Contributions to Discrete Mathematics 10(1) (2015), 134-144.
  149. A. Frieze, D. Mitsche, X. Perez-Gimenez, and P. Pralat, On-line list colouring of random graphs, Electronic Journal of Combinatorics 22(2) (2015), #P2.41.
  150. P. Pralat, Containment game played on random graphs: another zig-zag theorem, Electronic Journal of Combinatorics 22(2) (2015), #P2.32.
  151. T. Muller and P. Pralat, The acquaintance time of (percolated) random geometric graphs, European Journal of Combinatorics 48 (2015), 198-214.
  152. A. Bonato, M. Lozier, D. Mitsche, X. Perez-Gimenez, and P. Pralat, The domination number of on-line social networks and random geometric graphs, Proceedings of the 12th Conference on Theory and Applications of Models of Computation (TAMC 2015), Lecture Notes in Computer Science 9076, Springer, 2015, 150-163.
  153. A. Dudek and P. Pralat, An alternative proof of the linearity of the size-Ramsey number of paths, Combinatorics, Probability and Computing 24(3) (2015), 551-555.
  154. D. Bal, P. Bennett, A. Frieze, and P. Pralat, Power of k choices and rainbow spanning trees in random graphs, Electronic Journal of Combinatorics 22(1) (2015), #P1.29.
  155. P. Pralat, Almost all k-cop-win graphs contain a dominating set of cardinality k, Discrete Mathematics 338 (2015), 47-52.
  156. 2014

  157. A. Kehagias, D. Mitsche, and P. Pralat, The Role of Visibility in Pursuit/Evasion Games, Robotics 4 (2014), 371-399.
  158. A. Bonato, W. Kinnersley, and P. Pralat, Toppling numbers of complete and random graphs, Discrete Mathematics & Theoretical Computer Science 16(3) (2014), 229-252 (supplementary files).
  159. P. Borowiecki, D. Dereniowski, and P. Pralat, Brushing with additional cleaning restrictions, Theoretical Computer Science 557 (2014), 76-86.
  160. T. Gavenciak, J. Kratochvil, and P. Pralat, Firefighting on square, hexagonal, and triangular grids, Discrete Mathematics 337 (2014), 142-155 (Maple worksheet).
  161. N. Alon and P. Pralat, Chasing robbers on random geometric graphs---an alternative approach, Discrete Applied Mathematics 178 (2014), 149-152.
  162. A. Bonato, D. Gleich, M. Kim, D. Mitsche, P. Pralat, A. Tian, and S. Young, Dimensionality Matching of Social Networks using Motifs and Eigenvalues, PLoS ONE, 9(9) (2014), e106052 (supplement).
  163. D. Mitsche and P. Pralat, On the hyperbolicity of random graphs, Electronic Journal of Combinatorics 21(2) (2014), #P2.39.
  164. M.E. Messinger, R. Nowakowski, and P. Pralat, Elimination schemes and lattices, Discrete Mathematics 328 (2014), 63-70.
  165. C. Cooper, A. Frieze, and P. Pralat, Some typical properties of the Spatial Preferred Attachment model, Internet Mathematics 10 (2014), 27-47.
  166. A. Bonato, J. Brown, D. Mitsche, and P. Pralat, Independence densities of hypergraphs, European Journal of Combinatorics 40 (2014), 124-136.
  167. D. Bryant, N. Francetic, P. Gordinowicz, D. Pike, and P. Pralat, Brushing without capacity restrictions, Discrete Applied Mathematics 170 (2014), 33-45.
  168. P. Pralat, Graphs with average degree smaller than 30/11 burn slowly, Graphs and Combinatorics 30(2) (2014), 455-470.
  169. A. Dudek, P. Gordinowicz, and P. Pralat, Cops and Robbers playing on edges, Journal of Combinatorics 5(1) (2014), 131-153.
  170. A. Bonato, S. Finbow, P. Gordinowicz, A. Haidar, W. Kinnersley, D. Mitsche, P. Pralat, L. Stacho, The robber strikes back, Proceedings of the International Conference on Computational Intelligence, Cyber Security and Computational Models (ICC3), Advances in Intelligent Systems and Computing 246, Springer, 2014, 3-12.
  171. 2013

  172. P. Pralat, Sparse graphs are not flammable, SIAM Journal on Discrete Mathematics 27(4) (2013), 2157-2166.
  173. J. Janssen, P. Pralat, and R. Wilson, Asymmetric Distribution of Nodes in the Spatial Preferred Attachment Model, Proceedings of the 10th Workshop on Algorithms and Models for the Web Graph (WAW 2013), Lecture Notes in Computer Science 8305, Springer, 2013, 1-13.
  174. B. Bollobas, D. Mitsche, and P. Pralat, Metric dimension for random graphs, Electronic Journal of Combinatorics 20(4) (2013), #P1.
  175. W. Kinnersley, D. Mitsche, and P. Pralat, A note on the acquaintance time of random graphs, Electronic Journal of Combinatorics 20(3) (2013), #P52.
  176. A. Mehrabian, D. Mitsche, and P. Pralat, On the Maximum Density of Graphs with Unique-Path Labellings, SIAM Journal on Discrete Mathematics 27 (2013), 1228-1233.
  177. A. Kehagias, D. Mitsche, and P. Pralat, The Role of Visibility in the Cops-Robber Game and Robotic Pursuit/Evasion, 2013 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM 2013), paper accepted but not presented, 6pp.
  178. A. Bonato, P. Gordinowicz, W. Kinnersley, and P. Pralat, The capture time of the hypercube, Electronic Journal of Combinatorics 20 (2013), #P24.
  179. A. Bonato, D. Mitsche, and P. Pralat, Vertex-pursuit in random directed acyclic graphs, SIAM Journal on Discrete Mathematics 27 (2013), 732-756.
  180. D. Mitsche and P. Pralat, Revolutionaries and spies on random graphs, Combinatorics, Probability and Computing 22 (2013), 417-432.
  181. A. Kehagias, D. Mitsche, and P. Pralat, Cops and Invisible Robbers: the Cost of Drunkenness, Theoretical Computer Science 481 (2013), 100-120.
  182. A. Henry and P. Pralat, Discovery of Nodal Attributes through a Rank-Based Model of Network Structure, Internet Mathematics 9 (2013), 33-57 (program in C++/Maple).
  183. J. Janssen, P. Pralat, and R. Wilson, Geometric Graph Properties of the Spatial Preferred Attachment model, Advances in Applied Mathematics 50 (2013), 243-267.
  184. F. Claude, R. Dorrigiv, S. Kamali, A. Lopez-Ortiz, P. Pralat, J. Romero, A. Salinger, and D. Seco, Broadcasting in Conflict-Aware Multi-Channel Networks, Proceedings of the 7th International Workshop on Algorithms and Computation (WALCOM 2013), Lecture Notes in Computer Science 7748, Springer, 2013, 158-169.
  185. 2012

  186. A. Kehagias and P. Pralat, Some Remarks on Cops and Drunk Robbers, Theoretical Computer Science 463 (2012), 133-147 (supplementary files).
  187. P. Gordinowicz, R. Nowakowski, and P. Pralat, POLISH-Let us play the cleaning game, Theoretical Computer Science 463 (2012), 123-132.
  188. P. Pralat, A note on off-diagonal small on-line Ramsey numbers for paths, Ars Combinatoria 107 (2012), 295-306 (programs in C/C++).
  189. O-Y. Chan and P. Pralat, Chipping away at the edges: how long does it take?, Journal of Combinatorics 3 (2012), 101-121.
  190. A. Bonato, D. Mitsche, and P. Pralat, Vertex-pursuit in hierarchical social networks, Proceedings of the 9th annual conference on Theory and Applications of Models of Computation (TAMC 2012), Lecture Notes in Computer Science 7287, Springer, 2012, 50-60.
  191. F. Fomin, P. Golovach, and P. Pralat, Cops and Robber with Constraints, SIAM Journal on Discrete Mathematics 26 (2012), 571-590.
  192. A. Bonato, M.E. Messinger, and P. Pralat, Fighting Constrained Fires in Graphs, Theoretical Computer Science 434 (2012), 11-22 (program in C/C++).
  193. C. Cooper, A. Frieze, and P. Pralat, Some typical properties of the Spatial Preferred Attachment model, Proceedings of the 9th Workshop on Algorithms and Models for the Web Graph (WAW 2012), Lecture Notes in Computer Science 7323, Springer, 2012, 29-40.
  194. A. Bonato, G. Kemkes, and P. Pralat, Almost all cop-win graphs contain a universal vertex, Discrete Mathematics 312 (2012), 1652-1657.
  195. A. Bonato, J. Janssen, and P. Pralat, Geometric Protean Graphs, Internet Mathematics 8 (2012), 2-28.
  196. P. Gordinowicz and P. Pralat, The first player wins the one-colour triangle avoidance game on 16 vertices, Discussiones Mathematicae Graph Theory 32 (2012), 181-185 (programs in C/C++).
  197. 2011

  198. A. Bonato, J. Brown, G. Kemkes, and P. Pralat, Independence and chromatic densities of graphs, Journal of Combinatorics 2 (2011), 397-411.
  199. P. Pralat, J. Verstraete, and N. Wormald, On the threshold for k-regular subgraphs of random graphs, Combinatorica 31 (2011), 565-581.
  200. P. Pralat and C. Wang, An edge deletion model for complex networks, Theoretical Computer Science 412 (2011), 5111-5120 (Maple worksheet).
  201. P. Pralat, Cleaning random d-regular graphs with Brooms, Graphs and Combinatorics 27 (2011), 567-584 (Maple worksheets).
  202. A. Henry, P. Pralat, and CQ. Zhang, The Emergence of Segregation in Evolving Social Networks, Proceedings of the National Academy of Sciences 108 (2011), 8605-8610 (Maple worksheet).
  203. C. Cooper and P. Pralat, Scale-free graphs of increasing degree, Random Structures and Algorithms 38 (2011), 396-421.
  204. A. Henry and P. Pralat, Rank-Based Models of Network Structure and the Discovery of Content, Proceedings of the 8th Workshop on Algorithms and Models for the Web Graph (WAW 2011), Lecture Notes in Computer Science 6732, Springer, 2011, 62-73.
  205. N. Alon and P. Pralat, Modular orientations of random and quasi-random regular graphs, Combinatorics, Probability and Computing 20 (2011), 321-329.
  206. P. Pralat, Connectivity threshold and recovery time in rank-based models for complex networks, Discrete Mathematics 311 (2011), 932-939.
  207. A. Bonato, N. Hadi, P. Horn, P. Pralat, and C. Wang, Models of on-line social networks, Internet Mathematics 6 (2011), 285-313.
  208. M.E. Messinger, R. Nowakowski, and P. Pralat, Cleaning with Brooms, Graphs and Combinatorics 27 (2011), 251-267.
  209. I. Benjamini, C. Hoppen, E. Ofek, P. Pralat, and N. Wormald, Geodesics and almost geodesic cycles in random regular graphs, Journal of Graph Theory 66 (2011), 115-136.
  210. 2010

  211. A. Bonato, J. Janssen, and P. Pralat, The geometric protean model for on-line social networks, Proceedings of the 7th Workshop on Algorithms and Models for the Web-Graph (WAW2010), Lecture Notes in Computer Science 6516, Springer, 2010, 110-121.
  212. T. Luczak and P. Pralat, Chasing robbers on random graphs: zigzag theorem, Random Structures and Algorithms 37 (2010), 516-524.
  213. P. Pralat, A note on the one-colour avoidance game on graphs, Journal of Combinatorial Mathematics and Combinatorial Computing 75 (2010), 85-94 (programs in C/C++).
  214. A. Bonato, E. Chiniforooshan, and P. Pralat, Cops and Robbers from a Distance, Theoretical Computer Science 411 (2010), 3834-3844.
  215. A. Bonato, P. Gordinowicz, and P. Pralat, Bounds and constructions for n-e.c. tournaments, Contributions to Discrete Mathematics 5 (2010), 52-66 (programs in C/C++).
  216. P. Pralat, The surviving rate of planar graphs, Proceedings of the Midsummer Combinatorial Workshop 2010, KAM-DIMATIA Series, 2pp.
  217. P. Gordinowicz and P. Pralat, The search for the smallest 3-e.c. graphs, Journal of Combinatorial Mathematics and Combinatorial Computing 74 (2010), 129-142 (programs in C/C++).
  218. A. Bonato, J. Janssen, and P. Pralat, A Geometric Model for On-line Social Networks, 3rd Workshop on Online Social Networks (WOSN 2010), 7pp.
  219. J. Janssen, P. Pralat, and R. Wilson, Estimating node similarity from co-citation in a spatial graph model, Proceedings of the 2010 ACM Symposium on Applied Computing (SAC) -- Special Track on Self-organizing Complex Systems, 2010, 1329-1333.
  220. J. Janssen and P. Pralat, Rank-based attachment leads to power law graphs, SIAM Journal on Discrete Mathematics 24 (2010), 420-440.
  221. S. Gaspers, M.E. Messinger, R. Nowakowski, and P. Pralat, Parallel Cleaning of a Network with Brushes, Discrete Applied Mathematics 158 (2010), 467-478 (programs in C/C++).
  222. R. Angelova, M. Lipczak, E. Milios, and P. Pralat, Investigating the properties of a social bookmarking and tagging network, International Journal of Data Warehousing and Mining 6 (2010), 1-19.
  223. P. Pralat, When does a random graph have constant cop number?, Australasian Journal of Combinatorics 46 (2010), 285-296.
  224. 2009

  225. J. Janssen and P. Pralat, Protean graphs with a variety of ranking schemes, Theoretical Computer Science 410 (2009), 5491-5504.
  226. A. Bonato and P. Pralat, The good, the bad, and the great: homomorphisms and cores of random graphs, Discrete Mathematics 309 (2009), 5535-5539.
  227. W. Aiello, A. Bonato, C. Cooper, J. Janssen, and P. Pralat, A spatial web graph model with local influence regions, Internet Mathematics 5 (2009), 175-196.
  228. C.A. Baker, A. Bonato, N.A. McKay, and P. Pralat, Graphs with the N-e.c. adjacency property constructed from resolvable designs, Journal of Combinatorial Designs 17 (2009), 294-306.
  229. A. Bonato, P. Pralat, and C. Wang, Pursuit-evasion in models of complex networks, Internet Mathematics 4 (2009), 419-436.
  230. S. Gaspers, M.E. Messinger, R. Nowakowski, and P. Pralat, Clean the graph before you draw it!, Information Processing Letters 109 (2009), 463-467.
  231. P. Pralat and N. Wormald, Growing protean graphs, Internet Mathematics 4 (2009), 1-16.
  232. P. Pralat, Cleaning random graphs with brushes, Australasian Journal of Combinatorics 43 (2009), 237-251 (Maple worksheets).
  233. A. Bonato, N. Hadi, P. Horn, P. Pralat, and C. Wang, A dynamic model for on-line social networks, Proceedings of the 6th Workshop on Algorithms and Models for the Web-Graph (WAW2009), Lecture Notes in Computer Science 5427, Springer, 2009, 127-142.
  234. 2008

  235. N. Alon, P. Pralat, and N. Wormald, Cleaning regular graphs with brushes, SIAM Journal on Discrete Mathematics 23 (2008), 233-250 (Maple worksheets).
  236. J. Grytczuk, H. Kierstead, and P. Pralat, On-line Ramsey Numbers for Paths and Stars, Discrete Mathematics & Theoretical Computer Science 10 (2008), 63-74.
  237. R. Angelova, M. Lipczak, E. Milios, and P. Pralat, Characterizing a social bookmarking and tagging network, Proceedings of the 18th European Conference on Artificial Intelligence -- Workshop on Mining Social Data (MSoDa), 2008, 21-25.
  238. P. Pralat, A note on the diameter of protean graphs, Discrete Mathematics 308 (2008), 3399-3406.
  239. M.E. Messinger, R. Nowakowski, and P. Pralat, Cleaning a Network with Brushes, Theoretical Computer Science 399 (2008), 191-205.
  240. P. Pralat, R*(3,4)=17, Electronic Journal of Combinatorics 15 (2008), #R67, 13pp (programs in C/C++).
  241. P. Pralat, Protean graphs with a variety of ranking schemes, Proceedings of the 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA'08), Lecture Notes in Computer Science 5165, Springer, 2008, 149-159.
  242. P. Pralat, A note on small on-line Ramsey numbers for paths and their generalization, Australasian Journal of Combinatorics 40 (2008), 27-36 (programs in C/C++).
  243. 2007

  244. W. Aiello, A. Bonato, C. Cooper, J. Janssen, and P. Pralat, A spatial web graph model with local influence regions, Proceedings of the 5th Workshop on Algorithms and Models for the Web-Graph (WAW2007), Lecture Notes in Computer Science 4863, Springer, 2007, 96-107.
  245. A. Bonato, P. Pralat, and C. Wang, Vertex Pursuit Games in Stochastic Network Models, Proceedings of the 4th Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN2007), Lecture Notes in Computer Science 4852, Springer, 2007, 46-56.
  246. R. Dorrigiv, A. Lopez-Ortiz, and P. Pralat, Search Algorithms for Unstructured Peer-to-Peer Networks, Proceedings of the 32nd IEEE Conference on Local Computer Networks (LCN), 2007, 343-352 (program in C).
  247. M.E. Messinger, R. Nowakowski, P. Pralat, and N. Wormald, Cleaning random d-regular graphs with brushes using a degree-greedy algorithm, Proceedings of the 4th Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN2007), Lecture Notes in Computer Science 4852, Springer, 2007, 13-26 (Maple worksheets).
  248. 2006

  249. T. Luczak and P. Pralat, Protean graphs, Internet Mathematics 3 (2006), 21-40.
  250. Unpublished Manuscripts

  251. H.M. Morgan, B. Kaminski, and P. Pralat, Cognition, Network Structure, and Learning in Top Managers' Interpersonal Networks, 2018, 46pp.
  252. R.M. del Rio-Chanona, C. MacRury, J. Nicolaidis, X. Perez-Gimenez, P. Pralat, and K. Ternovsky, Injective colouring of binomial random graphs, 2016, 11pp.
  253. Dissertations

  254. P. Pralat, Protean graphs (in Polish), Ph.D. dissertation (2004), 103pp.
  255. P. Pralat, Wavelet representation of digital images (in Polish), M.A.Sc. thesis, Technical University of Lodz (2001), 68pp.
  256. P. Pralat, Lossless `dictionary based' compression algorithms (in Polish), M.Sc. thesis, University of Lodz (2000), 54pp.

Collaborators

  1. William Aiello (2 papers), Department of Computer Science, University of British Columbia, Vancouver, BC, Canada
  2. Noga Alon (3 papers), Schools of Mathematics and Computer Science, Tel Aviv University, Tel Aviv, Israel
  3. Ralitsa Angelova (2 papers), Google Inc., Zurich, Switzerland
  4. Alessia Antelmi (2 papers), Dipartimento di Informatica, Universita degli Studi di Salerno, Italy
  5. Marek Antosiewicz (1 paper), Decision Support and Analysis Unit, SGH Warsaw School of Economics, Warsaw, Poland
  6. Nick Arnosti (1 paper), Department of Industrial and Systems Engineering, University of Minnesota, Minneapolis, MN, USA
  7. Konstantin Avrachenkov (1 paper), Sophia Antipolis, INRIA, Sophia Antipolis Cedex, France
  8. Ceni Babaoglu (1 paper), Data Science Lab, Department of Mechanical & Industrial Engineering, Ryerson University, Toronto, ON, Canada
  9. Catharine Baker (1 paper), Department of Mathematics and Computer Science, Mount Allison University, Sackville, NB, Canada
  10. Deepak Bal (8 papers), Department of Mathematics, Montclair State University, Montclair, NJ, USA
  11. Jordan Barrett (2 papers), Department of Mathematics, Toronto Metropolitan University, Toronto, ON, Canada
  12. Natalie C. Behague (2 papers), Mathematics Institute, University of Warwick, Coventry, UK
  13. Ayse Bener (3 papers), Data Science Lab, Department of Mechanical & Industrial Engineering, Ryerson University, Toronto, ON, Canada
  14. Itai Benjamini (1 paper), Department of Mathematics, The Weizmann institute of Science, Rehovot, Israel
  15. Patrick Bennett (6 papers), Department of Mathematics, Western Michigan University, Kalamazoo, MI, USA
  16. Andrei Betlen (4 papers), Patagona Technologies, Pickering, ON, Canada
  17. Bela Bollobas (1 paper), Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, Cambridge, UK
  18. Anthony Bonato (39 papers), Department of Mathematics, Ryerson University, Toronto, ON, Canada
  19. Piotr Borowiecki (1 paper), Department of Algorithms and System Modeling, Gdansk University of Technology, Gdansk, Poland
  20. Jason Brown (2 papers), Department of Mathematics and Statistics, Dalhousie University, Halifax, NS, Canada
  21. Darryn Bryant (1 paper), Department of Mathematics, The University of Queensland, Brisbane, Australia
  22. Bora Caglayan (1 paper), Data Science Lab, Department of Mechanical & Industrial Engineering, Ryerson University, Toronto, ON, Canada
  23. O-Yeat Chan (1 paper), School of Mathematical and Physical Sciences, University of Newcastle, Callaghan, Australia
  24. Ehsan Chiniforooshan (1 paper), Biocomputing Lab, University of Western Ontario, London, ON, Canada
  25. Fan Chung Graham (3 papers), Department of Mathematics, University of California, San Diego, USA
  26. Francisco Claude (1 paper), Department of Computer Science, University of Waterloo, Waterloo, ON, Canada
  27. Colin Cooper (6 papers), Department of Computer Science, King's College, London, United Kingdom
  28. Gennaro Cordasco (2 papers), Dipartimento di Psicologia, Universita degli Studi della Campania `Luigi Vanvitelli', Italy
  29. Ryan Cushman (1 paper), Department of Mathematics, Toronto Metropolitan University, Toronto, ON, Canada
  30. Ashkan Dehghan (5 papers), Department of Mathematics, Toronto Metropolitan University, Toronto, ON, Canada
  31. Arash Dehghan-Kooshkghazi (1 paper), Department of Mathematics, Ryerson University, Toronto, ON, Canada
  32. Rita M. del Rio-Chanona (3 papers), Universidad Nacional Autonoma de Mexico, Mexico City, Mexico
  33. Michelle Delcourt (1 paper), Department of Mathematics, Toronto Metropolitan University, Toronto, ON, Canada
  34. Dariusz Dereniowski (2 papers), Department of Algorithms and System Modeling, Gdansk University of Technology, Gdansk, Poland
  35. Luc Devroye (1 paper), School of Computer Science, McGill University, Montreal, Canada
  36. Megan Dewar (4 papers), The Tutte Institute for Mathematics and Computing, Ottawa, ON, Canada
  37. Reza Dorrigiv (2 papers), Faculty of Computer Science, Dalhousie University, Halifax, NS, Canada
  38. Akshat Dubey (2 papers), Mathematics and Computing, Birla Institute of Technology - Mesra, Ranchi, India
  39. Andrzej Dudek (11 papers), Department of Mathematics, Western Michigan University, Kalamazoo, MI, USA
  40. Austin Eide (2 papers), Department of Mathematics, Toronto Metropolitan University, Toronto, ON, Canada
  41. Sean English (3 papers), Department of Mathematics, Ryerson University, Toronto, ON, Canada
  42. Jacek Filipowski (1 paper), Decision Support and Analysis Unit, Warsaw School of Economics, Warsaw, Poland
  43. Stephen Finbow (1 paper), Department of Mathematics, Statistics and Computer Science, St. Francis Xavier University, Antigonish, NS, Canada
  44. Fedor Fomin (1 paper), Department of Informatics, University of Bergen, Bergen, Norway
  45. Nevena Francetic (1 paper), Department of Mathematics and Statistics, Carleton University, Ottawa, ON, Canada
  46. Alan Frieze (11 papers), Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA, USA
  47. David Gamarnik (1 paper), MIT Sloan School of Management, MIT, Cambridge, MA, USA
  48. Pu Gao (4 papers), Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, Canada
  49. Serge Gaspers (2 papers), School of Computer Science and Engineering, The University of New South Wales, Sydney, Australia
  50. Tomas Gavenciak (1 paper), Department of Applied Mathematics, Charles University, Praha, Czech Republic
  51. Konstantinos Georgiou (6 papers), Department of Mathematics, Ryerson University, Toronto, ON, Canada
  52. David Gleich (1 paper), Computer Science Department, Purdue University, West Lafayette, IN, USA
  53. Anant Godbole (1 paper), Department of Mathematics and Statistics, East Tennessee State University, Johnson City, TN, USA
  54. Petr Golovach (1 paper), Department of Informatics, University of Bergen, Bergen, Norway
  55. Przemyslaw Gordinowicz (10 papers), Department of Mathematics, Technical University of Lodz, Lodz, Poland
  56. Jaroslaw Grytczuk (1 paper), Faculty of Mathematics and Computer Science, Jagiellonian University, Krakow, Poland
  57. Noor Hadi (2 papers), Department of Mathematics, Wilfrid Laurier University, Waterloo, ON, Canada
  58. Ali Haidar (1 paper), School of Mathematics and Statistics, Carleton University, Ottawa, ON, Canada
  59. John Healy (2 papers), The Tutte Institute for Mathematics and Computing, Ottawa, ON, Canada
  60. Adam Henry (5 papers), School of Government and Public Policy, University of Arizona, Tucson, AZ, USA
  61. Carlos Hoppen (1 paper), Instituto de Matematica, Universidade Federal do Rio Grande do Sul, Brazil
  62. Paul Horn (3 papers), Department of Mathematics, Harvard University, Cambridge, MA, USA
  63. Reaz Huq (3 papers), Department of Mathematics, Toronto Metropolitan University, Toronto, ON, Canada
  64. Ewa Infeld (2 papers), Department of Mathematics, Ryerson University, Toronto, ON, Canada
  65. Lenar Iskhakov (3 papers), Advanced Combinatorics and Network Applications Lab, Moscow Institute of Physics and Technology, Moscow, Russia
  66. Jeannette Janssen (12 papers), Department of Mathematics and Statistics, Dalhousie University, Halifax, NS, Canada
  67. Shahin Kamali (1 paper), Department of Computer Science, University of Waterloo, Waterloo, ON, Canada
  68. Bogumil Kaminski (46 papers), Decision Support and Analysis Unit, Warsaw School of Economics, Warsaw, Poland
  69. Mihyun Kang (1 paper), Institute of Discrete Mathematics, Graz University of Technology, Graz, Austria
  70. Daniel Kaszynski (1 paper), Decision Support and Analysis Unit, Warsaw School of Economics, Warsaw, Poland
  71. Thanasis Kehagias (4 papers), Department of Mathematics, Physics and Computer Sciences, Aristotle University of Thessaloniki, Thessaloniki, Greece
  72. Elizabeth Kelley (1 paper), Department of Mathematics, University of Minnesota, Minneapolis, MN, USA
  73. Graeme Kemkes (2 papers), Department of Mathematics, Ryerson University, Toronto, ON, Canada
  74. Farideh Khoeini (1 paper), Department of Mathematical Sciences, Isfahan University of Technology, Isfahan, Iran
  75. Hal Kierstead (1 paper), Department of Mathematics, Arizona State University, Tempe, AZ, USA
  76. Myunghwan Kim (1 paper), Computer Science Department, Stanford University, Stanford, CA, USA
  77. William Kinnersley (8 papers), Department of Mathematics, University of Rhode Island, Kingston, RI, USA
  78. Marcos Kiwi (1 paper), Departamento de Ingeniería Matemática, Universidad de Chile, Santiago, Chile
  79. Akin Kocak (1 paper), Data Science Lab, Department of Mechanical & Industrial Engineering, Ryerson University, Toronto, ON, Canada
  80. Lukasz Krainski (3 papers), Decision Support and Analysis Unit, Warsaw School of Economics, Warsaw, Poland
  81. Jan Kratochvil (1 paper), Department of Applied Mathematics, Charles University, Praha, Czech Republic
  82. Somnath Kundu (4 papers), Department of Mathematics, Ryerson University, Toronto, ON, Canada
  83. Emily Kurtz (1 paper), Department of Mathematics, Wellesley College, Wellesley, MA, USA
  84. Parisa Lak (2 papers), Data Science Lab, Department of Mechanical & Industrial Engineering, Ryerson University, Toronto, ON, Canada
  85. Anshui Li (1 paper), Mathematical Institute, Utrecht University, Utrecht, The Netherlands
  86. Lyuben Lichev (2 papers), Ecole Normale Superieure de Lyon, Lyon, France
  87. Marek Lipczak (2 papers), Google, Waterloo, ON, Canada
  88. Adam Logan (1 paper), The Tutte Institute for Mathematics and Computing, Ottawa, ON, Canada
  89. Alejandro Lopez-Ortiz (2 papers), Department of Computer Science, University of Waterloo, Waterloo, ON, Canada
  90. Marc Lozier (1 paper), Department of Mathematics, Ryerson University, Toronto, ON, Canada
  91. Tomasz Luczak (2 papers), Department of Discrete Mathematics, Adam Mickiewicz University, Poznan, Poland
  92. Calum MacRury (13 papers), Department of Computer Science , University of Toronto, Toronto, ON, Canada
  93. Trent Marbach (2 papers), Department of Mathematics, Ryerson University, Toronto, ON, Canada
  94. Atefeh Mashatan (5 papers), Cybersecurity Research Lab, Toronto Metropolitan University, Toronto, ON, Canada
  95. Stan Matwin (1 paper), Faculty of Computer Science, Dalhousie University, Halifax, NS, Canada
  96. Colin McDiarmid (2 papers), Department of Statistics, University of Oxford, Oxford, England
  97. Neil A. McKay (1 paper), Department of Mathematics and Statistics, Dalhousie University, Halifax, NS, Canada
  98. Abbas Mehrabian (1 paper), Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, Canada
  99. Margaret-Ellen Messinger (7 papers), Department of Mathematics & Computer Science, Mount Allison University, Sackville, NB, Canada
  100. Aristides Milios (1 paper), McGill University/MILA, Montreal, QC, Canada
  101. Evangelos Milios (2 papers), Faculty of Computer Science, Dalhousie University, Halifax, NS, Canada
  102. David Miller (4 papers), Patagona Technologies, Pickering, ON, Canada
  103. Maksim Mironov (3 papers), Advanced Combinatorics and Network Applications Lab, Moscow Institute of Physics and Technology, Moscow, Russia
  104. Pawel Misiorek (1 paper), Institute of Computing Science, Poznan University of Technology, Poznan, Poland
  105. Dieter Mitsche (28 papers), The Camille Jordan Institute, Université Claude Bernard Lyon 1, Lyon, France
  106. Michael Mitzenmacher (1 paper), School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA
  107. Divyarthi Mohan (1 paper), Department of Computer Science, Tel Aviv University, Israel
  108. Mike Molloy (3 papers), Department of Computer Science, University of Toronto, Toronto, ON, Canada
  109. Horatio Morgan (2 papers), Ted Rogers School of Management, Ryerson University, Toronto, ON, Canada
  110. Tobias Muller (2 papers), Mathematical Institute, Utrecht University, Utrecht, The Netherlands
  111. Jake Nicolaidis (3 papers), Department of Computer Science, Ryerson University, Toronto, ON, Canada
  112. Richard Nowakowski (7 papers), Department of Mathematics and Statistics, Dalhousie University, Halifax, NS, Canada
  113. Eran Ofek (1 paper), Department of Computer Science and Applied Mathematics, The Weizmann institute of Science, Rehovot, Israel
  114. Tomasz Olczak (3 papers), Decision Support and Analysis Unit, Warsaw School of Economics, Warsaw, Poland
  115. Marcin Opalski (1 paper), Decision Support and Analysis Unit, Warsaw School of Economics, Warsaw, Poland
  116. Bartosz Pankratz (6 papers), Decision Support and Analysis Unit, Warsaw School of Economics, Warsaw, Poland
  117. Xavier Perez-Gimenez (16 papers), Department of Mathematics, University of Nebraska, Lincoln, NE, USA
  118. David Pike (1 paper), Department of Mathematics and Statistics, Memorial University of Newfoundland, St. John's, NL, Canada
  119. Hari Pokhrel (1 paper), Department of Mathematics, Ryerson University, Toronto, ON, Canada
  120. Nykyta Polituchyi (1 paper), Decision Support and Analysis Unit, Warsaw School of Economics, Warsaw, Poland
  121. Valerie Poulin (1 paper), The Tutte Institute for Mathematics and Computing, Ottawa, ON, Canada
  122. Liudmila Prokhorenkova (6 papers), Machine intelligence and research department, Yandex, Moscow, Russia
  123. John Proos (2 papers), The Tutte Institute for Mathematics and Computing, Ottawa, ON, Canada
  124. Hao Qi (1 paper), Department of Mathematics, Zhejiang Normal University, China
  125. Andrei Raigorodskii (4 papers), Yandex, Moscow, Russia
  126. Benjamin Reiniger (4 papers), Department of Mathematics, Ryerson University, Toronto, ON, Canada
  127. Jazmin Romero (1 paper), Department of Computer Science, University of Waterloo, Waterloo, ON, Canada
  128. Elham Roshanbin (2 papers), Department of Mathematics and Statistics, Dalhousie University, Halifax, NS, Canada
  129. Andrzej Rucinski (1 paper), Department of Discrete Mathematics, Adam Mickiewicz University, Poznan, Poland
  130. Alejandro Salinger (1 paper), Department of Computer Science, University of Waterloo, Waterloo, ON, Canada
  131. Akram Samarikhalaj (1 paper), Data Science Lab, Department of Mechanical & Industrial Engineering, Ryerson University, Toronto, ON, Canada
  132. Vittorio Scarano (2 papers), Dipartimento di Psicologia, Universita degli Studi della Campania `Luigi Vanvitelli', Italy
  133. Diego Seco (1 paper), Department of Computer Science, University of A Coruna, A Coruna, Spain
  134. Harjas Singh (1 paper), Department of Mathematics, Toronto Metropolitan University, Toronto, ON, Canada
  135. Kinga Siuta (5 papers), Decision Support and Analysis Unit, Warsaw School of Economics, Warsaw, Poland
  136. Agata Skorupka (5 papers), Decision Support and Analysis Unit, Warsaw School of Economics, Warsaw, Poland
  137. Amilcar Soares (1 paper), Department of Computer Science, Memorial University of Newfoundland, St. John's, NL, Canada
  138. Gregory Sorkin (2 papers), Department of Mathematics, London School of Economics and Political Science, London, United Kingdom
  139. Carmine Spagnuolo (2 papers), Dipartimento di Psicologia, Universita degli Studi della Campania `Luigi Vanvitelli', Italy
  140. Ladislav Stacho (1 paper), Department of Mathematics, Simon Fraser University, Burnaby, BC, Canada
  141. Anna Szczurek (1 paper), Decision Support and Analysis Unit, Warsaw School of Economics, Warsaw, Poland
  142. Przemyslaw Szufel (12 papers), Decision Support and Analysis Unit, SGH Warsaw School of Economics, Warsaw, Poland
  143. Kirill Ternovsky (5 papers), Department of Computer Science, Ryerson University, Toronto, ON, Canada
  144. Francois Theberge (23 papers), The Tutte Institute for Mathematics and Computing, Ottawa, ON, Canada
  145. Amanda Tian (1 paper), Department of Mathematics, Ryerson University, Toronto, ON, Canada
  146. Jacques Verstraete (1 paper), Department of Mathematics, University of California, San Diego, USA
  147. Changping Wang (5 papers), Department of Mathematics, Ryerson University, Toronto, ON, Canada
  148. Douglas West (3 papers), Department of Mathematics, Zhejiang Normal University, China
  149. Rory Wilson (4 papers), Department of Mathematics and Statistics, Dalhousie University, Halifax, NS, Canada
  150. Nicholas Wormald (8 papers), School of Mathematical Sciences, Monash University, Australia
  151. Malgorzata Wrzosek (2 papers), Decision Support and Analysis Unit, Warsaw School of Economics, Warsaw, Poland
  152. Wei Xu (2 papers), Department of Mathematics, Ryerson University, Toronto, ON, Canada
  153. Nan Ye (1 paper), Department of Mathematics, The University of Queensland, Brisbane, Australia
  154. Stephen Young (1 paper), Mathematics Department, University of Louisville, Louisville, KY, USA
  155. Sebastian Zajac (2 papers), Decision Support and Analysis Unit, Warsaw School of Economics, Warsaw, Poland
  156. Mateusz Zawisza (1 paper), Decision Support and Analysis Unit, Warsaw School of Economics, Warsaw, Poland
  157. Cun-Quan Zhang (1 paper), Department of Mathematics, West Virginia University, Morgantown, WV, USA
  158. Yiguang Zhang (1 paper), Department of Applied Mathematics and Statistics, The Johns Hopkins University, Baltimore, MD, USA
  159. Xuding Zhu (1 paper), Department of Mathematics, Zhejiang Normal University, China


Curriculum Vitae

Education

  • Ph.D. in Mathematics and Computer Science, Adam Mickiewicz University, Poznan, Poland, 2004 (diploma with distinction)
  • M.A.Sc. in Computer Science, Technical University of Lodz, Poland, 2001
  • M.Eng. in Computer Science, Technical University of Lodz, Poland, 2001
  • M.Sc. in Mathematics, University of Lodz, Poland, 2000

Curriculum Vitae - Long Version (PDF file)