A list analogue of equitable coloring. - Alexandr V. Kostochka; Michael J. Pelsmajer; Douglas B. West (J. Graph Theory, 2003)

Parameterized Algorithms for Feedback Vertex Set. - Iyad A. Kanj; Michael J. Pelsmajer; Marcus Schaefer 001 (IWPEC, 2004)

The Toughness of a Toroidal Graph with Connectivity 3 and Girth 6 is Exactly 1. - Weiting Cao; Michael J. Pelsmajer (Graphs Comb., 2004)

Maximum Induced Linear Forests in Outerplanar Graphs. - Michael J. Pelsmajer (Graphs Comb., 2004)

Equitable list-coloring for graphs of maximum degree 3. - Michael J. Pelsmajer (J. Graph Theory, 2004)

Integer Programming Methods for Several Optimization Problems in Graph Theory. - Jamiru Luttamaguzi; Michael J. Pelsmajer; Zhizhang Shen; Boting Yang (CATA, 2005)

Odd Crossing Number Is Not Crossing Number. - Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (GD, 2005)

Graph Minors and Reliable Single Message Transmission. - Faith Ellen Fich; André Kündgen; Michael J. Pelsmajer; Radhika Ramamurthi (SIAM J. Discret. Math., 2005)

Transversal numbers of translates of a convex body. - Seog-Jin Kim; Kittikorn Nakprasit; Michael J. Pelsmajer; Jozef Skokan (Discret. Math., 2006)

Crossing Number of Graphs with Rotation Systems. - Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (GD, 2007)

Crossing Numbers and Parameterized Complexity. - Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (GD, 2007)

Train Tracks and Confluent Drawings. - Peter Hui; Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (Algorithmica, 2007)

Removing Even Crossings on Surfaces. - Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (Electron. Notes Discret. Math., 2007)

Removing even crossings. - Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (J. Comb. Theory B, 2007)

Axiomization of the center function on trees. - Henry Martyn Mulder; Michael J. Pelsmajer; K. Brooks Reid (Australas. J Comb., 2008)

Odd Crossing Number and Crossing Number Are Not the Same. - Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (Discret. Comput. Geom., 2008)

Nonrepetitive colorings of graphs of bounded tree-width. - André Kündgen; Michael J. Pelsmajer (Discret. Math., 2008)

Fast edge colorings with fixed number of colors to minimize imbalance. - Gruia Calinescu; Michael J. Pelsmajer (J. Graph Algorithms Appl., 2008)

Equitable list coloring and treewidth. - Michael J. Pelsmajer (J. Graph Theory, 2009)

Strong Hanani–Tutte on the Projective Plane. - Michael J. Pelsmajer; Marcus Schaefer 001; Despina Stasi (SIAM J. Discret. Math., 2009)

Dominating sets in plane triangulations. - Erika L. C. King; Michael J. Pelsmajer (Discret. Math., 2010)

k-Robust Single-Message Transmission. - André Kündgen; Michael J. Pelsmajer; Radhika Ramamurthi (SIAM J. Discret. Math., 2010)

Removing Independently Even Crossings. - Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (SIAM J. Discret. Math., 2010)

Hanani-Tutte and Monotone Drawings. - Radoslav Fulek; Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (WG, 2011)

Crossing Numbers of Graphs with Rotation Systems. - Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (Algorithmica, 2011)

Dominating sets in triangulations on surfaces. - Hong Liu; Michael J. Pelsmajer (Ars Math. Contemp., 2011)

On the induced matching problem. - Iyad A. Kanj; Michael J. Pelsmajer; Marcus Schaefer 001; Ge Xia (J. Comput. Syst. Sci., 2011)

Adjacent Crossings Do Matter. - Radoslav Fulek; Michael J. Pelsmajer; Marcus Schaefer 001; Daniel Stefankovic (J. Graph Algorithms Appl., 2012)

Maximum Induced Forests in Graphs of Bounded Treewidth. - Glenn G. Chappell; Michael J. Pelsmajer (Electron. J. Comb., 2013)

Statistical models for cores decomposition of an undirected random graph. - Vishesh Karwa; Michael J. Pelsmajer; Sonja Petrovic; Despina Stasi; Dane Wilburne (CoRR, 2014)

Finding Minors in Graphs with a Given Path Structure. - André Kündgen; Michael J. Pelsmajer; Radhika Ramamurthi (J. Graph Theory, 2015)

Hanani-Tutte for Radial Planarity. - Radoslav Fulek; Michael J. Pelsmajer; Marcus Schaefer 001 (J. Graph Algorithms Appl., 2017)

Total Equitable List Coloring. - Hemanshu Kaul; Jeffrey A. Mudrock; Michael J. Pelsmajer (Graphs Comb., 2018)

Proportional choosability: A new list analogue of equitable coloring. - Hemanshu Kaul; Jeffrey A. Mudrock; Michael J. Pelsmajer; Benjamin Reiniger (Discret. Math., 2019)

A Simple Characterization of Proportionally 2-choosable Graphs. - Hemanshu Kaul; Jeffrey A. Mudrock; Michael J. Pelsmajer; Benjamin Reiniger (Graphs Comb., 2020)

Strong Hanani-Tutte for the Torus. - Radoslav Fulek; Michael J. Pelsmajer; Marcus Schaefer 001 (SoCG, 2021)

Partial DP-coloring of graphs. - Hemanshu Kaul; Jeffrey A. Mudrock; Michael J. Pelsmajer (Discret. Math., 2021)

Hanani-Tutte for Radial Planarity II. - Radoslav Fulek; Michael J. Pelsmajer; Marcus Schaefer 001 (Electron. J. Comb., 2023)

Flexible list colorings: Maximizing the number of requests satisfied. - Hemanshu Kaul; Rogers Mathew; Jeffrey A. Mudrock; Michael J. Pelsmajer (J. Graph Theory, 2024)