Michael J. Pelsmajer

Publication Activity (10 Years)

Years Active: 2003-2023
Publications (10 Years): 10

Top Topics

Conjunctive Queries

Highly Parallelizable

Inversely Proportional

Top Venues

Electron. J. Comb.

Publications

Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer
Hanani-Tutte for Radial Planarity II. Electron. J. Comb. 30 (1) (2023)
Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer
Partial DP-coloring of graphs. Discret. Math. 344 (4) (2021)
Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer
Strong Hanani-Tutte for the Torus. SoCG (2021)
Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer, Benjamin Reiniger
A Simple Characterization of Proportionally 2-choosable Graphs. Graphs Comb. 36 (3) (2020)
Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer
Strong Hanani-Tutte for the Torus. CoRR (2020)
Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer, Benjamin Reiniger
Proportional choosability: A new list analogue of equitable coloring. Discret. Math. 342 (8) (2019)
Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer
Total Equitable List Coloring. Graphs Comb. 34 (6) (2018)
Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer
Hanani-Tutte for Radial Planarity. J. Graph Algorithms Appl. 21 (1) (2017)
Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer
Hanani-Tutte for Radial Planarity II. Graph Drawing (2016)
Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer
Hanani-Tutte for Radial Planarity II. CoRR (2016)
Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer
Hanani-Tutte for Radial Planarity. Graph Drawing (2015)
André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi
Finding Minors in Graphs with a Given Path Structure. J. Graph Theory 79 (1) (2015)
Vishesh Karwa, Michael J. Pelsmajer, Sonja Petrovic, Despina Stasi, Dane Wilburne
Statistical models for cores decomposition of an undirected random graph. CoRR (2014)
Glenn G. Chappell, Michael J. Pelsmajer
Maximum Induced Forests in Graphs of Bounded Treewidth. Electron. J. Comb. 20 (4) (2013)
Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Adjacent Crossings Do Matter. J. Graph Algorithms Appl. 16 (3) (2012)
Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer, Ge Xia
On the induced matching problem. J. Comput. Syst. Sci. 77 (6) (2011)
Hong Liu, Michael J. Pelsmajer
Dominating sets in triangulations on surfaces. Ars Math. Contemp. 4 (1) (2011)
Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Adjacent Crossings Do Matter. Graph Drawing (2011)
Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Hanani-Tutte and Monotone Drawings. WG (2011)
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Crossing Numbers of Graphs with Rotation Systems. Algorithmica 60 (3) (2011)
André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi
k-Robust Single-Message Transmission. SIAM J. Discret. Math. 24 (1) (2010)
Erika L. C. King, Michael J. Pelsmajer
Dominating sets in plane triangulations. Discret. Math. 310 (17-18) (2010)
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Removing Independently Even Crossings. SIAM J. Discret. Math. 24 (2) (2010)
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Removing Independently Even Crossings. Graph Drawing (2009)
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Removing even crossings on surfaces. Eur. J. Comb. 30 (7) (2009)
Michael J. Pelsmajer
Equitable list coloring and treewidth. J. Graph Theory 61 (2) (2009)
Michael J. Pelsmajer, Marcus Schaefer, Despina Stasi
Strong Hanani--Tutte on the Projective Plane. SIAM J. Discret. Math. 23 (3) (2009)
Henry Martyn Mulder, Michael J. Pelsmajer, K. Brooks Reid
Axiomization of the center function on trees. Australas. J Comb. 41 (2008)
Gruia Calinescu, Michael J. Pelsmajer
Fast edge colorings with fixed number of colors to minimize imbalance. J. Graph Algorithms Appl. 12 (4) (2008)
André Kündgen, Michael J. Pelsmajer
Nonrepetitive colorings of graphs of bounded tree-width. Discret. Math. 308 (19) (2008)
Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer
On the Induced Matching Problem. STACS (2008)
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Odd Crossing Number and Crossing Number Are Not the Same. Discret. Comput. Geom. 39 (1-3) (2008)
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Removing even crossings. J. Comb. Theory, Ser. B 97 (4) (2007)
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Removing Even Crossings on Surfaces. Electron. Notes Discret. Math. 29 (2007)
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Crossing Number of Graphs with Rotation Systems. Graph Drawing (2007)
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Crossing Numbers and Parameterized Complexity. Graph Drawing (2007)
Peter Hui, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Train Tracks and Confluent Drawings. Algorithmica 47 (4) (2007)
Gruia Calinescu, Michael J. Pelsmajer
Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance. FSTTCS (2006)
Seog-Jin Kim, Kittikorn Nakprasit, Michael J. Pelsmajer, Jozef Skokan
Transversal numbers of translates of a convex body. Discret. Math. 306 (18) (2006)
Faith Ellen Fich, André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi
Graph Minors and Reliable Single Message Transmission. SIAM J. Discret. Math. 19 (4) (2005)
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Odd Crossing Number Is Not Crossing Number. Graph Drawing (2005)
Jamiru Luttamaguzi, Michael J. Pelsmajer, Zhizhang Shen, Boting Yang
Integer Programming Methods for Several Optimization Problems in Graph Theory. CATA (2005)
André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi
k-Robust Single-Message Transmission. CAAN (2004)
Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer
Parameterized Algorithms for Feedback Vertex Set. IWPEC (2004)
Weiting Cao, Michael J. Pelsmajer
The Toughness of a Toroidal Graph with Connectivity 3 and Girth 6 is Exactly 1. Graphs Comb. 20 (2) (2004)
Michael J. Pelsmajer
Maximum Induced Linear Forests in Outerplanar Graphs. Graphs Comb. 20 (1) (2004)
Michael J. Pelsmajer
Equitable list-coloring for graphs of maximum degree 3. J. Graph Theory 47 (1) (2004)
Alexandr V. Kostochka, Michael J. Pelsmajer, Douglas B. West
A list analogue of equitable coloring. J. Graph Theory 44 (3) (2003)