| 2009 |
| 14 | EE | Mindaugas Bloznelis,
Jerzy Jaworski,
Katarzyna Rybarczyk:
Component evolution in a secure wireless sensor network.
Networks 53(1): 19-26 (2009) |
| 13 | EE | Jennie C. Hansen,
Jerzy Jaworski:
A random mapping with preferential attachment.
Random Struct. Algorithms 34(1): 87-111 (2009) |
| 2008 |
| 12 | EE | Jerzy Jaworski,
Dudley Stark:
The Vertex Degree Distribution of Passive Random Intersection Graph Models.
Combinatorics, Probability & Computing 17(4): 549-558 (2008) |
| 11 | EE | Jennie C. Hansen,
Jerzy Jaworski:
Random mappings with exchangeable in-degrees.
Random Struct. Algorithms 33(1): 105-126 (2008) |
| 2007 |
| 10 | EE | Jennie C. Hansen,
Jerzy Jaworski:
A cutting process for random mappings.
Random Struct. Algorithms 30(1-2): 287-306 (2007) |
| 2006 |
| 9 | EE | Jerzy Jaworski,
Michal Karonski,
Dudley Stark:
The degree of a typical vertex in generalized random intersection graph models.
Discrete Mathematics 306(18): 2152-2165 (2006) |
| 2002 |
| 8 | | Jerzy Jaworski,
Zbigniew Palka:
Remarks on a general model of a random digraph.
Ars Comb. 65: (2002) |
| 2001 |
| 7 | EE | Erhard Godehardt,
Jerzy Jaworski:
Two Models of Random Intersection Graphs and their Applications.
Electronic Notes in Discrete Mathematics 10: 129-132 (2001) |
| 6 | EE | Jerzy Jaworski,
Zbigniew Palka:
Subgraphs of Random Match-Graphs.
Graphs and Combinatorics 17(2): 255-264 (2001) |
| 2000 |
| 5 | | Jennie C. Hansen,
Jerzy Jaworski:
Large components of bipartite random mappings.
Random Struct. Algorithms 17(3-4): 317-342 (2000) |
| 1998 |
| 4 | | Jerzy Jaworski:
Predecessors in a random mapping.
Random Struct. Algorithms 13(3-4): 501-519 (1998) |
| 1996 |
| 3 | | Erhard Godehardt,
Jerzy Jaworski:
On the connectivity of a random interval graph.
Random Struct. Algorithms 9(1-2): 137-161 (1996) |
| 1994 |
| 2 | | Jerzy Jaworski,
Ljuben R. Mutafchiev:
The Largest Connected in a Random Mapping.
Random Struct. Algorithms 5(1): 73-94 (1994) |
| 1992 |
| 1 | | Jerzy Jaworski,
Tomasz Luczak:
Cycles in a Uniform Graph Process.
Combinatorics, Probability & Computing 1: 223-239 (1992) |