<?xml version="1.0"?>
<dblpperson name="Pawel Pralat" pid="p/PawelPralat" n="267">
<person key="homepages/p/PawelPralat" mdate="2025-05-13">
<author pid="p/PawelPralat">Pawel Pralat</author>
<note type="uname">Pawe&#322; Pra&#322;at</note>
<note type="affiliation">Toronto Metropolitan University, Department of Mathematics, ON, Canada</note>
<note label="former" type="affiliation">Ryerson University, Department of Mathematics, Toronto, ON, Canada</note>
<note label="former" type="affiliation">West Virginia University, Department of Mathematics, Morgantown, WV, USA</note>
<note label="former" type="affiliation">Dalhousie University, Department of Mathematics and Statistics, Halifax, NS, Canada</note>
<url>https://www.math.ryerson.ca/~pralat/</url>
<url>https://scholar.google.com/citations?user=7qWSDHIAAAAJ</url>
<url>https://zbmath.org/authors/?q=ai:pralat.pawel</url>
<url>https://mathgenealogy.org/id.php?id=154654</url>
<url>https://orcid.org/0000-0001-9176-8493</url>
<url>https://www.wikidata.org/entity/Q91144904</url>
<url>https://www.scopus.com/authid/detail.uri?authorId=23397724900</url>
</person>
<r><article key="journals/combinatorics/BehaguePR26" mdate="2026-03-24">
<author orcid="0000-0001-6616-1606" pid="219/8674">Natalie C. Behague</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="01/3907-1">Andrzej Rucinski 0001</author>
<title>Creating Subgraphs in Semi-Random Hypergraph Games.</title>
<year>2026</year>
<volume>33</volume>
<journal>Electron. J. Comb.</journal>
<number>1</number>
<ee type="oa">https://doi.org/10.37236/13447</ee>
<url>db/journals/combinatorics/combinatorics33.html#BehaguePR26</url>
<stream>streams/journals/combinatorics</stream>
</article>
</r>
<r><article key="journals/eswa/KrainskiCBPKT26" mdate="2026-02-03">
<author orcid="0000-0002-3664-468X" pid="285/6190">Lukasz Krainski</author>
<author orcid="0000-0001-8652-3678" pid="331/2690">Michal Czuba</author>
<author orcid="0000-0002-6474-0089" pid="41/7376">Piotr Br&#243;dka</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author orcid="0000-0002-0678-282X" pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0002-5499-3680" pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Multilayer artificial benchmark for community detection (mABCD).</title>
<pages>130920</pages>
<year>2026</year>
<volume>307</volume>
<journal>Expert Syst. Appl.</journal>
<ee>https://doi.org/10.1016/j.eswa.2025.130920</ee>
<url>db/journals/eswa/eswa307.html#KrainskiCBPKT26</url>
<stream>streams/journals/eswa</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2601-14151" mdate="2026-02-26">
<author pid="232/2008">Jordan Barrett</author>
<author pid="153/1906">Karen Gunderson</author>
<author pid="312/4946">JD Nir</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>Achievable Burning Densities of Growing Grids.</title>
<year>2026</year>
<month>January</month>
<volume>abs/2601.14151</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2601.14151</ee>
<url>db/journals/corr/corr2601.html#abs-2601-14151</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2602-02044" mdate="2026-03-13">
<author pid="41/7376">Piotr Br&#243;dka</author>
<author pid="331/2690">Michal Czuba</author>
<author pid="10/7115">Bogumil Kaminski</author>
<author pid="285/6190">Lukasz Krainski</author>
<author pid="11/5835">Katarzyna Musial</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="395/4022">Mateusz Stolarski</author>
<title>Twinning Complex Networked Systems: Data-Driven Calibration of the mABCD Synthetic Graph Generator.</title>
<year>2026</year>
<month>February</month>
<volume>abs/2602.02044</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2602.02044</ee>
<url>db/journals/corr/corr2602.html#abs-2602-02044</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2602-04694" mdate="2026-03-19">
<author pid="429/6431">Maya Le</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="19/3885">Aaron Smith</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>The Needle is a Thread: Finding Planted Paths in Noisy Process Trees.</title>
<year>2026</year>
<month>February</month>
<volume>abs/2602.04694</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2602.04694</ee>
<url>db/journals/corr/corr2602.html#abs-2602-04694</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2602-14855" mdate="2026-03-29">
<author pid="364/7561">Ryan DeWolfe</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>A Pragmatic Method for Comparing Clusterings with Overlaps and Outliers.</title>
<year>2026</year>
<month>February</month>
<volume>abs/2602.14855</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2602.14855</ee>
<url>db/journals/corr/corr2602.html#abs-2602-14855</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2602-17567" mdate="2026-03-30">
<author pid="17/10715">Mikhail Isaev</author>
<author pid="29/10716">Tam&#225;s Makai</author>
<author pid="74/5295">Brendan D. McKay</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="231/2136">Jane Tan</author>
<author pid="77/11133">Maksim Zhukovskii</author>
<title>Canonical labelling of random regular graphs.</title>
<year>2026</year>
<month>February</month>
<volume>abs/2602.17567</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2602.17567</ee>
<url>db/journals/corr/corr2602.html#abs-2602-17567</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article key="journals/combinatorics/DelcourtHP25" mdate="2025-12-01">
<author pid="121/1083">Michelle Delcourt</author>
<author pid="261/2630">Reaz Huq</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>Almost All 9-Regular Graphs Have a Modulo-5 Orientation.</title>
<year>2025</year>
<volume>32</volume>
<journal>Electron. J. Comb.</journal>
<number>2</number>
<ee type="oa">https://doi.org/10.37236/12513</ee>
<url>db/journals/combinatorics/combinatorics32.html#DelcourtHP25</url>
<stream>streams/journals/combinatorics</stream>
</article>
</r>
<r><article key="journals/compnet/BarrettPST25" mdate="2026-04-07">
<author pid="232/2008">Jordan Barrett</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="19/3885">Aaron Smith</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Counting simplicial pairs in hypergraphs.</title>
<year>2025</year>
<volume>13</volume>
<journal>J. Complex Networks</journal>
<number>4</number>
<ee>https://doi.org/10.1093/comnet/cnaf021</ee>
<url>db/journals/compnet/compnet13.html#BarrettPST25</url>
<stream>streams/journals/compnet</stream>
</article>
</r>
<r><article key="journals/dm/EideP25" mdate="2025-03-03">
<author orcid="0009-0009-6146-4494" pid="300/3463">Austin Eide</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Linear colouring of binomial random graphs.</title>
<pages>114278</pages>
<year>2025</year>
<volume>348</volume>
<journal>Discret. Math.</journal>
<number>2</number>
<ee type="oa">https://doi.org/10.1016/j.disc.2024.114278</ee>
<url>db/journals/dm/dm348.html#EideP25</url>
<stream>streams/journals/dm</stream>
</article>
</r>
<r><article key="journals/dm/PralatS25" mdate="2026-04-07">
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="341/1422">Harjas Singh</author>
<title>Hopping forcing number in random d-regular graphs.</title>
<pages>114644</pages>
<year>2025</year>
<volume>348</volume>
<journal>Discret. Math.</journal>
<number>12</number>
<ee>https://doi.org/10.1016/j.disc.2025.114644</ee>
<url>db/journals/dm/dm348.html#PralatS25</url>
<stream>streams/journals/dm</stream>
</article>
</r>
<r><article key="journals/dmtcs/GeorgiouKP25" mdate="2025-10-02">
<author pid="77/4787">Konstantinos Georgiou</author>
<author pid="119/4166">Somnath Kundu</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>The Fagnano Triangle Patrolling Problem.</title>
<year>2025</year>
<volume>27</volume>
<journal>Discret. Math. Theor. Comput. Sci.</journal>
<number>3</number>
<ee type="oa">https://doi.org/10.46298/dmtcs.13421</ee>
<url>db/journals/dmtcs/dmtcs27.html#GeorgiouKP25</url>
<stream>streams/journals/dmtcs</stream>
</article>
</r>
<r><article key="journals/ejc/FriezeGMPS25" mdate="2025-02-17">
<author pid="f/AlanMFrieze">Alan M. Frieze</author>
<author pid="54/3104">Pu Gao</author>
<author pid="172/5055">Calum MacRury</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="60/1574">Gregory B. Sorkin</author>
<title>Building Hamiltonian cycles in the semi-random graph process in less than 2n rounds.</title>
<pages>104122</pages>
<year>2025</year>
<volume>126</volume>
<journal>Eur. J. Comb.</journal>
<ee>https://doi.org/10.1016/j.ejc.2025.104122</ee>
<url>db/journals/ejc/ejc126.html#FriezeGMPS25</url>
<stream>streams/journals/ejc</stream>
</article>
</r>
<r><article key="journals/geb/MaurasPV25" mdate="2025-10-15">
<author orcid="0000-0003-4080-3118" pid="199/6302">Simon Mauras</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author orcid="0000-0002-2213-4937" pid="v/AdrianVetta">Adrian Vetta</author>
<title>A direct proof of the short-side advantage in random matching markets.</title>
<pages>53-61</pages>
<year>2025</year>
<volume>154</volume>
<journal>Games Econ. Behav.</journal>
<ee>https://doi.org/10.1016/j.geb.2025.08.013</ee>
<url>db/journals/geb/geb154.html#MaurasPV25</url>
<stream>streams/journals/geb</stream>
</article>
</r>
<r><article key="journals/rsa/MolloyPS25" mdate="2025-04-08">
<author pid="m/MichaelMolloy">Michael Molloy 0001</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author orcid="0000-0003-4935-7820" pid="60/1574">Gregory B. Sorkin</author>
<title>Perfect Matchings and Loose Hamilton Cycles in the Semirandom Hypergraph Model.</title>
<year>2025</year>
<month>March</month>
<volume>66</volume>
<journal>Random Struct. Algorithms</journal>
<number>2</number>
<ee>https://doi.org/10.1002/rsa.21270</ee>
<url>db/journals/rsa/rsa66.html#MolloyPS25</url>
<stream>streams/journals/rsa</stream>
</article>
</r>
<r><article key="journals/tcs/BarrettKPT25" mdate="2025-03-03">
<author pid="232/2008">Jordan Barrett</author>
<author pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Self-similarity of communities of the ABCD model.</title>
<pages>115012</pages>
<year>2025</year>
<volume>1026</volume>
<journal>Theor. Comput. Sci.</journal>
<ee>https://doi.org/10.1016/j.tcs.2024.115012</ee>
<url>db/journals/tcs/tcs1026.html#BarrettKPT25</url>
<stream>streams/journals/tcs</stream>
</article>
</r>
<r><article key="journals/teco/MohanP25" mdate="2025-12-26">
<author orcid="0000-0002-8671-5714" pid="206/3417">Divyarthi Mohan</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Asynchronous Majority Dynamics on Binomial Random Graphs.</title>
<pages>19:1-19:26</pages>
<year>2025</year>
<month>December</month>
<volume>13</volume>
<journal>ACM Trans. Economics and Comput.</journal>
<number>4</number>
<ee>https://doi.org/10.1145/3771091</ee>
<url>db/journals/teco/teco13.html#MohanP25</url>
<stream>streams/journals/teco</stream>
</article>
</r>
<r><inproceedings key="conf/waw/BarrettDKPST25" mdate="2025-07-04">
<author pid="232/2008">Jordan Barrett</author>
<author orcid="0009-0009-3597-4220" pid="364/7561">Ryan DeWolfe</author>
<author pid="10/7115">Bogumil Kaminski</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="19/3885">Aaron Smith</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Improving Community Detection via Community Association Strength Scores.</title>
<pages>81-95</pages>
<year>2025</year>
<booktitle>WAW</booktitle>
<ee>https://doi.org/10.1007/978-3-031-92898-7_6</ee>
<crossref>conf/waw/2025</crossref>
<url>db/conf/waw/waw2025.html#BarrettDKPST25</url>
<stream>streams/conf/waw</stream>
</inproceedings>
</r>
<r><inproceedings key="conf/waw/BarrettDKPST25a" mdate="2025-07-04">
<author pid="232/2008">Jordan Barrett</author>
<author orcid="0009-0009-3597-4220" pid="364/7561">Ryan DeWolfe</author>
<author pid="10/7115">Bogumil Kaminski</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="19/3885">Aaron Smith</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>The Artificial Benchmark for Community Detection with Outliers and Overlapping Communities ($\mathbf {ABCD{+}o}^2$).</title>
<pages>125-140</pages>
<year>2025</year>
<booktitle>WAW</booktitle>
<ee>https://doi.org/10.1007/978-3-031-92898-7_9</ee>
<crossref>conf/waw/2025</crossref>
<url>db/conf/waw/waw2025.html#BarrettDKPST25a</url>
<stream>streams/conf/waw</stream>
</inproceedings>
</r>
<r><inproceedings key="conf/waw/BrodkaCKKPT25" mdate="2025-06-10">
<author pid="41/7376">Piotr Br&#243;dka</author>
<author pid="331/2690">Michal Czuba</author>
<author pid="10/7115">Bogumil Kaminski</author>
<author pid="285/6190">Lukasz Krainski</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>The Multilayer Artificial Benchmark for Community Detection (mABCD).</title>
<pages>172-188</pages>
<year>2025</year>
<booktitle>WAW</booktitle>
<ee>https://doi.org/10.1007/978-3-031-92898-7_12</ee>
<crossref>conf/waw/2025</crossref>
<url>db/conf/waw/waw2025.html#BrodkaCKKPT25</url>
<stream>streams/conf/waw</stream>
</inproceedings>
</r>
<r><proceedings key="conf/waw/2025" mdate="2025-06-10">
<editor pid="28/4513">Mindaugas Bloznelis</editor>
<editor pid="215/7308">Paulius Drungilas</editor>
<editor pid="10/7115">Bogumil Kaminski</editor>
<editor pid="p/PawelPralat">Pawel Pralat</editor>
<editor pid="130/9101">Matas Sileikis</editor>
<editor pid="80/1457">Fran&#231;ois Th&#233;berge</editor>
<editor pid="407/0183">Rimantas Vaicekauskas</editor>
<title>Modelling and Mining Networks - 20th International Workshop, WAW 2025, Vilnius, Lithuania, June 30 - July 3, 2025, Proceedings</title>
<booktitle>WAW</booktitle>
<publisher>Springer</publisher>
<year>2025</year>
<series href="db/series/lncs/index.html">Lecture Notes in Computer Science</series>
<volume>15699</volume>
<isbn>978-3-031-92897-0</isbn>
<isbn>978-3-031-92898-7</isbn>
<ee>https://doi.org/10.1007/978-3-031-92898-7</ee>
<url>db/conf/waw/waw2025.html</url>
</proceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-2501-05574" mdate="2025-02-19">
<author pid="199/6302">Simon Mauras</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="v/AdrianVetta">Adrian Vetta</author>
<title>A Direct Proof of the Short-Side Advantage in Random Matching Markets.</title>
<year>2025</year>
<month>January</month>
<volume>abs/2501.05574</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2501.05574</ee>
<url>db/journals/corr/corr2501.html#abs-2501-05574</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2501-17817" mdate="2025-02-26">
<author pid="232/2008">Jordan Barrett</author>
<author pid="364/7561">Ryan DeWolfe</author>
<author pid="10/7115">Bogumil Kaminski</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="19/3885">Aaron Smith</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Improving community detection via community association strength scores.</title>
<year>2025</year>
<month>January</month>
<volume>abs/2501.17817</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2501.17817</ee>
<url>db/journals/corr/corr2501.html#abs-2501-17817</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2503-07335" mdate="2025-04-21">
<author pid="228/7828">Jack Dippel</author>
<author pid="300/3463">Austin Eide</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="402/5634">Daniel Willhalm</author>
<title>Playing Sudoku on random 3-regular graphs.</title>
<year>2025</year>
<month>March</month>
<volume>abs/2503.07335</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2503.07335</ee>
<url>db/journals/corr/corr2503.html#abs-2503-07335</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2503-15853" mdate="2025-04-14">
<author pid="325/6986">Ashkan Dehghan</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Network Embedding Exploration Tool (NEExT).</title>
<year>2025</year>
<month>March</month>
<volume>abs/2503.15853</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2503.15853</ee>
<url>db/journals/corr/corr2503.html#abs-2503-15853</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2506-05486" mdate="2025-07-07">
<author pid="232/2008">Jordan Barrett</author>
<author pid="364/7561">Ryan DeWolfe</author>
<author pid="10/7115">Bogumil Kaminski</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="19/3885">Aaron Smith</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>The Artificial Benchmark for Community Detection with Outliers and Overlapping Communities (ABCD+o<sup>2</sup>).</title>
<year>2025</year>
<month>June</month>
<volume>abs/2506.05486</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2506.05486</ee>
<url>db/journals/corr/corr2506.html#abs-2506-05486</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2507-10795" mdate="2025-08-14">
<author pid="285/6190">Lukasz Krainski</author>
<author pid="331/2690">Michal Czuba</author>
<author pid="41/7376">Piotr Br&#243;dka</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="10/7115">Bogumil Kaminski</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Multilayer Artificial Benchmark for Community Detection (mABCD).</title>
<year>2025</year>
<month>July</month>
<volume>abs/2507.10795</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2507.10795</ee>
<url>db/journals/corr/corr2507.html#abs-2507-10795</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2507-11686" mdate="2025-08-22">
<author pid="300/3463">Austin Eide</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>Multiset Metric Dimension of Binomial Random Graphs.</title>
<year>2025</year>
<month>July</month>
<volume>abs/2507.11686</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2507.11686</ee>
<url>db/journals/corr/corr2507.html#abs-2507-11686</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article key="journals/combinatorics/PralatS24" mdate="2025-12-01">
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="341/1422">Harjas Singh</author>
<title>Power of $k$ Choices in the Semi-Random Graph Process.</title>
<year>2024</year>
<volume>31</volume>
<journal>Electron. J. Comb.</journal>
<number>1</number>
<ee type="oa">https://doi.org/10.37236/11909</ee>
<url>db/journals/combinatorics/combinatorics31.html#PralatS24</url>
</article>
</r>
<r><article key="journals/combinatorics/BehagueMPR24" mdate="2026-03-24">
<author orcid="0000-0001-6616-1606" pid="219/8674">Natalie C. Behague</author>
<author pid="169/9502">Trent G. Marbach</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author orcid="0000-0002-0742-7694" pid="01/3907-1">Andrzej Rucinski 0001</author>
<title>Subgraph Games in the Semi-Random Graph Process and Its Generalization to Hypergraphs.</title>
<year>2024</year>
<volume>31</volume>
<journal>Electron. J. Comb.</journal>
<number>3</number>
<ee type="oa">https://doi.org/10.37236/11859</ee>
<url>db/journals/combinatorics/combinatorics31.html#BehagueMPR24</url>
<stream>streams/journals/combinatorics</stream>
</article>
</r>
<r><article key="journals/compnet/DehghanSSBMKP24" mdate="2025-03-03">
<author orcid="0009-0008-5032-4720" pid="325/6986">Ashkan Dehghan</author>
<author orcid="0000-0001-5003-029X" pid="325/7014">Kinga Siuta</author>
<author pid="325/7059">Agata Skorupka</author>
<author pid="325/6584">Andrei Betlen</author>
<author pid="25/721">David Miller</author>
<author pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Unsupervised framework for evaluating and explaining structural node embeddings of graphs.</title>
<year>2024</year>
<month>February</month>
<volume>12</volume>
<journal>J. Complex Networks</journal>
<number>2</number>
<ee>https://doi.org/10.1093/comnet/cnae003</ee>
<url>db/journals/compnet/compnet12.html#DehghanSSBMKP24</url>
</article>
</r>
<r><article key="journals/compnet/PankratzKP24" mdate="2025-03-03">
<author orcid="0000-0001-7618-9119" pid="193/7531">Bartosz Pankratz</author>
<author pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Performance of community detection algorithms supported by node embeddings.</title>
<year>2024</year>
<volume>12</volume>
<journal>J. Complex Networks</journal>
<number>4</number>
<ee>https://doi.org/10.1093/comnet/cnae035</ee>
<url>db/journals/compnet/compnet12.html#PankratzKP24</url>
<stream>streams/journals/compnet</stream>
</article>
</r>
<r><article key="journals/compnet/KaminskiMPT24" mdate="2025-03-03">
<author pid="10/7115">Bogumil Kaminski</author>
<author pid="17/9386">Pawel Misiorek</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Modularity based community detection in hypergraphs.</title>
<year>2024</year>
<volume>12</volume>
<journal>J. Complex Networks</journal>
<number>5</number>
<ee>https://doi.org/10.1093/comnet/cnae041</ee>
<url>db/journals/compnet/compnet12.html#KaminskiMPT24</url>
<stream>streams/journals/compnet</stream>
</article>
</r>
<r><article key="journals/dmtcs/GeorgiouKP24" mdate="2025-02-21">
<author pid="77/4787">Konstantinos Georgiou</author>
<author pid="119/4166">Somnath Kundu</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>Makespan Trade-offs for Visiting Triangle Edges.</title>
<year>2024</year>
<volume>26</volume>
<journal>Discret. Math. Theor. Comput. Sci.</journal>
<number>3</number>
<ee type="oa">https://doi.org/10.46298/dmtcs.8729</ee>
<url>db/journals/dmtcs/dmtcs26.html#GeorgiouKP24</url>
<stream>streams/journals/dmtcs</stream>
</article>
</r>
<r><article key="journals/jctb/BennettCDP24" mdate="2025-05-31">
<author orcid="0000-0003-3147-4690" pid="119/4799">Patrick Bennett</author>
<author pid="304/2170">Ryan Cushman</author>
<author orcid="0000-0002-6410-5413" pid="68/4382">Andrzej Dudek</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>The Erd&#337;s-Gy&#225;rf&#225;s function f(n,4,5)=56n+o(n) - So Gy&#225;rf&#225;s was right.</title>
<pages>253-297</pages>
<year>2024</year>
<volume>169</volume>
<journal>J. Comb. Theory B</journal>
<ee>https://doi.org/10.1016/j.jctb.2024.07.001</ee>
<url>db/journals/jctb/jctb169.html#BennettCDP24</url>
<stream>streams/journals/jctb</stream>
</article>
</r>
<r><article key="journals/pubtrans/MacRuryPPSS24" mdate="2025-04-01">
<author pid="172/5055">Calum MacRury</author>
<author orcid="0009-0003-3687-552X" pid="383/9736">Nykyta Polituchyi</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author orcid="0000-0001-5003-029X" pid="325/7014">Kinga Siuta</author>
<author orcid="0000-0001-9525-3497" pid="133/5756">Przemyslaw Szufel</author>
<title>Optimizing transport frequency in multi-layered urban transportation networks for pandemic prevention.</title>
<pages>381-418</pages>
<year>2024</year>
<month>June</month>
<volume>16</volume>
<journal>Public Transp.</journal>
<number>2</number>
<ee>https://doi.org/10.1007/s12469-024-00351-0</ee>
<url>db/journals/pubtrans/pubtrans16.html#MacRuryPPSS24</url>
<stream>streams/journals/pubtrans</stream>
</article>
</r>
<r><article key="journals/siamdm/BalFP24" mdate="2025-03-03">
<author orcid="0000-0003-1441-1823" pid="59/3284">Deepak Bal</author>
<author orcid="0000-0002-8481-5615" pid="f/AlanMFrieze">Alan M. Frieze</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\).</title>
<pages>867-882</pages>
<year>2024</year>
<month>March</month>
<volume>38</volume>
<journal>SIAM J. Discret. Math.</journal>
<number>1</number>
<ee>https://doi.org/10.1137/22m1537497</ee>
<url>db/journals/siamdm/siamdm38.html#BalFP24</url>
</article>
</r>
<r><article key="journals/siamdm/GamarnikKP24" mdate="2025-05-01">
<author pid="74/4070">David Gamarnik</author>
<author orcid="0000-0001-8729-2779" pid="71/2814">Mihyun Kang</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Cliques, Chromatic Number, and Independent Sets in the Semi-random Process.</title>
<pages>2312-2334</pages>
<year>2024</year>
<volume>38</volume>
<journal>SIAM J. Discret. Math.</journal>
<number>3</number>
<ee>https://doi.org/10.1137/23m1561105</ee>
<url>db/journals/siamdm/siamdm38.html#GamarnikKP24</url>
<stream>streams/journals/siamdm</stream>
</article>
</r>
<r><article key="journals/snam/KaminskiPTZ23" mdate="2025-03-03">
<author orcid="0000-0002-0678-282X" pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<author orcid="0000-0001-6616-8744" pid="258/8005">Sebastian Zajac</author>
<title>Predicting properties of nodes via community-aware features.</title>
<pages>117</pages>
<year>2024</year>
<month>December</month>
<volume>14</volume>
<journal>Soc. Netw. Anal. Min.</journal>
<number>1</number>
<ee>https://doi.org/10.1007/s13278-024-01281-2</ee>
<url>db/journals/snam/snam14.html#KaminskiPTZ23</url>
</article>
</r>
<r><inproceedings key="conf/approx/MohanP24" mdate="2025-05-31">
<author orcid="0000-0002-8671-5714" pid="206/3417">Divyarthi Mohan</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Asynchronous Majority Dynamics on Binomial Random Graphs.</title>
<pages>5:1-5:20</pages>
<year>2024</year>
<booktitle>APPROX/RANDOM</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.5</ee>
<crossref>conf/approx/2024</crossref>
<url>db/conf/approx/approx2024.html#MohanP24</url>
</inproceedings>
</r>
<r><inproceedings key="conf/waw/BarrettKPT24" mdate="2024-05-31">
<author pid="232/2008">Jordan Barrett</author>
<author orcid="0000-0002-0678-282X" pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author orcid="0000-0002-5499-3680" pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Self-similarity of Communities of the ABCD Model.</title>
<pages>17-31</pages>
<year>2024</year>
<booktitle>WAW</booktitle>
<ee>https://doi.org/10.1007/978-3-031-59205-8_2</ee>
<crossref>conf/waw/2024</crossref>
<url>db/conf/waw/waw2024.html#BarrettKPT24</url>
</inproceedings>
</r>
<r><inproceedings key="conf/waw/ArnostiKPZ24" mdate="2024-05-17">
<author orcid="0000-0002-6685-1428" pid="138/8057">Nick Arnosti</author>
<author orcid="0000-0002-0678-282X" pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author orcid="0000-0002-3717-0148" pid="14/9833">Mateusz Zawisza</author>
<title>Impact of Market Design and Trading Network Structure on Market Efficiency.</title>
<pages>47-64</pages>
<year>2024</year>
<booktitle>WAW</booktitle>
<ee>https://doi.org/10.1007/978-3-031-59205-8_4</ee>
<crossref>conf/waw/2024</crossref>
<url>db/conf/waw/waw2024.html#ArnostiKPZ24</url>
</inproceedings>
</r>
<r><inproceedings key="conf/waw/DehghanPT24" mdate="2025-03-03">
<author pid="325/6986">Ashkan Dehghan</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Network Embedding Exploration Tool (NEExT).</title>
<pages>65-79</pages>
<year>2024</year>
<booktitle>WAW</booktitle>
<ee>https://doi.org/10.1007/978-3-031-59205-8_5</ee>
<crossref>conf/waw/2024</crossref>
<url>db/conf/waw/waw2024.html#DehghanPT24</url>
</inproceedings>
</r>
<r><proceedings key="conf/waw/2024" mdate="2024-10-06">
<editor pid="185/0699">Megan Dewar</editor>
<editor pid="10/7115">Bogumil Kaminski</editor>
<editor pid="374/3886">Daniel Kaszynski</editor>
<editor orcid="0000-0002-3664-468X" pid="285/6190">Lukasz Krainski</editor>
<editor pid="p/PawelPralat">Pawel Pralat</editor>
<editor pid="80/1457">Fran&#231;ois Th&#233;berge</editor>
<editor pid="347/7749">Malgorzata Wrzosek</editor>
<title>Modelling and Mining Networks - 19th International Workshop, WAW 2024, Warsaw, Poland, June 3-6, 2024, Proceedings</title>
<booktitle>WAW</booktitle>
<publisher>Springer</publisher>
<year>2024</year>
<series href="db/series/lncs/index.html">Lecture Notes in Computer Science</series>
<volume>14671</volume>
<isbn>978-3-031-59204-1</isbn>
<isbn>978-3-031-59205-8</isbn>
<ee>https://doi.org/10.1007/978-3-031-59205-8</ee>
<url>db/conf/waw/waw2024.html</url>
</proceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-2406-17556" mdate="2025-03-03">
<author pid="10/7115">Bogumil Kaminski</author>
<author pid="17/9386">Pawel Misiorek</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Modularity Based Community Detection in Hypergraphs.</title>
<year>2024</year>
<volume>abs/2406.17556</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2406.17556</ee>
<url>db/journals/corr/corr2406.html#abs-2406-17556</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2408-11806" mdate="2025-03-03">
<author pid="232/2008">Jordan Barrett</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="19/3885">Aaron Smith</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Counting simplicial pairs in hypergraphs.</title>
<year>2024</year>
<volume>abs/2408.11806</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2408.11806</ee>
<url>db/journals/corr/corr2408.html#abs-2408-11806</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><book key="series/sbcs/MatwinMPST23" mdate="2024-07-02">
<author orcid="0000-0001-6629-8434" pid="m/StanMatwin">Stan Matwin</author>
<author pid="260/6061">Aristides Milios</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author orcid="0000-0001-5957-3805" pid="144/7946">Am&#237;lcar Soares 0001</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Generative Methods for Social Media Analysis</title>
<publisher>Springer</publisher>
<year>2023</year>
<pages>1-67</pages>
<series href="db/series/sbcs/index.html">Springer Briefs in Computer Science</series>
<isbn>978-3-031-33616-4</isbn>
<ee>https://doi.org/10.1007/978-3-031-33617-1</ee>
</book>
</r>
<r><article key="journals/algorithmica/BonatoGMP23" mdate="2025-03-03">
<author pid="16/2406">Anthony Bonato</author>
<author pid="77/4787">Konstantinos Georgiou</author>
<author pid="172/5055">Calum MacRury</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Algorithms for p-Faulty Search on a Half-Line.</title>
<pages>2485-2514</pages>
<year>2023</year>
<month>August</month>
<volume>85</volume>
<journal>Algorithmica</journal>
<number>8</number>
<ee>https://doi.org/10.1007/s00453-022-01075-y</ee>
<url>db/journals/algorithmica/algorithmica85.html#BonatoGMP23</url>
</article>
</r>
<r><article key="journals/ans/KaminskiPT23" mdate="2025-03-03">
<author pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Artificial benchmark for community detection with outliers (ABCD+o).</title>
<pages>25</pages>
<year>2023</year>
<month>December</month>
<volume>8</volume>
<journal>Appl. Netw. Sci.</journal>
<number>1</number>
<ee type="oa">https://doi.org/10.1007/s41109-023-00552-9</ee>
<ee>https://www.wikidata.org/entity/Q124842486</ee>
<url>db/journals/ans/ans8.html#KaminskiPT23</url>
</article>
</r>
<r><article key="journals/combinatorics/DereniowskiGP23" mdate="2025-12-01">
<author pid="d/DDereniowski">Dariusz Dereniowski</author>
<author pid="12/8077">Przemyslaw Gordinowicz</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Edge and Pair Queries-Random Graphs and Complexity.</title>
<year>2023</year>
<volume>30</volume>
<journal>Electron. J. Comb.</journal>
<number>2</number>
<ee type="oa">https://doi.org/10.37236/11159</ee>
<url>db/journals/combinatorics/combinatorics30.html#DereniowskiGP23</url>
</article>
</r>
<r><article key="journals/compnet/KaminskiPT23" mdate="2025-03-03">
<author pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Hypergraph Artificial Benchmark for Community Detection (h-ABCD).</title>
<year>2023</year>
<month>June</month>
<volume>11</volume>
<journal>J. Complex Networks</journal>
<number>4</number>
<ee>https://doi.org/10.1093/comnet/cnad028</ee>
<url>db/journals/compnet/compnet11.html#KaminskiPT23</url>
</article>
</r>
<r><article key="journals/ejc/LichevMP23" mdate="2025-03-03">
<author pid="293/8993">Lyuben Lichev</author>
<author pid="11/3659">Dieter Mitsche</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Localization game for random geometric graphs.</title>
<pages>103616</pages>
<year>2023</year>
<volume>108</volume>
<journal>Eur. J. Comb.</journal>
<ee>https://doi.org/10.1016/j.ejc.2022.103616</ee>
<url>db/journals/ejc/ejc108.html#LichevMP23</url>
</article>
</r>
<r><article key="journals/jbd/DehghanSSDBMXKP23" mdate="2025-03-03">
<author pid="325/6986">Ashkan Dehghan</author>
<author orcid="0000-0001-5003-029X" pid="325/7014">Kinga Siuta</author>
<author pid="325/7059">Agata Skorupka</author>
<author orcid="0009-0008-4823-9375" pid="218/5474">Akshat Dubey</author>
<author pid="325/6584">Andrei Betlen</author>
<author pid="25/721">David Miller</author>
<author pid="32/1213">Wei Xu</author>
<author pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Detecting bots in social-networks using node and structural embeddings.</title>
<pages>119</pages>
<year>2023</year>
<month>December</month>
<volume>10</volume>
<journal>J. Big Data</journal>
<number>1</number>
<ee type="oa">https://doi.org/10.1186/s40537-023-00796-3</ee>
<url>db/journals/jbd/jbd10.html#DehghanSSDBMXKP23</url>
</article>
</r>
<r><article key="journals/jgt/LoganMP23" mdate="2023-01-31">
<author pid="21/9403">Adam Logan</author>
<author orcid="0000-0001-5435-1015" pid="m/MichaelMolloy">Michael Molloy 0001</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>A variant of the Erd&#337;s-R&#233;nyi random graph process.</title>
<pages>322-345</pages>
<year>2023</year>
<volume>102</volume>
<journal>J. Graph Theory</journal>
<number>2</number>
<ee>https://doi.org/10.1002/jgt.22873</ee>
<url>db/journals/jgt/jgt102.html#LoganMP23</url>
</article>
</r>
<r><inproceedings key="conf/complexnetworks/KaminskiPTZ23" mdate="2025-03-03">
<author pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<author orcid="0000-0001-6616-8744" pid="258/8005">Sebastian Zajac</author>
<title>Classification Supported by Community-Aware Node Features.</title>
<pages>133-145</pages>
<year>2023</year>
<booktitle>COMPLEX NETWORKS (2)</booktitle>
<ee>https://doi.org/10.1007/978-3-031-53499-7_11</ee>
<crossref>conf/complexnetworks/2023-2</crossref>
<url>db/conf/complexnetworks/complexnetworks2023-2.html#KaminskiPTZ23</url>
</inproceedings>
</r>
<r><inproceedings key="conf/sss/GeorgiouKP23" mdate="2025-03-03">
<author pid="77/4787">Konstantinos Georgiou</author>
<author pid="119/4166">Somnath Kundu</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>The Fagnano Triangle Patrolling Problem (Extended Abstract).</title>
<pages>157-171</pages>
<year>2023</year>
<booktitle>SSS</booktitle>
<ee>https://doi.org/10.1007/978-3-031-44274-2_13</ee>
<crossref>conf/sss/2023</crossref>
<url>db/conf/sss/sss2023.html#GeorgiouKP23</url>
</inproceedings>
</r>
<r><inproceedings key="conf/waw/DehghanSSBMKP23" mdate="2025-03-03">
<author pid="325/6986">Ashkan Dehghan</author>
<author orcid="0000-0001-5003-029X" pid="325/7014">Kinga Siuta</author>
<author pid="325/7059">Agata Skorupka</author>
<author pid="325/6584">Andrei Betlen</author>
<author pid="25/721">David Miller</author>
<author pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Unsupervised Framework for Evaluating Structural Node Embeddings of Graphs.</title>
<pages>36-51</pages>
<year>2023</year>
<booktitle>WAW</booktitle>
<ee>https://doi.org/10.1007/978-3-031-32296-9_3</ee>
<crossref>conf/waw/2023</crossref>
<url>db/conf/waw/waw2023.html#DehghanSSBMKP23</url>
</inproceedings>
</r>
<r><inproceedings key="conf/waw/KaminskiMPT23" mdate="2025-03-03">
<author pid="10/7115">Bogumil Kaminski</author>
<author pid="17/9386">Pawel Misiorek</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Modularity Based Community Detection in Hypergraphs.</title>
<pages>52-67</pages>
<year>2023</year>
<booktitle>WAW</booktitle>
<ee>https://doi.org/10.1007/978-3-031-32296-9_4</ee>
<crossref>conf/waw/2023</crossref>
<url>db/conf/waw/waw2023.html#KaminskiMPT23</url>
</inproceedings>
</r>
<r><proceedings key="conf/waw/2023" mdate="2023-05-23">
<editor pid="185/0699">Megan Dewar</editor>
<editor pid="p/PawelPralat">Pawel Pralat</editor>
<editor pid="133/5756">Przemyslaw Szufel</editor>
<editor pid="80/1457">Fran&#231;ois Th&#233;berge</editor>
<editor pid="347/7749">Malgorzata Wrzosek</editor>
<title>Algorithms and Models for the Web Graph - 18th International Workshop, WAW 2023, Toronto, ON, Canada, May 23-26, 2023, Proceedings</title>
<booktitle>WAW</booktitle>
<publisher>Springer</publisher>
<year>2023</year>
<series href="db/series/lncs/index.html">Lecture Notes in Computer Science</series>
<volume>13894</volume>
<isbn>978-3-031-32295-2</isbn>
<isbn>978-3-031-32296-9</isbn>
<ee>https://doi.org/10.1007/978-3-031-32296-9</ee>
<url>db/conf/waw/waw2023.html</url>
</proceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-2301-05749" mdate="2023-01-19">
<author pid="10/7115">Bogumil Kaminski</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Artificial Benchmark for Community Detection with Outliers (ABCD+o).</title>
<year>2023</year>
<volume>abs/2301.05749</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2301.05749</ee>
<url>db/journals/corr/corr2301.html#abs-2301-05749</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2302-03569" mdate="2025-03-03">
<author pid="k/MarcosAKiwi">Marcos Kiwi</author>
<author pid="293/8993">Lyuben Lichev</author>
<author pid="11/3659">Dieter Mitsche</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Label propagation on binomial random graphs.</title>
<year>2023</year>
<volume>abs/2302.03569</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2302.03569</ee>
<url>db/journals/corr/corr2302.html#abs-2302-03569</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2302-13330" mdate="2023-02-28">
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="341/1422">Harjas Singh</author>
<title>Power of k Choices in the Semi-Random Graph Process.</title>
<year>2023</year>
<volume>abs/2302.13330</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2302.13330</ee>
<url>db/journals/corr/corr2302.html#abs-2302-13330</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2303-13443" mdate="2024-02-05">
<author pid="74/4070">David Gamarnik</author>
<author orcid="0000-0001-8729-2779" pid="71/2814">Mihyun Kang</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>Cliques, Chromatic Number, and Independent Sets in the Semi-random Process.</title>
<year>2023</year>
<volume>abs/2303.13443</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2303.13443</ee>
<url>db/journals/corr/corr2303.html#abs-2303-13443</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2306-10770" mdate="2023-06-22">
<author pid="325/6986">Ashkan Dehghan</author>
<author pid="325/7014">Kinga Siuta</author>
<author pid="325/7059">Agata Skorupka</author>
<author pid="325/6584">Andrei Betlen</author>
<author pid="25/721">David Miller</author>
<author pid="10/7115">Bogumil Kaminski</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>Unsupervised Framework for Evaluating and Explaining Structural Node Embeddings of Graphs.</title>
<year>2023</year>
<volume>abs/2306.10770</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2306.10770</ee>
<url>db/journals/corr/corr2306.html#abs-2306-10770</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2307-13153" mdate="2025-03-03">
<author pid="77/4787">Konstantinos Georgiou</author>
<author pid="119/4166">Somnath Kundu</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>The Fagnano Triangle Patrolling Problem.</title>
<year>2023</year>
<volume>abs/2307.13153</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2307.13153</ee>
<url>db/journals/corr/corr2307.html#abs-2307-13153</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2309-04691" mdate="2025-05-31">
<author orcid="0000-0002-8671-5714" pid="206/3417">Divyarthi Mohan</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Asynchronous Majority Dynamics on Binomial Random Graphs.</title>
<year>2023</year>
<volume>abs/2309.04691</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2309.04691</ee>
<url>db/journals/corr/corr2309.html#abs-2309-04691</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2311-04730" mdate="2025-03-03">
<author pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<author orcid="0000-0001-6616-8744" pid="258/8005">Sebastian Zajac</author>
<title>Predicting Properties of Nodes via Community-Aware Features.</title>
<year>2023</year>
<volume>abs/2311.04730</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2311.04730</ee>
<url>db/journals/corr/corr2311.html#abs-2311-04730</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2311-05533" mdate="2025-03-03">
<author pid="f/AlanMFrieze">Alan M. Frieze</author>
<author pid="54/3104">Pu Gao</author>
<author pid="172/5055">Calum MacRury</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="60/1574">Gregory B. Sorkin</author>
<title>Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than 2n Rounds.</title>
<year>2023</year>
<volume>abs/2311.05533</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2311.05533</ee>
<url>db/journals/corr/corr2311.html#abs-2311-05533</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2311-08560" mdate="2025-03-03">
<author pid="300/3463">Austin Eide</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Linear Colouring of Binomial Random Graphs.</title>
<year>2023</year>
<volume>abs/2311.08560</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2311.08560</ee>
<url>db/journals/corr/corr2311.html#abs-2311-08560</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2312-00238" mdate="2025-03-03">
<author pid="232/2008">Jordan Barrett</author>
<author pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Self-similarity of Communities of the ABCD Model.</title>
<year>2023</year>
<volume>abs/2312.00238</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2312.00238</ee>
<url>db/journals/corr/corr2312.html#abs-2312-00238</url>
</article>
</r>
<r><article key="journals/bdr/KaminskiOPPT22" mdate="2025-03-03">
<author orcid="0000-0002-0678-282X" pid="10/7115">Bogumil Kaminski</author>
<author pid="196/7820">Tomasz Olczak</author>
<author orcid="0000-0001-7618-9119" pid="193/7531">Bartosz Pankratz</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Properties and Performance of the ABCDe Random Graph Model with Community Structure.</title>
<pages>100348</pages>
<year>2022</year>
<volume>30</volume>
<journal>Big Data Res.</journal>
<ee type="oa">https://doi.org/10.1016/j.bdr.2022.100348</ee>
<url>db/journals/bdr/bdr30.html#KaminskiOPPT22</url>
</article>
</r>
<r><article key="journals/combinatorics/BehagueMP22" mdate="2025-12-01">
<author orcid="0000-0001-6616-1606" pid="219/8674">Natalie C. Behague</author>
<author orcid="0000-0002-3708-3095" pid="169/9502">Trent G. Marbach</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Tight Bounds on Probabilistic Zero Forcing on Hypercubes and Grids.</title>
<year>2022</year>
<volume>29</volume>
<journal>Electron. J. Comb.</journal>
<number>1</number>
<ee type="oa">https://doi.org/10.37236/10585</ee>
<url>db/journals/combinatorics/combinatorics29.html#BehagueMP22</url>
</article>
</r>
<r><article key="journals/compnet/DehghanKooshkghaziKKPT22" mdate="2025-03-03">
<author pid="285/5957">Arash Dehghan-Kooshkghazi</author>
<author pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0002-3664-468X" pid="285/6190">Lukasz Krainski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Evaluating node embeddings of complex networks.</title>
<year>2022</year>
<month>June</month>
<volume>10</volume>
<journal>J. Complex Networks</journal>
<number>4</number>
<ee>https://doi.org/10.1093/comnet/cnac030</ee>
<url>db/journals/compnet/compnet10.html#DehghanKooshkghaziKKPT22</url>
</article>
</r>
<r><article key="journals/compnet/KaminskiPPT22" mdate="2025-03-03">
<author pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0001-7618-9119" pid="193/7531">Bartosz Pankratz</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Modularity of the ABCD random graph model with community structure.</title>
<year>2022</year>
<month>October</month>
<volume>10</volume>
<journal>J. Complex Networks</journal>
<number>6</number>
<ee>https://doi.org/10.1093/comnet/cnac050</ee>
<url>db/journals/compnet/compnet10.html#KaminskiPPT22</url>
</article>
</r>
<r><article key="journals/dam/DudekEFMP22" mdate="2022-02-08">
<author pid="68/4382">Andrzej Dudek</author>
<author orcid="0000-0003-1830-8671" pid="211/0959">Sean English</author>
<author orcid="0000-0002-8481-5615" pid="f/AlanMFrieze">Alan M. Frieze</author>
<author pid="172/5055">Calum MacRury</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Localization game for random graphs.</title>
<pages>202-214</pages>
<year>2022</year>
<volume>309</volume>
<journal>Discret. Appl. Math.</journal>
<ee>https://doi.org/10.1016/j.dam.2021.12.002</ee>
<url>db/journals/dam/dam309.html#DudekEFMP22</url>
</article>
</r>
<r><article key="journals/dm/HuqP22" mdate="2022-06-13">
<author orcid="0000-0002-5489-288X" pid="261/2630">Reaz Huq</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Broadcasting on paths and cycles.</title>
<pages>112883</pages>
<year>2022</year>
<volume>345</volume>
<journal>Discret. Math.</journal>
<number>7</number>
<ee>https://doi.org/10.1016/j.disc.2022.112883</ee>
<url>db/journals/dm/dm345.html#HuqP22</url>
</article>
</r>
<r><article key="journals/ejc/GaoKMP22" mdate="2025-03-03">
<author pid="54/3104">Pu Gao</author>
<author pid="10/7115">Bogumil Kaminski</author>
<author pid="172/5055">Calum MacRury</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Hamilton cycles in the semi-random graph process.</title>
<pages>103423</pages>
<year>2022</year>
<volume>99</volume>
<journal>Eur. J. Comb.</journal>
<ee>https://doi.org/10.1016/j.ejc.2021.103423</ee>
<url>db/journals/ejc/ejc99.html#GaoKMP22</url>
</article>
</r>
<r><article key="journals/netsci/KaminskiKPT22" mdate="2023-03-21">
<author pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0002-3664-468X" pid="285/6190">Lukasz Krainski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>A multi-purposed unsupervised framework for comparing embeddings of undirected and directed graphs.</title>
<pages>323-346</pages>
<year>2022</year>
<month>December</month>
<volume>10</volume>
<journal>Netw. Sci.</journal>
<number>4</number>
<ee type="oa">https://doi.org/10.1017/nws.2022.27</ee>
<url>db/journals/netsci/netsci10.html#KaminskiKPT22</url>
</article>
</r>
<r><article key="journals/siamdm/GaoMP22" mdate="2022-07-25">
<author pid="54/3104">Pu Gao</author>
<author pid="172/5055">Calum MacRury</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Perfect Matchings in the Semirandom Graph Process.</title>
<pages>1274-1290</pages>
<year>2022</year>
<volume>36</volume>
<journal>SIAM J. Discret. Math.</journal>
<number>2</number>
<ee>https://doi.org/10.1137/21m1446939</ee>
<url>db/journals/siamdm/siamdm36.html#GaoMP22</url>
</article>
</r>
<r><inproceedings key="conf/approx/GaoMP22" mdate="2025-03-03">
<author pid="54/3104">Pu Gao</author>
<author pid="172/5055">Calum MacRury</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process.</title>
<pages>29:1-29:22</pages>
<year>2022</year>
<booktitle>APPROX/RANDOM</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.29</ee>
<crossref>conf/approx/2022</crossref>
<url>db/conf/approx/approx2022.html#GaoMP22</url>
</inproceedings>
</r>
<r><inproceedings key="conf/complexnetworks/KaminskiPPT22" mdate="2025-03-03">
<author pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0001-7618-9119" pid="193/7531">Bartosz Pankratz</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Modularity of the ABCD Random Graph Model with Community Structure.</title>
<pages>3-15</pages>
<year>2022</year>
<booktitle>COMPLEX NETWORKS (2)</booktitle>
<ee>https://doi.org/10.1007/978-3-031-21131-7_1</ee>
<crossref>conf/complexnetworks/2022-2</crossref>
<url>db/conf/complexnetworks/complexnetworks2022-2.html#KaminskiPPT22</url>
</inproceedings>
</r>
<r><inproceedings key="conf/complexnetworks/KaminskiPT22" mdate="2025-03-03">
<author pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Outliers in the ABCD Random Graph Model with Community Structure (ABCD+o).</title>
<pages>163-174</pages>
<year>2022</year>
<booktitle>COMPLEX NETWORKS (2)</booktitle>
<ee>https://doi.org/10.1007/978-3-031-21131-7_13</ee>
<crossref>conf/complexnetworks/2022-2</crossref>
<url>db/conf/complexnetworks/complexnetworks2022-2.html#KaminskiPT22</url>
</inproceedings>
</r>
<r><inproceedings key="conf/complexnetworks/PankratzKP22" mdate="2025-03-03">
<author orcid="0000-0001-7618-9119" pid="193/7531">Bartosz Pankratz</author>
<author pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Community Detection Supported by Node Embeddings (Searching for a Suitable Method).</title>
<pages>221-232</pages>
<year>2022</year>
<booktitle>COMPLEX NETWORKS (2)</booktitle>
<ee>https://doi.org/10.1007/978-3-031-21131-7_17</ee>
<crossref>conf/complexnetworks/2022-2</crossref>
<url>db/conf/complexnetworks/complexnetworks2022-2.html#PankratzKP22</url>
</inproceedings>
</r>
<r><inproceedings key="conf/data/DehghanSSDBMXKP22" mdate="2022-08-03">
<author pid="325/6986">Ashkan Dehghan</author>
<author pid="325/7014">Kinga Siuta</author>
<author pid="325/7059">Agata Skorupka</author>
<author pid="218/5474">Akshat Dubey</author>
<author pid="325/6584">Andrei Betlen</author>
<author pid="25/721">David Miller</author>
<author pid="32/1213">Wei Xu</author>
<author pid="10/7115">Bogumil Kaminski</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>Detecting Bots in Social-networks using Node and Structural Embeddings.</title>
<pages>50-61</pages>
<year>2022</year>
<booktitle>DATA</booktitle>
<ee>https://doi.org/10.5220/0011147300003269</ee>
<crossref>conf/data/2022</crossref>
<url>db/conf/data/data2022.html#DehghanSSDBMXKP22</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-2203-01480" mdate="2025-03-03">
<author pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0001-7618-9119" pid="193/7531">Bartosz Pankratz</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Modularity of the ABCD Random Graph Model with Community Structure.</title>
<year>2022</year>
<volume>abs/2203.01480</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2203.01480</ee>
<url>db/journals/corr/corr2203.html#abs-2203-01480</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2203-06006" mdate="2025-03-03">
<author pid="d/DDereniowski">Dariusz Dereniowski</author>
<author pid="12/8077">Przemyslaw Gordinowicz</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Edge and Pair Queries - Random Graphs and Complexity.</title>
<year>2022</year>
<volume>abs/2203.06006</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2203.06006</ee>
<url>db/journals/corr/corr2203.html#abs-2203-06006</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2203-14899" mdate="2025-03-03">
<author pid="10/7115">Bogumil Kaminski</author>
<author pid="196/7820">Tomasz Olczak</author>
<author orcid="0000-0001-7618-9119" pid="193/7531">Bartosz Pankratz</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Properties and Performance of the ABCDe Random Graph Model with Community Structure.</title>
<year>2022</year>
<volume>abs/2203.14899</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2203.14899</ee>
<url>db/journals/corr/corr2203.html#abs-2203-14899</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2205-02350" mdate="2025-03-03">
<author pid="54/3104">Pu Gao</author>
<author pid="172/5055">Calum MacRury</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process.</title>
<year>2022</year>
<volume>abs/2205.02350</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2205.02350</ee>
<url>db/journals/corr/corr2205.html#abs-2205-02350</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2210-01327" mdate="2025-03-03">
<author pid="59/3284">Deepak Bal</author>
<author pid="f/AlanMFrieze">Alan M. Frieze</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Rainbow spanning trees in randomly coloured G<sub>k-out</sub>.</title>
<year>2022</year>
<volume>abs/2210.01327</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2210.01327</ee>
<url>db/journals/corr/corr2210.html#abs-2210-01327</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2210-15009" mdate="2022-11-02">
<author pid="10/7115">Bogumil Kaminski</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Hypergraph Artificial Benchmark for Community Detection (h-ABCD).</title>
<year>2022</year>
<volume>abs/2210.15009</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2210.15009</ee>
<url>db/journals/corr/corr2210.html#abs-2210-15009</url>
</article>
</r>
<r><article key="journals/combinatorics/GeorgiouKP21" mdate="2025-12-01">
<author pid="77/4787">Konstantinos Georgiou</author>
<author pid="119/4166">Somnath Kundu</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>The Unit Acquisition Number of Binomial Random Graphs.</title>
<year>2021</year>
<volume>28</volume>
<journal>Electron. J. Comb.</journal>
<number>3</number>
<ee type="oa">https://doi.org/10.37236/9671</ee>
<url>db/journals/combinatorics/combinatorics28.html#GeorgiouKP21</url>
</article>
</r>
<r><article key="journals/compnet/KaminskiPT21" mdate="2025-03-03">
<author orcid="0000-0002-0678-282X" pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>An unsupervised framework for comparing graph embeddings.</title>
<year>2021</year>
<volume>8</volume>
<journal>J. Complex Networks</journal>
<number>5</number>
<ee>https://doi.org/10.1093/comnet/cnz043</ee>
<ee>https://www.wikidata.org/entity/Q126981503</ee>
<url>db/journals/compnet/compnet8.html#KaminskiPT21</url>
</article>
</r>
<r><article key="journals/dam/HuqKMPS21" mdate="2021-04-07">
<author pid="261/2630">Reaz Huq</author>
<author orcid="0000-0002-0678-282X" pid="10/7115">Bogumil Kaminski</author>
<author pid="49/4622">Atefeh Mashatan</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author orcid="0000-0001-9525-3497" pid="133/5756">Przemyslaw Szufel</author>
<title>On broadcasting time in the model of travelling agents.</title>
<pages>246-263</pages>
<year>2021</year>
<volume>291</volume>
<journal>Discret. Appl. Math.</journal>
<ee>https://doi.org/10.1016/j.dam.2020.12.022</ee>
<url>db/journals/dam/dam291.html#HuqKMPS21</url>
</article>
</r>
<r><article key="journals/ejc/EnglishMP21" mdate="2025-03-03">
<author orcid="0000-0003-1830-8671" pid="211/0959">Sean English</author>
<author pid="172/5055">Calum MacRury</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Probabilistic zero forcing on random graphs.</title>
<pages>103207</pages>
<year>2021</year>
<volume>91</volume>
<journal>Eur. J. Comb.</journal>
<ee>https://doi.org/10.1016/j.ejc.2020.103207</ee>
<url>db/journals/ejc/ejc91.html#EnglishMP21</url>
</article>
</r>
<r><article key="journals/ejc/Perez-GimenezPW21" mdate="2026-02-25">
<author orcid="0000-0002-7969-1136" pid="36/1984">Xavier P&#233;rez-Gim&#233;nez</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="10/3889">Douglas B. West</author>
<title>On-line size Ramsey number for monotone k-uniform ordered paths with uniform looseness.</title>
<pages>103242</pages>
<year>2021</year>
<volume>92</volume>
<journal>Eur. J. Comb.</journal>
<ee>https://doi.org/10.1016/j.ejc.2020.103242</ee>
<url>db/journals/ejc/ejc92.html#Perez-GimenezPW21</url>
</article>
</r>
<r><article key="journals/netsci/KaminskiPT21" mdate="2021-07-29">
<author orcid="0000-0002-0678-282X" pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author orcid="0000-0002-5499-3680" pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Artificial Benchmark for Community Detection (ABCD) - Fast random graph model with community structure.</title>
<pages>153-178</pages>
<year>2021</year>
<volume>9</volume>
<journal>Netw. Sci.</journal>
<number>2</number>
<ee>https://doi.org/10.1017/nws.2020.45</ee>
<url>db/journals/netsci/netsci9.html#KaminskiPT21</url>
</article>
</r>
<r><inproceedings key="conf/iwoca/GeorgiouKP21" mdate="2025-03-03">
<author pid="77/4787">Konstantinos Georgiou</author>
<author pid="119/4166">Somnath Kundu</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Makespan Trade-Offs for Visiting Triangle Edges - (Extended Abstract).</title>
<pages>340-355</pages>
<year>2021</year>
<booktitle>IWOCA</booktitle>
<ee>https://doi.org/10.1007/978-3-030-79987-8_24</ee>
<crossref>conf/iwoca/2021</crossref>
<url>db/conf/iwoca/iwoca2021.html#GeorgiouKP21</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-2102-08275" mdate="2021-10-14">
<author pid="285/5957">Arash Dehghan-Kooshkghazi</author>
<author pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0002-3664-468X" pid="285/6190">Lukasz Krainski</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Evaluating Node Embeddings of Complex Networks.</title>
<year>2021</year>
<volume>abs/2102.08275</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2102.08275</ee>
<url>db/journals/corr/corr2102.html#abs-2102-08275</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2105-01191" mdate="2021-05-12">
<author pid="77/4787">Konstantinos Georgiou</author>
<author pid="119/4166">Somnath Kundu</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>Makespan Trade-offs for Visiting Triangle Edges.</title>
<year>2021</year>
<volume>abs/2105.01191</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2105.01191</ee>
<url>db/journals/corr/corr2105.html#abs-2105-01191</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2105-13455" mdate="2025-03-03">
<author pid="54/3104">Pu Gao</author>
<author pid="172/5055">Calum MacRury</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Perfect Matchings in the Semi-random Graph Process.</title>
<year>2021</year>
<volume>abs/2105.13455</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2105.13455</ee>
<url>db/journals/corr/corr2105.html#abs-2105-13455</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2112-00075" mdate="2021-12-07">
<author pid="10/7115">Bogumil Kaminski</author>
<author pid="285/6190">Lukasz Krainski</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>A Multi-purposed Unsupervised Framework for Comparing Embeddings of Undirected and Directed Graphs.</title>
<year>2021</year>
<volume>abs/2112.00075</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2112.00075</ee>
<url>db/journals/corr/corr2112.html#abs-2112-00075</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2112-07041" mdate="2024-07-02">
<author pid="m/StanMatwin">Stan Matwin</author>
<author pid="260/6061">Aristides Milios</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="144/7946">Am&#237;lcar Soares 0001</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Survey of Generative Methods for Social Media Analysis.</title>
<year>2021</year>
<volume>abs/2112.07041</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2112.07041</ee>
<url>db/journals/corr/corr2112.html#abs-2112-07041</url>
</article>
</r>
<r><article key="journals/combinatorics/FriezePP20" mdate="2026-02-25">
<author pid="f/AlanMFrieze">Alan M. Frieze</author>
<author orcid="0000-0002-7969-1136" pid="36/1984">Xavier P&#233;rez-Gim&#233;nez</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>On the Existence of Hamilton Cycles with a Periodic Pattern in a Random Digraph.</title>
<pages>4</pages>
<year>2020</year>
<volume>27</volume>
<journal>Electron. J. Comb.</journal>
<number>4</number>
<ee type="oa">https://doi.org/10.37236/9376</ee>
<url>db/journals/combinatorics/combinatorics27.html#FriezePP20</url>
</article>
</r>
<r><article key="journals/im/SpagnuoloCSPSKA20" mdate="2025-03-03">
<author orcid="0000-0002-8267-9808" pid="71/11144">Carmine Spagnuolo</author>
<author orcid="0000-0001-9148-9769" pid="26/4019">Gennaro Cordasco</author>
<author orcid="0000-0001-9525-3497" pid="133/5756">Przemyslaw Szufel</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author orcid="0000-0001-8437-5253" pid="32/6668">Vittorio Scarano</author>
<author orcid="0000-0002-0678-282X" pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0002-6366-0546" pid="173/0709">Alessia Antelmi</author>
<title>Analyzing, Exploring, and Visualizing Complex Networks via Hypergraphs using SimpleHypergraphs.jl.</title>
<year>2020</year>
<volume>2020</volume>
<journal>Internet Math.</journal>
<ee>https://doi.org/10.24166/im.01.2020</ee>
<url>db/journals/im/im2020.html#SpagnuoloCSPSKA20</url>
</article>
</r>
<r><article key="journals/jctb/MitscheMP20" mdate="2025-03-03">
<author pid="11/3659">Dieter Mitsche</author>
<author pid="m/MichaelMolloy">Michael Molloy 0001</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title><i>k</i>-regular subgraphs near the <i>k</i>-core threshold of a random graph.</title>
<pages>106-143</pages>
<year>2020</year>
<volume>142</volume>
<journal>J. Comb. Theory B</journal>
<ee>https://doi.org/10.1016/j.jctb.2019.10.001</ee>
<url>db/journals/jctb/jctb142.html#MitscheMP20</url>
</article>
</r>
<r><article key="journals/jgt/PralatW20" mdate="2025-03-03">
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="w/NicholasCWormald">Nick Wormald</author>
<title>Almost all 5-regular graphs have a 3-flow.</title>
<pages>147-156</pages>
<year>2020</year>
<volume>93</volume>
<journal>J. Graph Theory</journal>
<number>2</number>
<ee>https://doi.org/10.1002/jgt.22478</ee>
<ee>https://www.wikidata.org/entity/Q127582003</ee>
<url>db/journals/jgt/jgt93.html#PralatW20</url>
</article>
</r>
<r><inproceedings key="conf/complexnetworks/KaminskiPT20" mdate="2025-03-03">
<author pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Community Detection Algorithm Using Hypergraph Modularity.</title>
<pages>152-163</pages>
<year>2020</year>
<booktitle>COMPLEX NETWORKS (1)</booktitle>
<ee>https://doi.org/10.1007/978-3-030-65347-7_13</ee>
<crossref>conf/complexnetworks/2020-1</crossref>
<url>db/conf/complexnetworks/complexnetworks2020-1.html#KaminskiPT20</url>
</inproceedings>
</r>
<r><inproceedings key="conf/latin/BonatoGMP20" mdate="2025-03-03">
<author pid="16/2406">Anthony Bonato</author>
<author pid="77/4787">Konstantinos Georgiou</author>
<author pid="172/5055">Calum MacRury</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Probabilistically Faulty Searching on a Half-Line - (Extended Abstract).</title>
<pages>168-180</pages>
<year>2020</year>
<booktitle>LATIN</booktitle>
<ee>https://doi.org/10.1007/978-3-030-61792-9_14</ee>
<crossref>conf/latin/2020</crossref>
<url>db/conf/latin/latin2020.html#BonatoGMP20</url>
</inproceedings>
</r>
<r><inproceedings key="conf/waw/KaminskiPT20" mdate="2025-03-03">
<author orcid="0000-0002-0678-282X" pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>A Scalable Unsupervised Framework for Comparing Graph Embeddings.</title>
<pages>52-67</pages>
<year>2020</year>
<booktitle>WAW</booktitle>
<ee>https://doi.org/10.1007/978-3-030-48478-1_4</ee>
<crossref>conf/waw/2020</crossref>
<url>db/conf/waw/waw2020.html#KaminskiPT20</url>
</inproceedings>
</r>
<r><proceedings key="conf/waw/2020" mdate="2020-06-02">
<editor pid="10/7115">Bogumil Kaminski</editor>
<editor pid="p/PawelPralat">Pawel Pralat</editor>
<editor pid="133/5756">Przemyslaw Szufel</editor>
<title>Algorithms and Models for the Web Graph - 17th International Workshop, WAW 2020, Warsaw, Poland, September 21-22, 2020, Proceedings</title>
<booktitle>WAW</booktitle>
<publisher>Springer</publisher>
<year>2020</year>
<series href="db/series/lncs/index.html">Lecture Notes in Computer Science</series>
<volume>12091</volume>
<isbn>978-3-030-48477-4</isbn>
<isbn>978-3-030-48478-1</isbn>
<ee>https://doi.org/10.1007/978-3-030-48478-1</ee>
<url>db/conf/waw/waw2020.html</url>
</proceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-2002-00843" mdate="2020-02-10">
<author pid="10/7115">Bogumil Kaminski</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>Artificial Benchmark for Community Detection (ABCD): Fast Random Graph Model with Community Structure.</title>
<year>2020</year>
<volume>abs/2002.00843</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2002.00843</ee>
<url>db/journals/corr/corr2002.html#abs-2002-00843</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2002-04654" mdate="2020-02-14">
<author pid="173/0709">Alessia Antelmi</author>
<author pid="26/4019">Gennaro Cordasco</author>
<author pid="10/7115">Bogumil Kaminski</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="32/6668">Vittorio Scarano</author>
<author pid="71/11144">Carmine Spagnuolo</author>
<author pid="133/5756">Przemyslaw Szufel</author>
<title>Analyzing, Exploring, and Visualizing Complex Networks via Hypergraphs using SimpleHypergraphs.jl.</title>
<year>2020</year>
<volume>abs/2002.04654</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2002.04654</ee>
<url>db/journals/corr/corr2002.html#abs-2002-04654</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2002-07797" mdate="2020-03-02">
<author pid="16/2406">Anthony Bonato</author>
<author pid="77/4787">Konstantinos Georgiou</author>
<author pid="172/5055">Calum MacRury</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>Probabilistically Faulty Searching on a Half-Line.</title>
<year>2020</year>
<volume>abs/2002.07797</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2002.07797</ee>
<url>db/journals/corr/corr2002.html#abs-2002-07797</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2003-08501" mdate="2020-03-24">
<author pid="261/2630">Reaz Huq</author>
<author pid="10/7115">Bogumil Kaminski</author>
<author pid="49/4622">Atefeh Mashatan</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="133/5756">Przemyslaw Szufel</author>
<title>On Broadcasting Time in the Model of Travelling Agents.</title>
<year>2020</year>
<volume>abs/2003.08501</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2003.08501</ee>
<url>db/journals/corr/corr2003.html#abs-2003-08501</url>
</article>
</r>
<r><article key="journals/dam/KaminskiP19a" mdate="2025-03-03">
<author orcid="0000-0002-0678-282X" pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Sub-trees of a random tree.</title>
<pages>119-129</pages>
<year>2019</year>
<volume>268</volume>
<journal>Discret. Appl. Math.</journal>
<ee>https://doi.org/10.1016/j.dam.2019.05.003</ee>
<url>db/journals/dam/dam268.html#KaminskiP19a</url>
</article>
</r>
<r><article key="journals/rsa/FriezePPR19" mdate="2025-03-03">
<author pid="f/AlanMFrieze">Alan M. Frieze</author>
<author orcid="0000-0002-7969-1136" pid="36/1984">Xavier P&#233;rez-Gim&#233;nez</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="140/1162">Benjamin Reiniger</author>
<title>Perfect matchings and Hamiltonian cycles in the preferential attachment model.</title>
<pages>258-288</pages>
<year>2019</year>
<volume>54</volume>
<journal>Random Struct. Algorithms</journal>
<number>2</number>
<ee>https://doi.org/10.1002/rsa.20778</ee>
<ee>https://www.wikidata.org/entity/Q57991407</ee>
<url>db/journals/rsa/rsa54.html#FriezePPR19</url>
</article>
</r>
<r><article key="journals/rsa/McDiarmidMP19" mdate="2025-03-03">
<author pid="m/ColinMcDiarmid">Colin McDiarmid</author>
<author pid="11/3659">Dieter Mitsche</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Clique coloring of binomial random graphs.</title>
<pages>589-614</pages>
<year>2019</year>
<volume>54</volume>
<journal>Random Struct. Algorithms</journal>
<number>4</number>
<ee>https://doi.org/10.1002/rsa.20804</ee>
<url>db/journals/rsa/rsa54.html#McDiarmidMP19</url>
</article>
</r>
<r><article key="journals/rsa/PralatW19" mdate="2025-03-03">
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="w/NicholasCWormald">Nicholas C. Wormald</author>
<title>Meyniel's conjecture holds for random d-regular graphs.</title>
<pages>719-741</pages>
<year>2019</year>
<volume>55</volume>
<journal>Random Struct. Algorithms</journal>
<number>3</number>
<ee>https://doi.org/10.1002/rsa.20874</ee>
<ee>https://www.wikidata.org/entity/Q122871561</ee>
<url>db/journals/rsa/rsa55.html#PralatW19</url>
</article>
</r>
<r><article key="journals/tcs/KaminskiOP19" mdate="2025-03-03">
<author orcid="0000-0002-0678-282X" pid="10/7115">Bogumil Kaminski</author>
<author pid="196/7820">Tomasz Olczak</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Parallel execution of schedules with random dependency graph.</title>
<pages>113-132</pages>
<year>2019</year>
<volume>784</volume>
<journal>Theor. Comput. Sci.</journal>
<ee>https://doi.org/10.1016/j.tcs.2019.03.043</ee>
<url>db/journals/tcs/tcs784.html#KaminskiOP19</url>
</article>
</r>
<r><article key="journals/tcs/Pralat19" mdate="2025-03-03">
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>How many zombies are needed to catch the survivor on toroidal grids?</title>
<pages>3-11</pages>
<year>2019</year>
<volume>794</volume>
<journal>Theor. Comput. Sci.</journal>
<ee>https://doi.org/10.1016/j.tcs.2018.05.021</ee>
<ee>https://www.wikidata.org/entity/Q129793880</ee>
<url>db/journals/tcs/tcs794.html#Pralat19</url>
</article>
</r>
<r><inproceedings key="conf/waw/AntelmiCKPSSS19" mdate="2025-03-03">
<author orcid="0000-0002-6366-0546" pid="173/0709">Alessia Antelmi</author>
<author orcid="0000-0001-9148-9769" pid="26/4019">Gennaro Cordasco</author>
<author orcid="0000-0002-0678-282X" pid="10/7115">Bogumil Kaminski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author orcid="0000-0001-8437-5253" pid="32/6668">Vittorio Scarano</author>
<author orcid="0000-0002-8267-9808" pid="71/11144">Carmine Spagnuolo</author>
<author orcid="0000-0001-9525-3497" pid="133/5756">Przemyslaw Szufel</author>
<title>SimpleHypergraphs.jl - Novel Software Framework for Modelling and Analysis of Hypergraphs.</title>
<pages>115-129</pages>
<year>2019</year>
<booktitle>WAW</booktitle>
<ee>https://doi.org/10.1007/978-3-030-25070-6_9</ee>
<crossref>conf/waw/2019</crossref>
<url>db/conf/waw/waw2019.html#AntelmiCKPSSS19</url>
</inproceedings>
</r>
<r><proceedings key="conf/waw/2019" mdate="2022-01-03">
<editor orcid="0000-0002-8124-8272" pid="a/KonstantinAvrachenkov">Konstantin Avrachenkov</editor>
<editor pid="p/PawelPralat">Pawel Pralat</editor>
<editor pid="73/7375">Nan Ye</editor>
<title>Algorithms and Models for the Web Graph - 16th International Workshop, WAW 2019, Brisbane, QLD, Australia, July 6-7, 2019, Proceedings</title>
<booktitle>WAW</booktitle>
<publisher>Springer</publisher>
<year>2019</year>
<series href="db/series/lncs/index.html">Lecture Notes in Computer Science</series>
<volume>11631</volume>
<isbn>978-3-030-25069-0</isbn>
<isbn>978-3-030-25070-6</isbn>
<ee>https://doi.org/10.1007/978-3-030-25070-6</ee>
<url>db/conf/waw/waw2019.html</url>
</proceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-1906-04562" mdate="2019-06-14">
<author pid="10/7115">Bogumil Kaminski</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="80/1457">Fran&#231;ois Th&#233;berge</author>
<title>An Unsupervised Framework for Comparing Graph Embeddings.</title>
<year>2019</year>
<volume>abs/1906.04562</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1906.04562</ee>
<url>db/journals/corr/corr1906.html#abs-1906-04562</url>
</article>
</r>
<r><article key="journals/cdm/PralatG18" mdate="2025-05-01">
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="12/8077">Przemyslaw Gordinowicz</author>
<title>Small on-line Ramsey numbers - a new approach.</title>
<year>2018</year>
<volume>13</volume>
<journal>Contributions Discret. Math.</journal>
<number>2</number>
<ee type="oa">https://doi.org/10.11575/cdm.v13i2.62731</ee>
<ee type="oa">https://doi.org/10.55016/ojs/cdm.v13i2.62731</ee>
<url>db/journals/cdm/cdm13.html#PralatG18</url>
</article>
</r>
<r><article key="journals/combinatorics/DudekP18" mdate="2025-12-01">
<author pid="68/4382">Andrzej Dudek</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Note on the Multicolour Size-Ramsey Number for Paths, .</title>
<pages>3</pages>
<year>2018</year>
<volume>25</volume>
<journal>Electron. J. Comb.</journal>
<number>3</number>
<ee type="oa">https://doi.org/10.37236/7954</ee>
<url>db/journals/combinatorics/combinatorics25.html#DudekP18</url>
</article>
</r>
<r><article key="journals/combinatorics/McDiarmidMP18" mdate="2025-12-01">
<author pid="m/ColinMcDiarmid">Colin McDiarmid</author>
<author pid="11/3659">Dieter Mitsche</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Clique Colourings of Geometric Graphs.</title>
<pages>4</pages>
<year>2018</year>
<volume>25</volume>
<journal>Electron. J. Comb.</journal>
<number>4</number>
<ee type="oa">https://doi.org/10.37236/7159</ee>
<url>db/journals/combinatorics/combinatorics25.html#McDiarmidMP18</url>
</article>
</r>
<r><article key="journals/dam/BonatoRMNPPT18" mdate="2025-03-03">
<author pid="16/2406">Anthony Bonato</author>
<author pid="172/5035">Rita M. del R&#237;o-Chanona</author>
<author pid="172/5055">Calum MacRury</author>
<author pid="172/5061">Jake Nicolaidis</author>
<author orcid="0000-0002-7969-1136" pid="36/1984">Xavier P&#233;rez-Gim&#233;nez</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="172/5104">Kirill Ternovsky</author>
<title>The robot crawler graph process.</title>
<pages>23-36</pages>
<year>2018</year>
<volume>247</volume>
<journal>Discret. Appl. Math.</journal>
<ee>https://doi.org/10.1016/j.dam.2018.01.018</ee>
<ee>https://www.wikidata.org/entity/Q57991411</ee>
<url>db/journals/dam/dam247.html#BonatoRMNPPT18</url>
</article>
</r>
<r><article key="journals/dm/DudekKP18" mdate="2025-03-03">
<author pid="68/4382">Andrzej Dudek</author>
<author pid="220/2951">Farideh Khoeini</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Size-Ramsey numbers of cycles versus a path.</title>
<pages>2095-2103</pages>
<year>2018</year>
<volume>341</volume>
<journal>Discret. Math.</journal>
<number>7</number>
<ee>https://doi.org/10.1016/j.disc.2018.04.008</ee>
<ee>https://www.wikidata.org/entity/Q129900939</ee>
<url>db/journals/dm/dm341.html#DudekKP18</url>
</article>
</r>
<r><article key="journals/ejc/DudekPPQWZ18" mdate="2025-03-03">
<author pid="68/4382">Andrzej Dudek</author>
<author orcid="0000-0002-7969-1136" pid="36/1984">Xavier P&#233;rez-Gim&#233;nez</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="24/8493-1">Hao Qi 0001</author>
<author pid="10/3889">Douglas B. West</author>
<author pid="58/5187">Xuding Zhu</author>
<title>Randomly twisted hypercubes.</title>
<pages>364-373</pages>
<year>2018</year>
<volume>70</volume>
<journal>Eur. J. Comb.</journal>
<ee>https://doi.org/10.1016/j.ejc.2018.01.013</ee>
<ee>https://www.wikidata.org/entity/Q57991408</ee>
<url>db/journals/ejc/ejc70.html#DudekPPQWZ18</url>
</article>
</r>
<r><article key="journals/im/DewarTRPPPH18" mdate="2025-01-19">
<author pid="185/0699">Megan Dewar</author>
<author pid="172/5104">Kirill Ternovsky</author>
<author pid="140/1162">Benjamin Reiniger</author>
<author pid="73/4135">John Proos</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="36/1984">Xavier P&#233;rez-Gim&#233;nez</author>
<author pid="15/4960">John Healy</author>
<title>Subhypergraphs in non-uniform random hypergraphs.</title>
<year>2018</year>
<volume>2018</volume>
<journal>Internet Math.</journal>
<ee>https://doi.org/10.24166/im.03.2018</ee>
<ee>https://www.wikidata.org/entity/Q130094456</ee>
<url>db/journals/im/im2018.html#DewarTRPPPH18</url>
</article>
</r>
<r><article key="journals/tcs/MitschePR18" mdate="2025-03-03">
<author pid="11/3659">Dieter Mitsche</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="146/6441">Elham Roshanbin</author>
<title>Burning number of graph products.</title>
<pages>124-135</pages>
<year>2018</year>
<volume>746</volume>
<journal>Theor. Comput. Sci.</journal>
<ee>https://doi.org/10.1016/j.tcs.2018.06.036</ee>
<ee>https://www.wikidata.org/entity/Q129598205</ee>
<url>db/journals/tcs/tcs746.html#MitschePR18</url>
</article>
</r>
<r><inproceedings key="conf/waw/IskhakovKMPP18" mdate="2025-03-03">
<author pid="189/5961">Lenar Iskhakov</author>
<author orcid="0000-0002-0678-282X" pid="10/7115">Bogumil Kaminski</author>
<author pid="189/5958">Maksim Mironov</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="45/11468">Liudmila Ostroumova Prokhorenkova</author>
<title>Clustering Properties of Spatial Preferential Attachment Model.</title>
<pages>30-43</pages>
<year>2018</year>
<booktitle>WAW</booktitle>
<ee>https://doi.org/10.1007/978-3-319-92871-5_3</ee>
<crossref>conf/waw/2018</crossref>
<url>db/conf/waw/waw2018.html#IskhakovKMPP18</url>
</inproceedings>
</r>
<r><proceedings key="conf/waw/2018" mdate="2019-05-14">
<editor pid="16/2406">Anthony Bonato</editor>
<editor pid="p/PawelPralat">Pawel Pralat</editor>
<editor pid="117/9427">Andrei M. Raigorodskii</editor>
<title>Algorithms and Models for the Web Graph - 15th International Workshop, WAW 2018, Moscow, Russia, May 17-18, 2018, Proceedings</title>
<booktitle>WAW</booktitle>
<publisher>Springer</publisher>
<year>2018</year>
<series href="db/series/lncs/index.html">Lecture Notes in Computer Science</series>
<volume>10836</volume>
<isbn>978-3-319-92870-8</isbn>
<isbn>978-3-319-92871-5</isbn>
<ee>https://doi.org/10.1007/978-3-319-92871-5</ee>
<url>db/conf/waw/waw2018.html</url>
</proceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-1802-05127" mdate="2018-08-13">
<author pid="189/5961">Lenar Iskhakov</author>
<author pid="10/7115">Bogumil Kaminski</author>
<author pid="189/5958">Maksim Mironov</author>
<author pid="45/11468">Liudmila Ostroumova Prokhorenkova</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>Clustering Properties of Spatial Preferential Attachment Model.</title>
<year>2018</year>
<volume>abs/1802.05127</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1802.05127</ee>
<url>db/journals/corr/corr1802.html#abs-1802-05127</url>
</article>
</r>
<r><article key="journals/combinatorics/InfeldMP17" mdate="2025-12-01">
<author pid="149/2449">Ewa J. Infeld</author>
<author pid="11/3659">Dieter Mitsche</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>The Total Acquisition Number of Random Geometric Graphs.</title>
<pages>3</pages>
<year>2017</year>
<volume>24</volume>
<journal>Electron. J. Comb.</journal>
<number>3</number>
<ee type="oa">https://doi.org/10.37236/6632</ee>
<ee>https://www.wikidata.org/entity/Q116336059</ee>
<url>db/journals/combinatorics/combinatorics24.html#InfeldMP17</url>
</article>
</r>
<r><article key="journals/dmgt/GodboleKKPZ17" mdate="2025-03-03">
<author pid="80/3968">Anant P. Godbole</author>
<author pid="173/5849">Elizabeth Kelley</author>
<author pid="211/0974">Emily Kurtz</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="147/4624">Yiguang Zhang</author>
<title>The total acquisition number of the randomly weighted path.</title>
<pages>919-934</pages>
<year>2017</year>
<volume>37</volume>
<journal>Discuss. Math. Graph Theory</journal>
<number>4</number>
<ee type="oa">https://doi.org/10.7151/dmgt.1972</ee>
<url>db/journals/dmgt/dmgt37.html#GodboleKKPZ17</url>
</article>
</r>
<r><article key="journals/endm/ProkhorenkovaPR17" mdate="2025-03-03">
<author pid="45/11468">Liudmila Ostroumova Prokhorenkova</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="117/9427">Andrei M. Raigorodskii</author>
<title>Modularity in several random graph models.</title>
<pages>947-953</pages>
<year>2017</year>
<volume>61</volume>
<journal>Electron. Notes Discret. Math.</journal>
<ee>https://doi.org/10.1016/j.endm.2017.07.058</ee>
<url>db/journals/endm/endm61.html#ProkhorenkovaPR17</url>
</article>
</r>
<r><article key="journals/gc/MitschePR17" mdate="2025-03-03">
<author pid="11/3659">Dieter Mitsche</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="146/6441">Elham Roshanbin</author>
<title>Burning Graphs: A Probabilistic Perspective.</title>
<pages>449-471</pages>
<year>2017</year>
<volume>33</volume>
<journal>Graphs Comb.</journal>
<number>2</number>
<ee>https://doi.org/10.1007/s00373-017-1768-5</ee>
<url>db/journals/gc/gc33.html#MitschePR17</url>
</article>
</r>
<r><article key="journals/gc/BonatoPPR17" mdate="2025-03-03">
<author pid="16/2406">Anthony Bonato</author>
<author orcid="0000-0002-7969-1136" pid="36/1984">Xavier P&#233;rez-Gim&#233;nez</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="140/1162">Benjamin Reiniger</author>
<title>The Game of Overprescribed Cops and Robbers Played on Graphs.</title>
<pages>801-815</pages>
<year>2017</year>
<volume>33</volume>
<journal>Graphs Comb.</journal>
<number>4</number>
<ee>https://doi.org/10.1007/s00373-017-1815-2</ee>
<ee>https://www.wikidata.org/entity/Q57991413</ee>
<url>db/journals/gc/gc33.html#BonatoPPR17</url>
</article>
</r>
<r><article key="journals/rsa/BalBPP17" mdate="2025-03-03">
<author orcid="0000-0003-1441-1823" pid="59/3284">Deepak Bal</author>
<author orcid="0000-0003-3147-4690" pid="119/4799">Patrick Bennett</author>
<author orcid="0000-0002-7969-1136" pid="36/1984">Xavier P&#233;rez-Gim&#233;nez</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Rainbow perfect matchings and Hamilton cycles in the random geometric graph.</title>
<pages>587-606</pages>
<year>2017</year>
<volume>51</volume>
<journal>Random Struct. Algorithms</journal>
<number>4</number>
<ee>https://doi.org/10.1002/rsa.20717</ee>
<ee>https://www.wikidata.org/entity/Q57991415</ee>
<url>db/journals/rsa/rsa51.html#BalBPP17</url>
</article>
</r>
<r><article key="journals/siamdm/DudekP17" mdate="2025-03-03">
<author pid="68/4382">Andrzej Dudek</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>On some Multicolor Ramsey Properties of Random Graphs.</title>
<pages>2079-2092</pages>
<year>2017</year>
<volume>31</volume>
<journal>SIAM J. Discret. Math.</journal>
<number>3</number>
<ee>https://doi.org/10.1137/16M1069717</ee>
<url>db/journals/siamdm/siamdm31.html#DudekP17</url>
</article>
</r>
<r><inproceedings key="conf/waw/BonatoIPP17" mdate="2017-09-06">
<author pid="16/2406">Anthony Bonato</author>
<author pid="149/2449">Ewa J. Infeld</author>
<author pid="205/4389">Hari Pokhrel</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>Common Adversaries Form Alliances: Modelling Complex Networks via Anti-transitivity.</title>
<pages>16-26</pages>
<year>2017</year>
<booktitle>WAW</booktitle>
<ee>https://doi.org/10.1007/978-3-319-67810-8_2</ee>
<crossref>conf/waw/2017</crossref>
<url>db/conf/waw/waw2017.html#BonatoIPP17</url>
</inproceedings>
</r>
<r><inproceedings key="conf/waw/KaminskiOP17" mdate="2019-12-27">
<author orcid="0000-0002-0678-282X" pid="10/7115">Bogumil Kaminski</author>
<author pid="196/7820">Tomasz Olczak</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>Endogenous Differentiation of Consumer Preferences Under Quality Uncertainty in a SPA Network.</title>
<pages>42-59</pages>
<year>2017</year>
<booktitle>WAW</booktitle>
<ee>https://doi.org/10.1007/978-3-319-67810-8_4</ee>
<crossref>conf/waw/2017</crossref>
<url>db/conf/waw/waw2017.html#KaminskiOP17</url>
</inproceedings>
</r>
<r><proceedings key="conf/waw/2017" mdate="2019-05-14">
<editor pid="16/2406">Anthony Bonato</editor>
<editor pid="c/FRKChung">Fan Chung Graham</editor>
<editor pid="p/PawelPralat">Pawel Pralat</editor>
<title>Algorithms and Models for the Web Graph - 14th International Workshop, WAW 2017, Toronto, ON, Canada, June 15-16, 2017, Revised Selected Papers</title>
<booktitle>WAW</booktitle>
<publisher>Springer</publisher>
<year>2017</year>
<series href="db/series/lncs/index.html">Lecture Notes in Computer Science</series>
<volume>10519</volume>
<isbn>978-3-319-67809-2</isbn>
<isbn>978-3-319-67810-8</isbn>
<ee>https://doi.org/10.1007/978-3-319-67810-8</ee>
<url>db/conf/waw/waw2017.html</url>
</proceedings>
</r>
<r><article key="journals/combinatorics/BalBDP16" mdate="2025-12-01">
<author pid="59/3284">Deepak Bal</author>
<author orcid="0000-0003-3147-4690" pid="119/4799">Patrick Bennett</author>
<author pid="68/4382">Andrzej Dudek</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>The Total Acquisition Number of Random Graphs.</title>
<pages>2</pages>
<year>2016</year>
<volume>23</volume>
<journal>Electron. J. Comb.</journal>
<number>2</number>
<ee type="oa">https://doi.org/10.37236/5327</ee>
<url>db/journals/combinatorics/combinatorics23.html#BalBDP16</url>
</article>
</r>
<r><article key="journals/combinatorics/MitschePP16" mdate="2025-12-01">
<author pid="11/3659">Dieter Mitsche</author>
<author pid="36/1984">Xavier P&#233;rez-Gim&#233;nez</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>The Bondage Number of Random Graphs.</title>
<pages>2</pages>
<year>2016</year>
<volume>23</volume>
<journal>Electron. J. Comb.</journal>
<number>2</number>
<ee type="oa">https://doi.org/10.37236/5180</ee>
<url>db/journals/combinatorics/combinatorics23.html#MitschePP16</url>
</article>
</r>
<r><article key="journals/dam/KinnersleyP16" mdate="2025-03-03">
<author pid="35/2244">William B. Kinnersley</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Game brush number.</title>
<pages>1-14</pages>
<year>2016</year>
<volume>207</volume>
<journal>Discret. Appl. Math.</journal>
<ee type="oa">https://doi.org/10.1016/j.dam.2016.02.011</ee>
<url>db/journals/dam/dam207.html#KinnersleyP16</url>
</article>
</r>
<r><article key="journals/dam/DudekMP16" mdate="2025-03-03">
<author pid="68/4382">Andrzej Dudek</author>
<author pid="11/3659">Dieter Mitsche</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>The set chromatic number of random graphs.</title>
<pages>61-70</pages>
<year>2016</year>
<volume>215</volume>
<journal>Discret. Appl. Math.</journal>
<ee type="oa">https://doi.org/10.1016/j.dam.2016.07.011</ee>
<url>db/journals/dam/dam215.html#DudekMP16</url>
</article>
</r>
<r><article key="journals/im/BonatoP16" mdate="2025-03-03">
<author pid="16/2406">Anthony Bonato</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Special Issue on Algorithms and Models for the Web-Graph.</title>
<pages>1</pages>
<year>2016</year>
<volume>12</volume>
<journal>Internet Math.</journal>
<number>1-2</number>
<ee>https://doi.org/10.1080/15427951.2016.1140994</ee>
<url>db/journals/im/im12.html#BonatoP16</url>
</article>
</r>
<r><article key="journals/im/JanssenPW16" mdate="2025-03-03">
<author orcid="0000-0002-0322-7855" pid="j/JCMJanssen">Jeannette C. M. Janssen</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="67/8008">Rory Wilson</author>
<title>Nonuniform Distribution of Nodes in the Spatial Preferential Attachment Model.</title>
<pages>121-144</pages>
<year>2016</year>
<volume>12</volume>
<journal>Internet Math.</journal>
<number>1-2</number>
<ee>https://doi.org/10.1080/15427951.2015.1110543</ee>
<url>db/journals/im/im12.html#JanssenPW16</url>
</article>
</r>
<r><article key="journals/jgt/BalBCFP16" mdate="2025-03-03">
<author orcid="0000-0003-1441-1823" pid="59/3284">Deepak Bal</author>
<author orcid="0000-0003-3147-4690" pid="119/4799">Patrick Bennett</author>
<author pid="41/126">Colin Cooper</author>
<author orcid="0000-0002-8481-5615" pid="f/AlanMFrieze">Alan M. Frieze</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Rainbow Arborescence in Random Digraphs.</title>
<pages>251-265</pages>
<year>2016</year>
<volume>83</volume>
<journal>J. Graph Theory</journal>
<number>3</number>
<ee>https://doi.org/10.1002/jgt.21995</ee>
<ee>https://www.wikidata.org/entity/Q57401405</ee>
<url>db/journals/jgt/jgt83.html#BalBCFP16</url>
</article>
</r>
<r><article key="journals/netsci/HenryMP16" mdate="2025-03-03">
<author pid="96/9725">Adam Douglas Henry</author>
<author pid="11/3659">Dieter Mitsche</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Homophily, influence and the decay of segregation in self-organizing networks.</title>
<pages>81-116</pages>
<year>2016</year>
<volume>4</volume>
<journal>Netw. Sci.</journal>
<number>1</number>
<ee>https://doi.org/10.1017/nws.2016.1</ee>
<url>db/journals/netsci/netsci4.html#HenryMP16</url>
</article>
</r>
<r><article key="journals/rsa/PralatW16" mdate="2025-03-03">
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="w/NicholasCWormald">Nicholas C. Wormald</author>
<title>Meyniel's conjecture holds for random graphs.</title>
<pages>396-421</pages>
<year>2016</year>
<volume>48</volume>
<journal>Random Struct. Algorithms</journal>
<number>2</number>
<ee>https://doi.org/10.1002/rsa.20587</ee>
<ee>https://www.wikidata.org/entity/Q123181686</ee>
<url>db/journals/rsa/rsa48.html#PralatW16</url>
</article>
</r>
<r><article key="journals/siamdm/DudekP16" mdate="2025-03-03">
<author pid="68/4382">Andrzej Dudek</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Acquaintance Time of Random Graphs Near Connectivity Threshold.</title>
<pages>555-568</pages>
<year>2016</year>
<volume>30</volume>
<journal>SIAM J. Discret. Math.</journal>
<number>1</number>
<ee>https://doi.org/10.1137/140969105</ee>
<url>db/journals/siamdm/siamdm30.html#DudekP16</url>
</article>
</r>
<r><article key="journals/tcs/KinnersleyPW16" mdate="2025-03-03">
<author orcid="0000-0003-3849-4221" pid="35/2244">William B. Kinnersley</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="10/3889">Douglas B. West</author>
<title>To catch a falling robber.</title>
<pages>107-111</pages>
<year>2016</year>
<volume>627</volume>
<journal>Theor. Comput. Sci.</journal>
<ee type="oa">https://doi.org/10.1016/j.tcs.2016.02.030</ee>
<url>db/journals/tcs/tcs627.html#KinnersleyPW16</url>
</article>
</r>
<r><article key="journals/tcs/BonatoMPP16" mdate="2025-03-03">
<author pid="16/2406">Anthony Bonato</author>
<author pid="11/3659">Dieter Mitsche</author>
<author orcid="0000-0002-7969-1136" pid="36/1984">Xavier P&#233;rez-Gim&#233;nez</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>A probabilistic version of the game of Zombies and Survivors on graphs.</title>
<pages>2-14</pages>
<year>2016</year>
<volume>655</volume>
<journal>Theor. Comput. Sci.</journal>
<ee type="oa">https://doi.org/10.1016/j.tcs.2015.12.012</ee>
<ee>https://www.wikidata.org/entity/Q57991426</ee>
<url>db/journals/tcs/tcs655.html#BonatoMPP16</url>
</article>
</r>
<r><inproceedings key="conf/recsys/LakBBP16" mdate="2023-03-10">
<author pid="142/7909">Parisa Lak</author>
<author pid="185/2896">Ceni Babaoglu</author>
<author pid="55/2997">Ayse Basar Bener</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>News Article Position Recommendation Based on the Analysis of Article's Content - Time Matters.</title>
<pages>11-14</pages>
<year>2016</year>
<booktitle>CBRecSys@RecSys</booktitle>
<ee type="oa">https://ceur-ws.org/Vol-1673/paper2.pdf</ee>
<crossref>conf/recsys/2016cbrecsys</crossref>
<url>db/conf/recsys/cbrecsys2016.html#LakBBP16</url>
</inproceedings>
</r>
<r><inproceedings key="conf/waw/ProkhorenkovaPR16" mdate="2025-03-03">
<author pid="45/11468">Liudmila Ostroumova Prokhorenkova</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="117/9427">Andrei M. Raigorodskii</author>
<title>Modularity of Complex Networks Models.</title>
<pages>115-126</pages>
<year>2016</year>
<booktitle>WAW</booktitle>
<ee>https://doi.org/10.1007/978-3-319-49787-7_10</ee>
<crossref>conf/waw/2016</crossref>
<url>db/conf/waw/waw2016.html#ProkhorenkovaPR16</url>
</inproceedings>
</r>
<r><inproceedings key="conf/waw/DewarHPPPRT16" mdate="2025-03-03">
<author pid="185/0699">Megan Dewar</author>
<author pid="15/4960">John Healy</author>
<author orcid="0000-0002-7969-1136" pid="36/1984">Xavier P&#233;rez-Gim&#233;nez</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="73/4135">John Proos</author>
<author pid="140/1162">Benjamin Reiniger</author>
<author pid="172/5104">Kirill Ternovsky</author>
<title>Subgraphs in Non-uniform Random Hypergraphs.</title>
<pages>140-151</pages>
<year>2016</year>
<booktitle>WAW</booktitle>
<ee>https://doi.org/10.1007/978-3-319-49787-7_12</ee>
<ee>https://www.wikidata.org/entity/Q57991427</ee>
<crossref>conf/waw/2016</crossref>
<url>db/conf/waw/waw2016.html#DewarHPPPRT16</url>
</inproceedings>
</r>
<r><proceedings key="conf/waw/2016" mdate="2019-05-14">
<editor pid="16/2406">Anthony Bonato</editor>
<editor pid="c/FRKChung">Fan Chung Graham</editor>
<editor pid="p/PawelPralat">Pawel Pralat</editor>
<title>Algorithms and Models for the Web Graph - 13th International Workshop, WAW 2016, Montreal, QC, Canada, December 14-15, 2016, Proceedings</title>
<booktitle>WAW</booktitle>
<year>2016</year>
<series href="db/series/lncs/index.html">Lecture Notes in Computer Science</series>
<volume>10088</volume>
<isbn>978-3-319-49786-0</isbn>
<ee>https://doi.org/10.1007/978-3-319-49787-7</ee>
<url>db/conf/waw/waw2016.html</url>
</proceedings>
</r>
<r><article publtype="informal" key="journals/corr/BonatoPPR16" mdate="2018-08-13">
<author pid="16/2406">Anthony Bonato</author>
<author pid="36/1984">Xavier P&#233;rez-Gim&#233;nez</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="140/1162">Benjamin Reiniger</author>
<title>The game of Overprescribed Cops and Robbers played on graphs.</title>
<year>2016</year>
<volume>abs/1611.07592</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1611.07592</ee>
<url>db/journals/corr/corr1611.html#BonatoPPR16</url>
</article>
</r>
<r><article key="journals/cdm/LiMP15" mdate="2025-04-01">
<author pid="167/0572">Anshui Li</author>
<author pid="59/1656-1">Tobias M&#252;ller 0001</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>Chasing robbers on percolated random geometric graphs.</title>
<year>2015</year>
<volume>10</volume>
<journal>Contributions Discret. Math.</journal>
<number>1</number>
<ee type="oa">https://doi.org/10.11575/cdm.v10i1.62293</ee>
<url>db/journals/cdm/cdm10.html#LiMP15</url>
</article>
</r>
<r><article key="journals/combinatorics/BalBFP15" mdate="2025-12-01">
<author orcid="0000-0003-1441-1823" pid="59/3284">Deepak Bal</author>
<author orcid="0000-0003-3147-4690" pid="119/4799">Patrick Bennett</author>
<author pid="f/AlanMFrieze">Alan M. Frieze</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Power of k Choices and Rainbow Spanning Trees in Random Graphs.</title>
<pages>1</pages>
<year>2015</year>
<volume>22</volume>
<journal>Electron. J. Comb.</journal>
<number>1</number>
<ee type="oa">https://doi.org/10.37236/4642</ee>
<url>db/journals/combinatorics/combinatorics22.html#BalBFP15</url>
</article>
</r>
<r><article key="journals/combinatorics/FriezeMPP15" mdate="2025-12-01">
<author pid="f/AlanMFrieze">Alan M. Frieze</author>
<author pid="11/3659">Dieter Mitsche</author>
<author pid="36/1984">Xavier P&#233;rez-Gim&#233;nez</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>On-line List Colouring of Random Graphs.</title>
<pages>2</pages>
<year>2015</year>
<volume>22</volume>
<journal>Electron. J. Comb.</journal>
<number>2</number>
<ee type="oa">https://doi.org/10.37236/5003</ee>
<url>db/journals/combinatorics/combinatorics22.html#FriezeMPP15</url>
</article>
</r>
<r><article key="journals/combinatorics/Pralat15" mdate="2025-12-01">
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Containment Game Played on Random Graphs: Another Zig-Zag Theorem.</title>
<pages>2</pages>
<year>2015</year>
<volume>22</volume>
<journal>Electron. J. Comb.</journal>
<number>2</number>
<ee type="oa">https://doi.org/10.37236/4777</ee>
<url>db/journals/combinatorics/combinatorics22.html#Pralat15</url>
</article>
</r>
<r><article key="journals/cpc/DudekP15" mdate="2025-03-03">
<author pid="68/4382">Andrzej Dudek</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths.</title>
<pages>551-555</pages>
<year>2015</year>
<volume>24</volume>
<journal>Comb. Probab. Comput.</journal>
<number>3</number>
<ee>https://doi.org/10.1017/S096354831400056X</ee>
<ee>https://www.wikidata.org/entity/Q105585042</ee>
<url>db/journals/cpc/cpc24.html#DudekP15</url>
</article>
</r>
<r><article key="journals/cpc/BalBKP15" mdate="2025-03-03">
<author pid="59/3284">Deepak Bal</author>
<author pid="16/2406">Anthony Bonato</author>
<author pid="35/2244">William B. Kinnersley</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Lazy Cops and Robbers on Hypercubes.</title>
<pages>829-837</pages>
<year>2015</year>
<volume>24</volume>
<journal>Comb. Probab. Comput.</journal>
<number>6</number>
<ee>https://doi.org/10.1017/S0963548314000807</ee>
<url>db/journals/cpc/cpc24.html#BalBKP15</url>
</article>
</r>
<r><article key="journals/dm/Pralat15" mdate="2025-03-03">
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Almost all k-cop-win graphs contain a dominating set of cardinality k.</title>
<pages>47-52</pages>
<year>2015</year>
<volume>338</volume>
<number>1</number>
<journal>Discret. Math.</journal>
<ee type="oa">https://doi.org/10.1016/j.disc.2014.08.023</ee>
<url>db/journals/dm/dm338.html#Pralat15</url>
</article>
</r>
<r><article key="journals/ejc/MullerP15" mdate="2025-03-03">
<author pid="59/1656-1">Tobias M&#252;ller 0001</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>The acquaintance time of (percolated) random geometric graphs.</title>
<pages>198-214</pages>
<year>2015</year>
<volume>48</volume>
<journal>Eur. J. Comb.</journal>
<ee type="oa">https://doi.org/10.1016/j.ejc.2015.02.021</ee>
<url>db/journals/ejc/ejc48.html#MullerP15</url>
</article>
</r>
<r><article key="journals/im/BonatoP15" mdate="2025-03-03">
<author pid="16/2406">Anthony Bonato</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Special Issue on Algorithms and Models for the Web-graph.</title>
<pages>307</pages>
<year>2015</year>
<volume>11</volume>
<journal>Internet Math.</journal>
<number>4-5</number>
<ee>https://doi.org/10.1080/15427951.2015.1069522</ee>
<url>db/journals/im/im11.html#BonatoP15</url>
</article>
</r>
<r><inproceedings key="conf/isc2/LakKPBS15" mdate="2025-03-03">
<author pid="142/7909">Parisa Lak</author>
<author pid="188/0773">Akin Kocak</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author orcid="0000-0003-4934-8326" pid="55/2997">Ayse Bener</author>
<author pid="188/0728">Akram Samarikhalaj</author>
<title>Towards dynamic pricing for digital billboard advertising network in smart cities.</title>
<pages>1-6</pages>
<year>2015</year>
<booktitle>ISC2</booktitle>
<ee>https://doi.org/10.1109/ISC2.2015.7366211</ee>
<crossref>conf/isc2/2015</crossref>
<url>db/conf/isc2/isc2015.html#LakKPBS15</url>
</inproceedings>
</r>
<r><inproceedings key="conf/tamc/BonatoLMPP15" mdate="2025-03-03">
<author pid="16/2406">Anthony Bonato</author>
<author pid="156/0089">Marc Lozier</author>
<author pid="11/3659">Dieter Mitsche</author>
<author orcid="0000-0002-7969-1136" pid="36/1984">Xavier P&#233;rez-Gim&#233;nez</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>The Domination Number of On-line Social Networks and Random Geometric Graphs.</title>
<pages>150-163</pages>
<year>2015</year>
<booktitle>TAMC</booktitle>
<ee>https://doi.org/10.1007/978-3-319-17142-5_14</ee>
<ee>https://www.wikidata.org/entity/Q57991431</ee>
<crossref>conf/tamc/2015</crossref>
<url>db/conf/tamc/tamc2015.html#BonatoLMPP15</url>
</inproceedings>
</r>
<r><inproceedings key="conf/waw/BonatoRMNPPT15" mdate="2025-03-03">
<author pid="16/2406">Anthony Bonato</author>
<author pid="172/5035">Rita M. del R&#237;o-Chanona</author>
<author pid="172/5055">Calum MacRury</author>
<author pid="172/5061">Jake Nicolaidis</author>
<author orcid="0000-0002-7969-1136" pid="36/1984">Xavier P&#233;rez-Gim&#233;nez</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="172/5104">Kirill Ternovsky</author>
<title>The Robot Crawler Number of a Graph.</title>
<pages>132-147</pages>
<year>2015</year>
<booktitle>WAW</booktitle>
<ee>https://doi.org/10.1007/978-3-319-26784-5_11</ee>
<ee>https://www.wikidata.org/entity/Q57991433</ee>
<crossref>conf/waw/2015</crossref>
<url>db/conf/waw/waw2015.html#BonatoRMNPPT15</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/FriezeMPP15" mdate="2018-08-13">
<author pid="f/AlanMFrieze">Alan M. Frieze</author>
<author pid="11/3659">Dieter Mitsche</author>
<author pid="36/1984">Xavier P&#233;rez-Gim&#233;nez</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>On-line list colouring of random graphs.</title>
<year>2015</year>
<volume>abs/1501.07469</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1501.07469</ee>
<url>db/journals/corr/corr1501.html#FriezeMPP15</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/MitschePP15" mdate="2018-08-13">
<author pid="11/3659">Dieter Mitsche</author>
<author pid="36/1984">Xavier P&#233;rez-Gim&#233;nez</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>Strong-majority bootstrap percolation on regular graphs with low dissemination threshold.</title>
<year>2015</year>
<volume>abs/1503.08310</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1503.08310</ee>
<url>db/journals/corr/corr1503.html#MitschePP15</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/BonatoMPP15" mdate="2018-08-13">
<author pid="16/2406">Anthony Bonato</author>
<author pid="11/3659">Dieter Mitsche</author>
<author pid="36/1984">Xavier P&#233;rez-Gim&#233;nez</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>A probabilistic version of the game of Zombies and Survivors on graphs.</title>
<year>2015</year>
<volume>abs/1503.08810</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1503.08810</ee>
<url>db/journals/corr/corr1503.html#BonatoMPP15</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/MitschePR15" mdate="2018-08-13">
<author pid="11/3659">Dieter Mitsche</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="146/6441">Elham Roshanbin</author>
<title>Burning graphs - a probabilistic perspective.</title>
<year>2015</year>
<volume>abs/1505.03052</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1505.03052</ee>
<url>db/journals/corr/corr1505.html#MitschePR15</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/JanssenPW15" mdate="2018-08-13">
<author pid="j/JCMJanssen">Jeannette C. M. Janssen</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="67/8008">Rory Wilson</author>
<title>Non-Uniform Distribution of Nodes in the Spatial Preferential Attachment Model.</title>
<year>2015</year>
<volume>abs/1506.06053</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1506.06053</ee>
<url>db/journals/corr/corr1506.html#JanssenPW15</url>
</article>
</r>
<r><article key="journals/combinatorics/MitscheP14" mdate="2025-12-01">
<author pid="11/3659">Dieter Mitsche</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>On the Hyperbolicity of Random Graphs.</title>
<pages>2</pages>
<year>2014</year>
<volume>21</volume>
<journal>Electron. J. Comb.</journal>
<number>2</number>
<ee type="oa">https://doi.org/10.37236/4053</ee>
<url>db/journals/combinatorics/combinatorics21.html#MitscheP14</url>
</article>
</r>
<r><article key="journals/dam/BryantFGPP14" mdate="2025-03-03">
<author orcid="0000-0002-1605-5343" pid="b/DarrynEBryant">Darryn E. Bryant</author>
<author orcid="0000-0002-1603-2635" pid="36/8049">Nevena Francetic</author>
<author orcid="0000-0001-9843-3928" pid="12/8077">Przemyslaw Gordinowicz</author>
<author orcid="0000-0001-8952-3016" pid="77/605">David A. Pike</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Brushing without capacity restrictions.</title>
<pages>33-45</pages>
<year>2014</year>
<volume>170</volume>
<journal>Discret. Appl. Math.</journal>
<ee type="oa">https://doi.org/10.1016/j.dam.2014.01.024</ee>
<url>db/journals/dam/dam170.html#BryantFGPP14</url>
</article>
</r>
<r><article key="journals/dam/AlonP14" mdate="2025-03-03">
<author pid="a/NAlon">Noga Alon</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Chasing robbers on random geometric graphs - An alternative approach.</title>
<pages>149-152</pages>
<year>2014</year>
<volume>178</volume>
<journal>Discret. Appl. Math.</journal>
<ee type="oa">https://doi.org/10.1016/j.dam.2014.06.004</ee>
<url>db/journals/dam/dam178.html#AlonP14</url>
</article>
</r>
<r><article key="journals/dm/MessingerNP14" mdate="2025-03-03">
<author pid="68/6403">Margaret-Ellen Messinger</author>
<author orcid="0000-0002-4434-672X" pid="40/6020">Richard J. Nowakowski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Elimination schemes and lattices.</title>
<pages>63-70</pages>
<year>2014</year>
<volume>328</volume>
<journal>Discret. Math.</journal>
<ee type="oa">https://doi.org/10.1016/j.disc.2014.03.024</ee>
<url>db/journals/dm/dm328.html#MessingerNP14</url>
</article>
</r>
<r><article key="journals/dm/GavenciakKP14" mdate="2025-03-03">
<author orcid="0000-0003-1119-2426" pid="00/8050">Tomas Gavenciak</author>
<author orcid="0000-0002-2620-6133" pid="31/6569">Jan Kratochv&#237;l</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Firefighting on square, hexagonal, and triangular grids.</title>
<pages>142-155</pages>
<year>2014</year>
<volume>337</volume>
<journal>Discret. Math.</journal>
<ee type="oa">https://doi.org/10.1016/j.disc.2014.06.020</ee>
<url>db/journals/dm/dm337.html#GavenciakKP14</url>
</article>
</r>
<r><article key="journals/dmtcs/BonatoKP14" mdate="2023-08-28">
<author pid="16/2406">Anthony Bonato</author>
<author pid="35/2244">William B. Kinnersley</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>Toppling numbers of complete and random graphs.</title>
<pages>229-252</pages>
<year>2014</year>
<volume>16</volume>
<journal>Discret. Math. Theor. Comput. Sci.</journal>
<number>3</number>
<ee type="oa">https://doi.org/10.46298/dmtcs.2084</ee>
<ee>https://www.wikidata.org/entity/Q114020649</ee>
<url>db/journals/dmtcs/dmtcs16.html#BonatoKP14</url>
</article>
</r>
<r><article key="journals/ejc/BonatoBMP14" mdate="2025-03-03">
<author pid="16/2406">Anthony Bonato</author>
<author orcid="0000-0002-4721-8985" pid="68/697">Jason I. Brown</author>
<author pid="11/3659">Dieter Mitsche</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Independence densities of hypergraphs.</title>
<pages>124-136</pages>
<year>2014</year>
<volume>40</volume>
<journal>Eur. J. Comb.</journal>
<ee type="oa">https://doi.org/10.1016/j.ejc.2014.03.001</ee>
<url>db/journals/ejc/ejc40.html#BonatoBMP14</url>
</article>
</r>
<r><article key="journals/gc/Pralat14" mdate="2025-03-03">
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Graphs with Average Degree Smaller Than $${\frac {30}{11}}$$ Burn Slowly.</title>
<pages>455-470</pages>
<year>2014</year>
<volume>30</volume>
<journal>Graphs Comb.</journal>
<number>2</number>
<ee>https://doi.org/10.1007/s00373-012-1265-9</ee>
<url>db/journals/gc/gc30.html#Pralat14</url>
</article>
</r>
<r><article key="journals/im/CooperFP14" mdate="2025-03-03">
<author pid="41/126">Colin Cooper</author>
<author pid="f/AlanMFrieze">Alan M. Frieze</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Some Typical Properties of the Spatial Preferred Attachment Model.</title>
<pages>116-136</pages>
<year>2014</year>
<volume>10</volume>
<journal>Internet Math.</journal>
<number>1-2</number>
<ee>https://doi.org/10.1080/15427951.2013.796301</ee>
<url>db/journals/im/im10.html#CooperFP14</url>
</article>
</r>
<r><article key="journals/robotics/KehagiasMP14" mdate="2025-03-03">
<author pid="52/2514">Athanasios Kehagias</author>
<author pid="11/3659">Dieter Mitsche</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>The Role of Visibility in Pursuit/Evasion Games.</title>
<pages>371-399</pages>
<year>2014</year>
<volume>3</volume>
<journal>Robotics</journal>
<number>4</number>
<ee type="oa">https://doi.org/10.3390/robotics3040371</ee>
<url>db/journals/robotics/robotics3.html#KehagiasMP14</url>
</article>
</r>
<r><article key="journals/tcs/BorowieckiDP14" mdate="2025-03-03">
<author orcid="0000-0002-5239-6540" pid="19/582">Piotr Borowiecki</author>
<author orcid="0000-0003-4000-4818" pid="d/DDereniowski">Dariusz Dereniowski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Brushing with additional cleaning restrictions.</title>
<pages>76-86</pages>
<year>2014</year>
<volume>557</volume>
<journal>Theor. Comput. Sci.</journal>
<ee type="oa">https://doi.org/10.1016/j.tcs.2014.09.005</ee>
<ee>https://www.wikidata.org/entity/Q62043610</ee>
<url>db/journals/tcs/tcs557.html#BorowieckiDP14</url>
</article>
</r>
<r><proceedings key="conf/waw/2014" mdate="2019-05-14">
<editor pid="16/2406">Anthony Bonato</editor>
<editor pid="c/FRKChung">Fan Chung Graham</editor>
<editor pid="p/PawelPralat">Pawel Pralat</editor>
<title>Algorithms and Models for the Web Graph - 11th International Workshop, WAW 2014, Beijing, China, December 17-18, 2014, Proceedings</title>
<year>2014</year>
<publisher>Springer</publisher>
<series href="db/series/lncs/index.html">Lecture Notes in Computer Science</series>
<volume>8882</volume>
<ee>https://doi.org/10.1007/978-3-319-13123-8</ee>
<isbn>978-3-319-13122-1</isbn>
<booktitle>WAW</booktitle>
<url>db/conf/waw/waw2014.html</url>
</proceedings>
</r>
<r><article publtype="informal" key="journals/corr/KehagiasMP14" mdate="2018-08-13">
<author pid="52/2514">Athanasios Kehagias</author>
<author pid="11/3659">Dieter Mitsche</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>The Role of Visibility in Pursuit / Evasion Games.</title>
<year>2014</year>
<volume>abs/1402.6136</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1402.6136</ee>
<url>db/journals/corr/corr1402.html#KehagiasMP14</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/BonatoGKMPTY14" mdate="2018-08-13">
<author pid="16/2406">Anthony Bonato</author>
<author pid="40/4457">David F. Gleich</author>
<author pid="66/1606-1">Myunghwan Kim 0002</author>
<author pid="11/3659">Dieter Mitsche</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="146/0866">Amanda Tian</author>
<author pid="05/4973">Stephen J. Young</author>
<title>Dimensionality of social networks using motifs and eigenvalues.</title>
<year>2014</year>
<volume>abs/1405.0157</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1405.0157</ee>
<url>db/journals/corr/corr1405.html#BonatoGKMPTY14</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/BonatoLMPP14" mdate="2018-08-13">
<author pid="16/2406">Anthony Bonato</author>
<author pid="156/0089">Marc Lozier</author>
<author pid="11/3659">Dieter Mitsche</author>
<author pid="36/1984">Xavier P&#233;rez-Gim&#233;nez</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>The domination number of on-line social networks and random geometric graphs.</title>
<year>2014</year>
<volume>abs/1412.1189</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1412.1189</ee>
<url>db/journals/corr/corr1412.html#BonatoLMPP14</url>
</article>
</r>
<r><article key="journals/aam/JanssenPW13" mdate="2025-03-03">
<author orcid="0000-0002-0322-7855" pid="j/JCMJanssen">Jeannette C. M. Janssen</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="67/8008">Rory Wilson</author>
<title>Geometric graph properties of the spatial preferred attachment model.</title>
<pages>243-267</pages>
<year>2013</year>
<volume>50</volume>
<journal>Adv. Appl. Math.</journal>
<number>2</number>
<ee>https://doi.org/10.1016/j.aam.2012.09.001</ee>
<url>db/journals/aam/aam50.html#JanssenPW13</url>
</article>
</r>
<r><article key="journals/combinatorics/BonatoGKP13" mdate="2025-12-01">
<author pid="16/2406">Anthony Bonato</author>
<author pid="12/8077">Przemyslaw Gordinowicz</author>
<author pid="35/2244">Bill Kinnersley</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>The Capture Time of the Hypercube.</title>
<pages>24</pages>
<year>2013</year>
<volume>20</volume>
<journal>Electron. J. Comb.</journal>
<number>2</number>
<ee type="oa">https://doi.org/10.37236/2921</ee>
<url>db/journals/combinatorics/combinatorics20.html#BonatoGKP13</url>
</article>
</r>
<r><article key="journals/combinatorics/KinnersleyMP13" mdate="2025-12-01">
<author pid="35/2244">William B. Kinnersley</author>
<author pid="11/3659">Dieter Mitsche</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>A Note on the Acquaintance Time of Random Graphs.</title>
<pages>52</pages>
<year>2013</year>
<volume>20</volume>
<journal>Electron. J. Comb.</journal>
<number>3</number>
<ee type="oa">https://doi.org/10.37236/3357</ee>
<url>db/journals/combinatorics/combinatorics20.html#KinnersleyMP13</url>
</article>
</r>
<r><article key="journals/combinatorics/BollobasMP13" mdate="2025-12-01">
<author pid="66/6039">B&#233;la Bollob&#225;s</author>
<author pid="11/3659">Dieter Mitsche</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Metric Dimension for Random Graphs.</title>
<pages>1</pages>
<year>2013</year>
<volume>20</volume>
<journal>Electron. J. Comb.</journal>
<number>4</number>
<ee type="oa">https://doi.org/10.37236/2639</ee>
<url>db/journals/combinatorics/combinatorics20.html#BollobasMP13</url>
</article>
</r>
<r><article key="journals/cpc/MitscheP13" mdate="2025-03-03">
<author pid="11/3659">Dieter Mitsche</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Revolutionaries and Spies on Random Graphs.</title>
<pages>417-432</pages>
<year>2013</year>
<volume>22</volume>
<journal>Comb. Probab. Comput.</journal>
<number>3</number>
<ee>https://doi.org/10.1017/S0963548313000072</ee>
<url>db/journals/cpc/cpc22.html#MitscheP13</url>
</article>
</r>
<r><article key="journals/im/FriezeHP13" mdate="2025-03-03">
<author pid="f/AlanMFrieze">Alan M. Frieze</author>
<author orcid="0000-0003-3022-9036" pid="60/5324">Paul Horn</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Special Issue on Algorithms and Models for the Web Graph.</title>
<pages>1-2</pages>
<year>2013</year>
<volume>9</volume>
<journal>Internet Math.</journal>
<number>1</number>
<ee>https://doi.org/10.1080/15427951.2012.678140</ee>
<url>db/journals/im/im9.html#FriezeHP13</url>
</article>
</r>
<r><article key="journals/im/HenryP13" mdate="2025-03-03">
<author pid="96/9725">Adam Douglas Henry</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Discovery of Nodal Attributes through a Rank-Based Model of Network Structure.</title>
<pages>33-57</pages>
<year>2013</year>
<volume>9</volume>
<journal>Internet Math.</journal>
<number>1</number>
<ee>https://doi.org/10.1080/15427951.2012.678157</ee>
<url>db/journals/im/im9.html#HenryP13</url>
</article>
</r>
<r><article key="journals/siamdm/BonatoMP13" mdate="2025-03-03">
<author pid="16/2406">Anthony Bonato</author>
<author pid="11/3659">Dieter Mitsche</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Vertex-Pursuit in Random Directed Acyclic Graphs.</title>
<pages>732-756</pages>
<year>2013</year>
<volume>27</volume>
<journal>SIAM J. Discret. Math.</journal>
<number>2</number>
<ee>https://doi.org/10.1137/120866932</ee>
<url>db/journals/siamdm/siamdm27.html#BonatoMP13</url>
</article>
</r>
<r><article key="journals/siamdm/MehrabianMP13" mdate="2025-03-03">
<author pid="88/8395">Abbas Mehrabian</author>
<author pid="11/3659">Dieter Mitsche</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>On the Maximum Density of Graphs with Unique-Path Labelings.</title>
<pages>1228-1233</pages>
<year>2013</year>
<volume>27</volume>
<journal>SIAM J. Discret. Math.</journal>
<number>3</number>
<ee>https://doi.org/10.1137/120898528</ee>
<url>db/journals/siamdm/siamdm27.html#MehrabianMP13</url>
</article>
</r>
<r><article key="journals/siamdm/Pralat13" mdate="2025-03-03">
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Sparse Graphs Are Not Flammable.</title>
<pages>2157-2166</pages>
<year>2013</year>
<volume>27</volume>
<journal>SIAM J. Discret. Math.</journal>
<number>4</number>
<ee>https://doi.org/10.1137/120876113</ee>
<url>db/journals/siamdm/siamdm27.html#Pralat13</url>
</article>
</r>
<r><article key="journals/tcs/KehagiasMP13" mdate="2025-03-03">
<author pid="52/2514">Athanasios Kehagias</author>
<author pid="11/3659">Dieter Mitsche</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Cops and invisible robbers: The cost of drunkenness.</title>
<pages>100-120</pages>
<year>2013</year>
<volume>481</volume>
<journal>Theor. Comput. Sci.</journal>
<ee type="oa">https://doi.org/10.1016/j.tcs.2013.01.032</ee>
<url>db/journals/tcs/tcs481.html#KehagiasMP13</url>
</article>
</r>
<r><inproceedings key="conf/walcom/ClaudeDKLPRSS13" mdate="2025-03-03">
<author pid="94/4051">Francisco Claude</author>
<author pid="d/RezaDorrigiv">Reza Dorrigiv</author>
<author orcid="0000-0003-1404-2212" pid="59/577">Shahin Kamali</author>
<author pid="l/ALopezOrtiz">Alejandro L&#243;pez-Ortiz</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="30/1209">Jazm&#237;n Romero</author>
<author pid="24/979">Alejandro Salinger</author>
<author orcid="0000-0002-2514-9907" pid="68/2814">Diego Seco</author>
<title>Broadcasting in Conflict-Aware Multi-channel Networks.</title>
<pages>158-169</pages>
<year>2013</year>
<booktitle>WALCOM</booktitle>
<ee>https://doi.org/10.1007/978-3-642-36065-7_16</ee>
<crossref>conf/walcom/2013</crossref>
<url>db/conf/walcom/walcom2013.html#ClaudeDKLPRSS13</url>
</inproceedings>
</r>
<r><inproceedings key="conf/waw/JanssenPW13" mdate="2025-03-03">
<author orcid="0000-0002-0322-7855" pid="j/JCMJanssen">Jeannette C. M. Janssen</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="67/8008">Rory Wilson</author>
<title>Asymmetric Distribution of Nodes in the Spatial Preferred Attachment Model.</title>
<pages>1-13</pages>
<year>2013</year>
<booktitle>WAW</booktitle>
<ee>https://doi.org/10.1007/978-3-319-03536-9_1</ee>
<crossref>conf/waw/2013</crossref>
<url>db/conf/waw/waw2013.html#JanssenPW13</url>
</inproceedings>
</r>
<r><proceedings key="conf/waw/2013" mdate="2019-05-14">
<editor pid="16/2406">Anthony Bonato</editor>
<editor pid="74/838">Michael Mitzenmacher</editor>
<editor pid="p/PawelPralat">Pawel Pralat</editor>
<title>Algorithms and Models for the Web Graph - 10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings</title>
<year>2013</year>
<publisher>Springer</publisher>
<series href="db/series/lncs/index.html">Lecture Notes in Computer Science</series>
<volume>8305</volume>
<ee>https://doi.org/10.1007/978-3-319-03536-9</ee>
<isbn>978-3-319-03535-2</isbn>
<booktitle>WAW</booktitle>
<url>db/conf/waw/waw2013.html</url>
</proceedings>
</r>
<r><article publtype="informal" key="journals/corr/BonatoFGHKMPS13" mdate="2018-08-13">
<author pid="16/2406">Anthony Bonato</author>
<author pid="21/5822">Stephen Finbow</author>
<author pid="12/8077">Przemyslaw Gordinowicz</author>
<author pid="09/478">Ali Haidar</author>
<author pid="35/2244">William B. Kinnersley</author>
<author pid="11/3659">Dieter Mitsche</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="08/4220">Ladislav Stacho</author>
<title>The robber strikes back.</title>
<year>2013</year>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1308.2843</ee>
<volume>abs/1308.2843</volume>
<url>db/journals/corr/corr1308.html#BonatoFGHKMPS13</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/BonatoKGP13" mdate="2018-08-13">
<author pid="16/2406">Anthony Bonato</author>
<author pid="35/2244">William B. Kinnersley</author>
<author pid="12/8077">Przemyslaw Gordinowicz</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>The capture time of the hypercube.</title>
<year>2013</year>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1308.3354</ee>
<volume>abs/1308.3354</volume>
<url>db/journals/corr/corr1308.html#BonatoKGP13</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/BonatoHHPW13" mdate="2018-08-13">
<author pid="16/2406">Anthony Bonato</author>
<author pid="88/6348">Noor Hadi</author>
<author pid="60/5324">Paul Horn</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="75/4229">Changping Wang</author>
<title>Models of on-line social networks.</title>
<year>2013</year>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1308.3388</ee>
<volume>abs/1308.3388</volume>
<url>db/journals/corr/corr1308.html#BonatoHHPW13</url>
</article>
</r>
<r><article key="journals/arscom/Pralat12" mdate="2013-03-12">
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>A Note On Off-Diagonal Small On-Line Ramsey Numbers For Paths.</title>
<pages>295-306</pages>
<year>2012</year>
<volume>107</volume>
<journal>Ars Comb.</journal>
<url>db/journals/arscom/arscom107.html#Pralat12</url>
</article>
</r>
<r><article key="journals/dm/BonatoKP12" mdate="2025-03-03">
<author pid="16/2406">Anthony Bonato</author>
<author pid="74/381">Graeme Kemkes</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Almost all cop-win graphs contain a universal vertex.</title>
<pages>1652-1657</pages>
<year>2012</year>
<volume>312</volume>
<journal>Discret. Math.</journal>
<number>10</number>
<ee type="oa">https://doi.org/10.1016/j.disc.2012.02.018</ee>
<url>db/journals/dm/dm312.html#BonatoKP12</url>
</article>
</r>
<r><article key="journals/dmgt/GordinowiczP12" mdate="2025-03-03">
<author orcid="0000-0001-9843-3928" pid="12/8077">Przemyslaw Gordinowicz</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>The first player wins the one-colour triangle avoidance game on 16 vertices.</title>
<pages>181-185</pages>
<year>2012</year>
<volume>32</volume>
<journal>Discuss. Math. Graph Theory</journal>
<number>1</number>
<ee type="oa">https://doi.org/10.7151/dmgt.1596</ee>
<url>db/journals/dmgt/dmgt32.html#GordinowiczP12</url>
</article>
</r>
<r><article key="journals/im/BonatoJP12" mdate="2025-03-03">
<author pid="16/2406">Anthony Bonato</author>
<author orcid="0000-0002-0322-7855" pid="j/JCMJanssen">Jeannette C. M. Janssen</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Geometric Protean Graphs.</title>
<pages>2-28</pages>
<year>2012</year>
<volume>8</volume>
<journal>Internet Math.</journal>
<number>1-2</number>
<ee>https://doi.org/10.1080/15427951.2012.625246</ee>
<url>db/journals/im/im8.html#BonatoJP12</url>
</article>
</r>
<r><article key="journals/siamdm/FominGP12" mdate="2025-03-03">
<author orcid="0000-0003-1955-4612" pid="f/FedorVFomin">Fedor V. Fomin</author>
<author orcid="0000-0002-2619-2990" pid="06/6306">Petr A. Golovach</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Cops and Robber with Constraints.</title>
<pages>571-590</pages>
<year>2012</year>
<volume>26</volume>
<journal>SIAM J. Discret. Math.</journal>
<number>2</number>
<ee>https://doi.org/10.1137/110837759</ee>
<ee>https://www.wikidata.org/entity/Q60488471</ee>
<url>db/journals/siamdm/siamdm26.html#FominGP12</url>
</article>
</r>
<r><article key="journals/tcs/BonatoMP12" mdate="2025-03-03">
<author pid="16/2406">Anthony Bonato</author>
<author pid="68/6403">Margaret-Ellen Messinger</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Fighting constrained fires in graphs.</title>
<pages>11-22</pages>
<year>2012</year>
<volume>434</volume>
<journal>Theor. Comput. Sci.</journal>
<ee type="oa">https://doi.org/10.1016/j.tcs.2012.01.041</ee>
<url>db/journals/tcs/tcs434.html#BonatoMP12</url>
</article>
</r>
<r><article key="journals/tcs/GordinowiczNP12" mdate="2025-03-03">
<author orcid="0000-0001-9843-3928" pid="12/8077">Przemyslaw Gordinowicz</author>
<author orcid="0000-0002-4434-672X" pid="40/6020">Richard J. Nowakowski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>polish - Let us play the cleaning game.</title>
<pages>123-132</pages>
<year>2012</year>
<volume>463</volume>
<journal>Theor. Comput. Sci.</journal>
<ee type="oa">https://doi.org/10.1016/j.tcs.2012.05.014</ee>
<url>db/journals/tcs/tcs463.html#GordinowiczNP12</url>
</article>
</r>
<r><article key="journals/tcs/KehagiasP12" mdate="2025-03-03">
<author pid="52/2514">Athanasios Kehagias</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Some remarks on cops and drunk robbers.</title>
<pages>133-147</pages>
<year>2012</year>
<volume>463</volume>
<journal>Theor. Comput. Sci.</journal>
<ee type="oa">https://doi.org/10.1016/j.tcs.2012.08.016</ee>
<url>db/journals/tcs/tcs463.html#KehagiasP12</url>
</article>
</r>
<r><inproceedings key="conf/tamc/BonatoMP12" mdate="2025-03-03">
<author pid="16/2406">Anthony Bonato</author>
<author pid="11/3659">Dieter Mitsche</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Vertex-Pursuit in Hierarchical Social Networks.</title>
<pages>50-60</pages>
<year>2012</year>
<booktitle>TAMC</booktitle>
<ee>https://doi.org/10.1007/978-3-642-29952-0_11</ee>
<crossref>conf/tamc/2012</crossref>
<url>db/conf/tamc/tamc2012.html#BonatoMP12</url>
</inproceedings>
</r>
<r><inproceedings key="conf/waw/CooperFP12" mdate="2025-03-03">
<author pid="41/126">Colin Cooper</author>
<author pid="f/AlanMFrieze">Alan M. Frieze</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Some Typical Properties of the Spatial Preferred Attachment Model.</title>
<pages>29-40</pages>
<year>2012</year>
<booktitle>WAW</booktitle>
<ee>https://doi.org/10.1007/978-3-642-30541-2_3</ee>
<crossref>conf/waw/2012</crossref>
<url>db/conf/waw/waw2012.html#CooperFP12</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-1201-0946" mdate="2018-08-13">
<author pid="52/2514">Athanasios Kehagias</author>
<author pid="11/3659">Dieter Mitsche</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>Cops and Invisible Robbers: the Cost of Drunkenness</title>
<ee type="oa">http://arxiv.org/abs/1201.0946</ee>
<year>2012</year>
<journal>CoRR</journal>
<volume>abs/1201.0946</volume>
<url>db/journals/corr/corr1201.html#abs-1201-0946</url>
</article>
</r>
<r><article key="journals/combinatorica/PralatVW11" mdate="2025-03-03">
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="v/JacquesVerstraete">Jacques Verstra&#235;te</author>
<author pid="w/NicholasCWormald">Nicholas C. Wormald</author>
<title>On the threshold for k-regular subgraphs of random graphs.</title>
<pages>565-581</pages>
<year>2011</year>
<volume>31</volume>
<journal>Comb.</journal>
<number>5</number>
<ee>https://doi.org/10.1007/s00493-011-2545-3</ee>
<url>db/journals/combinatorica/combinatorica31.html#PralatVW11</url>
</article>
</r>
<r><article key="journals/cpc/AlonP11" mdate="2025-03-03">
<author pid="a/NAlon">Noga Alon</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Modular Orientations of Random and Quasi-Random Regular Graphs.</title>
<pages>321-329</pages>
<year>2011</year>
<volume>20</volume>
<journal>Comb. Probab. Comput.</journal>
<number>3</number>
<ee>https://doi.org/10.1017/S0963548310000544</ee>
<url>db/journals/cpc/cpc20.html#AlonP11</url>
</article>
</r>
<r><article key="journals/dm/Pralat11" mdate="2025-03-03">
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Connectivity threshold and recovery time in rank-based models for complex networks.</title>
<pages>932-939</pages>
<year>2011</year>
<volume>311</volume>
<journal>Discret. Math.</journal>
<number>12</number>
<ee type="oa">https://doi.org/10.1016/j.disc.2011.02.031</ee>
<url>db/journals/dm/dm311.html#Pralat11</url>
</article>
</r>
<r><article key="journals/gc/MessingerNP11" mdate="2025-03-03">
<author pid="68/6403">Margaret-Ellen Messinger</author>
<author orcid="0000-0002-4434-672X" pid="40/6020">Richard J. Nowakowski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Cleaning with Brooms.</title>
<pages>251-267</pages>
<year>2011</year>
<volume>27</volume>
<journal>Graphs Comb.</journal>
<number>2</number>
<ee>https://doi.org/10.1007/s00373-010-0965-2</ee>
<url>db/journals/gc/gc27.html#MessingerNP11</url>
</article>
</r>
<r><article key="journals/gc/Pralat11" mdate="2025-03-03">
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Cleaning Random <i>d</i>-Regular Graphs with Brooms.</title>
<pages>567-584</pages>
<year>2011</year>
<volume>27</volume>
<journal>Graphs Comb.</journal>
<number>4</number>
<ee>https://doi.org/10.1007/s00373-010-0986-x</ee>
<url>db/journals/gc/gc27.html#Pralat11</url>
</article>
</r>
<r><article key="journals/jgt/BenjaminiHOPW11" mdate="2025-03-03">
<author pid="77/3851">Itai Benjamini</author>
<author orcid="0000-0002-7581-1583" pid="28/769">Carlos Hoppen</author>
<author pid="31/2429">Eran Ofek</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="w/NicholasCWormald">Nicholas C. Wormald</author>
<title>Geodesics and almost geodesic cycles in random regular graphs.</title>
<pages>115-136</pages>
<year>2011</year>
<volume>66</volume>
<journal>J. Graph Theory</journal>
<number>2</number>
<ee>https://doi.org/10.1002/jgt.20496</ee>
<url>db/journals/jgt/jgt66.html#BenjaminiHOPW11</url>
</article>
</r>
<r><article key="journals/rsa/CooperP11" mdate="2025-03-03">
<author pid="41/126">Colin Cooper</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Scale-free graphs of increasing degree.</title>
<pages>396-421</pages>
<year>2011</year>
<volume>38</volume>
<journal>Random Struct. Algorithms</journal>
<number>4</number>
<ee>https://doi.org/10.1002/rsa.20318</ee>
<url>db/journals/rsa/rsa38.html#CooperP11</url>
</article>
</r>
<r><article key="journals/tcs/PralatW11" mdate="2025-03-03">
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="75/4229">Changping Wang</author>
<title>An edge deletion model for complex networks.</title>
<pages>5111-5120</pages>
<year>2011</year>
<volume>412</volume>
<journal>Theor. Comput. Sci.</journal>
<number>39</number>
<ee type="oa">https://doi.org/10.1016/j.tcs.2011.05.016</ee>
<url>db/journals/tcs/tcs412.html#PralatW11</url>
</article>
</r>
<r><inproceedings key="conf/waw/HenryP11" mdate="2025-03-03">
<author pid="96/9725">Adam Douglas Henry</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Rank-Based Models of Network Structure and the Discovery of Content.</title>
<pages>62-73</pages>
<year>2011</year>
<booktitle>WAW</booktitle>
<ee>https://doi.org/10.1007/978-3-642-21286-4_6</ee>
<crossref>conf/waw/2011</crossref>
<url>db/conf/waw/waw2011.html#HenryP11</url>
</inproceedings>
</r>
<r><proceedings key="conf/waw/2011" mdate="2019-05-14">
<editor pid="f/AlanMFrieze">Alan M. Frieze</editor>
<editor pid="60/5324">Paul Horn</editor>
<editor pid="p/PawelPralat">Pawel Pralat</editor>
<title>Algorithms and Models for the Web Graph - 8th International Workshop, WAW 2011, Atlanta, GA, USA, May 27-29, 2011. Proceedings</title>
<volume>6732</volume>
<year>2011</year>
<ee>https://doi.org/10.1007/978-3-642-21286-4</ee>
<isbn>978-3-642-21285-7</isbn>
<booktitle>WAW</booktitle>
<series href="db/series/lncs/index.html">Lecture Notes in Computer Science</series>
<publisher>Springer</publisher>
<url>db/conf/waw/waw2011.html</url>
</proceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-1106-2414" mdate="2018-08-13">
<author pid="52/2514">Athanasios Kehagias</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>Some remarks on cops and drunk robbers</title>
<ee type="oa">http://arxiv.org/abs/1106.2414</ee>
<year>2011</year>
<journal>CoRR</journal>
<volume>abs/1106.2414</volume>
<url>db/journals/corr/corr1106.html#abs-1106-2414</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1111-0207" mdate="2018-08-13">
<author pid="16/2406">Anthony Bonato</author>
<author pid="j/JCMJanssen">Jeannette C. M. Janssen</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>Geometric protean graphs</title>
<ee type="oa">http://arxiv.org/abs/1111.0207</ee>
<year>2011</year>
<journal>CoRR</journal>
<volume>abs/1111.0207</volume>
<url>db/journals/corr/corr1111.html#abs-1111-0207</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1111-0508" mdate="2018-08-13">
<author pid="j/JCMJanssen">Jeannette C. M. Janssen</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="67/8008">Rory Wilson</author>
<title>Geometric Graph Properties of the Spatial Preferred Attachment model</title>
<ee type="oa">http://arxiv.org/abs/1111.0508</ee>
<year>2011</year>
<journal>CoRR</journal>
<volume>abs/1111.0508</volume>
<url>db/journals/corr/corr1111.html#abs-1111-0508</url>
</article>
</r>
<r><article key="journals/ajc/Pralat10" mdate="2020-03-11">
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>When does a random graph have constant cop number?</title>
<pages>285-296</pages>
<year>2010</year>
<volume>46</volume>
<journal>Australas. J Comb.</journal>
<ee type="oa">http://ajc.maths.uq.edu.au/pdf/46/ajc_v46_p285.pdf</ee>
<url>db/journals/ajc/ajc46.html#Pralat10</url>
</article>
</r>
<r><article key="journals/cdm/BonatoGP10" mdate="2025-04-01">
<author pid="16/2406">Anthony Bonato</author>
<author pid="12/8077">Przemyslaw Gordinowicz</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>Bounds and constructions for n-e.c. tournaments.</title>
<year>2010</year>
<volume>5</volume>
<journal>Contributions Discret. Math.</journal>
<number>2</number>
<ee type="oa">https://doi.org/10.11575/cdm.v5i2.62061</ee>
<url>db/journals/cdm/cdm5.html#BonatoGP10</url>
</article>
</r>
<r><article key="journals/dam/GaspersMNP10" mdate="2025-03-03">
<author pid="33/5862">Serge Gaspers</author>
<author pid="68/6403">Margaret-Ellen Messinger</author>
<author orcid="0000-0002-4434-672X" pid="40/6020">Richard J. Nowakowski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Parallel cleaning of a network with brushes.</title>
<pages>467-478</pages>
<year>2010</year>
<volume>158</volume>
<journal>Discret. Appl. Math.</journal>
<number>5</number>
<ee type="oa">https://doi.org/10.1016/j.dam.2009.11.003</ee>
<url>db/journals/dam/dam158.html#GaspersMNP10</url>
</article>
</r>
<r><article key="journals/jdwm/AngelovaLMP10" mdate="2025-03-03">
<author pid="a/RalitsaAngelova">Ralitsa Angelova</author>
<author pid="04/7184">Marek Lipczak</author>
<author orcid="0000-0001-5549-4675" pid="m/EvangelosEMilios">Evangelos E. Milios</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Investigating the Properties of a Social Bookmarking and Tagging Network.</title>
<pages>1-19</pages>
<year>2010</year>
<volume>6</volume>
<journal>Int. J. Data Warehous. Min.</journal>
<number>1</number>
<ee>https://doi.org/10.4018/jdwm.2010090801</ee>
<url>db/journals/jdwm/ijdwm6.html#AngelovaLMP10</url>
</article>
</r>
<r><article key="journals/rsa/LuczakP10" mdate="2025-03-03">
<author orcid="0000-0002-3517-9034" pid="35/5622">Tomasz Luczak 0001</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Chasing robbers on random graphs: Zigzag theorem.</title>
<pages>516-524</pages>
<year>2010</year>
<volume>37</volume>
<journal>Random Struct. Algorithms</journal>
<number>4</number>
<ee>https://doi.org/10.1002/rsa.20338</ee>
<url>db/journals/rsa/rsa37.html#LuczakP10</url>
</article>
</r>
<r><article key="journals/siamdm/JanssenP10" mdate="2025-03-03">
<author orcid="0000-0002-0322-7855" pid="j/JCMJanssen">Jeannette C. M. Janssen</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Rank-Based Attachment Leads to Power Law Graphs.</title>
<pages>420-440</pages>
<year>2010</year>
<volume>24</volume>
<journal>SIAM J. Discret. Math.</journal>
<number>2</number>
<ee>https://doi.org/10.1137/080716967</ee>
<url>db/journals/siamdm/siamdm24.html#JanssenP10</url>
</article>
</r>
<r><article key="journals/tcs/BonatoCP10" mdate="2025-03-03">
<author pid="16/2406">Anthony Bonato</author>
<author pid="14/5821">Ehsan Chiniforooshan</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Cops and Robbers from a distance.</title>
<pages>3834-3844</pages>
<year>2010</year>
<volume>411</volume>
<journal>Theor. Comput. Sci.</journal>
<number>43</number>
<ee type="oa">https://doi.org/10.1016/j.tcs.2010.07.003</ee>
<url>db/journals/tcs/tcs411.html#BonatoCP10</url>
</article>
</r>
<r><inproceedings key="conf/ht/BonatoJP10" mdate="2025-03-03">
<author pid="16/2406">Anthony Bonato</author>
<author orcid="0000-0002-0322-7855" pid="j/JCMJanssen">Jeannette C. M. Janssen</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>A geometric model for on-line social networks.</title>
<pages>4:1-4:2</pages>
<year>2010</year>
<booktitle>MSM</booktitle>
<ee>https://doi.org/10.1145/1835980.1835984</ee>
<crossref>conf/ht/2010msm</crossref>
<url>db/conf/ht/msm2010.html#BonatoJP10</url>
</inproceedings>
</r>
<r><inproceedings key="conf/sac/JanssenPW10" mdate="2025-03-03">
<author orcid="0000-0002-0322-7855" pid="j/JCMJanssen">Jeannette C. M. Janssen</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="67/8008">Rory Wilson</author>
<title>Estimating node similarity from co-citation in a spatial graph model.</title>
<pages>1329-1333</pages>
<year>2010</year>
<booktitle>SAC</booktitle>
<ee>https://doi.org/10.1145/1774088.1774372</ee>
<crossref>conf/sac/2010</crossref>
<url>db/conf/sac/sac2010.html#JanssenPW10</url>
</inproceedings>
</r>
<r><inproceedings key="conf/waw/BonatoJP10" mdate="2025-03-03">
<author pid="16/2406">Anthony Bonato</author>
<author orcid="0000-0002-0322-7855" pid="j/JCMJanssen">Jeannette C. M. Janssen</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>The Geometric Protean Model for On-Line Social Networks.</title>
<pages>110-121</pages>
<year>2010</year>
<booktitle>WAW</booktitle>
<ee>https://doi.org/10.1007/978-3-642-18009-5_11</ee>
<crossref>conf/waw/2010</crossref>
<url>db/conf/waw/waw2010.html#BonatoJP10</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wosn/BonatoJP10" mdate="2017-02-02">
<author pid="16/2406">Anthony Bonato</author>
<author pid="j/JCMJanssen">Jeannette C. M. Janssen</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>A Geometric Model for On-line Social Networks.</title>
<year>2010</year>
<booktitle>WOSN</booktitle>
<ee>https://www.usenix.org/conference/wosn-2010/geometric-model-line-social-networks</ee>
<crossref>conf/wosn/2010</crossref>
<url>db/conf/wosn/wosn2010.html#BonatoJP10</url>
</inproceedings>
</r>
<r><article key="journals/ajc/Pralat09" mdate="2020-03-11">
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>Cleaning random graphs with brushes.</title>
<pages>237-252</pages>
<year>2009</year>
<volume>43</volume>
<journal>Australas. J Comb.</journal>
<ee type="oa">http://ajc.maths.uq.edu.au/pdf/43/ajc_v43_p237.pdf</ee>
<url>db/journals/ajc/ajc43.html#Pralat09</url>
</article>
</r>
<r><article key="journals/dm/BonatoP09" mdate="2025-03-03">
<author pid="16/2406">Anthony Bonato</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>The good, the bad, and the great: Homomorphisms and cores of random graphs.</title>
<pages>5535-5539</pages>
<year>2009</year>
<volume>309</volume>
<journal>Discret. Math.</journal>
<number>18</number>
<ee type="oa">https://doi.org/10.1016/j.disc.2008.03.026</ee>
<url>db/journals/dm/dm309.html#BonatoP09</url>
</article>
</r>
<r><article key="journals/im/BonatoHHPW09" mdate="2025-03-03">
<author pid="16/2406">Anthony Bonato</author>
<author pid="88/6348">Noor Hadi</author>
<author orcid="0000-0003-3022-9036" pid="60/5324">Paul Horn</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="75/4229">Changping Wang</author>
<title>Models of Online Social Networks.</title>
<pages>285-313</pages>
<year>2009</year>
<volume>6</volume>
<journal>Internet Math.</journal>
<number>3</number>
<ee>https://doi.org/10.1080/15427951.2009.10390642</ee>
<url>db/journals/im/im6.html#BonatoHHPW09</url>
</article>
</r>
<r><article key="journals/ipl/GaspersMNP09" mdate="2025-03-03">
<author pid="33/5862">Serge Gaspers</author>
<author pid="68/6403">Margaret-Ellen Messinger</author>
<author orcid="0000-0002-4434-672X" pid="40/6020">Richard J. Nowakowski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Clean the graph before you draw it!</title>
<pages>463-467</pages>
<year>2009</year>
<volume>109</volume>
<journal>Inf. Process. Lett.</journal>
<number>10</number>
<ee>https://doi.org/10.1016/j.ipl.2009.01.003</ee>
<url>db/journals/ipl/ipl109.html#GaspersMNP09</url>
</article>
</r>
<r><article key="journals/tcs/JanssenP09" mdate="2025-03-03">
<author orcid="0000-0002-0322-7855" pid="j/JCMJanssen">Jeannette C. M. Janssen</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Protean graphs with a variety of ranking schemes.</title>
<pages>5491-5504</pages>
<year>2009</year>
<volume>410</volume>
<journal>Theor. Comput. Sci.</journal>
<number>52</number>
<ee type="oa">https://doi.org/10.1016/j.tcs.2009.05.009</ee>
<url>db/journals/tcs/tcs410.html#JanssenP09</url>
</article>
</r>
<r><inproceedings key="conf/waw/BonatoHHPW09" mdate="2025-03-03">
<author pid="16/2406">Anthony Bonato</author>
<author pid="88/6348">Noor Hadi</author>
<author pid="60/5324">Paul Horn</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="75/4229">Changping Wang</author>
<title>A Dynamic Model for On-Line Social Networks.</title>
<pages>127-142</pages>
<year>2009</year>
<booktitle>WAW</booktitle>
<ee>https://doi.org/10.1007/978-3-540-95995-3_11</ee>
<crossref>conf/waw/2009</crossref>
<url>db/conf/waw/waw2009.html#BonatoHHPW09</url>
</inproceedings>
</r>
<r><article key="journals/ajc/Pralat08" mdate="2020-03-11">
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>A note on small on-line Ramsey numbers for paths and their generalization.</title>
<pages>27-36</pages>
<year>2008</year>
<volume>40</volume>
<journal>Australas. J Comb.</journal>
<ee type="oa">http://ajc.maths.uq.edu.au/pdf/40/ajc_v40_p027.pdf</ee>
<url>db/journals/ajc/ajc40.html#Pralat08</url>
</article>
</r>
<r><article key="journals/combinatorics/Pralat08" mdate="2020-07-09">
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>R(3, 4)=17.</title>
<year>2008</year>
<volume>15</volume>
<journal>Electron. J. Comb.</journal>
<number>1</number>
<ee type="oa">http://www.combinatorics.org/Volume_15/Abstracts/v15i1r67.html</ee>
<url>db/journals/combinatorics/combinatorics15.html#Pralat08</url>
</article>
</r>
<r><article key="journals/dm/Pralat08" mdate="2025-03-03">
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>The diameter of protean graphs.</title>
<pages>3399-3406</pages>
<year>2008</year>
<volume>308</volume>
<journal>Discret. Math.</journal>
<number>15</number>
<ee type="oa">https://doi.org/10.1016/j.disc.2007.06.025</ee>
<url>db/journals/dm/dm308.html#Pralat08</url>
</article>
</r>
<r><article key="journals/dmtcs/GrytczukKP08" mdate="2023-01-24">
<author pid="74/2404">Jaroslaw Grytczuk</author>
<author pid="k/HAKierstead">Hal A. Kierstead</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>On-line Ramsey Numbers for Paths and Stars.</title>
<year>2008</year>
<volume>10</volume>
<journal>Discret. Math. Theor. Comput. Sci.</journal>
<number>3</number>
<ee type="oa">https://doi.org/10.46298/dmtcs.427</ee>
<url>db/journals/dmtcs/dmtcs10.html#GrytczukKP08</url>
</article>
</r>
<r><article key="journals/im/AielloBCJP08" mdate="2025-03-03">
<author pid="a/WilliamAiello">William Aiello</author>
<author pid="16/2406">Anthony Bonato</author>
<author pid="41/126">Colin Cooper</author>
<author orcid="0000-0002-0322-7855" pid="j/JCMJanssen">Jeannette C. M. Janssen</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>A Spatial Web Graph Model with Local Influence Regions.</title>
<pages>175-196</pages>
<year>2008</year>
<volume>5</volume>
<journal>Internet Math.</journal>
<number>1</number>
<ee>https://doi.org/10.1080/15427951.2008.10129305</ee>
<url>db/journals/im/im5.html#AielloBCJP08</url>
</article>
</r>
<r><article key="journals/siamdm/AlonPW08" mdate="2025-03-03">
<author pid="a/NAlon">Noga Alon</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="w/NicholasCWormald">Nicholas C. Wormald</author>
<title>Cleaning Regular Graphs with Brushes.</title>
<pages>233-250</pages>
<year>2008</year>
<volume>23</volume>
<journal>SIAM J. Discret. Math.</journal>
<number>1</number>
<ee>https://doi.org/10.1137/070703053</ee>
<url>db/journals/siamdm/siamdm23.html#AlonPW08</url>
</article>
</r>
<r><article key="journals/tcs/MessingerNP08" mdate="2025-03-03">
<author pid="68/6403">Margaret-Ellen Messinger</author>
<author orcid="0000-0002-4434-672X" pid="40/6020">Richard J. Nowakowski</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Cleaning a network with brushes.</title>
<pages>191-205</pages>
<year>2008</year>
<volume>399</volume>
<journal>Theor. Comput. Sci.</journal>
<number>3</number>
<ee type="oa">https://doi.org/10.1016/j.tcs.2008.02.037</ee>
<url>db/journals/tcs/tcs399.html#MessingerNP08</url>
</article>
</r>
<r><inproceedings key="conf/cocoa/Pralat08" mdate="2025-03-03">
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Protean Graphs with a Variety of Ranking Schemes.</title>
<pages>149-159</pages>
<year>2008</year>
<booktitle>COCOA</booktitle>
<ee>https://doi.org/10.1007/978-3-540-85097-7_14</ee>
<crossref>conf/cocoa/2008</crossref>
<url>db/conf/cocoa/cocoa2008.html#Pralat08</url>
</inproceedings>
</r>
<r><article key="journals/im/PralatW07" mdate="2025-03-03">
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="w/NicholasCWormald">Nicholas C. Wormald</author>
<title>Growing Protean Graphs.</title>
<pages>1-16</pages>
<year>2007</year>
<volume>4</volume>
<journal>Internet Math.</journal>
<number>1</number>
<ee>https://doi.org/10.1080/15427951.2007.10129135</ee>
<url>db/journals/im/im4.html#PralatW07</url>
</article>
</r>
<r><article key="journals/im/BonatoPW07" mdate="2025-03-03">
<author pid="16/2406">Anthony Bonato</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author pid="75/4229">Changping Wang</author>
<title>Pursuit-Evasion in Models of Complex Networks.</title>
<pages>419-436</pages>
<year>2007</year>
<volume>4</volume>
<journal>Internet Math.</journal>
<number>4</number>
<ee>https://doi.org/10.1080/15427951.2007.10129149</ee>
<url>db/journals/im/im4.html#BonatoPW07</url>
</article>
</r>
<r><inproceedings key="conf/caan/MessingerPNW07" mdate="2025-03-03">
<author pid="68/6403">Margaret-Ellen Messinger</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<author orcid="0000-0002-4434-672X" pid="40/6020">Richard J. Nowakowski</author>
<author pid="w/NicholasCWormald">Nicholas C. Wormald</author>
<title>Cleaning Random <i>d</i>-Regular Graphs with Brushes Using a Degree-Greedy Algorithm.</title>
<pages>13-26</pages>
<year>2007</year>
<crossref>conf/caan/2007</crossref>
<booktitle>CAAN</booktitle>
<ee>https://doi.org/10.1007/978-3-540-77294-1_4</ee>
<url>db/conf/caan/caan2007.html#MessingerPNW07</url>
</inproceedings>
</r>
<r><inproceedings key="conf/caan/BonatoPW07" mdate="2017-05-21">
<author pid="16/2406">Anthony Bonato</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<author pid="75/4229">Changping Wang</author>
<title>Vertex Pursuit Games in Stochastic Network Models.</title>
<pages>46-56</pages>
<year>2007</year>
<crossref>conf/caan/2007</crossref>
<booktitle>CAAN</booktitle>
<ee>https://doi.org/10.1007/978-3-540-77294-1_6</ee>
<url>db/conf/caan/caan2007.html#BonatoPW07</url>
</inproceedings>
</r>
<r><inproceedings key="conf/lcn/DorrigivLP07" mdate="2023-03-24">
<author pid="d/RezaDorrigiv">Reza Dorrigiv</author>
<author pid="l/ALopezOrtiz">Alejandro L&#243;pez-Ortiz</author>
<author pid="p/PawelPralat">Pawel Pralat</author>
<title>Search Algorithms for Unstructured Peer-to-Peer Networks.</title>
<pages>343-352</pages>
<year>2007</year>
<crossref>conf/lcn/2007</crossref>
<booktitle>LCN</booktitle>
<ee>https://doi.org/10.1109/LCN.2007.65</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/LCN.2007.65</ee>
<url>db/conf/lcn/lcn2007.html#DorrigivLP07</url>
</inproceedings>
</r>
<r><inproceedings key="conf/waw/AielloBCJP07" mdate="2025-03-03">
<author pid="a/WilliamAiello">William Aiello</author>
<author pid="16/2406">Anthony Bonato</author>
<author pid="41/126">Colin Cooper</author>
<author orcid="0000-0002-0322-7855" pid="j/JCMJanssen">Jeannette C. M. Janssen</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>A Spatial Web Graph Model with Local Influence Regions.</title>
<pages>96-107</pages>
<year>2007</year>
<crossref>conf/waw/2007</crossref>
<booktitle>WAW</booktitle>
<ee>https://doi.org/10.1007/978-3-540-77004-6_8</ee>
<url>db/conf/waw/waw2007.html#AielloBCJP07</url>
</inproceedings>
</r>
<r><proceedings key="conf/caan/2007" mdate="2019-05-14">
<editor pid="j/JCMJanssen">Jeannette C. M. Janssen</editor>
<editor pid="p/PawelPralat">Pawel Pralat</editor>
<title>Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007. Revised Papers</title>
<booktitle>CAAN</booktitle>
<series href="db/series/lncs/index.html">Lecture Notes in Computer Science</series>
<volume>4852</volume>
<publisher>Springer</publisher>
<year>2007</year>
<isbn>978-3-540-77293-4</isbn>
<ee>https://doi.org/10.1007/978-3-540-77294-1</ee>
<url>db/conf/caan/caan2007.html</url>
</proceedings>
</r>
<r><article key="journals/im/LuczakP06" mdate="2025-03-03">
<author orcid="0000-0002-3517-9034" pid="35/5622">Tomasz Luczak 0001</author>
<author orcid="0000-0001-9176-8493" pid="p/PawelPralat">Pawel Pralat</author>
<title>Protean Graphs.</title>
<year>2006</year>
<volume>3</volume>
<journal>Internet Math.</journal>
<number>1</number>
<url>db/journals/im/im3.html#LuczakP06</url>
<ee>https://doi.org/10.1080/15427951.2006.10129118</ee>
<pages>21-40</pages>
</article>
</r>
<coauthors n="169" nc="4">
<co c="0"><na f="a/Aiello:William" pid="a/WilliamAiello">William Aiello</na></co>
<co c="0"><na f="a/Alon:Noga" pid="a/NAlon">Noga Alon</na></co>
<co c="0"><na f="a/Angelova:Ralitsa" pid="a/RalitsaAngelova">Ralitsa Angelova</na></co>
<co c="0"><na f="a/Antelmi:Alessia" pid="173/0709">Alessia Antelmi</na></co>
<co c="0"><na f="a/Arnosti:Nick" pid="138/8057">Nick Arnosti</na></co>
<co c="0"><na f="a/Avrachenkov:Konstantin" pid="a/KonstantinAvrachenkov">Konstantin Avrachenkov</na></co>
<co c="2"><na f="b/Babaoglu:Ceni" pid="185/2896">Ceni Babaoglu</na></co>
<co c="0"><na f="b/Bal:Deepak" pid="59/3284">Deepak Bal</na></co>
<co c="0"><na f="b/Barrett:Jordan" pid="232/2008">Jordan Barrett</na></co>
<co c="0"><na f="b/Behague:Natalie_C=" pid="219/8674">Natalie C. Behague</na></co>
<co c="2" n="2"><na f="b/Bener:Ayse_Basar" pid="55/2997">Ayse Basar Bener</na><na>Ayse Bener</na></co>
<co c="0"><na f="b/Benjamini:Itai" pid="77/3851">Itai Benjamini</na></co>
<co c="0"><na f="b/Bennett:Patrick" pid="119/4799">Patrick Bennett</na></co>
<co c="0"><na f="b/Betlen:Andrei" pid="325/6584">Andrei Betlen</na></co>
<co c="0"><na f="b/Bloznelis:Mindaugas" pid="28/4513">Mindaugas Bloznelis</na></co>
<co c="0"><na f="b/Bollob=aacute=s:B=eacute=la" pid="66/6039">B&#233;la Bollob&#225;s</na></co>
<co c="0"><na f="b/Bonato:Anthony" pid="16/2406">Anthony Bonato</na></co>
<co c="0"><na f="b/Borowiecki:Piotr" pid="19/582">Piotr Borowiecki</na></co>
<co c="0"><na f="b/Br=oacute=dka:Piotr" pid="41/7376">Piotr Br&#243;dka</na></co>
<co c="0"><na f="b/Brown:Jason_I=" pid="68/697">Jason I. Brown</na></co>
<co c="0"><na f="b/Bryant:Darryn_E=" pid="b/DarrynEBryant">Darryn E. Bryant</na></co>
<co c="0"><na f="c/Chiniforooshan:Ehsan" pid="14/5821">Ehsan Chiniforooshan</na></co>
<co c="0"><na f="c/Claude:Francisco" pid="94/4051">Francisco Claude</na></co>
<co c="0"><na f="c/Cooper:Colin" pid="41/126">Colin Cooper</na></co>
<co c="0"><na f="c/Cordasco:Gennaro" pid="26/4019">Gennaro Cordasco</na></co>
<co c="0"><na f="c/Cushman:Ryan" pid="304/2170">Ryan Cushman</na></co>
<co c="0"><na f="c/Czuba:Michal" pid="331/2690">Michal Czuba</na></co>
<co c="0"><na f="d/Dehghan:Ashkan" pid="325/6986">Ashkan Dehghan</na></co>
<co c="0"><na f="d/Dehghan=Kooshkghazi:Arash" pid="285/5957">Arash Dehghan-Kooshkghazi</na></co>
<co c="0"><na f="d/Delcourt:Michelle" pid="121/1083">Michelle Delcourt</na></co>
<co c="0"><na f="d/Dereniowski:Dariusz" pid="d/DDereniowski">Dariusz Dereniowski</na></co>
<co c="0"><na f="d/Dewar:Megan" pid="185/0699">Megan Dewar</na></co>
<co c="0"><na f="d/DeWolfe:Ryan" pid="364/7561">Ryan DeWolfe</na></co>
<co c="1"><na f="d/Dippel:Jack" pid="228/7828">Jack Dippel</na></co>
<co c="0"><na f="d/Dorrigiv:Reza" pid="d/RezaDorrigiv">Reza Dorrigiv</na></co>
<co c="0"><na f="d/Drungilas:Paulius" pid="215/7308">Paulius Drungilas</na></co>
<co c="0"><na f="d/Dubey:Akshat" pid="218/5474">Akshat Dubey</na></co>
<co c="0"><na f="d/Dudek:Andrzej" pid="68/4382">Andrzej Dudek</na></co>
<co c="1"><na f="e/Eide:Austin" pid="300/3463">Austin Eide</na></co>
<co c="0"><na f="e/English:Sean" pid="211/0959">Sean English</na></co>
<co c="0"><na f="f/Finbow:Stephen" pid="21/5822">Stephen Finbow</na></co>
<co c="0"><na f="f/Fomin:Fedor_V=" pid="f/FedorVFomin">Fedor V. Fomin</na></co>
<co c="0"><na f="f/Francetic:Nevena" pid="36/8049">Nevena Francetic</na></co>
<co c="0"><na f="f/Frieze:Alan_M=" pid="f/AlanMFrieze">Alan M. Frieze</na></co>
<co c="0"><na f="g/Gamarnik:David" pid="74/4070">David Gamarnik</na></co>
<co c="0"><na f="g/Gao:Pu" pid="54/3104">Pu Gao</na></co>
<co c="0"><na f="g/Gaspers:Serge" pid="33/5862">Serge Gaspers</na></co>
<co c="0"><na f="g/Gavenciak:Tomas" pid="00/8050">Tomas Gavenciak</na></co>
<co c="0"><na f="g/Georgiou:Konstantinos" pid="77/4787">Konstantinos Georgiou</na></co>
<co c="0"><na f="g/Gleich:David_F=" pid="40/4457">David F. Gleich</na></co>
<co c="3"><na f="g/Godbole:Anant_P=" pid="80/3968">Anant P. Godbole</na></co>
<co c="0"><na f="g/Golovach:Petr_A=" pid="06/6306">Petr A. Golovach</na></co>
<co c="0"><na f="g/Gordinowicz:Przemyslaw" pid="12/8077">Przemyslaw Gordinowicz</na></co>
<co c="0"><na f="g/Graham:Fan_Chung" pid="c/FRKChung">Fan Chung Graham</na></co>
<co c="0"><na f="g/Grytczuk:Jaroslaw" pid="74/2404">Jaroslaw Grytczuk</na></co>
<co c="0"><na f="g/Gunderson:Karen" pid="153/1906">Karen Gunderson</na></co>
<co c="0"><na f="h/Hadi:Noor" pid="88/6348">Noor Hadi</na></co>
<co c="0"><na f="h/Haidar:Ali" pid="09/478">Ali Haidar</na></co>
<co c="0"><na f="h/Healy:John" pid="15/4960">John Healy</na></co>
<co c="0"><na f="h/Henry:Adam_Douglas" pid="96/9725">Adam Douglas Henry</na></co>
<co c="0"><na f="h/Hoppen:Carlos" pid="28/769">Carlos Hoppen</na></co>
<co c="0"><na f="h/Horn:Paul" pid="60/5324">Paul Horn</na></co>
<co c="0"><na f="h/Huq:Reaz" pid="261/2630">Reaz Huq</na></co>
<co c="0"><na f="i/Infeld:Ewa_J=" pid="149/2449">Ewa J. Infeld</na></co>
<co c="0"><na f="i/Isaev:Mikhail" pid="17/10715">Mikhail Isaev</na></co>
<co c="0"><na f="i/Iskhakov:Lenar" pid="189/5961">Lenar Iskhakov</na></co>
<co c="0"><na f="j/Janssen:Jeannette_C=_M=" pid="j/JCMJanssen">Jeannette C. M. Janssen</na></co>
<co c="0" n="2"><na f="j/J=uacute=nior_0001:Am=iacute=lcar_Soares" pid="144/7946">Am&#237;lcar Soares J&#250;nior 0001</na><na>Am&#237;lcar Soares 0001</na></co>
<co c="0"><na f="k/Kamali:Shahin" pid="59/577">Shahin Kamali</na></co>
<co c="0"><na f="k/Kaminski:Bogumil" pid="10/7115">Bogumil Kaminski</na></co>
<co c="0"><na f="k/Kang:Mihyun" pid="71/2814">Mihyun Kang</na></co>
<co c="0"><na f="k/Kaszynski:Daniel" pid="374/3886">Daniel Kaszynski</na></co>
<co c="0"><na f="k/Kehagias:Athanasios" pid="52/2514">Athanasios Kehagias</na></co>
<co c="3"><na f="k/Kelley:Elizabeth" pid="173/5849">Elizabeth Kelley</na></co>
<co c="0"><na f="k/Kemkes:Graeme" pid="74/381">Graeme Kemkes</na></co>
<co c="0"><na f="k/Khoeini:Farideh" pid="220/2951">Farideh Khoeini</na></co>
<co c="0"><na f="k/Kierstead:Hal_A=" pid="k/HAKierstead">Hal A. Kierstead</na></co>
<co c="0"><na f="k/Kim_0002:Myunghwan" pid="66/1606-1">Myunghwan Kim 0002</na></co>
<co c="0" n="2"><na f="k/Kinnersley:Bill" pid="35/2244">Bill Kinnersley</na><na>William B. Kinnersley</na></co>
<co c="0" n="2"><na f="k/Kiwi:Marcos_A=" pid="k/MarcosAKiwi">Marcos A. Kiwi</na><na>Marcos Kiwi</na></co>
<co c="2"><na f="k/Kocak:Akin" pid="188/0773">Akin Kocak</na></co>
<co c="0"><na f="k/Krainski:Lukasz" pid="285/6190">Lukasz Krainski</na></co>
<co c="0"><na f="k/Kratochv=iacute=l:Jan" pid="31/6569">Jan Kratochv&#237;l</na></co>
<co c="0"><na f="k/Kundu:Somnath" pid="119/4166">Somnath Kundu</na></co>
<co c="3"><na f="k/Kurtz:Emily" pid="211/0974">Emily Kurtz</na></co>
<co c="2"><na f="l/Lak:Parisa" pid="142/7909">Parisa Lak</na></co>
<co c="0"><na f="l/Le:Maya" pid="429/6431">Maya Le</na></co>
<co c="0"><na f="l/Li:Anshui" pid="167/0572">Anshui Li</na></co>
<co c="0"><na f="l/Lichev:Lyuben" pid="293/8993">Lyuben Lichev</na></co>
<co c="0"><na f="l/Lipczak:Marek" pid="04/7184">Marek Lipczak</na></co>
<co c="0"><na f="l/Logan:Adam" pid="21/9403">Adam Logan</na></co>
<co c="0"><na f="l/L=oacute=pez=Ortiz:Alejandro" pid="l/ALopezOrtiz">Alejandro L&#243;pez-Ortiz</na></co>
<co c="0"><na f="l/Lozier:Marc" pid="156/0089">Marc Lozier</na></co>
<co c="0"><na f="l/Luczak_0001:Tomasz" pid="35/5622">Tomasz Luczak 0001</na></co>
<co c="0"><na f="m/MacRury:Calum" pid="172/5055">Calum MacRury</na></co>
<co c="0"><na f="m/Makai:Tam=aacute=s" pid="29/10716">Tam&#225;s Makai</na></co>
<co c="0"><na f="m/Marbach:Trent_G=" pid="169/9502">Trent G. Marbach</na></co>
<co c="0"><na f="m/Mashatan:Atefeh" pid="49/4622">Atefeh Mashatan</na></co>
<co c="0"><na f="m/Matwin:Stan" pid="m/StanMatwin">Stan Matwin</na></co>
<co c="1"><na f="m/Mauras:Simon" pid="199/6302">Simon Mauras</na></co>
<co c="0"><na f="m/McDiarmid:Colin" pid="m/ColinMcDiarmid">Colin McDiarmid</na></co>
<co c="0"><na f="m/McKay:Brendan_D=" pid="74/5295">Brendan D. McKay</na></co>
<co c="0"><na f="m/Mehrabian:Abbas" pid="88/8395">Abbas Mehrabian</na></co>
<co c="0"><na f="m/Messinger:Margaret=Ellen" pid="68/6403">Margaret-Ellen Messinger</na></co>
<co c="0"><na f="m/Milios:Aristides" pid="260/6061">Aristides Milios</na></co>
<co c="0"><na f="m/Milios:Evangelos_E=" pid="m/EvangelosEMilios">Evangelos E. Milios</na></co>
<co c="0"><na f="m/Miller:David" pid="25/721">David Miller</na></co>
<co c="0"><na f="m/Mironov:Maksim" pid="189/5958">Maksim Mironov</na></co>
<co c="0"><na f="m/Misiorek:Pawel" pid="17/9386">Pawel Misiorek</na></co>
<co c="0"><na f="m/Mitsche:Dieter" pid="11/3659">Dieter Mitsche</na></co>
<co c="0"><na f="m/Mitzenmacher:Michael" pid="74/838">Michael Mitzenmacher</na></co>
<co c="1"><na f="m/Mohan:Divyarthi" pid="206/3417">Divyarthi Mohan</na></co>
<co c="0"><na f="m/Molloy_0001:Michael" pid="m/MichaelMolloy">Michael Molloy 0001</na></co>
<co c="0"><na f="m/M=uuml=ller_0001:Tobias" pid="59/1656-1">Tobias M&#252;ller 0001</na></co>
<co c="0"><na f="m/Musial:Katarzyna" pid="11/5835">Katarzyna Musial</na></co>
<co c="0" n="2"><na f="n/Naveiras:Diego_Seco" pid="68/2814">Diego Seco Naveiras</na><na>Diego Seco</na></co>
<co c="0"><na f="n/Nicolaidis:Jake" pid="172/5061">Jake Nicolaidis</na></co>
<co c="0"><na f="n/Nir:JD" pid="312/4946">JD Nir</na></co>
<co c="0"><na f="n/Nowakowski:Richard_J=" pid="40/6020">Richard J. Nowakowski</na></co>
<co c="0"><na f="o/Ofek:Eran" pid="31/2429">Eran Ofek</na></co>
<co c="0"><na f="o/Olczak:Tomasz" pid="196/7820">Tomasz Olczak</na></co>
<co c="0" n="2"><na f="o/Ostroumova:Liudmila" pid="45/11468">Liudmila Ostroumova</na><na>Liudmila Ostroumova Prokhorenkova</na></co>
<co c="0"><na f="p/Pankratz:Bartosz" pid="193/7531">Bartosz Pankratz</na></co>
<co c="0"><na f="p/P=eacute=rez=Gim=eacute=nez:Xavier" pid="36/1984">Xavier P&#233;rez-Gim&#233;nez</na></co>
<co c="0"><na f="p/Pike:David_A=" pid="77/605">David A. Pike</na></co>
<co c="0"><na f="p/Pokhrel:Hari" pid="205/4389">Hari Pokhrel</na></co>
<co c="0"><na f="p/Polituchyi:Nykyta" pid="383/9736">Nykyta Polituchyi</na></co>
<co c="0"><na f="p/Proos:John" pid="73/4135">John Proos</na></co>
<co c="0"><na f="q/Qi_0001:Hao" pid="24/8493-1">Hao Qi 0001</na></co>
<co c="0"><na f="r/Raigorodskii:Andrei_M=" pid="117/9427">Andrei M. Raigorodskii</na></co>
<co c="0"><na f="r/Reiniger:Benjamin" pid="140/1162">Benjamin Reiniger</na></co>
<co c="0"><na f="r/R=iacute=o=Chanona:Rita_M=_del" pid="172/5035">Rita M. del R&#237;o-Chanona</na></co>
<co c="0"><na f="r/Romero:Jazm=iacute=n" pid="30/1209">Jazm&#237;n Romero</na></co>
<co c="0"><na f="r/Roshanbin:Elham" pid="146/6441">Elham Roshanbin</na></co>
<co c="0"><na f="r/Rucinski_0001:Andrzej" pid="01/3907-1">Andrzej Rucinski 0001</na></co>
<co c="0"><na f="s/Salinger:Alejandro" pid="24/979">Alejandro Salinger</na></co>
<co c="2"><na f="s/Samarikhalaj:Akram" pid="188/0728">Akram Samarikhalaj</na></co>
<co c="0"><na f="s/Scarano:Vittorio" pid="32/6668">Vittorio Scarano</na></co>
<co c="0"><na f="s/Sileikis:Matas" pid="130/9101">Matas Sileikis</na></co>
<co c="-1"><na f="s/Singh:Harjas" pid="341/1422">Harjas Singh</na></co>
<co c="0"><na f="s/Siuta:Kinga" pid="325/7014">Kinga Siuta</na></co>
<co c="0"><na f="s/Skorupka:Agata" pid="325/7059">Agata Skorupka</na></co>
<co c="0"><na f="s/Smith:Aaron" pid="19/3885">Aaron Smith</na></co>
<co c="0"><na f="s/Sorkin:Gregory_B=" pid="60/1574">Gregory B. Sorkin</na></co>
<co c="0"><na f="s/Spagnuolo:Carmine" pid="71/11144">Carmine Spagnuolo</na></co>
<co c="0"><na f="s/Stacho:Ladislav" pid="08/4220">Ladislav Stacho</na></co>
<co c="0"><na f="s/Stolarski:Mateusz" pid="395/4022">Mateusz Stolarski</na></co>
<co c="0"><na f="s/Szufel:Przemyslaw" pid="133/5756">Przemyslaw Szufel</na></co>
<co c="0"><na f="t/Tan:Jane" pid="231/2136">Jane Tan</na></co>
<co c="0"><na f="t/Ternovsky:Kirill" pid="172/5104">Kirill Ternovsky</na></co>
<co c="0"><na f="t/Th=eacute=berge:Fran=ccedil=ois" pid="80/1457">Fran&#231;ois Th&#233;berge</na></co>
<co c="0"><na f="t/Tian:Amanda" pid="146/0866">Amanda Tian</na></co>
<co c="0"><na f="v/Vaicekauskas:Rimantas" pid="407/0183">Rimantas Vaicekauskas</na></co>
<co c="0"><na f="v/Verstra=euml=te:Jacques" pid="v/JacquesVerstraete">Jacques Verstra&#235;te</na></co>
<co c="1"><na f="v/Vetta:Adrian" pid="v/AdrianVetta">Adrian Vetta</na></co>
<co c="0"><na f="w/Wang:Changping" pid="75/4229">Changping Wang</na></co>
<co c="0"><na f="w/West:Douglas_B=" pid="10/3889">Douglas B. West</na></co>
<co c="1"><na f="w/Willhalm:Daniel" pid="402/5634">Daniel Willhalm</na></co>
<co c="0"><na f="w/Wilson:Rory" pid="67/8008">Rory Wilson</na></co>
<co c="0" n="2"><na f="w/Wormald:Nicholas_C=" pid="w/NicholasCWormald">Nicholas C. Wormald</na><na>Nick Wormald</na></co>
<co c="0"><na f="w/Wrzosek:Malgorzata" pid="347/7749">Malgorzata Wrzosek</na></co>
<co c="0"><na f="x/Xu:Wei" pid="32/1213">Wei Xu</na></co>
<co c="0"><na f="y/Ye:Nan" pid="73/7375">Nan Ye</na></co>
<co c="0"><na f="y/Young:Stephen_J=" pid="05/4973">Stephen J. Young</na></co>
<co c="0"><na f="z/Zajac:Sebastian" pid="258/8005">Sebastian Zajac</na></co>
<co c="0"><na f="z/Zawisza:Mateusz" pid="14/9833">Mateusz Zawisza</na></co>
<co c="3"><na f="z/Zhang:Yiguang" pid="147/4624">Yiguang Zhang</na></co>
<co c="0"><na f="z/Zhu:Xuding" pid="58/5187">Xuding Zhu</na></co>
<co c="0"><na f="z/Zhukovskii:Maksim" pid="77/11133">Maksim Zhukovskii</na></co>
</coauthors>
</dblpperson>

