Often it happens that what is essentially a single project will result in more than one type of publication, typically with a later version (e.g., for a math journal) having more details or building on an earlier version (e.g., an extended abstract in the proceedings of a computer science conference). Multiple versions of a single project will be grouped together, with all links to a single version of the paper. All publications listed here have been peer-reviewed/refereed; technical reports are not listed.

A list analogue of equitable coloring
J. Graph Theory 44(3), 2003, 166--177.
with A. V. Kostochka and D. B. West.

Maximum induced linear forests in outerplanar graphs
Graphs Combin. 20(1), 2004, 121--129.

Equitable list-coloring for graphs of maximum degree 3
J. Graph Theory 47(1), 2004, 1--8.

The toughness of a toroidal graph with connectivity 3 and girth 6 is exactly 1
Graphs Combin. 20(2), 2004, 181--183.
with W. Cao.

Parameterized Algorithms for Feedback Vertex Set
in IWPEC 2004, Lecture Notes in Comput. Sci. 3162, Springer, Berlin, 2004, 235--247.
with I. Kanj and M. Schaefer.

Graph minors and reliable single message transmission
SIAM J. Discrete Math. 19(4), 2005, 815--847.
with F. E. Fich, A. Kündgen, and R. Ramamurthi.

Integer Programming Solutions for Several Optimization Problems in Graph Theory
in Computers and Their Applications (CATA 2005), 2005, 50--55.
with J. Luttamaguzi, Z. Shen, and B. Yang.

Transversal numbers of translates of a convex body
Discrete Math. 306(18), 2006, 2166--2173.
with S.-J. Kim, K. Nakprasit, and J. Skokan.

Equitable list coloring for graphs of bounded tree-width
submitted to a journal, July 2006.

Odd Crossing Number and crossing number are not the same
Discrete Comput. Geom., to appear (published online: 20 March 2006).
Odd crossing number is not crossing number
in Graph drawing, Lecture Notes in Comput. Sci. 3843, Springer, Berlin, 2006, 386--396.
with M. Schaefer and D. Stefankovic.

Removing even crossings
J. Combin. Theory Ser. B 97(4), 2007, 489--500.
Removing even crossings
in 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), Stefan Felsner (ed.), Discrete Mathematics and Theoretical Computer Science Proceedings AE, 105--110.
with M. Schaefer and D. Stefankovic.

Train tracks and confluent drawings
Algorithmica 47(4), 2007, 465--479.
with P. Hui, M. Schaefer, and D. Stefankovic.

k-robust single-message transmission
in Combinatorial and algorithmic aspects of networking (CAAN 2004), Lecture Notes in Comput. Sci. 3405, Springer, Berlin, 2005, 90--101.
k-robust single-message transmission
submitted to a journal, April 2007, and
with A. Kündgen and R. Ramamurthi.

Removing even crossings on surfaces
to appear in 2007 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '07), Electronic Notes in Discrete Mathematics.
with M. Schaefer and D. Stefankovic.

Crossing Number of Graphs with Rotation Systems
to appear in Graph Drawing 2007, Lecture Notes in Computer Science.
submitted to a conference with proceedings, March 2007.
with M. Schaefer and D. Stefankovic.

Crossing Numbers and Parameterized Complexity
to appear in Graph Drawing 2007, Lecture Notes in Computer Science.
with M. Schaefer and D. Stefankovic.

Axiomization of the Center Function on Trees
to appear in Australas. J. Combin.
with H. M. Mulder and K. B. Reid.

Fast edge colorings with fixed number of colors to minimize imbalance
submitted to a journal, June 2007.
Fast edge colorings with fixed number of colors to minimize imbalance
in Foundations of Software Technology and Theoretical Computer Science 2006 (FSTTCS 2006), Lecture Notes in Comput. Sci. 4337, Springer, Berlin, 2006, 117-128.
Minimizing Tunable Ports in Optical Networks
to appear in Combinatorial and algorithmic aspects of networking (CAAN 2005), Internet Mathematics.
with G. Calinescu.

Nonrepetitive colorings of graphs of bounded tree-width
to appear in a special issue of a Discrete Math. for the 60th birthday conference of M. Simonovits.
with A. Kündgen.

On the induced matching problem
submitted to a conference with proceedings, September 2007.
with I. Kanj and M. Schaefer.

Generalized centrality in trees
Submitted to a journal, October 2007.
with H. M. Mulder and K. B. Reid.

Δ_k and O_k confluent graphs
In progress.
with M. Schaefer and K. Stern.

New proofs for strongly chordal graphs and chordal bipartite graphs
In progress.
with J. Tokaz and D. B. West.

Maximum induced forests in graphs of bounded treewidth
In progress.
with G. G. Chappell.

Upper chromatic number for random hypergraphs
In progress.
with J. Skokan.

Dominating sets in plane triangulations
In progress.
with E. L. C. King