default search action
Garth Isaak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j31]Garth Isaak, Matthew Prudente
:
Two-player pebbling on diameter 2 graphs. Int. J. Game Theory 50(2): 581-596 (2021)
2010 – 2019
- 2019
- [j30]Simona Boyadzhiyska
Interval orders with two interval lengths. Discret. Appl. Math. 267: 52-63 (2019) - 2012
- [j29]Michael J. Fisher, Garth Isaak:
Distinguishing numbers of Cartesian products of multiple complete graphs. Ars Math. Contemp. 5(1): 159-173 (2012) - [j28]Garth Isaak, Peter D. Johnson Jr., Caleb Petrie:
Integer and fractional security in graphs. Discret. Appl. Math. 160(13-14): 2060-2062 (2012) - 2011
- [j27]Jonelle Hook, Garth Isaak:
Star-critical Ramsey numbers. Discret. Appl. Math. 159(5): 328-334 (2011) - 2010
- [j26]Garth Isaak, Douglas B. West:
The Edge-Count Criterion for Graphic Lists. Electron. J. Comb. 17(1) (2010) - [j25]David E. Brown, Arthur H. Busch, Garth Isaak:
Linear Time Recognition Algorithms and Structure Theorems for Bipartite Tolerance Graphs and Bipartite Probe Interval Graphs. Discret. Math. Theor. Comput. Sci. 12(5): 63-82 (2010)
2000 – 2009
- 2009
- [j24]Garth Isaak, Robert E. Jamison, Darren A. Narayan:
Greedy rankings and arank numbers. Inf. Process. Lett. 109(15): 825-827 (2009) - [p1]Garth Isaak:
Interval Order Representation via Shortest Paths. The Mathematics of Preference, Choice and Order 2009: 303-311 - 2008
- [j23]Michael J. Fisher, Garth Isaak:
Distinguishing colorings of Cartesian products of complete graphs. Discret. Math. 308(11): 2240-2246 (2008) - 2007
- [c1]Arthur H. Busch, Garth Isaak:
Recognizing Bipartite Tolerance Graphs in Linear Time. WG 2007: 12-20 - 2006
- [j22]Garth Isaak:
Hamiltonicity of digraphs for universal cycles of permutations. Eur. J. Comb. 27(6): 801-805 (2006) - 2004
- [j21]Garth Isaak:
Sum List Coloring Block Graphs. Graphs Comb. 20(4): 499-506 (2004) - [j20]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) - [j19]Garth Isaak, Darren A. Narayan:
Complete classification of tournaments having a disjoint union of directed paths as a minimum feedback arc set. J. Graph Theory 45(1): 28-47 (2004) - [j18]Christian Bey, Garth Isaak:
Maximum Antichains of Sets of Distinct Sizes: 10932. Am. Math. Mon. 111(3): 262-263 (2004) - 2003
- [j17]Garth Isaak, Kathryn L. Nyman, Ann N. Trenk:
A Hierarchy of Classes of Bounded Bitolerance Orders. Ars Comb. 69 (2003) - 2002
- [j16]Garth Isaak:
Sum List Coloring 2*n Arrays. Electron. J. Comb. 9(1) (2002) - 2001
- [j15]Kenneth P. Bogart, Joshua D. Laison, Garth Isaak, Ann N. Trenk:
Comparability Invariance Results for Tolerance Orders. Order 18(3): 281-294 (2001) - 2000
- [j14]Anthony B. Evans, Garth Isaak, Darren A. Narayan:
Representations of graphs modulo n. Discret. Math. 223(1-3): 109-123 (2000)
1990 – 1999
- 1999
- [j13]Sam Donnelly, Garth Isaak:
Hamiltonian powers in threshold and arborescent comparability graphs. Discret. Math. 202(1-3): 33-44 (1999) - 1998
- [j12]Kenneth P. Bogart, Garth Isaak:
Proper and unit bitolerance orders and graphs. Discret. Math. 181(1-3): 37-51 (1998) - [j11]Garth Isaak:
Powers of Hamiltonian paths in interval graphs. J. Graph Theory 28(1): 31-38 (1998) - 1997
- [j10]Glenn Hurlbert, Garth Isaak:
On Higher Dimensional Perfect Factors. Ars Comb. 45 (1997) - 1996
- [j9]Glenn Hurlbert, Garth Isaak:
Equivalence class universal cycles for permutations. Discret. Math. 149(1-3): 123-129 (1996) - 1995
- [j8]Garth Isaak:
Tournaments as Feedback Arc Sets. Electron. J. Comb. 2 (1995) - [j7]Jean-Pierre Barthélemy, Olivier Hudry, Garth Isaak, Fred S. Roberts
The Reversing Number of a Digraph. Discret. Appl. Math. 60(1-3): 39-76 (1995) - [j6]Kenneth P. Bogart, Peter C. Fishburn, Garth Isaak, Larry J. Langley:
Proper and Unit Tolerance Graphs. Discret. Appl. Math. 60(1-3): 99-117 (1995) - [j5]James R. Driscoll, Dennis M. Healy Jr., Garth Isaak:
Scheduling Dyadic Intervals. Discret. Appl. Math. 63(2): 101-116 (1995) - [j4]Glenn Hurlbert, Garth Isaak:
New Constructions for De Bruijn Tori. Des. Codes Cryptogr. 6(1): 47-56 (1995) - 1993
- [j3]Garth Isaak:
Bounded Discrete Representations of Interval Orders. Discret. Appl. Math. 44(1-3): 157-183 (1993) - [j2]Glenn Hurlbert, Garth Isaak:
On the de Bruijn Torus Problem. J. Comb. Theory A 64(1): 50-62 (1993) - 1992
- [j1]Garth Isaak, Suh-Ryung Kim, Terry A. McKee, Fred R. McMorris, Fred S. Roberts
2-Competition Graphs. SIAM J. Discret. Math. 5(4): 524-538 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: