Graph Theory, Combinatorics, Algorithms and Complexity.
- Fast Edge Colorings with Fixed Number of Colors to minimize Imbalance, with G.Calinescu, Foundations of Software Technology and Theoretical Computer Science 2006, Lecture Notes in Comput. Sci. 4337, Springer, Berlin, 2006, 117-128.
- Graph minors and reliable single message transmission, with F. Fich, A. Kündgen, and R. Ramamurthi, Siam J. Discrete Math 19(4), 2005, 815-847.
- A list analogue of equitable coloring, with A. V. Kostochka and D. B. West, Journal of Graph Theory, Volume 44, Issue 3, 2003, 166-177.
- Odd Crossing Number and Crossing Number Are Not the Same, with M.Schaefer and D.Stefankovic, Discrete and Computational Geometry, published online March 2006
- Removing Even Crossings, with M.Schaefer and D.Stefankovic, Journal of Combinatorial Theory, Series B, 97(4), 2007, 489-500.
|
| |

10 W. 32nd Street
Engineering 1 Room 206
Chicago, IL 60616
312.567.5344
312.567.3135 fax
pelsmajer AT iit DOT edu
http://www.iit.edu/~pelsmajer Office Hours: by appointment only
|
|
|
| |