Proper path‐factors and interval edge‐coloring of (3, 4)‐biregular bigraphs AS Asratian, CJ Casselgren, J Vandenbussche, DB West Journal of Graph Theory 61 (2), 88-97, 2009 | 32 | 2009 |

Colored saturation parameters for rainbow subgraphs MD Barrus, M Ferrara, J Vandenbussche, PS Wenger Journal of Graph Theory 86 (4), 375-386, 2017 | 17 | 2017 |

On the Pagenumber of *k*-TreesJ Vandenbussche, DB West, G Yu SIAM Journal on Discrete Mathematics 23 (3), 1455-1464, 2009 | 17 | 2009 |

Further results on bar k-visibility graphs SG Hartke, J Vandenbussche, P Wenger SIAM Journal on Discrete Mathematics 21 (2), 523-531, 2007 | 17 | 2007 |

An incentivized early remediation program in Calculus I J Vandenbussche, L Ritter, C Scherrer International journal of mathematical education in science and technology 49 …, 2018 | 16 | 2018 |

Matching extendability in hypercubes J Vandenbussche, DB West SIAM Journal on Discrete Mathematics 23 (3), 1539-1547, 2009 | 13 | 2009 |

Extensions to 2-factors in bipartite graphs J Vandenbussche, DB West the electronic journal of combinatorics, P11-P11, 2013 | 12 | 2013 |

On a question of Sós about 3‐uniform friendship hypergraphs SG Hartke, J Vandenbussche Journal of Combinatorial Designs 16 (3), 253-261, 2008 | 10 | 2008 |

Using strand committees to build faculty support for departmental change J Vandenbussche, L Ritter, KM Callahan, EE Westlund Primus 31 (3-5), 330-342, 2021 | 6 | 2021 |

Overlap number of graphs DW Cranston, N Korula, TD LeSaulnier, KG Milans, CJ Stocker, ... Journal of Graph Theory 70 (1), 10-28, 2012 | 6 | 2012 |

EFFECTIVE MULTIDISCIPLINARY ACTIVE LEARNING TECHNIQUES FOR FRESHMEN POLYTECHNIC STUDENTS. A Khalid, B Nuhfer-Halten, J Vandenbussche, D Colebeck, M Atiqullah, ... Review of Higher Education & Self-Learning 4 (13), 2011 | 6 | 2011 |

STUDENTS'PERCEPTIONS OF HOMEWORK POLICIES IN LOWERAND INTERMEDIATE-LEVEL MATHEMATICS COURSES J Vandenbussche, W Griffiths, CR Scherrer Mathematics and Computer Education 48 (2), 149, 2014 | 5 | 2014 |

Equitable defective coloring of sparse planar graphs L Williams, J Vandenbussche, G Yu Discrete Mathematics 312 (5), 957-962, 2012 | 5 | 2012 |

Independence number of 2-factor-plus-triangles graphs J Vandenbussche, DB West the electronic journal of combinatorics, R27-R27, 2009 | 3 | 2009 |

A study of student perceptions of office hours L Ritter, C Scherrer, J Vandenbussche, J Whipple | 2 | 2024 |

Planar graphs without 4-cycles and close triangles are (2, 0, 0)-colorable H Hoskins, R Liu, J Vandenbussche, G Yu Journal of Combinatorial Optimization 36, 346-364, 2018 | 2 | 2018 |

Completing Partial Proper Colorings using Hall's Condition S Holliday, J Vandenbussche, EE Westlund The Electronic Journal of Combinatorics, P3. 6-P3. 6, 2015 | 2 | 2015 |

A study of the effects of early remediation in prerequisite material in a calculus I course J Vandenbussche 2013 ASEE Annual Conference & Exposition, 23.112. 1-23.112. 9, 2013 | 2 | 2013 |

A Hall-type condition for path covers in bipartite graphs M Lavrov, J Vandenbussche arXiv preprint arXiv:2310.05248, 2023 | 1 | 2023 |

Every Graph is Hall -Extendible S Holliday, J Vandenbussche, EE Westlund The Electronic Journal of Combinatorics 23 (4), P4. 19, 2016 | 1 | 2016 |