The following pages link to Paweł Prałat (Q265089):
Displaying 50 items.
- Tight bounds on probabilistic zero forcing on hypercubes and grids (Q2073291) (← links)
- Probabilistically faulty searching on a half-line (extended abstract) (Q2081614) (← links)
- Localization game for random geometric graphs (Q2107488) (← links)
- Makespan trade-offs for visiting triangle edges (extended abstract) (Q2115869) (← links)
- Broadcasting on paths and cycles (Q2138979) (← links)
- On the existence of Hamilton cycles with a periodic pattern in a random digraph (Q2213806) (← links)
- Probabilistic zero forcing on random graphs (Q2225411) (← links)
- On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness (Q2225445) (← links)
- Zero-forcing in random regular graphs (Q2226521) (← links)
- Hamilton cycles in the semi-random graph process (Q2237858) (← links)
- Power of \(k\) choices and rainbow spanning trees in random graphs (Q2256126) (← links)
- Sub-trees of a random tree (Q2274085) (← links)
- Parallel execution of schedules with random dependency graph (Q2317877) (← links)
- How many zombies are needed to catch the survivor on toroidal grids? (Q2328860) (← links)
- Containment game played on random graphs: another zig-zag theorem (Q2346471) (← links)
- The acquaintance time of (percolated) random geometric graphs (Q2346592) (← links)
- The total acquisition number of random geometric graphs (Q2401413) (← links)
- Strong-majority bootstrap percolation on regular graphs with low dissemination threshold (Q2402436) (← links)
- The game of overprescribed Cops and Robbers played on graphs (Q2409518) (← links)
- The total acquisition number of the randomly weighted path (Q2409784) (← links)
- On the threshold for \(k\)-regular subgraphs of random graphs (Q2428631) (← links)
- Cops and robbers playing on edges (Q2448255) (← links)
- Brushing without capacity restrictions (Q2449081) (← links)
- Elimination schemes and lattices (Q2449178) (← links)
- The total acquisition number of random graphs (Q2629497) (← links)
- On broadcasting time in the model of travelling agents (Q2659076) (← links)
- Meyniel's conjecture holds for random graphs (Q2795750) (← links)
- Acquaintance time of random graphs near connectivity threshold (Q2801332) (← links)
- Rainbow arborescence in random digraphs (Q2833120) (← links)
- Vertex-pursuit in random directed acyclic graphs (Q2848534) (← links)
- A note on off-diagonal small on-line Ramsey numbers for paths. (Q2864458) (← links)
- On the maximum density of graphs with unique-path labelings (Q2870502) (← links)
- Vertex-Pursuit in Hierarchical Social Networks (Q2898017) (← links)
- Some Typical Properties of the Spatial Preferred Attachment Model (Q2900582) (← links)
- The first player wins the one-colour triangle avoidance game on 16 vertices (Q2906377) (← links)
- Geometric protean graphs (Q2909127) (← links)
- Cops and robber with constraints (Q2910936) (← links)
- Asymmetric Distribution of Nodes in the Spatial Preferred Attachment Model (Q2938009) (← links)
- (Q2941401) (← links)
- The Domination Number of On-line Social Networks and Random Geometric Graphs (Q2948462) (← links)
- Modular Orientations of Random and Quasi-Random Regular Graphs (Q2998847) (← links)
- (Q3003877) (← links)
- Rank-Based Models of Network Structure and the Discovery of Content (Q3005571) (← links)
- (Q3012580) (← links)
- Chasing robbers on random graphs: Zigzag theorem (Q3061185) (← links)
- The Geometric Protean Model for On-Line Social Networks (Q3067510) (← links)
- Pursuit-Evasion in Models of Complex Networks (Q3078593) (← links)
- A Spatial Web Graph Model with Local Influence Regions (Q3078605) (← links)
- Geodesics and almost geodesic cycles in random regular graphs (Q3081309) (← links)
- (Q3120651) (← links)
