Name | Affiliation | Title of talk (if applicable) |
---|---|---|
Atif Abueida | University of Dayton | |
Safwan Akkari | Indiana-Purdue Fort Wayne | |
David J. Anderson | Eymina Corporation, Cincinatti OH | |
Divesh Angula | Ball State University | |
Mustafa Atici | Western Kentucky University | On (t,k)-geodetic sets |
Jay Bagga (invited speaker) | Ball State University | Old and new generalizations of line graphs |
Michael Barrus | Univerity of Illinois Urbana-Champaign | Graph classes characterized both by forbidden subgraphs and degree sequences |
Lowell Beineke | Indiana-Purdue Fort Wayne | |
Jeffrey Boats | University of Detroit Mercy | The Nova Graph: an improvement to the alternating group graph |
Art Busch | University of Dayton | Transitive sub-tournaments of tournaments with a given Score Sequence |
Jeong Ok Choi | University of Illinois Urbana-Champaign | Degree-splittability of k-regular graphs |
Adam Coffman | Indiana-Purdue Fort Wayne | |
Charles Brian Crane | Goshen College | Forbidden subgraphs and (k,m)-pancyclicity |
Daniel Cranston | University of Illinois Urbana-Champaign | List-Coloring the Square of a Subcubic Graph |
Janet Dalzell | ||
Ann Darke | Bowling Green State University | |
Gayla Domke | Purdue University North Central | |
Daniela Ferrero | Texas State University | Some algebraic properties of super line digraphs |
Adrian Heinz | Ball State University | On graceful labellings of cycles |
Amy Hlavacek | Saginaw Valley State University | The swapping number of a graph |
Lazaros Kikas | University of Detroit Mercy | An algorithm for finding disjoint paths in the alternating group graph, part 1 |
Mithra Koyyalamudi | University of Detroit Mercy | An algorithm for finding disjoint paths in the alternating group graph, part 2 |
Mohit Kumbhat | University of Illinois Urbana-Champaign | |
Hong-Jian Lai | West Virginia University | Some Recent Progresses on Hamiltonian Line Graphs and Claw-Free Graphs |
Hao Li | West Virginia University | Bi-cycle extendable through a given set in balanced bipartite graphs |
Yanting Liang | West Virginia University | Multi-g base index of anti-symmetric matrices |
Marc Lipman | Indiana-Purdue Fort Wayne | |
David Liu | Indiana-Purdue Fort Wayne | |
Rong Luo | Middle Tennessee State University | Realizing degree sequences with graphs having nowhere-zero 3-flows |
M. Mahbub A. Majumder | Ball State University | On graceful labellings of cycles |
Mike McGrew | Ball State University | |
Terry McKee | Wright State University | Minimal Weak Separators and the Chords of Clique Trees |
Kevin Milans | University of Illinois Urbana-Champaign | Parity edge-coloring of graphs |
Rafiullah Mohammed | Ball State University | Visualization of Graphs and Graph Algorithms |
Sayeed Nadim | Ball State University | |
Lale Ozkahya | University of Illinois Urbana-Champaign | |
Darren Parker | University of Dayton | The Helly and Radon Numbers in Multipartite Tournaments |
Ray Pippert (guest of honor) | Indiana-Purdue Fort Wayne | |
Yehong Shao | Ohio University Southern | Hamiltonian graphs involving neighborhood conditions |
Nart Shawash | Oakland University | Quotient Graphs of Star Graph |
Naeem Sheikh | University of Illinois Urbana-Champaign | Induced Ramsey numbers of P3 with other graphs |
Chris Stephens | Middle Tennessee State University | Spanning disks in toroidal embeddings |
Burak Stodolsky | Univerity of Illinois Urbana-Champaign | A lower bound on the coupled domination number of n-vertex trees |
Ida Svejdarova | University of Illinois Urbana-Champaign | |
Chip Vandell | Indiana-Purdue Fort Wayne | |
Matt Walsh | Indiana-Purdue Fort Wayne | |
Doug Weakley | Indiana-Purdue Fort Wayne | An Improved Lower Bound for Domination Numbers of the Queen's Graph |
Hehui Wu | University of Illinois Urbana-Champaign | Generalized mod p-orientations and generalized mod p-factor |
Huiya Yan | West Virginia University | Hamilton-Connected Indices of Graphs |
Gexin Yu | Vanderbilt University | First-Fit chromatic number of various classes of graphs |
Taoye Zhang | West Virginia University | Odd Edge Connectivity, Parity Subgraphs, Flows |
Ju Zhou | West Virginia University | The maximum size of a cut and graph homomorphisms |