Master of Arts / Department of Communications Studies / Timothy Steffensmeier / Due to a rising interest for degrees in higher education, more students with disabilities have enrolled in the university system. Still, accessibility issues on campuses suggest institutions are not meeting the needs of students in the classroom or through curricula. This study examines current academic adjustments and the lived experiences of students with disabilities in order to understand the ableist Othering phenomenon in higher education. Qualitative research methods have been commonly used to investigate the “disabled voice”; however, triangulation of such methodologies has been criticized for reinforcing Otherness. This study used a phenomenological design implementing rhetorical agency for disabled students to answer open-ended questions in semi-structured interviews about their lived experiences. Consequently, such interviews created a platform for social change. The author also reflects on his own lived experiences as a deaf student in higher education. Findings include major themes such as a percolation of institutional hegemony, a re-appropriation of stigma through “voice,” and a call for inclusive strategies. Results indicate disabled students experience discrimination likely due to organizational tension in their university institution. Further, this study elaborates on proposed policy changes to college classrooms on large university campuses. Contributions of this study lie in implications for the future of qualitative inquiry, including how current research practices could undergo methodological reinvention to examine the ableist Othering phenomenon.

Master of Science / Department of Industrial and Manufacturing Systems Engineering / Todd Easton / Graph theory is a widely researched topic. A graph contains a set of nodes and a set of edges. The nodes often represent resources such as machines, employees, or plant locations. Each edge represents the relationship between a pair of nodes such as time, distance, or cost. Integer programs are frequently used to solve graphical problems. Unfortunately, IPs are NP-hard unless P = NP, which implies that it requires exponential effort to solve them. Much research has been focused on reducing the amount of time required to solve IPs through the use of valid inequalities or cutting planes. The theoretically strongest cutting planes are facet defining cutting planes. This research focuses on the node packing problem or independent set problem, which is a combinatorial optimization problem. The node packing problem involves coloring the maximum number of nodes such that no two nodes are adjacent. Node packings have been applied to airline traffic and radio frequencies. This thesis introduces a new class of graphical structures called suns. Suns produce previously undiscovered valid inequalities for the node packing polyhedron. Conditions are provided for when these valid inequalities are proven to be facet defining. Sun valid inequalities have the potential to more quickly solve node packing problems and could even be extended to general integer programs through conflict graphs.