The following pages link to Michael J. Pelsmajer (Q396917):
Displaying 49 items.
- Maximum induced forests in graphs of bounded treewidth (Q396918) (← links)
- Statistical models for cores decomposition of an undirected random graph (Q527106) (← links)
- Crossing numbers of graphs with rotation systems (Q548653) (← links)
- On the induced matching problem (Q657915) (← links)
- Dominating sets in plane triangulations (Q708360) (← links)
- Train tracks and confluent drawings (Q879959) (← links)
- Removing even crossings (Q885288) (← links)
- Nonrepetitive colorings of graphs of bounded tree-width (Q941387) (← links)
- Removing even crossings on surfaces (Q1039443) (← links)
- Total equitable list coloring (Q1756126) (← links)
- The toughness of a toroidal graph with connectivity 3 and girth 6 is exactly 1 (Q1889826) (← links)
- Maximum induced linear forests in outerplanar graphs (Q1889849) (← links)
- A simple characterization of proportionally 2-choosable graphs (Q2175799) (← links)
- Proportional choosability: a new list analogue of equitable coloring (Q2319722) (← links)
- Odd crossing number and crossing number are not the same (Q2482214) (← links)
- Transversal numbers of translates of a convex body (Q2509292) (← links)
- Partial DP-coloring of graphs (Q2659213) (← links)
- Hanani-Tutte for radial planarity. II (Q2684882) (← links)
- Hanani–Tutte, Monotone Drawings, and Level-Planarity (Q2849807) (← links)
- Hanani-Tutte for Radial Planarity II (Q2961539) (← links)
- <i>k</i>-Robust Single-Message Transmission (Q3084227) (← links)
- Hanani-Tutte and Monotone Drawings (Q3104784) (← links)
- Dominating sets in triangulations on surfaces (Q3119068) (← links)
- Equitable list-coloring for graphs of maximum degree 3 (Q3156919) (← links)
- Removing Even Crossings on Surfaces (Q3503455) (← links)
- (Q3517171) (← links)
- Removing Independently Even Crossings (Q3557878) (← links)
- (Q3576669) (← links)
- Strong Hanani–Tutte on the Projective Plane (Q3583304) (← links)
- (Q3619952) (← links)
- Equitable list coloring and treewidth (Q3633001) (← links)
- A list analogue of equitable coloring (Q4446890) (← links)
- On the Induced Matching Problem (Q4910736) (← links)
- On Equitable List Arboricity of Graphs (Q5000322) (← links)
- Finding Minors in Graphs with a Given Path Structure (Q5251199) (← links)
- Fast edge colorings with fixed number of colors to minimize imbalance (Q5301445) (← links)
- Parameterized and Exact Computation (Q5311516) (← links)
- Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance (Q5385978) (← links)
- Removing Independently Even Crossings (Q5392899) (← links)
- Crossing Number of Graphs with Rotation Systems (Q5452204) (← links)
- Crossing Numbers and Parameterized Complexity (Q5452207) (← links)
- Graph Minors and Reliable Single Message Transmission (Q5470796) (← links)
- Hanani-Tutte for Radial Planarity (Q5892272) (← links)
- Hanani-Tutte for Radial Planarity (Q5892358) (← links)
- Adjacent Crossings Do Matter (Q5894784) (← links)
- Adjacent Crossings Do Matter (Q5895517) (← links)
- Graph Drawing (Q5897647) (← links)
- Flexible list colorings: Maximizing the number of requests satisfied (Q6507084) (← links)
- Flexible list colorings: maximizing the number of requests satisfied (Q6565815) (← links)
