2-Competition Graphs. - Garth Isaak; Suh-Ryung Kim; Terry A. McKee; Fred R. McMorris; Fred S. Roberts (SIAM J. Discret. Math., 1992)

Bounded Discrete Representations of Interval Orders. - Garth Isaak (Discret. Appl. Math., 1993)

On the de Bruijn Torus Problem. - Glenn Hurlbert; Garth Isaak (J. Comb. Theory A, 1993)

Tournaments as Feedback Arc Sets. - Garth Isaak (Electron. J. Comb., 1995)

The Reversing Number of a Digraph. - Jean-Pierre Barthélemy; Olivier Hudry; Garth Isaak; Fred S. Roberts; Barry A. Tesman (Discret. Appl. Math., 1995)

Proper and Unit Tolerance Graphs. - Kenneth P. Bogart; Peter C. Fishburn; Garth Isaak; Larry J. Langley (Discret. Appl. Math., 1995)

Scheduling Dyadic Intervals. - James R. Driscoll; Dennis M. Healy Jr.; Garth Isaak (Discret. Appl. Math., 1995)

New Constructions for De Bruijn Tori. - Glenn Hurlbert; Garth Isaak (Des. Codes Cryptogr., 1995)

Equivalence class universal cycles for permutations. - Glenn Hurlbert; Garth Isaak (Discret. Math., 1996)

On Higher Dimensional Perfect Factors. - Glenn Hurlbert; Garth Isaak (Ars Comb., 1997)

Proper and unit bitolerance orders and graphs. - Kenneth P. Bogart; Garth Isaak (Discret. Math., 1998)

Powers of Hamiltonian paths in interval graphs. - Garth Isaak (J. Graph Theory, 1998)

Hamiltonian powers in threshold and arborescent comparability graphs. - Sam Donnelly; Garth Isaak (Discret. Math., 1999)

Representations of graphs modulo n. - Anthony B. Evans; Garth Isaak; Darren A. Narayan (Discret. Math., 2000)

Comparability Invariance Results for Tolerance Orders. - Kenneth P. Bogart; Joshua D. Laison; Garth Isaak; Ann N. Trenk (Order, 2001)

Sum List Coloring 2*n Arrays. - Garth Isaak (Electron. J. Comb., 2002)

A Hierarchy of Classes of Bounded Bitolerance Orders. - Garth Isaak; Kathryn L. Nyman; Ann N. Trenk (Ars Comb., 2003)

Sum List Coloring Block Graphs. - Garth Isaak (Graphs Comb., 2004)

A classification of tournaments having an acyclic tournament as a minimum feedback arc set. - Garth Isaak; Darren A. Narayan (Inf. Process. Lett., 2004)

Complete classification of tournaments having a disjoint union of directed paths as a minimum feedback arc set. - Garth Isaak; Darren A. Narayan (J. Graph Theory, 2004)

Maximum Antichains of Sets of Distinct Sizes: 10932. - Christian Bey; Garth Isaak (Am. Math. Mon., 2004)

Hamiltonicity of digraphs for universal cycles of permutations. - Garth Isaak (Eur. J. Comb., 2006)

Recognizing Bipartite Tolerance Graphs in Linear Time. - Arthur H. Busch; Garth Isaak (WG, 2007)

Distinguishing colorings of Cartesian products of complete graphs. - Michael J. Fisher; Garth Isaak (Discret. Math., 2008)

Interval Order Representation via Shortest Paths. - Garth Isaak (The Mathematics of Preference, Choice and Order, 2009)

Greedy rankings and arank numbers. - Garth Isaak; Robert E. Jamison; Darren A. Narayan (Inf. Process. Lett., 2009)

The Edge-Count Criterion for Graphic Lists. - Garth Isaak; Douglas B. West (Electron. J. Comb., 2010)

Linear Time Recognition Algorithms and Structure Theorems for Bipartite Tolerance Graphs and Bipartite Probe Interval Graphs. - David E. Brown; Arthur H. Busch; Garth Isaak (Discret. Math. Theor. Comput. Sci., 2010)

Star-critical Ramsey numbers. - Jonelle Hook; Garth Isaak (Discret. Appl. Math., 2011)

Distinguishing numbers of Cartesian products of multiple complete graphs. - Michael J. Fisher; Garth Isaak (Ars Math. Contemp., 2012)

Integer and fractional security in graphs. - Garth Isaak; Peter D. Johnson Jr.; Caleb Petrie (Discret. Appl. Math., 2012)

Interval orders with two interval lengths. - Simona Boyadzhiyska; Garth Isaak; Ann N. Trenk (Discret. Appl. Math., 2019)

Two-player pebbling on diameter 2 graphs. - Garth Isaak; Matthew Prudente (Int. J. Game Theory, 2021)