Name
Papers
Collaborators
GARTH ISAAK
30
27
Citations 
PageRank 
Referers 
172
24.01
221
Referees 
References 
200
147
Search Limit
100221
Title
Citations
PageRank
Year
Interval Orders with Two Interval Lengths10.362019
Distinguishing numbers of Cartesian products of multiple complete graphs10.372012
Integer and fractional security in graphs.20.422012
Star-critical Ramsey numbers80.832011
The Edge-Count Criterion for Graphic Lists.00.342010
Linear Time Recognition Algorithms and Structure Theorems for Bipartite Tolerance Graphs and Bipartite Probe Interval Graphs90.532010
Greedy rankings and arank numbers30.412009
Distinguishing colorings of Cartesian products of complete graphs140.982008
Recognizing bipartite tolerance graphs in linear time20.402007
Hamiltonicity of digraphs for universal cycles of permutations30.452006
A classification of tournaments having an acyclic tournament as a minimum feedback arc set10.542004
Sum List Coloring Block Graphs111.652004
Maximum Antichains of Sets of Distinct Sizes: 10932.00.342004
Complete classification of tournaments having a disjoint union of directed paths as a minimum feedback arc set30.552004
A Hierarchy Of Classes Of Bounded Bitolerance Orders40.502003
Sum List Coloring 2 x n Arrays101.782002
Comparability Invariance Results for Tolerance Orders10.502001
Hamiltonian powers in threshold and arborescent comparability graphs120.871999
Proper and unit bitolerance orders and graphs80.771998
Powers of Hamiltonian paths in interval graphs110.861998
On Higher Dimensional Perfect Factors10.391997
Equivalence class universal cycles for permutations20.411996
New constructions for De Bruijn tori30.481995
Tournaments as Feedback Arc Sets40.751995
Proper and unit tolerance graphs242.631995
The reversing number of a digraph102.141995
On the de Bruijn Torus problem171.181993
Bounded discrete representations of interval orders40.421993
On the de Bruijn Torus Problem.00.341993
2-competition graphs31.811992