I Pawel Pralat - home page

Research Area: Modelling and Searching Complex Networks in the Big Data Era

In the big data era, data is considered as the new fossil fuel. Every human-technology interaction, or sensor network, generates new data points that can be viewed, based on the type of interaction, as a self-organizing network. In these networks (for example, the Facebook on-line social network) nodes not only contain some useful information (such as user's profile, photos, tags) but are also internally connected to other nodes (relations based on friendship, similar user's behaviour, age, geographic location). Such networks are large-scale, self-organizing, decentralized, and evolve dynamically over time. Understanding the principles driving the organization and behaviour of complex networks as well as algorithms based on these networks is crucial for a broad range of fields, including information and social sciences, economics, biology, and neuroscience.

My main research interests lie in graph theory with applications to real-world self-organizing networks such as the web graph or social networks. I am interested in both modelling and searching of complex networks with emphasis on connections to Big Data research questions. Both topics have experienced tremendous growth in the last few years, with an increasing number of applications in other areas of mathematics and computer science.


Research Support

Total amount received: $3,025,970
Total amount received for research: $2,709,750
Total amount received for service: $316,220

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

  • $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. B. Kaminski and P. Pralat, Train Your Brain---Challenging Yet Elementary Mathematics, CRC Press, 2020, in press.
  2. A. Bonato and P. Pralat, Graph Searching Games and Probabilistic Methods, CRC Press, 2017.
  3. Volumes Edited

  4. 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.
  5. 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.
  6. 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.
  7. 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.
  8. 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.
  9. 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.
  10. 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.
  11. 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.
  12. 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.
  13. Submitted Papers

  14. K. Georgiou, S. Kundu, and P. Pralat, The Unit Acquisition Number of Binomial Random Graphs, Electronic Journal of Combinatorics, 15pp.
  15. P. Gao, B. Kaminski, C. MacRury, and P. Pralat, Hamilton Cycles in the Semi-random Graph Process, European Journal of Combinatorics, 30pp (Maple/Julia worksheets).
  16. R. Huq, B. Kaminski, A. Mashatan, P. Pralat, and P. Szufel, On Broadcasting Time in the Model of Travelling Agents, Discrete Applied Mathematics, 32pp.
  17. 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, 16pp.
  18. B. Kaminski, P. Pralat, and F. Theberge, Artificial Benchmark for Community Detection (ABCD) --- Fast Random Graph Model with Community Structure, Network Science, 23pp.
  19. A. Dudek, S. English, A. Frieze, C. MacRury, and P. Pralat, Localization Game for Random Graphs, Electronic Journal of Combinatorics, 17pp.
  20. A. Logan, M. Molloy, and P. Pralat, A variant of the Erdos-Renyi random graph process, Journal of Graph Theory, 19pp.
  21. H.M. Morgan, B. Kaminski, and P. Pralat, Cognition, Network Structure, and Learning in Top Managers' Interpersonal Networks, Organization Science, 46pp.
  22. Accepted Papers

  23. D. Bal, P. Bennett, S. English, C. MacRury, and P. Pralat, Zero Forcing Number of Random Regular Graphs, Journal of Combinatorics, 21pp (Maple/Julia worksheet).
  24. S. English, C. MacRury, and P. Pralat, Probabilistic Zero Forcing on Random Graphs, European Journal of Combinatorics, 27pp.
  25. 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 2020).
  26. B. Kaminski, P. Pralat, and F. Theberge, An Unsupervised Framework for Comparing Graph Embeddings, Journal of Complex Networks, 27pp.
  27. 2021

  28. 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.
  29. 2020

  30. 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).
  31. 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.
  32. 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.
  33. 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.
  34. 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.
  35. P. Pralat and N. Wormald, Almost all 5-regular graphs have a 3-flow, Journal of Graph Theory 93(2) (2020), 147-156.
  36. 2019

  37. B. Kaminski, V. Poulin, P. Pralat, P. Szufel, and F. Theberge, Clustering via Hypergraph Modularity, PLoS ONE 14(11): e0224307 (GitHub gist repository).
  38. P. Pralat, How many zombies are needed to catch the survivor on toroidal grids?, Theoretical Computer Science 794 (2019), 3-11.
  39. B. Kaminski and P. Pralat, Subtrees of a random tree, Discrete Applied Mathematics 268 (2019), 119-129.
  40. P. Pralat and N. Wormald, Meyniel's conjecture holds for random d-regular graphs, Random Structures and Algorithms 55(3) (2019), 719-741.
  41. 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.
  42. B. Kaminski, T. Olczak, and P. Pralat, Parallel Execution of Schedules with Random Dependency Graph, Theoretical Computer Science 784 (2019), 113-132.
  43. C. McDiarmid, D. Mitsche, and P. Pralat, Clique colouring of binomial random graphs, Random Structures and Algorithms 54(4) (2019), 589-614.
  44. 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.
  45. 2018

  46. P. Gordinowicz and P. Pralat, Small online Ramsey numbers---a new approach, Contributions to Discrete Mathematics 13(2) (2018), 101-111 (supplementary files).
  47. C. McDiarmid, D. Mitsche, and P. Pralat, Clique colourings of geometric graphs, Electronic Journal of Combinatorics 25(4) (2018), #P4.56.
  48. 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.
  49. D. Mitsche, P. Pralat, and E. Roshanbin, Burning number of graph products, Theoretical Computer Science 746 (2018), 124-135.
  50. Л. Исхаков, М. Миронов, Л. Прохоренкова, Б. Камински, П. Пралат, Кластерный коэффициент в модели пространственного предпочтительного присоединения, Доклады Академии Наук 2018, том 481, №1, с. 10--14.
  51. A. Dudek and P. Pralat, Note on the multicolour size-Ramsey number for paths, Electronic Journal of Combinatorics 25(3) (2018), #P3.35.
  52. 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.
  53. 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.
  54. A. Dudek, F. Khoeini, and P. Pralat, Size-Ramsey numbers of cycles versus a path, Discrete Mathematics 341 (2018), 2095-2103.
  55. 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).
  56. A. Dudek, X. Perez-Gimenez, P. Pralat, H. Qi, D. West, X. Zhu, Randomly Twisted Hypercubes, European Journal of Combinatorics 70 (2018), 364-373.
  57. 2017

  58. 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.
  59. A. Dudek and P. Pralat, On some multicolour Ramsey properties of random graphs, SIAM Journal on Discrete Mathematics 31(3) (2017), 2079-2092.
  60. 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.
  61. 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.
  62. L. Ostroumova Prokhorenkova, P. Pralat, and A. Raigorodskii, Modularity in several random graph models, Electronic Notes in Discrete Mathematics 61 (2017), 947-953.
  63. 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.
  64. E. Infeld, D. Mitsche, and P. Pralat, The Total Acquisition Number of Random Geometric Graphs, Electronic Journal of Combinatorics 24(3) (2017), #P3.31.
  65. L. Ostroumova Prokhorenkova, P. Pralat, and A. Raigorodskii, Modularity of complex networks models, Internet Mathematics (2017), 23pp.
  66. 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++).
  67. 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.
  68. D. Mitsche, P. Pralat, and E. Roshanbin, Burning graphs---a probabilistic perspective, Graphs and Combinatorics 33(2) (2017), 449-471.
  69. 2016

  70. 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.
  71. 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.
  72. 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.
  73. A. Bener, B. Caglayan, A. Henry, and P. Pralat, Empirical Models of Social Learning in a Large, Evolving Network, PLoS ONE 11(10): e0160307.
  74. A. Dudek, D. Mitsche, and P. Pralat, The set chromatic number of random graphs, Discrete Applied Mathematics 215 (2016), 61-70.
  75. 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.
  76. 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.
  77. 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.
  78. 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.
  79. W. Kinnersley and P. Pralat, Game brush number, Discrete Applied Mathematics 207 (2016), 1-14.
  80. D. Mitsche, X. Perez-Gimenez, and P. Pralat, The bondage number of random graphs, Electronic Journal of Combinatorics 23(2) (2016), #P2.13.
  81. 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.
  82. A. Dudek and P. Pralat, Acquaintance time of random graphs near connectivity threshold, SIAM Journal on Discrete Mathematics 30(1) (2016), 555-568.
  83. W. Kinnersley, P. Pralat, and D. West, To Catch a Falling Robber, Theoretical Computer Science 627 (2016), 107-111.
  84. 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.
  85. 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.
  86. P. Pralat and N. Wormald, Meyniel's conjecture holds for random graphs, Random Structures and Algorithms 48(2) (2016), 396-421.
  87. 2015

  88. P. Pralat, Variants of the game of cops and robbers, Research Perspectives CRM Barcelona, 4pp.
  89. 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.
  90. D. Bal, A. Bonato, W. Kinnersley, and P. Pralat, Lazy Cops and Robbers on hypercubes, Combinatorics, Probability and Computing 24(6) (2015), 829-837.
  91. A. Li, T. Muller, and P. Pralat, Chasing robbers on percolated random geometric graphs, Contributions to Discrete Mathematics 10(1) (2015), 134-144.
  92. 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.
  93. P. Pralat, Containment game played on random graphs: another zig-zag theorem, Electronic Journal of Combinatorics 22(2) (2015), #P2.32.
  94. T. Muller and P. Pralat, The acquaintance time of (percolated) random geometric graphs, European Journal of Combinatorics 48 (2015), 198-214.
  95. 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.
  96. 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.
  97. 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.
  98. P. Pralat, Almost all k-cop-win graphs contain a dominating set of cardinality k, Discrete Mathematics 338 (2015), 47-52.
  99. 2014

  100. A. Kehagias, D. Mitsche, and P. Pralat, The Role of Visibility in Pursuit/Evasion Games, Robotics 4 (2014), 371-399.
  101. 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).
  102. P. Borowiecki, D. Dereniowski, and P. Pralat, Brushing with additional cleaning restrictions, Theoretical Computer Science 557 (2014), 76-86.
  103. T. Gavenciak, J. Kratochvil, and P. Pralat, Firefighting on square, hexagonal, and triangular grids, Discrete Mathematics 337 (2014), 142-155 (Maple worksheet).
  104. N. Alon and P. Pralat, Chasing robbers on random geometric graphs---an alternative approach, Discrete Applied Mathematics 178 (2014), 149-152.
  105. 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).
  106. D. Mitsche and P. Pralat, On the hyperbolicity of random graphs, Electronic Journal of Combinatorics 21(2) (2014), #P2.39.
  107. M.E. Messinger, R. Nowakowski, and P. Pralat, Elimination schemes and lattices, Discrete Mathematics 328 (2014), 63-70.
  108. C. Cooper, A. Frieze, and P. Pralat, Some typical properties of the Spatial Preferred Attachment model, Internet Mathematics 10 (2014), 27-47.
  109. A. Bonato, J. Brown, D. Mitsche, and P. Pralat, Independence densities of hypergraphs, European Journal of Combinatorics 40 (2014), 124-136.
  110. D. Bryant, N. Francetic, P. Gordinowicz, D. Pike, and P. Pralat, Brushing without capacity restrictions, Discrete Applied Mathematics 170 (2014), 33-45.
  111. P. Pralat, Graphs with average degree smaller than 30/11 burn slowly, Graphs and Combinatorics 30(2) (2014), 455-470.
  112. A. Dudek, P. Gordinowicz, and P. Pralat, Cops and Robbers playing on edges, Journal of Combinatorics 5(1) (2014), 131-153.
  113. 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.
  114. 2013

  115. P. Pralat, Sparse graphs are not flammable, SIAM Journal on Discrete Mathematics 27(4) (2013), 2157-2166.
  116. 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.
  117. B. Bollobas, D. Mitsche, and P. Pralat, Metric dimension for random graphs, Electronic Journal of Combinatorics 20(4) (2013), #P1.
  118. W. Kinnersley, D. Mitsche, and P. Pralat, A note on the acquaintance time of random graphs, Electronic Journal of Combinatorics 20(3) (2013), #P52.
  119. 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.
  120. 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.
  121. A. Bonato, P. Gordinowicz, W. Kinnersley, and P. Pralat, The capture time of the hypercube, Electronic Journal of Combinatorics 20 (2013), #P24.
  122. A. Bonato, D. Mitsche, and P. Pralat, Vertex-pursuit in random directed acyclic graphs, SIAM Journal on Discrete Mathematics 27 (2013), 732-756.
  123. D. Mitsche and P. Pralat, Revolutionaries and spies on random graphs, Combinatorics, Probability and Computing 22 (2013), 417-432.
  124. A. Kehagias, D. Mitsche, and P. Pralat, Cops and Invisible Robbers: the Cost of Drunkenness, Theoretical Computer Science 481 (2013), 100-120.
  125. 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).
  126. J. Janssen, P. Pralat, and R. Wilson, Geometric Graph Properties of the Spatial Preferred Attachment model, Advances in Applied Mathematics 50 (2013), 243-267.
  127. 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.
  128. 2012

  129. A. Kehagias and P. Pralat, Some Remarks on Cops and Drunk Robbers, Theoretical Computer Science 463 (2012), 133-147 (supplementary files).
  130. P. Gordinowicz, R. Nowakowski, and P. Pralat, POLISH-Let us play the cleaning game, Theoretical Computer Science 463 (2012), 123-132.
  131. P. Pralat, A note on off-diagonal small on-line Ramsey numbers for paths, Ars Combinatoria 107 (2012), 295-306 (programs in C/C++).
  132. O-Y. Chan and P. Pralat, Chipping away at the edges: how long does it take?, Journal of Combinatorics 3 (2012), 101-121.
  133. 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.
  134. F. Fomin, P. Golovach, and P. Pralat, Cops and Robber with Constraints, SIAM Journal on Discrete Mathematics 26 (2012), 571-590.
  135. A. Bonato, M.E. Messinger, and P. Pralat, Fighting Constrained Fires in Graphs, Theoretical Computer Science 434 (2012), 11-22 (program in C/C++).
  136. 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.
  137. A. Bonato, G. Kemkes, and P. Pralat, Almost all cop-win graphs contain a universal vertex, Discrete Mathematics 312 (2012), 1652-1657.
  138. A. Bonato, J. Janssen, and P. Pralat, Geometric Protean Graphs, Internet Mathematics 8 (2012), 2-28.
  139. 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++).
  140. 2011

  141. A. Bonato, J. Brown, G. Kemkes, and P. Pralat, Independence and chromatic densities of graphs, Journal of Combinatorics 2 (2011), 397-411.
  142. P. Pralat, J. Verstraete, and N. Wormald, On the threshold for k-regular subgraphs of random graphs, Combinatorica 31 (2011), 565-581.
  143. P. Pralat and C. Wang, An edge deletion model for complex networks, Theoretical Computer Science 412 (2011), 5111-5120 (Maple worksheet).
  144. P. Pralat, Cleaning random d-regular graphs with Brooms, Graphs and Combinatorics 27 (2011), 567-584 (Maple worksheets).
  145. 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).
  146. C. Cooper and P. Pralat, Scale-free graphs of increasing degree, Random Structures and Algorithms 38 (2011), 396-421.
  147. 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.
  148. N. Alon and P. Pralat, Modular orientations of random and quasi-random regular graphs, Combinatorics, Probability and Computing 20 (2011), 321-329.
  149. P. Pralat, Connectivity threshold and recovery time in rank-based models for complex networks, Discrete Mathematics 311 (2011), 932-939.
  150. A. Bonato, N. Hadi, P. Horn, P. Pralat, and C. Wang, Models of on-line social networks, Internet Mathematics 6 (2011), 285-313.
  151. M.E. Messinger, R. Nowakowski, and P. Pralat, Cleaning with Brooms, Graphs and Combinatorics 27 (2011), 251-267.
  152. 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.
  153. 2010

  154. 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.
  155. T. Luczak and P. Pralat, Chasing robbers on random graphs: zigzag theorem, Random Structures and Algorithms 37 (2010), 516-524.
  156. 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++).
  157. A. Bonato, E. Chiniforooshan, and P. Pralat, Cops and Robbers from a Distance, Theoretical Computer Science 411 (2010), 3834-3844.
  158. 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++).
  159. P. Pralat, The surviving rate of planar graphs, Proceedings of the Midsummer Combinatorial Workshop 2010, KAM-DIMATIA Series, 2pp.
  160. 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++).
  161. A. Bonato, J. Janssen, and P. Pralat, A Geometric Model for On-line Social Networks, 3rd Workshop on Online Social Networks (WOSN 2010), 7pp.
  162. 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.
  163. J. Janssen and P. Pralat, Rank-based attachment leads to power law graphs, SIAM Journal on Discrete Mathematics 24 (2010), 420-440.
  164. 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++).
  165. 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.
  166. P. Pralat, When does a random graph have constant cop number?, Australasian Journal of Combinatorics 46 (2010), 285-296.
  167. 2009

  168. J. Janssen and P. Pralat, Protean graphs with a variety of ranking schemes, Theoretical Computer Science 410 (2009), 5491-5504.
  169. A. Bonato and P. Pralat, The good, the bad, and the great: homomorphisms and cores of random graphs, Discrete Mathematics 309 (2009), 5535-5539.
  170. 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.
  171. 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.
  172. A. Bonato, P. Pralat, and C. Wang, Pursuit-evasion in models of complex networks, Internet Mathematics 4 (2009), 419-436.
  173. S. Gaspers, M.E. Messinger, R. Nowakowski, and P. Pralat, Clean the graph before you draw it!, Information Processing Letters 109 (2009), 463-467.
  174. P. Pralat and N. Wormald, Growing protean graphs, Internet Mathematics 4 (2009), 1-16.
  175. P. Pralat, Cleaning random graphs with brushes, Australasian Journal of Combinatorics 43 (2009), 237-251 (Maple worksheets).
  176. 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.
  177. 2008

  178. N. Alon, P. Pralat, and N. Wormald, Cleaning regular graphs with brushes, SIAM Journal on Discrete Mathematics 23 (2008), 233-250 (Maple worksheets).
  179. J. Grytczuk, H. Kierstead, and P. Pralat, On-line Ramsey Numbers for Paths and Stars, Discrete Mathematics & Theoretical Computer Science 10 (2008), 63-74.
  180. 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.
  181. P. Pralat, A note on the diameter of protean graphs, Discrete Mathematics 308 (2008), 3399-3406.
  182. M.E. Messinger, R. Nowakowski, and P. Pralat, Cleaning a Network with Brushes, Theoretical Computer Science 399 (2008), 191-205.
  183. P. Pralat, R*(3,4)=17, Electronic Journal of Combinatorics 15 (2008), #R67, 13pp (programs in C/C++).
  184. 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.
  185. 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++).
  186. 2007

  187. 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.
  188. 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.
  189. 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).
  190. 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).
  191. 2006

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

  194. 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.
  195. Dissertations

  196. P. Pralat, Protean graphs (in Polish), Ph.D. dissertation (2004), 103pp.
  197. P. Pralat, Wavelet representation of digital images (in Polish), M.A.Sc. thesis, Technical University of Lodz (2001), 68pp.
  198. 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. Konstantin Avrachenkov (1 paper), Sophia Antipolis, INRIA, Sophia Antipolis Cedex, France
  6. Ceni Babaoglu (1 paper), Data Science Lab, Department of Mechanical & Industrial Engineering, Ryerson University, Toronto, ON, Canada
  7. Catharine Baker (1 paper), Department of Mathematics and Computer Science, Mount Allison University, Sackville, NB, Canada
  8. Deepak Bal (7 papers), Department of Mathematics, Montclair State University, Montclair, NJ, USA
  9. Ayse Bener (3 papers), Data Science Lab, Department of Mechanical & Industrial Engineering, Ryerson University, Toronto, ON, Canada
  10. Itai Benjamini (1 paper), Department of Mathematics, The Weizmann institute of Science, Rehovot, Israel
  11. Patrick Bennett (5 papers), Department of Mathematics, Western Michigan University, Kalamazoo, MI, USA
  12. Bela Bollobas (1 paper), Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, Cambridge, UK
  13. Anthony Bonato (38 papers), Department of Mathematics, Ryerson University, Toronto, ON, Canada
  14. Piotr Borowiecki (1 paper), Department of Algorithms and System Modeling, Gdansk University of Technology, Gdansk, Poland
  15. Jason Brown (2 papers), Department of Mathematics and Statistics, Dalhousie University, Halifax, NS, Canada
  16. Darryn Bryant (1 paper), Department of Mathematics, The University of Queensland, Brisbane, Australia
  17. Bora Caglayan (1 paper), Data Science Lab, Department of Mechanical & Industrial Engineering, Ryerson University, Toronto, ON, Canada
  18. O-Yeat Chan (1 paper), School of Mathematical and Physical Sciences, University of Newcastle, Callaghan, Australia
  19. Ehsan Chiniforooshan (1 paper), Biocomputing Lab, University of Western Ontario, London, ON, Canada
  20. Fan Chung Graham (3 papers), Department of Mathematics, University of California, San Diego, USA
  21. Francisco Claude (1 paper), Department of Computer Science, University of Waterloo, Waterloo, ON, Canada
  22. Colin Cooper (6 papers), Department of Computer Science, King's College, London, United Kingdom
  23. Gennaro Cordasco (2 papers), Dipartimento di Psicologia, Universita degli Studi della Campania `Luigi Vanvitelli', Italy
  24. Rita M. del Rio-Chanona (3 papers), Universidad Nacional Autonoma de Mexico, Mexico City, Mexico
  25. Dariusz Dereniowski (1 paper), Department of Algorithms and System Modeling, Gdansk University of Technology, Gdansk, Poland
  26. Megan Dewar (2 papers), The Tutte Institute for Mathematics and Computing, Ottawa, ON, Canada
  27. Reza Dorrigiv (2 papers), Faculty of Computer Science, Dalhousie University, Halifax, NS, Canada
  28. Andrzej Dudek (10 papers), Department of Mathematics, Western Michigan University, Kalamazoo, MI, USA
  29. Sean English (3 papers), Department of Mathematics, Ryerson University, Toronto, ON, Canada
  30. Stephen Finbow (1 paper), Department of Mathematics, Statistics and Computer Science, St. Francis Xavier University, Antigonish, NS, Canada
  31. Fedor Fomin (1 paper), Department of Informatics, University of Bergen, Bergen, Norway
  32. Nevena Francetic (1 paper), Department of Mathematics and Statistics, Carleton University, Ottawa, ON, Canada
  33. Alan Frieze (9 papers), Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA, USA
  34. Pu Gao (1 paper), Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, Canada
  35. Serge Gaspers (2 papers), School of Computer Science and Engineering, The University of New South Wales, Sydney, Australia
  36. Tomas Gavenciak (1 paper), Department of Applied Mathematics, Charles University, Praha, Czech Republic
  37. Konstantinos Georgiou (2 papers), Department of Mathematics, Ryerson University, Toronto, ON, Canada
  38. David Gleich (1 paper), Computer Science Department, Purdue University, West Lafayette, IN, USA
  39. Anant Godbole (1 paper), Department of Mathematics and Statistics, East Tennessee State University, Johnson City, TN, USA
  40. Petr Golovach (1 paper), Department of Informatics, University of Bergen, Bergen, Norway
  41. Przemyslaw Gordinowicz (9 papers), Department of Mathematics, Technical University of Lodz, Lodz, Poland
  42. Jaroslaw Grytczuk (1 paper), Faculty of Mathematics and Computer Science, Jagiellonian University, Krakow, Poland
  43. Noor Hadi (2 papers), Department of Mathematics, Wilfrid Laurier University, Waterloo, ON, Canada
  44. Ali Haidar (1 paper), School of Mathematics and Statistics, Carleton University, Ottawa, ON, Canada
  45. John Healy (2 papers), The Tutte Institute for Mathematics and Computing, Ottawa, ON, Canada
  46. Adam Henry (5 papers), School of Government and Public Policy, University of Arizona, Tucson, AZ, USA
  47. Carlos Hoppen (1 paper), Instituto de Matematica, Universidade Federal do Rio Grande do Sul, Brazil
  48. Paul Horn (3 papers), Department of Mathematics, Harvard University, Cambridge, MA, USA
  49. Reaz Huq (1 paper), Department of Mathematics, Ryerson University, Toronto, ON, Canada
  50. Ewa Infeld (2 papers), Department of Mathematics, Ryerson University, Toronto, ON, Canada
  51. Lenar Iskhakov (3 papers), Advanced Combinatorics and Network Applications Lab, Moscow Institute of Physics and Technology, Moscow, Russia
  52. Jeannette Janssen (12 papers), Department of Mathematics and Statistics, Dalhousie University, Halifax, NS, Canada
  53. Shahin Kamali (1 paper), Department of Computer Science, University of Waterloo, Waterloo, ON, Canada
  54. Bogumil Kaminski (19 papers), Decision Support and Analysis Unit, Warsaw School of Economics, Warsaw, Poland
  55. Thanasis Kehagias (4 papers), Department of Mathematics, Physics and Computer Sciences, Aristotle University of Thessaloniki, Thessaloniki, Greece
  56. Elizabeth Kelley (1 paper), Department of Mathematics, University of Minnesota, Minneapolis, MN, USA
  57. Graeme Kemkes (2 papers), Department of Mathematics, Ryerson University, Toronto, ON, Canada
  58. Farideh Khoeini (1 paper), Department of Mathematical Sciences, Isfahan University of Technology, Isfahan, Iran
  59. Hal Kierstead (1 paper), Department of Mathematics, Arizona State University, Tempe, AZ, USA
  60. Myunghwan Kim (1 paper), Computer Science Department, Stanford University, Stanford, CA, USA
  61. William Kinnersley (8 papers), Department of Mathematics, University of Rhode Island, Kingston, RI, USA
  62. Akin Kocak (1 paper), Data Science Lab, Department of Mechanical & Industrial Engineering, Ryerson University, Toronto, ON, Canada
  63. Lukasz Krainski (1 paper), Decision Support and Analysis Unit, Warsaw School of Economics, Warsaw, Poland
  64. Jan Kratochvil (1 paper), Department of Applied Mathematics, Charles University, Praha, Czech Republic
  65. Somnath Kundu (1 paper), Department of Mathematics, Ryerson University, Toronto, ON, Canada
  66. Emily Kurtz (1 paper), Department of Mathematics, Wellesley College, Wellesley, MA, USA
  67. Parisa Lak (2 papers), Data Science Lab, Department of Mechanical & Industrial Engineering, Ryerson University, Toronto, ON, Canada
  68. Anshui Li (1 paper), Mathematical Institute, Utrecht University, Utrecht, The Netherlands
  69. Marek Lipczak (2 papers), Google, Waterloo, ON, Canada
  70. Adam Logan (1 paper), The Tutte Institute for Mathematics and Computing, Ottawa, ON, Canada
  71. Alejandro Lopez-Ortiz (2 papers), Department of Computer Science, University of Waterloo, Waterloo, ON, Canada
  72. Marc Lozier (1 paper), Department of Mathematics, Ryerson University, Toronto, ON, Canada
  73. Tomasz Luczak (2 papers), Department of Discrete Mathematics, Adam Mickiewicz University, Poznan, Poland
  74. Calum MacRury (8 papers), Department of Computer Science , University of Toronto, Toronto, ON, Canada
  75. Atefeh Mashatan (2 papers), Cybersecurity Research Lab, Ryerson University, Toronto, ON, Canada
  76. Colin McDiarmid (2 papers), Department of Statistics, University of Oxford, Oxford, England
  77. Neil A. McKay (1 paper), Department of Mathematics and Statistics, Dalhousie University, Halifax, NS, Canada
  78. Abbas Mehrabian (1 paper), Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, Canada
  79. Margaret-Ellen Messinger (7 papers), Department of Mathematics & Computer Science, Mount Allison University , Sackville, NB, Canada
  80. Evangelos Milios (2 papers), Faculty of Computer Science, Dalhousie University, Halifax, NS, Canada
  81. Maksim Mironov (3 papers), Advanced Combinatorics and Network Applications Lab, Moscow Institute of Physics and Technology, Moscow, Russia
  82. Dieter Mitsche (26 papers), The Camille Jordan Institute, Université Claude Bernard Lyon 1, Lyon, France
  83. Michael Mitzenmacher (1 paper), School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA
  84. Mike Molloy (2 papers), Department of Computer Science , University of Toronto, Toronto, ON, Canada
  85. Horatio Morgan (2 papers), Ted Rogers School of Management, Ryerson University, Toronto, ON, Canada
  86. Tobias Muller (2 papers), Mathematical Institute, Utrecht University, Utrecht, The Netherlands
  87. Jake Nicolaidis (3 papers), Department of Computer Science, Ryerson University, Toronto, ON, Canada
  88. Richard Nowakowski (7 papers), Department of Mathematics and Statistics, Dalhousie University, Halifax, NS, Canada
  89. Eran Ofek (1 paper), Department of Computer Science and Applied Mathematics, The Weizmann institute of Science, Rehovot, Israel
  90. Tomasz Olczak (2 papers), Decision Support and Analysis Unit, Warsaw School of Economics, Warsaw, Poland
  91. Xavier Perez-Gimenez (16 papers), Department of Mathematics, University of Nebraska, Lincoln, NE, USA
  92. David Pike (1 paper), Department of Mathematics and Statistics, Memorial University of Newfoundland, St. John's, NL, Canada
  93. Hari Pokhrel (1 paper), Department of Mathematics, Ryerson University, Toronto, ON, Canada
  94. Valerie Poulin (1 paper), The Tutte Institute for Mathematics and Computing, Ottawa, ON, Canada
  95. Liudmila Prokhorenkova (6 papers), Machine intelligence and research department, Yandex, Moscow, Russia
  96. John Proos (2 papers), The Tutte Institute for Mathematics and Computing, Ottawa, ON, Canada
  97. Hao Qi (1 paper), Department of Mathematics, Zhejiang Normal University, China
  98. Andrei Raigorodskii (4 papers), Yandex, Moscow, Russia
  99. Benjamin Reiniger (4 papers), Department of Mathematics, Ryerson University, Toronto, ON, Canada
  100. Jazmin Romero (1 paper), Department of Computer Science, University of Waterloo, Waterloo, ON, Canada
  101. Elham Roshanbin (2 papers), Department of Mathematics and Statistics, Dalhousie University, Halifax, NS, Canada
  102. Alejandro Salinger (1 paper), Department of Computer Science, University of Waterloo, Waterloo, ON, Canada
  103. Akram Samarikhalaj (1 paper), Data Science Lab, Department of Mechanical & Industrial Engineering, Ryerson University, Toronto, ON, Canada
  104. Vittorio Scarano (2 papers), Dipartimento di Psicologia, Universita degli Studi della Campania `Luigi Vanvitelli', Italy
  105. Diego Seco (1 paper), Department of Computer Science, University of A Coruna, A Coruna, Spain
  106. Carmine Spagnuolo (2 papers), Dipartimento di Psicologia, Universita degli Studi della Campania `Luigi Vanvitelli', Italy
  107. Ladislav Stacho (1 paper), Department of Mathematics, Simon Fraser University, Burnaby, BC, Canada
  108. Przemyslaw Szufel (6 papers), Decision Support and Analysis Unit, Warsaw School of Economics, Warsaw, Poland
  109. Kirill Ternovsky (5 papers), Department of Computer Science, Ryerson University, Toronto, ON, Canada
  110. Francois Theberge (4 papers), The Tutte Institute for Mathematics and Computing, Ottawa, ON, Canada
  111. Amanda Tian (1 paper), Department of Mathematics, Ryerson University, Toronto, ON, Canada
  112. Jacques Verstraete (1 paper), Department of Mathematics, University of California, San Diego, USA
  113. Changping Wang (5 papers), Department of Mathematics, Ryerson University, Toronto, ON, Canada
  114. Douglas West (3 papers), Department of Mathematics, Zhejiang Normal University, China
  115. Rory Wilson (4 papers), Department of Mathematics and Statistics, Dalhousie University, Halifax, NS, Canada
  116. Nicholas Wormald (8 papers), School of Mathematical Sciences, Monash University, Australia
  117. Nan Ye (1 paper), Department of Mathematics, The University of Queensland, Brisbane, Australia
  118. Stephen Young (1 paper), Mathematics Department, University of Louisville, Louisville, KY, USA
  119. Cun-Quan Zhang (1 paper), Department of Mathematics, West Virginia University, Morgantown, WV, USA
  120. Yiguang Zhang (1 paper), Department of Applied Mathematics and Statistics, The Johns Hopkins University, Baltimore, MD, USA
  121. 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)