|
Search the dblp DataBase
Ryan Martin:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- 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, 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]
- Maria Axenovich, Ryan Martin
A note on short cycles in a hypercube. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:18, pp:2212-2218 [Journal]
- Alan Frieze, Ryan Martin, Julien Moncel, Miklós Ruszinkó, Cliff Smyth
Codes identifying sets of vertices in random networks. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:9-10, pp:1094-1107 [Journal]
- Maria Axenovich, Ryan Martin
Sub-Ramsey Numbers for Arithmetic Progressions. [Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2006, v:22, n:3, pp:297-309 [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]
- Alan M. Frieze, Michael Krivelevich, Ryan Martin
The emergence of a giant component in random subgraphs of pseudo-random graphs. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2004, v:24, n:1, pp:42-50 [Journal]
Automation of compressor test procedure using advantech data acquisition module. [Citation Graph (, )][DBLP]
Quadripartite version of the Hajnal-Szemerédi theorem. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
|