default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPawel 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
- 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
, Kinga Siuta, Agata Skorupka, Andrei Betlen, David Miller, Bogumil Kaminski, Pawel Pralat:
Unsupervised framework for evaluating and explaining structural node embeddings of graphs. J. Complex Networks 12(2) (2024) - [j133]Patrick Bennett, Ryan Cushman, Andrzej Dudek, Pawel Pralat:
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, Przemyslaw Szufel:
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, Pawel Pralat:
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, Pawel Pralat, François Théberge, Sebastian Zajac:
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, Pawel Pralat, François Théberge:
Self-similarity of Communities of the ABCD Model. WAW 2024: 17-31 - [c40]Nick Arnosti, Bogumil Kaminski, Pawel Pralat, Mateusz Zawisza:
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, Pawel Pralat, François Théberge, Malgorzata Wrzosek:
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, Aristides Milios, Pawel Pralat, Amílcar Soares, François Théberge:
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, Agata Skorupka, Akshat Dubey, Andrei Betlen, David Miller, Wei Xu, Bogumil Kaminski, Pawel Pralat:
Detecting bots in social-networks using node and structural embeddings. J. Big Data 10(1): 119 (2023) - [j122]Adam Logan, Michael Molloy, Pawel Pralat:
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, Agata Skorupka, Andrei Betlen, David Miller, Bogumil Kaminski, Pawel Pralat:
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, Pawel Pralat:
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, Tomasz Olczak, Bartosz Pankratz, Pawel Pralat, François Théberge:
Properties and Performance of the ABCDe Random Graph Model with Community Structure. Big Data Res. 30: 100348 (2022) - [j120]Natalie C. Behague, Trent G. Marbach, Pawel Pralat:
Tight Bounds on Probabilistic Zero Forcing on Hypercubes and Grids. Electron. J. Comb. 29(1) (2022) - [j119]Arash Dehghan-Kooshkghazi, Bogumil Kaminski, Lukasz Krainski, Pawel Pralat, François Théberge:
Evaluating node embeddings of complex networks. J. Complex Networks 10(4) (2022) - [j118]Bogumil Kaminski, Bartosz Pankratz, Pawel Pralat, François Théberge:
Modularity of the ABCD random graph model with community structure. J. Complex Networks 10(6) (2022) - [j117]Andrzej Dudek, Sean English, Alan M. Frieze, Calum MacRury, Pawel Pralat:
Localization game for random graphs. Discret. Appl. Math. 309: 202-214 (2022) - [j116]Reaz Huq, Pawel Pralat:
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, Pawel Pralat, François Théberge:
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, Pawel Pralat, François Théberge:
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, Bogumil Kaminski, Pawel Pralat:
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, Pawel Pralat, François Théberge:
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, Pawel Pralat, François Théberge:
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, Pawel Pralat, François Théberge:
An unsupervised framework for comparing graph embeddings. J. Complex Networks 8(5) (2021) - [j110]Reaz Huq, Bogumil Kaminski, Atefeh Mashatan, Pawel Pralat, Przemyslaw Szufel:
On broadcasting time in the model of travelling agents. Discret. Appl. Math. 291: 246-263 (2021) - [j109]Sean English, Calum MacRury, Pawel Pralat:
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, Pawel Pralat, François Théberge:
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, Pawel Pralat, François Théberge:
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, Gennaro Cordasco, Przemyslaw Szufel, Pawel Pralat, Vittorio Scarano, Bogumil Kaminski, Alessia Antelmi:
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, Pawel Pralat, François Théberge:
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, Pawel Pralat:
Sub-trees of a random tree. Discret. Appl. Math. 268: 119-129 (2019) - [j101]Alan M. Frieze, Xavier Pérez-Giménez, Pawel Pralat, Benjamin Reiniger:
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, Tomasz Olczak, Pawel Pralat:
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, Gennaro Cordasco, Bogumil Kaminski, Pawel Pralat, Vittorio Scarano, Carmine Spagnuolo, Przemyslaw Szufel:
SimpleHypergraphs.jl - Novel Software Framework for Modelling and Analysis of Hypergraphs. WAW 2019: 115-129 - [e8]Konstantin Avrachenkov, Pawel Pralat, Nan Ye:
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, Pawel Pralat, Kirill Ternovsky:
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, Pawel Pralat, Hao Qi, Douglas B. West, Xuding Zhu:
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, Maksim Mironov, Pawel Pralat, Liudmila Ostroumova Prokhorenkova:
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, Pawel Pralat, Benjamin Reiniger:
The Game of Overprescribed Cops and Robbers Played on Graphs. Graphs Comb. 33(4): 801-815 (2017) - [j83]Deepak Bal, Patrick Bennett, Xavier Pérez-Giménez, Pawel Pralat:
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, Tomasz Olczak, Pawel Pralat:
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, Andrzej Dudek, Pawel Pralat:
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]