☰

Michael J. Pelsmajer, Ph.D. - Publications

Affiliations: 
2002 University of Illinois, Urbana-Champaign, Urbana-Champaign, IL 
Area:
Mathematics
Tree Info Similar researchers PubMed Report error

34 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Kaul H, Mudrock JA, Pelsmajer MJ, Reiniger B. A Simple Characterization of Proportionally 2-choosable Graphs Graphs and Combinatorics. 36: 679-687. DOI: 10.1007/S00373-020-02146-Z  0.68
2019 Kaul H, Mudrock JA, Pelsmajer MJ, Reiniger B. Proportional choosability: A new list analogue of equitable coloring Discrete Mathematics. 342: 2371-2383. DOI: 10.1016/J.Disc.2019.05.011  0.675
2018 Kaul H, Mudrock JA, Pelsmajer MJ. Total Equitable List Coloring Graphs and Combinatorics. 34: 1637-1649. DOI: 10.1007/S00373-018-1965-X  0.705
2017 Karwa V, Pelsmajer MJ, Petrović S, Stasi D, Wilburne D. Statistical models for cores decomposition of an undirected random graph Electronic Journal of Statistics. 11: 1949-1982. DOI: 10.1214/17-Ejs1235  0.51
2015 Kündgen A, Pelsmajer MJ, Ramamurthi R. Finding minors in graphs with a given path structure Journal of Graph Theory. 79: 30-47. DOI: 10.1002/Jgt.21812  0.671
2013 Chappell GG, Pelsmajer MJ. Maximum induced forests in graphs of bounded treewidth Electronic Journal of Combinatorics. 20. DOI: 10.37236/3826  0.613
2013 Fulek R, Pelsmajer MJ, Schaefer M, Štefankovič D. Hanani-Tutte, monotone drawings, and level-planarity Thirty Essays On Geometric Graph Theory. 2147483647: 263-287. DOI: 10.1007/978-1-4614-0110-0_14  0.339
2012 Fulek R, Pelsmajer MJ, Schaefer M, Štefankovič D. Adjacent crossings do matter Journal of Graph Algorithms and Applications. 16: 759-782. DOI: 10.7155/Jgaa.00266  0.562
2011 Liu H, Pelsmajer MJ. Dominating sets in triangulations on surfaces Ars Mathematica Contemporanea. 4: 177-204. DOI: 10.26493/1855-3974.200.Fbe  0.431
2011 Kanj I, Pelsmajer MJ, Schaefer M, Xia G. On the induced matching problem Journal of Computer and System Sciences. 77: 1058-1070. DOI: 10.1016/J.Jcss.2010.09.001  0.605
2011 Pelsmajer MJ, Schaefer M, Štefankovič D. Crossing numbers of graphs with rotation systems Algorithmica (New York). 60: 679-702. DOI: 10.1007/S00453-009-9343-Y  0.546
2011 Fulek R, Pelsmajer MJ, Schaefer M, Štefankovič D. Hanani-Tutte and monotone drawings Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6986: 283-294. DOI: 10.1007/978-3-642-25870-1_26  0.453
2010 Pelsmajer MJ, Schaefer M, Štefankovič D. Removing independently even crossings Siam Journal On Discrete Mathematics. 24: 379-393. DOI: 10.1137/090765729  0.419
2010 Kündgen A, Pelsmajer MJ, Ramamurthi R. K-Robust single-message transmission Siam Journal On Discrete Mathematics. 24: 301-321. DOI: 10.1137/070689802  0.663
2010 King ELC, Pelsmajer MJ. Dominating sets in plane triangulations Discrete Mathematics. 310: 2221-2230. DOI: 10.1016/J.Disc.2010.03.022  0.41
2009 Pelsmajer MJ, Schaefer M, Stasi D. Strong Hanani-Tutte on the projective plane Siam Journal On Discrete Mathematics. 23: 1317-1323. DOI: 10.1137/08072485X  0.436
2009 Pelsmajer MJ, Schaefer M, Štefankovič D. Removing even crossings on surfaces European Journal of Combinatorics. 30: 1704-1717. DOI: 10.1016/J.Ejc.2009.03.002  0.455
2009 Pelsmajer MJ. Equitable list coloring and treewidth Journal of Graph Theory. 61: 127-139. DOI: 10.1002/Jgt.V61:2  0.621
2008 Cǎlinescu G, Pelsmajer MJ. Fast edge colorings with fixed number of colors to minimize imbalance Journal of Graph Algorithms and Applications. 12: 401-417. DOI: 10.7155/Jgaa.00172  0.512
2008 Kündgen A, Pelsmajer MJ. Nonrepetitive colorings of graphs of bounded tree-width Discrete Mathematics. 308: 4473-4478. DOI: 10.1016/J.Disc.2007.08.043  0.558
2008 Pelsmajer MJ, Schaefer M, Štefankovič D. Odd crossing number and crossing number are not the same Discrete and Computational Geometry. 39: 442-454. DOI: 10.1007/S00454-008-9058-X  0.487
2008 Pelsmajer MJ, Schaefer M, Štefankovič D. Crossing numbers and parameterized complexity Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4875: 31-36. DOI: 10.1007/978-3-540-77537-9_6  0.344
2008 Pelsmajer MJ, Schaefer M, Štefankovič D. Crossing number of graphs with rotation systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4875: 3-12. DOI: 10.1007/978-3-540-77537-9_3  0.445
2007 Pelsmajer MJ, Schaefer M, Štefankovič D. Removing even crossings Journal of Combinatorial Theory, Series B. 97: 489-500. DOI: 10.1016/J.Jctb.2006.08.001  0.56
2007 Hui P, Pelsmajer MJ, Schaefer M, Štefankovič D. Train tracks and confluent drawings Algorithmica (New York). 47: 465-479. DOI: 10.1007/S00453-006-0165-X  0.56
2006 Kim SJ, Nakprasit K, Pelsmajer MJ, Skokan J. Transversal numbers of translates of a convex body Discrete Mathematics. 306: 2166-2173. DOI: 10.1016/J.Disc.2006.05.014  0.307
2006 Pelsmajer MJ, Schaefer M, Štefankovič D. Odd crossing number is not crossing number Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3843: 386-396. DOI: 10.1007/11618058_35  0.414
2005 Fich FE, Kündgen A, Pelsmajer MJ, Ramamurthi R. Graph minors and reliable single message transmission Siam Journal On Discrete Mathematics. 19: 815-847. DOI: 10.1137/S0895480103421129  0.572
2005 Kündgen A, Pelsmajer MJ, Ramamurthi R. K-robust single-message transmission extended abstract Lecture Notes in Computer Science. 3405: 90-101.  0.657
2004 Cao W, Pelsmajer MJ. The toughness of a toroidal graph with connectivity 3 and girth 6 is exactly 1 Graphs and Combinatorics. 20: 181-183. DOI: 10.1007/S00373-004-0558-Z  0.558
2004 Pelsmajer MJ. Maximum Induced Linear Forests in Outerplanar Graphs Graphs and Combinatorics. 20: 121-129. DOI: 10.1007/S00373-003-0528-X  0.496
2004 Kanj IA, Pelsmajer MJ, Schaefer M. Parameterized Algorithms for Feedback Vertex Set Lecture Notes in Computer Science. 235-247. DOI: 10.1007/978-3-540-28639-4_21  0.494
2004 Pelsmajer MJ. Equitable list-coloring for graphs of maximum degree 3 Journal of Graph Theory. 47: 1-8. DOI: 10.1002/Jgt.V47:1  0.646
2003 Kostochka AV, Pelsmajer MJ, West DB. A List Analogue of Equitable Coloring Journal of Graph Theory. 44: 166-177. DOI: 10.1002/Jgt.V44:3  0.697
Show low-probability matches.