default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlice A. McRae
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j25]Teresa W. Haynes, Jason Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Raghuveer Mohan:
Coalition graphs of paths, cycles, and trees. Discuss. Math. Graph Theory 43(4): 931-946 (2023)- 2020
- [j24]Teresa W. Haynes, Jason T. Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Nicholas Phillips:
The upper domatic number of a graph. AKCE Int. J. Graphs Comb. 17(1): 139-148 (2020) - [j23]Teresa W. Haynes, Jason T. Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Raghuveer Mohan:
Introduction to coalitions in graphs. AKCE Int. J. Graphs Comb. 17(2): 653-659 (2020) - 2016
- [j22]Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Alice A. McRae:
Roman {2}-domination. Discret. Appl. Math. 204: 22-28 (2016) - [j21]Mustapha Chellali, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae:
A Roman Domination Chain. Graphs Comb. 32(1): 79-92 (2016) - 2014
- [j20]Mustapha Chellali, Odile Favaron, Teresa W. Haynes, Stephen T. Hedetniemi, Alice A. McRae:
Independent [1, k]-sets in graphs. Australas. J Comb. 59: 144-156 (2014) - 2013
- [j19]Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Alice A. McRae:
[1, 2]-sets in graphs. Discret. Appl. Math. 161(18): 2885-2893 (2013) - [j18]Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, K. E. Kennedy, Alice A. McRae:
Self-stabilizing Algorithms for Unfriendly Partitions into Two Disjoint Dominating Sets. Parallel Process. Lett. 23(1) (2013) - 2012
- [j17]Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Hao Jiang, Ken Kennedy, Alice A. McRae:
A self-stabilizing algorithm for optimally efficient sets in graphs. Inf. Process. Lett. 112(16): 621-623 (2012) - 2011
- [j16]Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Jason Lewis, Alice A. McRae:
Matchability and k-maximal matchings. Discret. Appl. Math. 159(1): 15-22 (2011) - 2010
- [j15]Wayne Goddard, Stephen T. Hedetniemi, James L. Huff, Alice A. McRae:
Capacitated Domination. Ars Comb. 96 (2010) - 2005
- [j14]Zhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi, Ken Kennedy, Renu C. Laskar, Alice A. McRae:
An algorithm for partial Grundy number on trees. Discret. Math. 304(1-3): 108-116 (2005) - 2004
- [j13]K. Brooks Reid, Alice A. McRae, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi:
Domination and irredundance in tournaments. Australas. J Comb. 29: 157-172 (2004) - [j12]Xue-Gang Chen, Liang Sun, Alice A. McRae:
Tree Domination in Graphs. Ars Comb. 73 (2004) - [j11]Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Dee Parks, Jan Arne Telle:
Iterated colorings of graphs. Discret. Math. 278(1-3): 81-108 (2004) - [j10]Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae:
Distance-two information in self-stabilizing algorithms. Parallel Process. Lett. 14(3-4): 387-398 (2004) - 1999
- [j9]Jean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae:
Minus domination in graphs. Discret. Math. 199(1-3): 35-47 (1999) - 1998
- [j8]Johannes H. Hattingh, Alice A. McRae, Elna Ungerer:
Minus k-subdomination in graphs III. Australas. J Comb. 17: 69-76 (1998) - 1997
- [j7]Jean E. Dunbar, Jerrold W. Grossman, Johannes H. Hattingh, Stephen T. Hedetniemi, Alice A. McRae:
On weakly connected domination in graphs. Discret. Math. 167-168: 261-269 (1997) - [j6]Ernest J. Cockayne, Johannes H. Hattingh, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae:
Using maximality and minimality conditions to construct inequality chains. Discret. Math. 176(1-3): 43-61 (1997) - [j5]Devidas Gupta, Brian A. Malloy, Alice A. McRae:
The Complexity of Scheduling for Data Cache Optimization. Inf. Sci. 100(1-4): 27-48 (1997) - 1996
- [j4]Jean E. Dunbar, Wayne Goddard, Stephen T. Hedetniemi, Alice A. McRae, Michael A. Henning:
The Algorithmic Complexity of Minus Domination in Graphs. Discret. Appl. Math. 68(1-2): 73-84 (1996) - [j3]Jean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae:
Minus domination in regular graphs. Discret. Math. 149(1-3): 311-312 (1996) - 1995
- [j2]Izak Broere, Johannes H. Hattingh, Michael A. Henning, Alice A. McRae:
Majority domination in graphs. Discret. Math. 138(1-3): 125-135 (1995) - [j1]Jean E. Dunbar, Frederick C. Harris Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Renu C. Laskar:
Nearly perfect sets in graphs. Discret. Math. 138(1-3): 229-246 (1995)
Conference and Workshop Papers
- 2011
- [c5]Rahman Mitchel Tashakkori, Barry L. Kurtz, Dolores A. Parks, James B. Fenwick Jr., Alice A. McRae:
Early participation of CS students in research. SIGCSE 2011: 63-68 - 2003
- [c4]Martin Gairing, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae:
Self-Stabilizing Algorithms for {k}-Domination. Self-Stabilizing Systems 2003: 49-60 - 2000
- [c3]David Pokrass Jacobs, Robert E. Jamison, Alice A. McRae:
On the complexity of sign-nonsingularity and equal unions of sets. ACM Southeast Regional Conference 2000: 232-234 - 1997
- [c2]Thomas J. Murray, Alice A. McRae, A. Wayne Madison:
Perfect page placement. ACM Southeast Regional Conference 1997: 44-50 - 1988
- [c1]Alice A. McRae, Keith A. R. Allen, Roy P. Pargas:
Comparison of several techniques for generating systolic arrays. ACM Conference on Computer Science 1988: 345-349
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-04-24 23:21 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:
