2008 |
22 | EE | Michael J. Fisher,
Garth Isaak:
Distinguishing colorings of Cartesian products of complete graphs.
Discrete Mathematics 308(11): 2240-2246 (2008) |
2007 |
21 | EE | Arthur H. Busch,
Garth Isaak:
Recognizing Bipartite Tolerance Graphs in Linear Time.
WG 2007: 12-20 |
2006 |
20 | EE | Garth Isaak:
Hamiltonicity of digraphs for universal cycles of permutations.
Eur. J. Comb. 27(6): 801-805 (2006) |
2004 |
19 | EE | Garth Isaak:
Sum List Coloring Block Graphs.
Graphs and Combinatorics 20(4): 499-506 (2004) |
18 | EE | Garth Isaak,
Darren A. Narayan:
A classification of tournaments having an acyclic tournament as a minimum feedback arc set.
Inf. Process. Lett. 92(3): 107-111 (2004) |
17 | EE | Garth Isaak,
Darren A. Narayan:
Complete classification of tournaments having a disjoint union of directed paths as a minimum feedback arc set.
Journal of Graph Theory 45(1): 28-47 (2004) |
2003 |
16 | | Garth Isaak,
Kathryn L. Nyman,
Ann N. Trenk:
A Hierarchy of Classes of Bounded Bitolerance Orders.
Ars Comb. 69: (2003) |
2002 |
15 | EE | Garth Isaak:
Sum List Coloring 2*n Arrays.
Electr. J. Comb. 9(1): (2002) |
2001 |
14 | EE | Kenneth P. Bogart,
Joshua D. Laison,
Garth Isaak,
Ann N. Trenk:
Comparability Invariance Results for Tolerance Orders.
Order 18(3): 281-294 (2001) |
2000 |
13 | EE | Anthony B. Evans,
Garth Isaak,
Darren A. Narayan:
Representations of graphs modulo n.
Discrete Mathematics 223(1-3): 109-123 (2000) |
1999 |
12 | EE | Sam Donnelly,
Garth Isaak:
Hamiltonian powers in threshold and arborescent comparability graphs.
Discrete Mathematics 202(1-3): 33-44 (1999) |
1998 |
11 | EE | Kenneth P. Bogart,
Garth Isaak:
Proper and unit bitolerance orders and graphs.
Discrete Mathematics 181(1-3): 37-51 (1998) |
1997 |
10 | | Glenn Hurlbert,
Garth Isaak:
On Higher Dimensional Perfect Factors.
Ars Comb. 45: (1997) |
1996 |
9 | EE | Glenn Hurlbert,
Garth Isaak:
Equivalence class universal cycles for permutations.
Discrete Mathematics 149(1-3): 123-129 (1996) |
1995 |
8 | | Glenn Hurlbert,
Garth Isaak:
New Constructions for De Bruijn Tori.
Des. Codes Cryptography 6(1): 47-56 (1995) |
7 | EE | Jean-Pierre Barthélemy,
Olivier Hudry,
Garth Isaak,
Fred S. Roberts,
Barry A. Tesman:
The Reversing Number of a Digraph.
Discrete Applied Mathematics 60(1-3): 39-76 (1995) |
6 | EE | Kenneth P. Bogart,
Peter C. Fishburn,
Garth Isaak,
Larry J. Langley:
Proper and Unit Tolerance Graphs.
Discrete Applied Mathematics 60(1-3): 99-117 (1995) |
5 | EE | James R. Driscoll,
Dennis M. Healy Jr.,
Garth Isaak:
Scheduling Dyadic Intervals.
Discrete Applied Mathematics 63(2): 101-116 (1995) |
4 | EE | Garth Isaak:
Tournaments as Feedback Arc Sets.
Electr. J. Comb. 2: (1995) |
1993 |
3 | EE | Garth Isaak:
Bounded Discrete Representations of Interval Orders.
Discrete Applied Mathematics 44(1-3): 157-183 (1993) |
2 | | Glenn Hurlbert,
Garth Isaak:
On the de Bruijn Torus Problem.
J. Comb. Theory, Ser. A 64(1): 50-62 (1993) |
1992 |
1 | | Garth Isaak,
Suh-Ryung Kim,
Terry A. McKee,
Fred R. McMorris,
Fred S. Roberts:
2-Competition Graphs.
SIAM J. Discrete Math. 5(4): 524-538 (1992) |