Search the dblp DataBase
Tom Bohman :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Tom Bohman , Alan M. Frieze Arc-Disjoint Paths in Expander Digraphs. [Citation Graph (0, 0)][DBLP ] FOCS, 2001, pp:558-567 [Conf ] Tom Bohman , Alan M. Frieze , Miklós Ruszinkó , Lubos Thoma Vertex Covers by Edge Disjoint Cliques. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2001, v:21, n:2, pp:171-197 [Journal ] Tom Bohman , Ron Holzman Linear Versus Hereditary Discrepancy. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2004, v:25, n:1, pp:39-47 [Journal ] Tom Bohman A Construction for Sets of Integers with Distinct Subset Sums. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 1998, v:5, n:, pp:- [Journal ] Tom Bohman , Colin Cooper , Alan M. Frieze Min-Wise Independent Linear Permutations. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 2000, v:7, n:, pp:- [Journal ] Tom Bohman , Colin Cooper , Alan M. Frieze , Ryan Martin , Miklós Ruszinkó On Randomly Generated Intersecting Hypergraphs. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 2003, v:10, n:, pp:- [Journal ] Tom Bohman , Alan M. Frieze , Miklós Ruszinkó , Lubos Thoma Note on Sparse Random Graphs and Cover Graphs. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 2000, v:7, n:, pp:- [Journal ] Tom Bohman , Ron Holzman , Daniel J. Kleitman Six Lonely Runners. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 2001, v:8, n:2, pp:- [Journal ] Tom Bohman , Alan M. Frieze , Miklós Ruszinkó , Lubos Thoma G-Intersecting Families. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 2001, v:10, n:5, pp:- [Journal ] Noga Alon , Tom Bohman , Ron Holzman , Daniel J. Kleitman On partitions of discrete boxes. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:257, n:2-3, pp:255-258 [Journal ] Tom Bohman , Ryan Martin A note on G-intersecting families. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2003, v:260, n:1-3, pp:183-188 [Journal ] Tom Bohman , Alan M. Frieze Avoiding a giant component. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2001, v:19, n:1, pp:75-85 [Journal ] Tom Bohman , Alan M. Frieze Addendum to avoiding a giant component. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2002, v:20, n:1, pp:126-130 [Journal ] Tom Bohman , Alan M. Frieze , Michael Krivelevich , Ryan Martin Adding random edges to dense graphs. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2004, v:24, n:2, pp:105-117 [Journal ] Tom Bohman , Alan M. Frieze , Ryan Martin How many random edges make a dense graph hamiltonian? [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2003, v:22, n:1, pp:33-42 [Journal ] Tom Bohman , Alan M. Frieze , Nicholas C. Wormald Avoidance of a giant component in half the edge set of a random graph. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2004, v:25, n:4, pp:432-449 [Journal ] Tom Bohman , Janko Gravner Random threshold growth dynamics. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1999, v:15, n:1, pp:93-111 [Journal ] Tom Bohman , Jeong Han Kim A phase transition for avoiding a giant component. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2006, v:28, n:2, pp:195-214 [Journal ] Tom Bohman , Alan M. Frieze Arc-Disjoint Paths in Expander Digraphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2003, v:32, n:2, pp:326-344 [Journal ] Tom Bohman , Ron Holzman A nontrivial lower bound on the Shannon capacities of the complements of odd cycles. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2003, v:49, n:3, pp:721-722 [Journal ] Tom Bohman , David Kravitz On the irregularity strength of trees. [Citation Graph (0, 0)][DBLP ] Journal of Graph Theory, 2004, v:45, n:4, pp:241-254 [Journal ] A note on the random greedy triangle-packing algorithm [Citation Graph (, )][DBLP ] First-Order Definability of Trees and Sparse Random Graphs. [Citation Graph (, )][DBLP ] Erdos-Ko-Rado in Random Hypergraphs. [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.302secs