default search action
Pawel Pralat
Paweł Prałat
Person information
- unicode name: Paweł Prałat
- affiliation: Toronto Metropolitan University, Department of Mathematics, ON, Canada
- affiliation (former): Ryerson University, Department of Mathematics, Toronto, ON, Canada
- affiliation (former): West Virginia University, Department of Mathematics, Morgantown, WV, USA
- affiliation (former): Dalhousie University, Department of Mathematics and Statistics, Halifax, NS, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j137]Austin Eide, Pawel Pralat:
Linear colouring of binomial random graphs. Discret. Math. 348(2): 114278 (2025) - 2024
- [j136]Pawel Pralat, Harjas Singh:
Power of $k$ Choices in the Semi-Random Graph Process. Electron. J. Comb. 31(1) (2024) - [j135]Natalie C. Behague, Trent G. Marbach, Pawel Pralat, Andrzej Rucinski
:
Subgraph Games in the Semi-Random Graph Process and Its Generalization to Hypergraphs. Electron. J. Comb. 31(3) (2024) - [j134]Ashkan Dehghan
Unsupervised framework for evaluating and explaining structural node embeddings of graphs. J. Complex Networks 12(2) (2024) - [j133]Patrick Bennett, Ryan Cushman, Andrzej Dudek
The Erdős-Gyárfás function f(n,4,5)=56n+o(n) - So Gyárfás was right. J. Comb. Theory B 169: 253-297 (2024) - [j132]Calum MacRury, Nykyta Polituchyi, Pawel Pralat, Kinga Siuta
Optimizing transport frequency in multi-layered urban transportation networks for pandemic prevention. Public Transp. 16(2): 381-418 (2024) - [j131]Deepak Bal, Alan M. Frieze
Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\). SIAM J. Discret. Math. 38(1): 867-882 (2024) - [j130]David Gamarnik, Mihyun Kang, Pawel Pralat:
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process. SIAM J. Discret. Math. 38(3): 2312-2334 (2024) - [j129]Bogumil Kaminski
Predicting properties of nodes via community-aware features. Soc. Netw. Anal. Min. 14(1): 117 (2024) - [c42]Divyarthi Mohan, Pawel Pralat:
Asynchronous Majority Dynamics on Binomial Random Graphs. APPROX/RANDOM 2024: 5:1-5:20 - [c41]Jordan Barrett, Bogumil Kaminski
Self-similarity of Communities of the ABCD Model. WAW 2024: 17-31 - [c40]Nick Arnosti
Impact of Market Design and Trading Network Structure on Market Efficiency. WAW 2024: 47-64 - [c39]Ashkan Dehghan, Pawel Pralat, François Théberge:
Network Embedding Exploration Tool (NEExT). WAW 2024: 65-79 - [e11]Megan Dewar, Bogumil Kaminski, Daniel Kaszynski, Lukasz Krainski
Modelling and Mining Networks - 19th International Workshop, WAW 2024, Warsaw, Poland, June 3-6, 2024, Proceedings. Lecture Notes in Computer Science 14671, Springer 2024, ISBN 978-3-031-59204-1 [contents] - [i46]Bogumil Kaminski, Pawel Misiorek, Pawel Pralat, François Théberge:
Modularity Based Community Detection in Hypergraphs. CoRR abs/2406.17556 (2024) - [i45]Jordan Barrett, Pawel Pralat, Aaron Smith, François Théberge:
Counting simplicial pairs in hypergraphs. CoRR abs/2408.11806 (2024) - 2023
- [b1]Stan Matwin
Generative Methods for Social Media Analysis. Springer Briefs in Computer Science, Springer 2023, ISBN 978-3-031-33616-4, pp. 1-67 - [j128]Anthony Bonato, Konstantinos Georgiou, Calum MacRury, Pawel Pralat:
Algorithms for p-Faulty Search on a Half-Line. Algorithmica 85(8): 2485-2514 (2023) - [j127]Bogumil Kaminski, Pawel Pralat, François Théberge:
Artificial benchmark for community detection with outliers (ABCD+o). Appl. Netw. Sci. 8(1): 25 (2023) - [j126]Dariusz Dereniowski, Przemyslaw Gordinowicz, Pawel Pralat:
Edge and Pair Queries-Random Graphs and Complexity. Electron. J. Comb. 30(2) (2023) - [j125]Bogumil Kaminski, Pawel Pralat, François Théberge:
Hypergraph Artificial Benchmark for Community Detection (h-ABCD). J. Complex Networks 11(4) (2023) - [j124]Lyuben Lichev, Dieter Mitsche, Pawel Pralat:
Localization game for random geometric graphs. Eur. J. Comb. 108: 103616 (2023) - [j123]Ashkan Dehghan, Kinga Siuta
Detecting bots in social-networks using node and structural embeddings. J. Big Data 10(1): 119 (2023) - [j122]Adam Logan, Michael Molloy
A variant of the Erdős-Rényi random graph process. J. Graph Theory 102(2): 322-345 (2023) - [c38]Bogumil Kaminski, Pawel Pralat, François Théberge, Sebastian Zajac
Classification Supported by Community-Aware Node Features. COMPLEX NETWORKS (2) 2023: 133-145 - [c37]Konstantinos Georgiou, Somnath Kundu, Pawel Pralat:
The Fagnano Triangle Patrolling Problem (Extended Abstract). SSS 2023: 157-171 - [c36]Ashkan Dehghan, Kinga Siuta
Unsupervised Framework for Evaluating Structural Node Embeddings of Graphs. WAW 2023: 36-51 - [c35]Bogumil Kaminski, Pawel Misiorek, Pawel Pralat, François Théberge:
Modularity Based Community Detection in Hypergraphs. WAW 2023: 52-67 - [e10]Megan Dewar, Pawel Pralat, Przemyslaw Szufel, François Théberge, Malgorzata Wrzosek:
Algorithms and Models for the Web Graph - 18th International Workshop, WAW 2023, Toronto, ON, Canada, May 23-26, 2023, Proceedings. Lecture Notes in Computer Science 13894, Springer 2023, ISBN 978-3-031-32295-2 [contents] - [i44]Bogumil Kaminski, Pawel Pralat, François Théberge:
Artificial Benchmark for Community Detection with Outliers (ABCD+o). CoRR abs/2301.05749 (2023) - [i43]Marcos Kiwi, Lyuben Lichev, Dieter Mitsche, Pawel Pralat:
Label propagation on binomial random graphs. CoRR abs/2302.03569 (2023) - [i42]Pawel Pralat, Harjas Singh:
Power of k Choices in the Semi-Random Graph Process. CoRR abs/2302.13330 (2023) - [i41]David Gamarnik, Mihyun Kang
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process. CoRR abs/2303.13443 (2023) - [i40]Ashkan Dehghan, Kinga Siuta, Agata Skorupka, Andrei Betlen, David Miller, Bogumil Kaminski, Pawel Pralat:
Unsupervised Framework for Evaluating and Explaining Structural Node Embeddings of Graphs. CoRR abs/2306.10770 (2023) - [i39]Konstantinos Georgiou, Somnath Kundu, Pawel Pralat:
The Fagnano Triangle Patrolling Problem. CoRR abs/2307.13153 (2023) - [i38]Divyarthi Mohan, Pawel Pralat:
Asynchronous Majority Dynamics on Binomial Random Graphs. CoRR abs/2309.04691 (2023) - [i37]Bogumil Kaminski, Pawel Pralat, François Théberge, Sebastian Zajac
Predicting Properties of Nodes via Community-Aware Features. CoRR abs/2311.04730 (2023) - [i36]Alan M. Frieze, Pu Gao, Calum MacRury, Pawel Pralat, Gregory B. Sorkin:
Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than 2n Rounds. CoRR abs/2311.05533 (2023) - [i35]Austin Eide, Pawel Pralat:
Linear Colouring of Binomial Random Graphs. CoRR abs/2311.08560 (2023) - [i34]Jordan Barrett, Bogumil Kaminski, Pawel Pralat, François Théberge:
Self-similarity of Communities of the ABCD Model. CoRR abs/2312.00238 (2023) - 2022
- [j121]Bogumil Kaminski
Properties and Performance of the ABCDe Random Graph Model with Community Structure. Big Data Res. 30: 100348 (2022) - [j120]Natalie C. Behague
Tight Bounds on Probabilistic Zero Forcing on Hypercubes and Grids. Electron. J. Comb. 29(1) (2022) - [j119]Arash Dehghan-Kooshkghazi, Bogumil Kaminski, Lukasz Krainski
Evaluating node embeddings of complex networks. J. Complex Networks 10(4) (2022) - [j118]Bogumil Kaminski, Bartosz Pankratz
Modularity of the ABCD random graph model with community structure. J. Complex Networks 10(6) (2022) - [j117]Andrzej Dudek, Sean English
Localization game for random graphs. Discret. Appl. Math. 309: 202-214 (2022) - [j116]Reaz Huq
Broadcasting on paths and cycles. Discret. Math. 345(7): 112883 (2022) - [j115]Pu Gao, Bogumil Kaminski, Calum MacRury, Pawel Pralat:
Hamilton cycles in the semi-random graph process. Eur. J. Comb. 99: 103423 (2022) - [j114]Bogumil Kaminski, Lukasz Krainski
A multi-purposed unsupervised framework for comparing embeddings of undirected and directed graphs. Netw. Sci. 10(4): 323-346 (2022) - [j113]Pu Gao, Calum MacRury, Pawel Pralat
Perfect Matchings in the Semirandom Graph Process. SIAM J. Discret. Math. 36(2): 1274-1290 (2022) - [c34]Pu Gao, Calum MacRury, Pawel Pralat:
A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process. APPROX/RANDOM 2022: 29:1-29:22 - [c33]Bogumil Kaminski, Bartosz Pankratz
Modularity of the ABCD Random Graph Model with Community Structure. COMPLEX NETWORKS (2) 2022: 3-15 - [c32]Bogumil Kaminski, Pawel Pralat, François Théberge:
Outliers in the ABCD Random Graph Model with Community Structure (ABCD+o). COMPLEX NETWORKS (2) 2022: 163-174 - [c31]Bartosz Pankratz
Community Detection Supported by Node Embeddings (Searching for a Suitable Method). COMPLEX NETWORKS (2) 2022: 221-232 - [c30]Ashkan Dehghan, Kinga Siuta, Agata Skorupka, Akshat Dubey, Andrei Betlen, David Miller, Wei Xu, Bogumil Kaminski, Pawel Pralat:
Detecting Bots in Social-networks using Node and Structural Embeddings. DATA 2022: 50-61 - [i33]Bogumil Kaminski, Bartosz Pankratz
Modularity of the ABCD Random Graph Model with Community Structure. CoRR abs/2203.01480 (2022) - [i32]Dariusz Dereniowski, Przemyslaw Gordinowicz, Pawel Pralat:
Edge and Pair Queries - Random Graphs and Complexity. CoRR abs/2203.06006 (2022) - [i31]Bogumil Kaminski, Tomasz Olczak, Bartosz Pankratz
Properties and Performance of the ABCDe Random Graph Model with Community Structure. CoRR abs/2203.14899 (2022) - [i30]Pu Gao, Calum MacRury, Pawel Pralat:
A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process. CoRR abs/2205.02350 (2022) - [i29]Deepak Bal, Alan M. Frieze, Pawel Pralat:
Rainbow spanning trees in randomly coloured Gk-out. CoRR abs/2210.01327 (2022) - [i28]Bogumil Kaminski, Pawel Pralat, François Théberge:
Hypergraph Artificial Benchmark for Community Detection (h-ABCD). CoRR abs/2210.15009 (2022) - 2021
- [j112]Konstantinos Georgiou, Somnath Kundu, Pawel Pralat:
The Unit Acquisition Number of Binomial Random Graphs. Electron. J. Comb. 28(3) (2021) - [j111]Bogumil Kaminski
An unsupervised framework for comparing graph embeddings. J. Complex Networks 8(5) (2021) - [j110]Reaz Huq, Bogumil Kaminski
On broadcasting time in the model of travelling agents. Discret. Appl. Math. 291: 246-263 (2021) - [j109]Sean English
Probabilistic zero forcing on random graphs. Eur. J. Comb. 91: 103207 (2021) - [j108]Xavier Pérez-Giménez, Pawel Pralat, Douglas B. West:
On-line size Ramsey number for monotone k-uniform ordered paths with uniform looseness. Eur. J. Comb. 92: 103242 (2021) - [j107]Bogumil Kaminski
Artificial Benchmark for Community Detection (ABCD) - Fast random graph model with community structure. Netw. Sci. 9(2): 153-178 (2021) - [c29]Konstantinos Georgiou, Somnath Kundu, Pawel Pralat:
Makespan Trade-Offs for Visiting Triangle Edges - (Extended Abstract). IWOCA 2021: 340-355 - [i27]Arash Dehghan-Kooshkghazi, Bogumil Kaminski, Lukasz Krainski
Evaluating Node Embeddings of Complex Networks. CoRR abs/2102.08275 (2021) - [i26]Konstantinos Georgiou, Somnath Kundu, Pawel Pralat:
Makespan Trade-offs for Visiting Triangle Edges. CoRR abs/2105.01191 (2021) - [i25]Pu Gao, Calum MacRury, Pawel Pralat:
Perfect Matchings in the Semi-random Graph Process. CoRR abs/2105.13455 (2021) - [i24]Bogumil Kaminski, Lukasz Krainski, Pawel Pralat, François Théberge:
A Multi-purposed Unsupervised Framework for Comparing Embeddings of Undirected and Directed Graphs. CoRR abs/2112.00075 (2021) - [i23]Stan Matwin, Aristides Milios, Pawel Pralat, Amílcar Soares, François Théberge:
Survey of Generative Methods for Social Media Analysis. CoRR abs/2112.07041 (2021) - 2020
- [j106]Alan M. Frieze, Xavier Pérez-Giménez, Pawel Pralat:
On the Existence of Hamilton Cycles with a Periodic Pattern in a Random Digraph. Electron. J. Comb. 27(4): 4 (2020) - [j105]Carmine Spagnuolo
Analyzing, Exploring, and Visualizing Complex Networks via Hypergraphs using SimpleHypergraphs.jl. Internet Math. 2020 (2020) - [j104]Dieter Mitsche, Michael Molloy, Pawel Pralat:
k-regular subgraphs near the k-core threshold of a random graph. J. Comb. Theory B 142: 106-143 (2020) - [j103]Pawel Pralat, Nick Wormald:
Almost all 5-regular graphs have a 3-flow. J. Graph Theory 93(2): 147-156 (2020) - [c28]Bogumil Kaminski, Pawel Pralat, François Théberge:
Community Detection Algorithm Using Hypergraph Modularity. COMPLEX NETWORKS (1) 2020: 152-163 - [c27]Anthony Bonato, Konstantinos Georgiou, Calum MacRury, Pawel Pralat:
Probabilistically Faulty Searching on a Half-Line - (Extended Abstract). LATIN 2020: 168-180 - [c26]Bogumil Kaminski
A Scalable Unsupervised Framework for Comparing Graph Embeddings. WAW 2020: 52-67 - [e9]Bogumil Kaminski, Pawel Pralat, Przemyslaw Szufel:
Algorithms and Models for the Web Graph - 17th International Workshop, WAW 2020, Warsaw, Poland, September 21-22, 2020, Proceedings. Lecture Notes in Computer Science 12091, Springer 2020, ISBN 978-3-030-48477-4 [contents] - [i22]Bogumil Kaminski, Pawel Pralat, François Théberge:
Artificial Benchmark for Community Detection (ABCD): Fast Random Graph Model with Community Structure. CoRR abs/2002.00843 (2020) - [i21]Alessia Antelmi, Gennaro Cordasco, Bogumil Kaminski, Pawel Pralat, Vittorio Scarano, Carmine Spagnuolo, Przemyslaw Szufel:
Analyzing, Exploring, and Visualizing Complex Networks via Hypergraphs using SimpleHypergraphs.jl. CoRR abs/2002.04654 (2020) - [i20]Anthony Bonato, Konstantinos Georgiou, Calum MacRury, Pawel Pralat:
Probabilistically Faulty Searching on a Half-Line. CoRR abs/2002.07797 (2020) - [i19]Reaz Huq, Bogumil Kaminski, Atefeh Mashatan, Pawel Pralat, Przemyslaw Szufel:
On Broadcasting Time in the Model of Travelling Agents. CoRR abs/2003.08501 (2020)
2010 – 2019
- 2019
- [j102]Bogumil Kaminski
Sub-trees of a random tree. Discret. Appl. Math. 268: 119-129 (2019) - [j101]Alan M. Frieze, Xavier Pérez-Giménez
Perfect matchings and Hamiltonian cycles in the preferential attachment model. Random Struct. Algorithms 54(2): 258-288 (2019) - [j100]Colin McDiarmid, Dieter Mitsche, Pawel Pralat:
Clique coloring of binomial random graphs. Random Struct. Algorithms 54(4): 589-614 (2019) - [j99]Pawel Pralat, Nicholas C. Wormald:
Meyniel's conjecture holds for random d-regular graphs. Random Struct. Algorithms 55(3): 719-741 (2019) - [j98]Bogumil Kaminski
Parallel execution of schedules with random dependency graph. Theor. Comput. Sci. 784: 113-132 (2019) - [j97]Pawel Pralat:
How many zombies are needed to catch the survivor on toroidal grids? Theor. Comput. Sci. 794: 3-11 (2019) - [c25]Alessia Antelmi
SimpleHypergraphs.jl - Novel Software Framework for Modelling and Analysis of Hypergraphs. WAW 2019: 115-129 - [e8]Konstantin Avrachenkov
Algorithms and Models for the Web Graph - 16th International Workshop, WAW 2019, Brisbane, QLD, Australia, July 6-7, 2019, Proceedings. Lecture Notes in Computer Science 11631, Springer 2019, ISBN 978-3-030-25069-0 [contents] - [i18]Bogumil Kaminski, Pawel Pralat, François Théberge:
An Unsupervised Framework for Comparing Graph Embeddings. CoRR abs/1906.04562 (2019) - 2018
- [j96]Pawel Pralat, Przemyslaw Gordinowicz:
Small on-line Ramsey numbers - a new approach. Contributions Discret. Math. 13(2) (2018) - [j95]Andrzej Dudek, Pawel Pralat:
Note on the Multicolour Size-Ramsey Number for Paths, . Electron. J. Comb. 25(3): 3 (2018) - [j94]Colin McDiarmid, Dieter Mitsche, Pawel Pralat:
Clique Colourings of Geometric Graphs. Electron. J. Comb. 25(4): 4 (2018) - [j93]Anthony Bonato, Rita M. del Río-Chanona, Calum MacRury, Jake Nicolaidis, Xavier Pérez-Giménez
The robot crawler graph process. Discret. Appl. Math. 247: 23-36 (2018) - [j92]Andrzej Dudek, Farideh Khoeini, Pawel Pralat:
Size-Ramsey numbers of cycles versus a path. Discret. Math. 341(7): 2095-2103 (2018) - [j91]Andrzej Dudek, Xavier Pérez-Giménez
Randomly twisted hypercubes. Eur. J. Comb. 70: 364-373 (2018) - [j90]Megan Dewar, Kirill Ternovsky, Benjamin Reiniger, John Proos, Pawel Pralat, Xavier Pérez-Giménez, John Healy:
Subhypergraphs in non-uniform random hypergraphs. Internet Math. 2018 (2018) - [j89]Dieter Mitsche, Pawel Pralat, Elham Roshanbin:
Burning number of graph products. Theor. Comput. Sci. 746: 124-135 (2018) - [c24]Lenar Iskhakov, Bogumil Kaminski
Clustering Properties of Spatial Preferential Attachment Model. WAW 2018: 30-43 - [e7]Anthony Bonato, Pawel Pralat, Andrei M. Raigorodskii:
Algorithms and Models for the Web Graph - 15th International Workshop, WAW 2018, Moscow, Russia, May 17-18, 2018, Proceedings. Lecture Notes in Computer Science 10836, Springer 2018, ISBN 978-3-319-92870-8 [contents] - [i17]Lenar Iskhakov, Bogumil Kaminski, Maksim Mironov, Liudmila Ostroumova Prokhorenkova, Pawel Pralat:
Clustering Properties of Spatial Preferential Attachment Model. CoRR abs/1802.05127 (2018) - 2017
- [j88]Ewa J. Infeld, Dieter Mitsche, Pawel Pralat:
The Total Acquisition Number of Random Geometric Graphs. Electron. J. Comb. 24(3): 3 (2017) - [j87]Anant P. Godbole, Elizabeth Kelley, Emily Kurtz, Pawel Pralat, Yiguang Zhang:
The total acquisition number of the randomly weighted path. Discuss. Math. Graph Theory 37(4): 919-934 (2017) - [j86]Liudmila Ostroumova Prokhorenkova, Pawel Pralat, Andrei M. Raigorodskii:
Modularity in several random graph models. Electron. Notes Discret. Math. 61: 947-953 (2017) - [j85]Dieter Mitsche, Pawel Pralat, Elham Roshanbin:
Burning Graphs: A Probabilistic Perspective. Graphs Comb. 33(2): 449-471 (2017) - [j84]Anthony Bonato, Xavier Pérez-Giménez
The Game of Overprescribed Cops and Robbers Played on Graphs. Graphs Comb. 33(4): 801-815 (2017) - [j83]Deepak Bal
Rainbow perfect matchings and Hamilton cycles in the random geometric graph. Random Struct. Algorithms 51(4): 587-606 (2017) - [j82]Andrzej Dudek, Pawel Pralat:
On some Multicolor Ramsey Properties of Random Graphs. SIAM J. Discret. Math. 31(3): 2079-2092 (2017) - [c23]Anthony Bonato, Ewa J. Infeld, Hari Pokhrel, Pawel Pralat:
Common Adversaries Form Alliances: Modelling Complex Networks via Anti-transitivity. WAW 2017: 16-26 - [c22]Bogumil Kaminski
Endogenous Differentiation of Consumer Preferences Under Quality Uncertainty in a SPA Network. WAW 2017: 42-59 - [e6]Anthony Bonato, Fan Chung Graham, Pawel Pralat:
Algorithms and Models for the Web Graph - 14th International Workshop, WAW 2017, Toronto, ON, Canada, June 15-16, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10519, Springer 2017, ISBN 978-3-319-67809-2 [contents] - 2016
- [j81]Deepak Bal, Patrick Bennett
The Total Acquisition Number of Random Graphs. Electron. J. Comb. 23(2): 2 (2016) - [j80]Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat:
The Bondage Number of Random Graphs. Electron. J. Comb. 23(2): 2 (2016) - [j79]William B. Kinnersley, Pawel Pralat:
Game brush number. Discret. Appl. Math. 207: 1-14 (2016) - [j78]Andrzej Dudek, Dieter Mitsche, Pawel Pralat:
The set chromatic number of random graphs. Discret. Appl. Math. 215: 61-70 (2016) - [j77]Anthony Bonato, Pawel Pralat:
Special Issue on Algorithms and Models for the Web-Graph. Internet Math. 12(1-2): 1 (2016) - [j76]Jeannette C. M. Janssen
Nonuniform Distribution of Nodes in the Spatial Preferential Attachment Model. Internet Math. 12(1-2): 121-144 (2016) - [j75]Deepak Bal
Rainbow Arborescence in Random Digraphs. J. Graph Theory 83(3): 251-265 (2016) - [j74]Adam Douglas Henry, Dieter Mitsche, Pawel Pralat:
Homophily, influence and the decay of segregation in self-organizing networks. Netw. Sci. 4(1): 81-116 (2016) - [j73]Pawel Pralat, Nicholas C. Wormald:
Meyniel's conjecture holds for random graphs. Random Struct. Algorithms 48(2): 396-421 (2016) - [j72]Andrzej Dudek, Pawel Pralat:
Acquaintance Time of Random Graphs Near Connectivity Threshold. SIAM J. Discret. Math. 30(1): 555-568 (2016) - [j71]William B. Kinnersley
To catch a falling robber. Theor. Comput. Sci. 627: 107-111 (2016) - [j70]Anthony Bonato, Dieter Mitsche, Xavier Pérez-Giménez
A probabilistic version of the game of Zombies and Survivors on graphs. Theor. Comput. Sci. 655: 2-14 (2016) - [c21]Parisa Lak, Ceni Babaoglu, Ayse Basar Bener, Pawel Pralat:
News Article Position Recommendation Based on the Analysis of Article's Content - Time Matters. CBRecSys@RecSys 2016: 11-14 - [c20]Liudmila Ostroumova Prokhorenkova, Pawel Pralat, Andrei M. Raigorodskii:
Modularity of Complex Networks Models. WAW 2016: 115-126 - [c19]Megan Dewar, John Healy, Xavier Pérez-Giménez
Subgraphs in Non-uniform Random Hypergraphs. WAW 2016: 140-151 - [e5]Anthony Bonato, Fan Chung Graham, Pawel Pralat:
Algorithms and Models for the Web Graph - 13th International Workshop, WAW 2016, Montreal, QC, Canada, December 14-15, 2016, Proceedings. Lecture Notes in Computer Science 10088, 2016, ISBN 978-3-319-49786-0 [contents] - [i16]Anthony Bonato, Xavier Pérez-Giménez, Pawel Pralat, Benjamin Reiniger:
The game of Overprescribed Cops and Robbers played on graphs. CoRR abs/1611.07592 (2016) - 2015
- [j69]Anshui Li, Tobias Müller, Pawel Pralat:
Chasing robbers on percolated random geometric graphs. Contributions Discret. Math. 10(1) (2015) - [j68]Deepak Bal
Power of k Choices and Rainbow Spanning Trees in Random Graphs. Electron. J. Comb. 22(1): 1 (2015) - [j67]Alan M. Frieze, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat:
On-line List Colouring of Random Graphs. Electron. J. Comb. 22(2): 2 (2015) - [j66]Pawel Pralat:
Containment Game Played on Random Graphs: Another Zig-Zag Theorem. Electron. J. Comb. 22(2): 2 (2015) - [j65]Andrzej Dudek, Pawel Pralat:
An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths. Comb. Probab. Comput. 24(3): 551-555 (2015) - [j64]Deepak Bal, Anthony Bonato, William B. Kinnersley, Pawel Pralat:
Lazy Cops and Robbers on Hypercubes. Comb. Probab. Comput. 24(6): 829-837 (2015) - [j63]Pawel Pralat:
Almost all k-cop-win graphs contain a dominating set of cardinality k. Discret. Math. 338(1): 47-52 (2015) - [j62]Tobias Müller, Pawel Pralat:
The acquaintance time of (percolated) random geometric graphs. Eur. J. Comb. 48: 198-214 (2015) - [j61]Anthony Bonato, Pawel Pralat:
Special Issue on Algorithms and Models for the Web-graph. Internet Math. 11(4-5): 307 (2015) - [c18]Parisa Lak, Akin Kocak, Pawel Pralat, Ayse Bener
Towards dynamic pricing for digital billboard advertising network in smart cities. ISC2 2015: 1-6 - [c17]Anthony Bonato, Marc Lozier, Dieter Mitsche, Xavier Pérez-Giménez
The Domination Number of On-line Social Networks and Random Geometric Graphs. TAMC 2015: 150-163 - [c16]Anthony Bonato, Rita M. del Río-Chanona, Calum MacRury, Jake Nicolaidis, Xavier Pérez-Giménez
The Robot Crawler Number of a Graph. WAW 2015: 132-147 - [i15]Alan M. Frieze, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat:
On-line list colouring of random graphs. CoRR abs/1501.07469 (2015) - [i14]Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat:
Strong-majority bootstrap percolation on regular graphs with low dissemination threshold. CoRR abs/1503.08310 (2015) - [i13]Anthony Bonato, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat:
A probabilistic version of the game of Zombies and Survivors on graphs. CoRR abs/1503.08810 (2015) - [i12]Dieter Mitsche, Pawel Pralat, Elham Roshanbin:
Burning graphs - a probabilistic perspective. CoRR abs/1505.03052 (2015) - [i11]Jeannette C. M. Janssen, Pawel Pralat, Rory Wilson:
Non-Uniform Distribution of Nodes in the Spatial Preferential Attachment Model. CoRR abs/1506.06053 (2015) - 2014
- [j60]Dieter Mitsche, Pawel Pralat:
On the Hyperbolicity of Random Graphs. Electron. J. Comb. 21(2): 2 (2014) - [j59]Darryn E. Bryant
Brushing without capacity restrictions. Discret. Appl. Math. 170: 33-45 (2014) - [j58]Noga Alon, Pawel Pralat:
Chasing robbers on random geometric graphs - An alternative approach. Discret. Appl. Math. 178: 149-152 (2014) - [j57]Margaret-Ellen Messinger, Richard J. Nowakowski
Elimination schemes and lattices. Discret. Math. 328: 63-70 (2014) - [j56]Tomas Gavenciak
Firefighting on square, hexagonal, and triangular grids. Discret. Math. 337: 142-155 (2014) - [j55]Anthony Bonato, William B. Kinnersley, Pawel Pralat:
Toppling numbers of complete and random graphs. Discret. Math. Theor. Comput. Sci. 16(3): 229-252 (2014) - [j54]Anthony Bonato, Jason I. Brown
Independence densities of hypergraphs. Eur. J. Comb. 40: 124-136 (2014) - [j53]Pawel Pralat:
Graphs with Average Degree Smaller Than $${\frac {30}{11}}$$ Burn Slowly. Graphs Comb. 30(2): 455-470 (2014) - [j52]Colin Cooper, Alan M. Frieze, Pawel Pralat:
Some Typical Properties of the Spatial Preferred Attachment Model. Internet Math. 10(1-2): 116-136 (2014) - [j51]Athanasios Kehagias, Dieter Mitsche, Pawel Pralat:
The Role of Visibility in Pursuit/Evasion Games. Robotics 3(4): 371-399 (2014) - [j50]Piotr Borowiecki
Brushing with additional cleaning restrictions. Theor. Comput. Sci. 557: 76-86 (2014) - [e4]Anthony Bonato, Fan Chung Graham, Pawel Pralat:
Algorithms and Models for the Web Graph - 11th International Workshop, WAW 2014, Beijing, China, December 17-18, 2014, Proceedings. Lecture Notes in Computer Science 8882, Springer 2014, ISBN 978-3-319-13122-1 [contents] - [i10]Athanasios Kehagias, Dieter Mitsche, Pawel Pralat:
The Role of Visibility in Pursuit / Evasion Games. CoRR abs/1402.6136 (2014) - [i9]Anthony Bonato, David F. Gleich, Myunghwan Kim, Dieter Mitsche, Pawel Pralat, Amanda Tian, Stephen J. Young:
Dimensionality of social networks using motifs and eigenvalues. CoRR abs/1405.0157 (2014) - [i8]Anthony Bonato, Marc Lozier, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat:
The domination number of on-line social networks and random geometric graphs. CoRR abs/1412.1189 (2014) - 2013
- [j49]Jeannette C. M. Janssen
Geometric graph properties of the spatial preferred attachment model. Adv. Appl. Math. 50(2): 243-267 (2013) - [j48]Anthony Bonato, Przemyslaw Gordinowicz, Bill Kinnersley, Pawel Pralat:
The Capture Time of the Hypercube. Electron. J. Comb. 20(2): 24 (2013) - [j47]William B. Kinnersley, Dieter Mitsche, Pawel Pralat:
A Note on the Acquaintance Time of Random Graphs. Electron. J. Comb. 20(3): 52 (2013) - [j46]Béla Bollobás, Dieter Mitsche, Pawel Pralat:
Metric Dimension for Random Graphs. Electron. J. Comb. 20(4): 1 (2013) - [j45]Dieter Mitsche, Pawel Pralat:
Revolutionaries and Spies on Random Graphs. Comb. Probab. Comput. 22(3): 417-432 (2013) - [j44]Alan M. Frieze, Paul Horn, Pawel Pralat:
Special Issue on Algorithms and Models for the Web Graph. Internet Math. 9(1): 1-2 (2013) - [j43]Adam Douglas Henry, Pawel Pralat:
Discovery of Nodal Attributes through a Rank-Based Model of Network Structure. Internet Math. 9(1): 33-57 (2013) - [j42]Anthony Bonato, Dieter Mitsche, Pawel Pralat:
Vertex-Pursuit in Random Directed Acyclic Graphs. SIAM J. Discret. Math. 27(2): 732-756 (2013) - [j41]Abbas Mehrabian, Dieter Mitsche, Pawel Pralat:
On the Maximum Density of Graphs with Unique-Path Labelings. SIAM J. Discret. Math. 27(3): 1228-1233 (2013) - [j40]Pawel Pralat:
Sparse Graphs Are Not Flammable. SIAM J. Discret. Math. 27(4): 2157-2166 (2013) - [j39]Athanasios Kehagias, Dieter Mitsche, Pawel Pralat:
Cops and invisible robbers: The cost of drunkenness. Theor. Comput. Sci. 481: 100-120 (2013) - [c15]Francisco Claude, Reza Dorrigiv, Shahin Kamali, Alejandro López-Ortiz, Pawel Pralat, Jazmín Romero, Alejandro Salinger, Diego Seco
Broadcasting in Conflict-Aware Multi-channel Networks. WALCOM 2013: 158-169 - [c14]Jeannette C. M. Janssen
Asymmetric Distribution of Nodes in the Spatial Preferred Attachment Model. WAW 2013: 1-13 - [e3]Anthony Bonato, Michael Mitzenmacher, Pawel Pralat:
Algorithms and Models for the Web Graph - 10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings. Lecture Notes in Computer Science 8305, Springer 2013, ISBN 978-3-319-03535-2 [contents] - [i7]Anthony Bonato, Stephen Finbow, Przemyslaw Gordinowicz, Ali Haidar, William B. Kinnersley, Dieter Mitsche, Pawel Pralat, Ladislav Stacho:
The robber strikes back. CoRR abs/1308.2843 (2013) - [i6]Anthony Bonato, William B. Kinnersley, Przemyslaw Gordinowicz, Pawel Pralat:
The capture time of the hypercube. CoRR abs/1308.3354 (2013) - [i5]Anthony Bonato, Noor Hadi, Paul Horn, Pawel Pralat, Changping Wang:
Models of on-line social networks. CoRR abs/1308.3388 (2013) - 2012
- [j38]Pawel Pralat:
A Note On Off-Diagonal Small On-Line Ramsey Numbers For Paths. Ars Comb. 107: 295-306 (2012) - [j37]Anthony Bonato, Graeme Kemkes, Pawel Pralat:
Almost all cop-win graphs contain a universal vertex. Discret. Math. 312(10): 1652-1657 (2012) - [j36]Przemyslaw Gordinowicz
The first player wins the one-colour triangle avoidance game on 16 vertices. Discuss. Math. Graph Theory 32(1): 181-185 (2012) - [j35]Anthony Bonato, Jeannette C. M. Janssen
Geometric Protean Graphs. Internet Math. 8(1-2): 2-28 (2012) - [j34]Fedor V. Fomin
Cops and Robber with Constraints. SIAM J. Discret. Math. 26(2): 571-590 (2012) - [j33]Anthony Bonato, Margaret-Ellen Messinger, Pawel Pralat:
Fighting constrained fires in graphs. Theor. Comput. Sci. 434: 11-22 (2012) - [j32]Przemyslaw Gordinowicz
polish - Let us play the cleaning game. Theor. Comput. Sci. 463: 123-132 (2012) - [j31]Athanasios Kehagias, Pawel Pralat:
Some remarks on cops and drunk robbers. Theor. Comput. Sci. 463: 133-147 (2012) - [c13]Anthony Bonato, Dieter Mitsche, Pawel Pralat:
Vertex-Pursuit in Hierarchical Social Networks. TAMC 2012: 50-60 - [c12]Colin Cooper, Alan M. Frieze, Pawel Pralat:
Some Typical Properties of the Spatial Preferred Attachment Model. WAW 2012: 29-40 - [i4]Athanasios Kehagias, Dieter Mitsche, Pawel Pralat:
Cops and Invisible Robbers: the Cost of Drunkenness. CoRR abs/1201.0946 (2012) - 2011
- [j30]Pawel Pralat, Jacques Verstraëte, Nicholas C. Wormald:
On the threshold for k-regular subgraphs of random graphs. Comb. 31(5): 565-581 (2011) - [j29]Noga Alon, Pawel Pralat:
Modular Orientations of Random and Quasi-Random Regular Graphs. Comb. Probab. Comput. 20(3): 321-329 (2011) - [j28]Pawel Pralat:
Connectivity threshold and recovery time in rank-based models for complex networks. Discret. Math. 311(12): 932-939 (2011) - [j27]Margaret-Ellen Messinger, Richard J. Nowakowski
Cleaning with Brooms. Graphs Comb. 27(2): 251-267 (2011) - [j26]Pawel Pralat:
Cleaning Random d-Regular Graphs with Brooms. Graphs Comb. 27(4): 567-584 (2011) - [j25]Itai Benjamini, Carlos Hoppen
Geodesics and almost geodesic cycles in random regular graphs. J. Graph Theory 66(2): 115-136 (2011) - [j24]Colin Cooper, Pawel Pralat:
Scale-free graphs of increasing degree. Random Struct. Algorithms 38(4): 396-421 (2011) - [j23]Pawel Pralat, Changping Wang:
An edge deletion model for complex networks. Theor. Comput. Sci. 412(39): 5111-5120 (2011) - [c11]Adam Douglas Henry, Pawel Pralat:
Rank-Based Models of Network Structure and the Discovery of Content. WAW 2011: 62-73 - [e2]Alan M. Frieze, Paul Horn, Pawel Pralat:
Algorithms and Models for the Web Graph - 8th International Workshop, WAW 2011, Atlanta, GA, USA, May 27-29, 2011. Proceedings. Lecture Notes in Computer Science 6732, Springer 2011, ISBN 978-3-642-21285-7 [contents] - [i3]Athanasios Kehagias, Pawel Pralat:
Some remarks on cops and drunk robbers. CoRR abs/1106.2414 (2011) - [i2]Anthony Bonato, Jeannette C. M. Janssen, Pawel Pralat:
Geometric protean graphs. CoRR abs/1111.0207 (2011) - [i1]Jeannette C. M. Janssen, Pawel Pralat, Rory Wilson:
Geometric Graph Properties of the Spatial Preferred Attachment model. CoRR abs/1111.0508 (2011) - 2010
- [j22]Pawel Pralat:
When does a random graph have constant cop number? Australas. J Comb. 46: 285-296 (2010) - [j21]Anthony Bonato, Przemyslaw Gordinowicz, Pawel Pralat:
Bounds and constructions for n-e.c. tournaments. Contributions Discret. Math. 5(2) (2010) - [j20]Serge Gaspers, Margaret-Ellen Messinger, Richard J. Nowakowski
Parallel cleaning of a network with brushes. Discret. Appl. Math. 158(5): 467-478 (2010) - [j19]Ralitsa Angelova, Marek Lipczak, Evangelos E. Milios
Investigating the Properties of a Social Bookmarking and Tagging Network. Int. J. Data Warehous. Min. 6(1): 1-19 (2010) - [j18]Tomasz Luczak
Chasing robbers on random graphs: Zigzag theorem. Random Struct. Algorithms 37(4): 516-524 (2010) - [j17]Jeannette C. M. Janssen
Rank-Based Attachment Leads to Power Law Graphs. SIAM J. Discret. Math. 24(2): 420-440 (2010) - [j16]Anthony Bonato, Ehsan Chiniforooshan, Pawel Pralat:
Cops and Robbers from a distance. Theor. Comput. Sci. 411(43): 3834-3844 (2010) - [c10]Anthony Bonato, Jeannette C. M. Janssen
A geometric model for on-line social networks. MSM 2010: 4:1-4:2 - [c9]Jeannette C. M. Janssen
Estimating node similarity from co-citation in a spatial graph model. SAC 2010: 1329-1333 - [c8]Anthony Bonato, Jeannette C. M. Janssen
The Geometric Protean Model for On-Line Social Networks. WAW 2010: 110-121 - [c7]Anthony Bonato, Jeannette C. M. Janssen, Pawel Pralat:
A Geometric Model for On-line Social Networks. WOSN 2010
2000 – 2009
- 2009
- [j15]Pawel Pralat:
Cleaning random graphs with brushes. Australas. J Comb. 43: 237-252 (2009) - [j14]Anthony Bonato, Pawel Pralat:
The good, the bad, and the great: Homomorphisms and cores of random graphs. Discret. Math. 309(18): 5535-5539 (2009) - [j13]Anthony Bonato, Noor Hadi, Paul Horn, Pawel Pralat, Changping Wang:
Models of Online Social Networks. Internet Math. 6(3): 285-313 (2009) - [j12]Serge Gaspers, Margaret-Ellen Messinger, Richard J. Nowakowski
Clean the graph before you draw it! Inf. Process. Lett. 109(10): 463-467 (2009) - [j11]Jeannette C. M. Janssen
Protean graphs with a variety of ranking schemes. Theor. Comput. Sci. 410(52): 5491-5504 (2009) - [c6]Anthony Bonato, Noor Hadi, Paul Horn, Pawel Pralat, Changping Wang:
A Dynamic Model for On-Line Social Networks. WAW 2009: 127-142 - 2008
- [j10]Pawel Pralat:
A note on small on-line Ramsey numbers for paths and their generalization. Australas. J Comb. 40: 27-36 (2008) - [j9]Pawel Pralat:
R(3, 4)=17. Electron. J. Comb. 15(1) (2008) - [j8]Pawel Pralat:
The diameter of protean graphs. Discret. Math. 308(15): 3399-3406 (2008) - [j7]Jaroslaw Grytczuk, Hal A. Kierstead, Pawel Pralat:
On-line Ramsey Numbers for Paths and Stars. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - [j6]William Aiello, Anthony Bonato, Colin Cooper, Jeannette C. M. Janssen
A Spatial Web Graph Model with Local Influence Regions. Internet Math. 5(1): 175-196 (2008) - [j5]Noga Alon, Pawel Pralat, Nicholas C. Wormald:
Cleaning Regular Graphs with Brushes. SIAM J. Discret. Math. 23(1): 233-250 (2008) - [j4]Margaret-Ellen Messinger, Richard J. Nowakowski
Cleaning a network with brushes. Theor. Comput. Sci. 399(3): 191-205 (2008) - [c5]Pawel Pralat:
Protean Graphs with a Variety of Ranking Schemes. COCOA 2008: 149-159 - 2007
- [j3]Pawel Pralat, Nicholas C. Wormald:
Growing Protean Graphs. Internet Math. 4(1): 1-16 (2007) - [j2]Anthony Bonato, Pawel Pralat, Changping Wang:
Pursuit-Evasion in Models of Complex Networks. Internet Math. 4(4): 419-436 (2007) - [c4]Margaret-Ellen Messinger, Pawel Pralat, Richard J. Nowakowski
Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm. CAAN 2007: 13-26 - [c3]Anthony Bonato, Pawel Pralat, Changping Wang:
Vertex Pursuit Games in Stochastic Network Models. CAAN 2007: 46-56 - [c2]Reza Dorrigiv, Alejandro López-Ortiz, Pawel Pralat:
Search Algorithms for Unstructured Peer-to-Peer Networks. LCN 2007: 343-352 - [c1]William Aiello, Anthony Bonato, Colin Cooper, Jeannette C. M. Janssen
A Spatial Web Graph Model with Local Influence Regions. WAW 2007: 96-107 - [e1]Jeannette C. M. Janssen, Pawel Pralat:
Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007. Revised Papers. Lecture Notes in Computer Science 4852, Springer 2007, ISBN 978-3-540-77293-4 [contents] - 2006
- [j1]Tomasz Luczak
Protean Graphs. Internet Math. 3(1): 21-40 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-10 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: