Michael J. Pelsmajer

From MaRDI portal
Person:396917

Available identifiers

zbMath Open pelsmajer.michael-jWikidataQ102246440 ScholiaQ102246440MaRDI QIDQ396917

List of research outcomes





PublicationDate of PublicationType
Flexible list colorings: maximizing the number of requests satisfied2024-07-02Paper
Hanani-Tutte for radial planarity. II2023-02-17Paper
On Equitable List Arboricity of Graphs2021-07-12Paper
Partial DP-coloring of graphs2021-03-25Paper
Strong Hanani-Tutte for the Torus2020-09-01Paper
A simple characterization of proportionally 2-choosable graphs2020-04-30Paper
Partial DP-Coloring2020-03-04Paper
Proportional choosability: a new list analogue of equitable coloring2019-08-20Paper
Total equitable list coloring2019-01-11Paper
Statistical models for cores decomposition of an undirected random graph2017-05-16Paper
Hanani-Tutte for Radial Planarity2017-04-05Paper
Hanani-Tutte for Radial Planarity II2017-02-21Paper
Hanani-Tutte for Radial Planarity2017-02-10Paper
Finding Minors in Graphs with a Given Path Structure2015-05-22Paper
Maximum induced forests in graphs of bounded treewidth2014-08-14Paper
Hanani–Tutte, Monotone Drawings, and Level-Planarity2013-09-25Paper
On the Induced Matching Problem2013-03-19Paper
Adjacent Crossings Do Matter2012-12-07Paper
Adjacent Crossings Do Matter2012-03-09Paper
Dominating sets in triangulations on surfaces2012-03-07Paper
On the induced matching problem2012-01-11Paper
Hanani-Tutte and Monotone Drawings2011-12-16Paper
Crossing numbers of graphs with rotation systems2011-06-30Paper
Removing Independently Even Crossings2011-04-15Paper
k-Robust Single-Message Transmission2011-03-15Paper
Dominating sets in plane triangulations2010-10-11Paper
Strong Hanani–Tutte on the Projective Plane2010-08-27Paper
https://portal.mardi4nfdi.de/entity/Q35766692010-07-30Paper
Removing Independently Even Crossings2010-04-27Paper
Removing even crossings on surfaces2009-11-30Paper
Equitable list coloring and treewidth2009-06-16Paper
https://portal.mardi4nfdi.de/entity/Q36199522009-04-14Paper
Fast edge colorings with fixed number of colors to minimize imbalance2009-01-19Paper
Nonrepetitive colorings of graphs of bounded tree-width2008-09-04Paper
https://portal.mardi4nfdi.de/entity/Q35171712008-08-12Paper
Removing Even Crossings on Surfaces2008-06-05Paper
Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance2008-04-17Paper
Odd crossing number and crossing number are not the same2008-04-16Paper
Crossing Numbers and Parameterized Complexity2008-03-25Paper
Crossing Number of Graphs with Rotation Systems2008-03-25Paper
Removing even crossings2007-06-08Paper
Train tracks and confluent drawings2007-05-10Paper
Graph Drawing2006-11-13Paper
Transversal numbers of translates of a convex body2006-10-19Paper
Graph Minors and Reliable Single Message Transmission2006-06-01Paper
Parameterized and Exact Computation2005-08-23Paper
Equitable list-coloring for graphs of maximum degree 32005-01-12Paper
Maximum induced linear forests in outerplanar graphs2004-12-13Paper
The toughness of a toroidal graph with connectivity 3 and girth 6 is exactly 12004-12-13Paper
A list analogue of equitable coloring2004-02-03Paper
Flexible list colorings: Maximizing the number of requests satisfiedN/APaper

Research outcomes over time

This page was built for person: Michael J. Pelsmajer