Michael J. Pelsmajer

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