Tom Bohman

	2011
37		Tom Bohman, Alan M. Frieze, Eyal Lubetzky: Random greedy triangle-packing beyond the 7/4 barrier CoRR abs/1108.1781: (2011)
36		Tom Bohman, Alan M. Frieze: Karp-Sipser on Random Graphs with a Fixed Degree Sequence. Combinatorics, Probability & Computing 20(5): 721-741 (2011)
35		Tom Bohman, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh, Benny Sudakov: Ramsey games with giants. Random Struct. Algorithms 38(1-2): 1-32 (2011)
	2010
34		Tom Bohman, Alan M. Frieze, Eyal Lubetzky: A note on the random greedy triangle-packing algorithm CoRR abs/1004.2418: (2010)
33		Tom Bohman, Alan M. Frieze, Dhruv Mubayi, Oleg Pikhurko: Hypergraphs with independent neighborhoods. Combinatorica 30(3): 277-293 (2010)
32		Tom Bohman, Alan M. Frieze, Oleg Pikhurko, Clifford D. Smyth: Anti-Ramsey properties of random graphs. J. Comb. Theory, Ser. B 100(3): 299-312 (2010)
31		Tom Bohman, Alan M. Frieze, Dhruv Mubayi: Coloring H-free hypergraphs. Random Struct. Algorithms 36(1): 11-25 (2010)
30		Tom Bohman, Andrzej Dudek, Alan M. Frieze, Oleg Pikhurko: Flips in Graphs. SIAM J. Discrete Math. 24(3): 1046-1055 (2010)
	2009
29		József Balogh, Tom Bohman, Dhruv Mubayi: Erdos-Ko-Rado in Random Hypergraphs. Combinatorics, Probability & Computing 18(5): 629-646 (2009)
28		Tom Bohman, Ron Holzman, Venkatesh Natarajan: Maximum Independent Sets in Certain Powers of Odd Cycles. Electr. J. Comb. 16(1): (2009)
27		Tom Bohman, Alan M. Frieze: Hamilton cycles in 3-out. Random Struct. Algorithms 35(4): 393-417 (2009)
26		Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg Pikhurko: Memoryless Rules for Achlioptas Processes. SIAM J. Discrete Math. 23(2): 993-1008 (2009)
	2008
25		Tom Bohman, Alan M. Frieze, Benny Sudakov: The game chromatic number of random graphs. Random Struct. Algorithms 32(2): 223-235 (2008)
24		Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg Pikhurko: Game chromatic index of graphs with given restrictions on degrees. Theor. Comput. Sci. 407(1-3): 242-249 (2008)
	2007
23		Tom Bohman, Alan M. Frieze, Tomasz Luczak, Oleg Pikhurko, Clifford D. Smyth, Joel Spencer, Oleg Verbitsky: First-Order Definability of Trees and Sparse Random Graphs. Combinatorics, Probability & Computing 16(3): 375-400 (2007)
22		Tom Bohman, Alan M. Frieze, Ryan Martin, Miklós Ruszinkó, Clifford D. Smyth: Randomly generated intersecting hypergraphs II. Random Struct. Algorithms 30(1-2): 17-34 (2007)
	2006
21		Tom Bohman, Jeong Han Kim: A phase transition for avoiding a giant component. Random Struct. Algorithms 28(2): 195-214 (2006)
	2004
20		Tom Bohman, Ron Holzman: Linear Versus Hereditary Discrepancy. Combinatorica 25(1): 39-47 (2004)
19		Tom Bohman, David Kravitz: On the irregularity strength of trees. Journal of Graph Theory 45(4): 241-254 (2004)
18		Tom Bohman, Alan M. Frieze, Michael Krivelevich, Ryan Martin: Adding random edges to dense graphs. Random Struct. Algorithms 24(2): 105-117 (2004)
17		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		Tom Bohman, Ryan Martin: A note on G-intersecting families. Discrete Mathematics 260(1-3): 183-188 (2003)
15		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		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		Tom Bohman, Alan M. Frieze: Arc-Disjoint Paths in Expander Digraphs. SIAM J. Comput. 32(2): 326-344 (2003)
	2002
11		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		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): 367-384 (2001)
6		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		Tom Bohman, Colin Cooper, Alan M. Frieze: Min-Wise Independent Linear Permutations. Electr. J. Comb. 7: (2000)
3		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		Tom Bohman: A Construction for Sets of Integers with Distinct Subset Sums. Electr. J. Comb. 5: (1998)

Coauthor Index

1	Noga Alon	[11]
2	József Balogh	[29]
3	Andrew Beveridge	[24] [26]
4	Colin Cooper	[4] [15]
5	Andrzej Dudek	[30]
6	Alan M. Frieze	[3] [4] [5] [7] [8] [9] [10] [12] [13] [15] [17] [18] [22] [23] [24] [25] [26] [27] [30] [31] [32] [33] [34] [35] [36] [37]
7	Janko Gravner	[2]
8	Ron Holzman	[6] [11] [14] [20] [28]
9	Jeong Han Kim	[21]
10	Daniel J. Kleitman	[6] [11]
11	David Kravitz	[19]
12	Michael Krivelevich	[18] [35]
13	Po-Shen Loh	[35]
14	Eyal Lubetzky	[34] [37]
15	Tomasz Luczak	[23]
16	Ryan Martin	[13] [15] [16] [18] [22]
17	Dhruv Mubayi	[29] [31] [33]
18	Venkatesh Natarajan	[28]
19	Oleg Pikhurko	[23] [24] [26] [30] [32] [33]
20	Miklós Ruszinkó	[3] [7] [8] [15] [22]
21	Clifford D. Smyth	[22] [23] [32]
22	Joel H. Spencer (Joel Spencer)	[23]
23	Benny Sudakov	[25] [35]
24	Lubos Thoma	[3] [7] [8]
25	Oleg Verbitsky	[23]
26	Nicholas C. Wormald	[17]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page