Radhika Ramamurthi, Ph.D.
Affiliations: | 2001 | University of Illinois, Urbana-Champaign, Urbana-Champaign, IL |
Area:
MathematicsGoogle:
"Radhika Ramamurthi"Parents
Sign in to add mentor| Douglas B. West | grad student | 2001 | UIUC | |
| (Coloring problems on graphs and hypergraphs.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Kündgen A, Pelsmajer MJ, Ramamurthi R. (2015) Finding minors in graphs with a given path structure Journal of Graph Theory. 79: 30-47 |
| Kündgen A, Pelsmajer MJ, Ramamurthi R. (2010) K-Robust single-message transmission Siam Journal On Discrete Mathematics. 24: 301-321 |
| Fich FE, Kündgen A, Pelsmajer MJ, et al. (2005) Graph minors and reliable single message transmission Siam Journal On Discrete Mathematics. 19: 815-847 |
| Ramamurthi R, West DB. (2005) Hypergraph extension of the Alon-Tarsi list coloring theorem Combinatorica. 25: 355-366 |
| Kündgen A, Pelsmajer MJ, Ramamurthi R. (2005) K-robust single-message transmission extended abstract Lecture Notes in Computer Science. 3405: 90-101 |
| Albertson MO, Chappell GG, Kierstead HA, et al. (2004) Coloring with no $2$-Colored $P_4$'s Electronic Journal of Combinatorics. 11: 26 |
| Ramamurthi R, West DB. (2004) Maximum face-constrained coloring of plane graphs Discrete Mathematics. 274: 233-240 |
| Albertson MO, Chappell GG, Kierstead HA, et al. (2004) Coloring with no 2-colored P 4's Electronic Journal of Combinatorics. 11 |
| Kündgen A, Ramamurthi R, Martin R. (2003) Maximal Paths in Bipartite Graphs: 10920 American Mathematical Monthly. 110: 747 |
| Ramamurthi R, West DB. (2002) Maximum Face-Constrained Coloring of Plane Graphs1 1 Written August, 2000. Revised July, 2001 Electronic Notes in Discrete Mathematics. 11: 542-549 |