Research publications

  1. Problems in extremal graph theory, advisor Zoltán Füredi,
    Ph.D. thesis University of Illinois (1999), 106 pages. (abstract, dvi, ps)
  2. Covering cliques with spanning bicliques,
    Journal of Graph Theory 27 (1998), 223-227. (abstract, link)
  3. Art galleries with interior walls,
    Discrete and Computational Geometry 22 (1999), 249-258. (abstract, link, pdf)
  4. Perfection thickness of graphs (with H. Asari, T. Jiang, D. West),
    Discrete Mathematics 215 (2000), 263-264. (abstract)
  5. Coloring planar mixed hypergraphs (with E. Mendelsohn, V. Voloshin),
    Electronic Journal of Combinatorics 7 (2000), R60, 13 pages (electronic).
  6. Minimal completely separating systems of k-sets (with D. Mubayi, P. Tetali),
    Journal of Combinatorial Theory (Series A) 93 (2001), 192-198. (abstract, link, preprint)
    Erratum to "Minimal completely separating systems of k-sets" (with D. Mubayi, P. Tetali),
    Journal of Combinatorial Theory (Series A) 103 (2003), 403-404.
  7. Gaps in the chromatic spectrum of face-constrained plane graphs (with D. Kobler),
    Electronic Journal of Combinatorics 8 (2001), N3, 4 pages (electronic).
  8. Covering a graph with cuts of minimum total size (with Z. Füredi),
    Discrete Mathematics 237 (2001), 129-148. (abstract, preprint)
  9. On a generalized Anti-Ramsey problem (with M. Axenovich),
    Combinatorica 21 (2001), 335-349. (abstract)
  10. Turán problems for weighted graphs (with Z. Füredi),
    Journal of Graph Theory, 40 (2002), 195-225. (abstract, preprint)
  11. Minimum average distance subsets in the Hamming cube,
    Discrete Mathematics, 249 (2002), 149-165. (abstract, dvi, ps)
  12. Coloring face-hypergraphs of graphs on surfaces (with R. Ramamurthi),
    Journal of Combinatorial Theory (Series B), 85 (2002), 307-337. (abstract)
  13. Extremal problems for chromatic neighborhood sets (with M. Molloy),
    Journal of Graph Theory, 40 (2002), 68-74.
  14. Probabilistic methods for decomposition dimension of graphs (with M. Hagita, D.B. West),
    Graphs and Combinatorics, 19 (2003), 493-503.
  15. Bipartite anti-Ramsey numbers of cycles and path covers in bipartite graphs (with M. Axenovich, T. Jiang),
    Journal of Graph Theory, 47 (2004), 9-28.
  16. Coloring with no 2-colored P4's (with M. O. Albertson, G. G. Chappell, H. A. Kierstead, R. Ramamurthi),
    Electronic Journal of Combinatorics, 11 (2004), R26, 13 pages (electronic).
  17. A bound on the total size of a cut cover (with M. Spangler),
    Discrete Mathematics, 296 (2005), 121-128.
  18. Moments of graphs in monotone families (with Z. Füredi),
    Journal of Graph Theory, 51 (2006), 37-48.
  19. Graph minors and reliable single message transmission (with F. E. Fich, M. J. Pelsmajer, R. Ramamurthi),
    SIAM Journal on Discrete Mathematics, 19 (2006), 815-847.
  20. k-robust single message transmission (Extended abstract) (with M. J. Pelsmajer, R. Ramamurthi),
    Lecture Notes in Computer Science, 3405 (2005), 90-101.
    k-robust single message transmission (Full text version) (with M. J. Pelsmajer, R. Ramamurthi),
    submitted.
  21. Orthogonal Art Galleries with Interior Walls (with J. Hutchinson),
    Discrete Applied Mathematics, 154 (2006), 1563-1569.
  22. Nonrepetitive colorings of graphs of bounded treewidth (with M. J. Pelsmajer),
    Discrete Mathematics, 308 (2008), 4473-4478.
  23. Star coloring bipartite planar graphs (with H. A. Kierstead, C. Timmons),
    Journal of Graph Theory, to appear.
  24. Covering hypergraphs with cuts of minimum total size (with S. M. Cioaba),
    submitted.
  25. Star coloring planar graphs from small lists (with C. Timmons),
    submitted.