| Nonrepetitive colorings of graphs of bounded tree-width A Kündgen, MJ Pelsmajer Discrete Mathematics 308 (19), 4473-4478, 2008 | 83 | 2008 |
| Removing even crossings MJ Pelsmajer, M Schaefer, D Štefankovič Journal of Combinatorial Theory, Series B 97 (4), 489-500, 2007 | 78 | 2007 |
| Parameterized algorithms for feedback vertex set I Kanj, M Pelsmajer, M Schaefer International Workshop on Parameterized and Exact Computation, 235-247, 2004 | 69 | 2004 |
| On the induced matching problem I Kanj, MJ Pelsmajer, M Schaefer, G Xia Journal of Computer and System Sciences 77 (6), 1058-1070, 2011 | 62 | 2011 |
| A list analogue of equitable coloring AV Kostochka, MJ Pelsmajer, DB West Journal of Graph Theory 44 (3), 166-177, 2003 | 62 | 2003 |
| Hanani–Tutte, monotone drawings, and level-planarity R Fulek, MJ Pelsmajer, M Schaefer, D Štefankovič Thirty essays on geometric graph theory, 263-287, 2013 | 57 | 2013 |
| Odd crossing number and crossing number are not the same MJ Pelsmajer, M Schaefer, D Štefankovic Twentieth Anniversary Volume: Discrete & Computational Geometry, 1-13, 2009 | 46 | 2009 |
| Strong Hanani–Tutte on the projective plane MJ Pelsmajer, M Schaefer, D Stasi SIAM Journal on Discrete Mathematics 23 (3), 1317-1323, 2009 | 38 | 2009 |
| Train tracks and confluent drawings P Hui, MJ Pelsmajer, M Schaefer, D Stefankovic Algorithmica 47, 465-479, 2007 | 37 | 2007 |
| Crossing numbers of graphs with rotation systems MJ Pelsmajer, M Schaefer, D Štefankovič Algorithmica 60 (3), 679-702, 2011 | 36 | 2011 |
| Dominating sets in plane triangulations ELC King, MJ Pelsmajer Discrete mathematics 310 (17-18), 2221-2230, 2010 | 35 | 2010 |
| Removing even crossings on surfaces MJ Pelsmajer, M Schaefer, D Štefankovič European Journal of Combinatorics 30 (7), 1704-1717, 2009 | 32 | 2009 |
| Axiomization of the center function on trees. M Mulder, MJ Pelsmajer, KB Reid Report/Econometric Institute, Erasmus University Rotterdam, 2006 | 28 | 2006 |
| Equitable list‐coloring for graphs of maximum degree 3 MJ Pelsmajer Journal of Graph Theory 47 (1), 1-8, 2004 | 28 | 2004 |
| Odd crossing number is not crossing number MJ Pelsmajer, M Schaefer, D Štefankovič Graph Drawing: 13th International Symposium, GD 2005, Limerick, Ireland …, 2006 | 27 | 2006 |
| Integer programming solutions for several optimization problems in graph theory J Luttamaguzi, M Pelsmajer, Z Shen, B Yang 20th International Conference on Computers and Their Applications (CATA 2005), 2005 | 23 | 2005 |
| Statistical models for cores decomposition of an undirected random graph V Karwa, MJ Pelsmajer, S Petrović, D Stasi, D Wilburne | 20 | 2017 |
| Adjacent crossings do matter R Fulek, MJ Pelsmajer, M Schaefer, D Štefankovič Graph Drawing: 19th International Symposium, GD 2011, Eindhoven, The …, 2012 | 20 | 2012 |
| Transversal numbers of translates of a convex body SJ Kim, K Nakprasit, MJ Pelsmajer, J Skokan Discrete Mathematics 306 (18), 2166-2173, 2006 | 19 | 2006 |
| Removing independently even crossings MJ Pelsmajer, M Schaefer, D Štefankovič SIAM Journal on Discrete Mathematics 24 (2), 379-393, 2010 | 18 | 2010 |
Marcus SchaeferDePaul UniversityVerified email at cdm.depaul.edu
