Michael J. Pelsmajer

From MaRDI portal
(Redirected from Person:396917)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Flexible list colorings: maximizing the number of requests satisfied
Journal of Graph Theory
2024-07-02Paper
Hanani-Tutte for radial planarity. II
The Electronic Journal of Combinatorics
2023-02-17Paper
On equitable list arboricity of graphs2021-07-12Paper
On equitable list arboricity of graphs
(available as arXiv preprint)
2021-07-12Paper
Partial DP-coloring of graphs
Discrete Mathematics
2021-03-25Paper
Strong Hanani-Tutte for the Torus2020-09-01Paper
A simple characterization of proportionally 2-choosable graphs
Graphs and Combinatorics
2020-04-30Paper
Partial DP-Coloring2020-03-04Paper
Proportional choosability: a new list analogue of equitable coloring
Discrete Mathematics
2019-08-20Paper
Total equitable list coloring
Graphs and Combinatorics
2019-01-11Paper
Statistical models for cores decomposition of an undirected random graph
Electronic Journal of Statistics
2017-05-16Paper
Statistical models for cores decomposition of an undirected random graph
Electronic Journal of Statistics
2017-05-16Paper
Hanani-Tutte for Radial Planarity
Journal of Graph Algorithms and Applications
2017-04-05Paper
Hanani-Tutte for Radial Planarity II
Lecture Notes in Computer Science
2017-02-21Paper
Hanani-Tutte for Radial Planarity
Lecture Notes in Computer Science
2017-02-10Paper
Finding Minors in Graphs with a Given Path Structure
Journal of Graph Theory
2015-05-22Paper
Maximum induced forests in graphs of bounded treewidth
The Electronic Journal of Combinatorics
2014-08-14Paper
Hanani-Tutte, monotone drawings, and level-planarity
Thirty Essays on Geometric Graph Theory
2013-09-25Paper
On the Induced Matching Problem2013-03-19Paper
Adjacent crossings do matter
Journal of Graph Algorithms and Applications
2012-12-07Paper
Adjacent Crossings Do Matter
Graph Drawing
2012-03-09Paper
Dominating sets in triangulations on surfaces
Ars Mathematica Contemporanea
2012-03-07Paper
On the induced matching problem
Journal of Computer and System Sciences
2012-01-11Paper
Hanani-Tutte and monotone drawings
Graph-Theoretic Concepts in Computer Science
2011-12-16Paper
Crossing numbers of graphs with rotation systems
Algorithmica
2011-06-30Paper
Removing Independently Even Crossings
SIAM Journal on Discrete Mathematics
2011-04-15Paper
\(k\)-robust single-message transmission
SIAM Journal on Discrete Mathematics
2011-03-15Paper
Dominating sets in plane triangulations
Discrete Mathematics
2010-10-11Paper
Strong Hanani–Tutte on the Projective Plane
SIAM Journal on Discrete Mathematics
2010-08-27Paper
scientific article; zbMATH DE number 5763167 (Why is no real title available?)2010-07-30Paper
Removing independently even crossings
Graph Drawing
2010-04-27Paper
Removing even crossings on surfaces
European Journal of Combinatorics
2009-11-30Paper
Equitable list coloring and treewidth
Journal of Graph Theory
2009-06-16Paper
scientific article; zbMATH DE number 5542505 (Why is no real title available?)2009-04-14Paper
Fast edge colorings with fixed number of colors to minimize imbalance
Journal of Graph Algorithms and Applications
2009-01-19Paper
Nonrepetitive colorings of graphs of bounded tree-width
Discrete Mathematics
2008-09-04Paper
scientific article; zbMATH DE number 5309978 (Why is no real title available?)2008-08-12Paper
Removing Even Crossings on Surfaces
Electronic Notes in Discrete Mathematics
2008-06-05Paper
Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science
2008-04-17Paper
Odd crossing number and crossing number are not the same
Discrete & Computational Geometry
2008-04-16Paper
Crossing Numbers and Parameterized Complexity
Graph Drawing
2008-03-25Paper
Crossing Number of Graphs with Rotation Systems
Graph Drawing
2008-03-25Paper
Removing even crossings
Journal of Combinatorial Theory. Series B
2007-06-08Paper
Train tracks and confluent drawings
Algorithmica
2007-05-10Paper
Graph Drawing
Lecture Notes in Computer Science
2006-11-13Paper
Transversal numbers of translates of a convex body
Discrete Mathematics
2006-10-19Paper
Graph Minors and Reliable Single Message Transmission
SIAM Journal on Discrete Mathematics
2006-06-01Paper
Parameterized and Exact Computation
Lecture Notes in Computer Science
2005-08-23Paper
Equitable list-coloring for graphs of maximum degree 3
Journal of Graph Theory
2005-01-12Paper
Maximum induced linear forests in outerplanar graphs
Graphs and Combinatorics
2004-12-13Paper
The toughness of a toroidal graph with connectivity 3 and girth 6 is exactly 1
Graphs and Combinatorics
2004-12-13Paper
A list analogue of equitable coloring
Journal of Graph Theory
2004-02-03Paper
Flexible list colorings: Maximizing the number of requests satisfied
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Michael J. Pelsmajer