default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael J. Pelsmajer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j31]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer
:
Hanani-Tutte for Radial Planarity II. Electron. J. Comb. 30(1) (2023)- 2021
- [j30]Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer:
Partial DP-coloring of graphs. Discret. Math. 344(4): 112306 (2021) - [c14]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer:
Strong Hanani-Tutte for the Torus. SoCG 2021: 38:1-38:15 - 2020
- [j29]Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer, Benjamin Reiniger:
A Simple Characterization of Proportionally 2-choosable Graphs. Graphs Comb. 36(3): 679-687 (2020) - [i3]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer:
Strong Hanani-Tutte for the Torus. CoRR abs/2009.01683 (2020)
2010 – 2019
- 2019
- [j28]Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer, Benjamin Reiniger:
Proportional choosability: A new list analogue of equitable coloring. Discret. Math. 342(8): 2371-2383 (2019) - 2018
- [j27]Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer:
Total Equitable List Coloring. Graphs Comb. 34(6): 1637-1649 (2018) - 2017
- [j26]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer:
Hanani-Tutte for Radial Planarity. J. Graph Algorithms Appl. 21(1): 135-154 (2017) - 2016
- [c13]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer:
Hanani-Tutte for Radial Planarity II. GD 2016: 468-481 - [i2]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer:
Hanani-Tutte for Radial Planarity II. CoRR abs/1608.08662 (2016) - 2015
- [j25]André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi:
Finding Minors in Graphs with a Given Path Structure. J. Graph Theory 79(1): 30-47 (2015) - [c12]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer:
Hanani-Tutte for Radial Planarity. GD 2015: 99-110 - 2014
- [i1]Vishesh Karwa, Michael J. Pelsmajer, Sonja Petrovic, Despina Stasi, Dane Wilburne:
Statistical models for cores decomposition of an undirected random graph. CoRR abs/1410.7357 (2014) - 2013
- [j24]Glenn G. Chappell, Michael J. Pelsmajer:
Maximum Induced Forests in Graphs of Bounded Treewidth. Electron. J. Comb. 20(4): 8 (2013) - 2012
- [j23]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Adjacent Crossings Do Matter. J. Graph Algorithms Appl. 16(3): 759-782 (2012) - 2011
- [j22]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Crossing Numbers of Graphs with Rotation Systems. Algorithmica 60(3): 679-702 (2011) - [j21]Hong Liu, Michael J. Pelsmajer:
Dominating sets in triangulations on surfaces. Ars Math. Contemp. 4(1): 177-204 (2011) - [j20]Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer, Ge Xia:
On the induced matching problem. J. Comput. Syst. Sci. 77(6): 1058-1070 (2011) - [c11]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Adjacent Crossings Do Matter. GD 2011: 343-354 - [c10]Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Hanani-Tutte and Monotone Drawings. WG 2011: 283-294 - 2010
- [j19]Erika L. C. King, Michael J. Pelsmajer:
Dominating sets in plane triangulations. Discret. Math. 310(17-18): 2221-2230 (2010) - [j18]André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi:
k-Robust Single-Message Transmission. SIAM J. Discret. Math. 24(1): 301-321 (2010) - [j17]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Removing Independently Even Crossings. SIAM J. Discret. Math. 24(2): 379-393 (2010)
2000 – 2009
- 2009
- [j16]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Removing even crossings on surfaces. Eur. J. Comb. 30(7): 1704-1717 (2009) - [j15]Michael J. Pelsmajer:
Equitable list coloring and treewidth. J. Graph Theory 61(2): 127-139 (2009) - [j14]Michael J. Pelsmajer, Marcus Schaefer, Despina Stasi:
Strong Hanani--Tutte on the Projective Plane. SIAM J. Discret. Math. 23(3): 1317-1323 (2009) - [c9]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Removing Independently Even Crossings. GD 2009: 201-206 - 2008
- [j13]Henry Martyn Mulder, Michael J. Pelsmajer, K. Brooks Reid:
Axiomization of the center function on trees. Australas. J Comb. 41: 223-226 (2008) - [j12]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Odd Crossing Number and Crossing Number Are Not the Same. Discret. Comput. Geom. 39(1-3): 442-454 (2008) - [j11]André Kündgen, Michael J. Pelsmajer:
Nonrepetitive colorings of graphs of bounded tree-width. Discret. Math. 308(19): 4473-4478 (2008) - [j10]Gruia Calinescu, Michael J. Pelsmajer:
Fast edge colorings with fixed number of colors to minimize imbalance. J. Graph Algorithms Appl. 12(4): 401-417 (2008) - [c8]Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer:
On the Induced Matching Problem. STACS 2008: 397-408 - 2007
- [j9]Peter Hui, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Train Tracks and Confluent Drawings. Algorithmica 47(4): 465-479 (2007) - [j8]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Removing Even Crossings on Surfaces. Electron. Notes Discret. Math. 29: 85-90 (2007) - [j7]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Removing even crossings. J. Comb. Theory B 97(4): 489-500 (2007) - [c7]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Crossing Number of Graphs with Rotation Systems. GD 2007: 3-12 - [c6]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Crossing Numbers and Parameterized Complexity. GD 2007: 31-36 - 2006
- [j6]Seog-Jin Kim, Kittikorn Nakprasit, Michael J. Pelsmajer, Jozef Skokan:
Transversal numbers of translates of a convex body. Discret. Math. 306(18): 2166-2173 (2006) - [c5]Gruia Calinescu, Michael J. Pelsmajer:
Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance. FSTTCS 2006: 117-128 - 2005
- [j5]Faith Ellen Fich, André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi:
Graph Minors and Reliable Single Message Transmission. SIAM J. Discret. Math. 19(4): 815-847 (2005) - [c4]Jamiru Luttamaguzi, Michael J. Pelsmajer, Zhizhang Shen, Boting Yang:
Integer Programming Methods for Several Optimization Problems in Graph Theory. CATA 2005: 50-55 - [c3]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Odd Crossing Number Is Not Crossing Number. GD 2005: 386-396 - 2004
- [j4]Michael J. Pelsmajer:
Maximum Induced Linear Forests in Outerplanar Graphs. Graphs Comb. 20(1): 121-129 (2004) - [j3]Weiting Cao, Michael J. Pelsmajer:
The Toughness of a Toroidal Graph with Connectivity 3 and Girth 6 is Exactly 1. Graphs Comb. 20(2): 181-183 (2004) - [j2]Michael J. Pelsmajer:
Equitable list-coloring for graphs of maximum degree 3. J. Graph Theory 47(1): 1-8 (2004) - [c2]André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi:
k-Robust Single-Message Transmission. CAAN 2004: 90-101 - [c1]Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer:
Parameterized Algorithms for Feedback Vertex Set. IWPEC 2004: 235-247 - 2003
- [j1]Alexandr V. Kostochka, Michael J. Pelsmajer, Douglas B. West:
A list analogue of equitable coloring. J. Graph Theory 44(3): 166-177 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
