Tom Bohman

2007
22	EE	Tom Bohman, Alan M. Frieze, Ryan Martin, Miklós Ruszinkó, Cliff Smyth: Randomly generated intersecting hypergraphs II. Random Struct. Algorithms 30(1-2): 17-34 (2007)
2006
21	EE	Tom Bohman, Jeong Han Kim: A phase transition for avoiding a giant component. Random Struct. Algorithms 28(2): 195-214 (2006)
2004
20	EE	Tom Bohman, Ron Holzman: Linear Versus Hereditary Discrepancy. Combinatorica 25(1): 39-47 (2004)
19	EE	Tom Bohman, David Kravitz: On the irregularity strength of trees. Journal of Graph Theory 45(4): 241-254 (2004)
18	EE	Tom Bohman, Alan M. Frieze, Michael Krivelevich, Ryan Martin: Adding random edges to dense graphs. Random Struct. Algorithms 24(2): 105-117 (2004)
17	EE	Tom Bohman, Alan M. Frieze, Nicholas C. Wormald: Avoidance of a giant component in half the edge set of a random graph. Random Struct. Algorithms 25(4): 432-449 (2004)
2003
16	EE	Tom Bohman, Ryan Martin: A note on G-intersecting families. Discrete Mathematics 260(1-3): 183-188 (2003)
15	EE	Tom Bohman, Colin Cooper, Alan M. Frieze, Ryan Martin, Miklós Ruszinkó: On Randomly Generated Intersecting Hypergraphs. Electr. J. Comb. 10: (2003)
14		Tom Bohman, Ron Holzman: A nontrivial lower bound on the Shannon capacities of the complements of odd cycles. IEEE Transactions on Information Theory 49(3): 721-722 (2003)
13	EE	Tom Bohman, Alan M. Frieze, Ryan Martin: How many random edges make a dense graph hamiltonian? Random Struct. Algorithms 22(1): 33-42 (2003)
12	EE	Tom Bohman, Alan M. Frieze: Arc-Disjoint Paths in Expander Digraphs. SIAM J. Comput. 32(2): 326-344 (2003)
2002
11	EE	Noga Alon, Tom Bohman, Ron Holzman, Daniel J. Kleitman: On partitions of discrete boxes. Discrete Mathematics 257(2-3): 255-258 (2002)
10		Tom Bohman, Alan M. Frieze: Addendum to avoiding a giant component. Random Struct. Algorithms 20(1): 126-130 (2002)
2001
9		Tom Bohman, Alan M. Frieze: Arc-Disjoint Paths in Expander Digraphs. FOCS 2001: 558-567
8	EE	Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma: Vertex Covers by Edge Disjoint Cliques. Combinatorica 21(2): 171-197 (2001)
7		Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma: G-Intersecting Families. Combinatorics, Probability & Computing 10(5): (2001)
6	EE	Tom Bohman, Ron Holzman, Daniel J. Kleitman: Six Lonely Runners. Electr. J. Comb. 8(2): (2001)
5		Tom Bohman, Alan M. Frieze: Avoiding a giant component. Random Struct. Algorithms 19(1): 75-85 (2001)
2000
4	EE	Tom Bohman, Colin Cooper, Alan M. Frieze: Min-Wise Independent Linear Permutations. Electr. J. Comb. 7: (2000)
3	EE	Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma: Note on Sparse Random Graphs and Cover Graphs. Electr. J. Comb. 7: (2000)
1999
2		Tom Bohman, Janko Gravner: Random threshold growth dynamics. Random Struct. Algorithms 15(1): 93-111 (1999)
1998
1	EE	Tom Bohman: A Construction for Sets of Integers with Distinct Subset Sums. Electr. J. Comb. 5: (1998)

Coauthor Index

1	Noga Alon	[11]
2	Colin Cooper	[4] [15]
3	Alan M. Frieze	[3] [4] [5] [7] [8] [9] [10] [12] [13] [15] [17] [18] [22]
4	Janko Gravner	[2]
5	Ron Holzman	[6] [11] [14] [20]
6	Jeong Han Kim	[21]
7	Daniel J. Kleitman	[6] [11]
8	David Kravitz	[19]
9	Michael Krivelevich	[18]
10	Ryan Martin	[13] [15] [16] [18] [22]
11	Miklós Ruszinkó	[3] [7] [8] [15] [22]
12	Cliff Smyth	[22]
13	Lubos Thoma	[3] [7] [8]
14	Nicholas C. Wormald	[17]

Colors in the list of coauthors