Michael J. Pelsmajer

	2008
18		Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer: On the Induced Matching Problem. STACS 2008: 397-408
17		Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic: Odd Crossing Number and Crossing Number Are Not the Same. Discrete & Computational Geometry 39(1-3): 442-454 (2008)
16		André Kündgen, Michael J. Pelsmajer: Nonrepetitive colorings of graphs of bounded tree-width. Discrete Mathematics 308(19): 4473-4478 (2008)
	2007
15		Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic: Crossing Number of Graphs with Rotation Systems. Graph Drawing 2007: 3-12
14		Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic: Crossing Numbers and Parameterized Complexity. Graph Drawing 2007: 31-36
13		Peter Hui, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic: Train Tracks and Confluent Drawings. Algorithmica 47(4): 465-479 (2007)
12		Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic: Removing Even Crossings on Surfaces. Electronic Notes in Discrete Mathematics 29: 85-90 (2007)
11		Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic: Removing even crossings. J. Comb. Theory, Ser. B 97(4): 489-500 (2007)
	2006
10		Gruia Calinescu, Michael J. Pelsmajer: Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance. FSTTCS 2006: 117-128
9		Seog-Jin Kim, Kittikorn Nakprasit, Michael J. Pelsmajer, Jozef Skokan: Transversal numbers of translates of a convex body. Discrete Mathematics 306(18): 2166-2173 (2006)
	2005
8		Jamiru Luttamaguzi, Michael J. Pelsmajer, Zhizhang Shen, Boting Yang: Integer Programming Methods for Several Optimization Problems in Graph Theory. Computers and Their Applications 2005: 50-55
7		Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic: Odd Crossing Number Is Not Crossing Number. Graph Drawing 2005: 386-396
6		Faith Ellen Fich, André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi: Graph Minors and Reliable Single Message Transmission. SIAM J. Discrete Math. 19(4): 815-847 (2005)
	2004
5		André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi: k-Robust Single-Message Transmission. CAAN 2004: 90-101
4		Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer: Parameterized Algorithms for Feedback Vertex Set. IWPEC 2004: 235-247
3		Michael J. Pelsmajer: Maximum Induced Linear Forests in Outerplanar Graphs. Graphs and Combinatorics 20(1): 121-129 (2004)
2		Weiting Cao, Michael J. Pelsmajer: The Toughness of a Toroidal Graph with Connectivity 3 and Girth 6 is Exactly 1. Graphs and Combinatorics 20(2): 181-183 (2004)
1		Michael J. Pelsmajer: Equitable list-coloring for graphs of maximum degree 3. Journal of Graph Theory 47(1): 1-8 (2004)

Coauthor Index

1	Gruia Calinescu	[10]
2	Weiting Cao	[2]
3	Faith Ellen (Faith Ellen Fich, Faith E. Fich)	[6]
4	Peter Hui	[13]
5	Iyad A. Kanj	[4] [18]
6	Seog-Jin Kim	[9]
7	André Kündgen	[5] [6] [16]
8	Jamiru Luttamaguzi	[8]
9	Kittikorn Nakprasit	[9]
10	Radhika Ramamurthi	[5] [6]
11	Marcus Schaefer	[4] [7] [11] [12] [13] [14] [15] [17] [18]
12	Zhizhang Shen	[8]
13	Jozef Skokan	[9]
14	Daniel Stefankovic	[7] [11] [12] [13] [14] [15] [17]
15	Ge Xia	[18]
16	Boting Yang (Bo-Ting Yang)	[8]

Colors in the list of coauthors