Michael J. Pelsmajer

Orcid: 0000-0001-9688-5787

According to our database1, Michael J. Pelsmajer authored at least 38 papers between 2003 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Hanani-Tutte for Radial Planarity II.
Electron. J. Comb., 2023

2021
Partial DP-coloring of graphs.
Discret. Math., 2021

Strong Hanani-Tutte for the Torus.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020
A Simple Characterization of Proportionally 2-choosable Graphs.
Graphs Comb., 2020

2019
Proportional choosability: A new list analogue of equitable coloring.
Discret. Math., 2019

2018
Total Equitable List Coloring.
Graphs Comb., 2018

2017
Hanani-Tutte for Radial Planarity.
J. Graph Algorithms Appl., 2017

2015
Finding Minors in Graphs with a Given Path Structure.
J. Graph Theory, 2015

2014
Statistical models for cores decomposition of an undirected random graph.
CoRR, 2014

2013
Maximum Induced Forests in Graphs of Bounded Treewidth.
Electron. J. Comb., 2013

2012
Adjacent Crossings Do Matter.
J. Graph Algorithms Appl., 2012

2011
On the induced matching problem.
J. Comput. Syst. Sci., 2011

Dominating sets in triangulations on surfaces.
Ars Math. Contemp., 2011

Crossing Numbers of Graphs with Rotation Systems.
Algorithmica, 2011

Hanani-Tutte and Monotone Drawings.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

2010
Removing Independently Even Crossings.
SIAM J. Discret. Math., 2010

k-Robust Single-Message Transmission.
SIAM J. Discret. Math., 2010

Dominating sets in plane triangulations.
Discret. Math., 2010

2009
Strong Hanani--Tutte on the Projective Plane.
SIAM J. Discret. Math., 2009

Equitable list coloring and treewidth.
J. Graph Theory, 2009

2008
Fast edge colorings with fixed number of colors to minimize imbalance.
J. Graph Algorithms Appl., 2008

Nonrepetitive colorings of graphs of bounded tree-width.
Discret. Math., 2008

Odd Crossing Number and Crossing Number Are Not the Same.
Discret. Comput. Geom., 2008

Axiomization of the center function on trees.
Australas. J Comb., 2008

2007
Removing even crossings.
J. Comb. Theory, Ser. B, 2007

Removing Even Crossings on Surfaces.
Electron. Notes Discret. Math., 2007

Train Tracks and Confluent Drawings.
Algorithmica, 2007

Crossing Numbers and Parameterized Complexity.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

Crossing Number of Graphs with Rotation Systems.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

2006
Transversal numbers of translates of a convex body.
Discret. Math., 2006

2005
Graph Minors and Reliable Single Message Transmission.
SIAM J. Discret. Math., 2005

Odd Crossing Number Is Not Crossing Number.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

Integer Programming Methods for Several Optimization Problems in Graph Theory.
Proceedings of the 20th International Conference on Computers and Their Applications, 2005

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

Maximum Induced Linear Forests in Outerplanar Graphs.
Graphs Comb., 2004

The Toughness of a Toroidal Graph with Connectivity 3 and Girth 6 is Exactly 1.
Graphs Comb., 2004

Parameterized Algorithms for Feedback Vertex Set.
Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

2003
A list analogue of equitable coloring.
J. Graph Theory, 2003


  Loading...