default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDenise Sakai Troxell
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j24]Matthew Beaudouin-Lafon, Margaret Crawford, Serena Chen
, Nathaniel J. Karst, Louise Nielsen, Denise Sakai Troxell:
On the zero blocking number of rectangular, cylindrical, and Möbius grids. Discret. Appl. Math. 282: 35-47 (2020)- [j23]Nathaniel J. Karst, Xierui Shen, Denise Sakai Troxell, MinhKhang Vu:
Blocking zero forcing processes in Cartesian products of graphs. Discret. Appl. Math. 285: 380-396 (2020)
2010 – 2019
- 2017
- [j22]Nathaniel J. Karst, Joshua Langowitz, Jessica Oehrlein, Denise Sakai Troxell:
Radio k-chromatic number of cycles for large k. Discret. Math. Algorithms Appl. 9(3): 1750031:1-1750031:20 (2017) - 2015
- [j21]Nathaniel J. Karst, Jessica Oehrlein, Denise Sakai Troxell, Junjie Zhu:
The minimum span of L(2, 1)-labelings of generalized flowers. Discret. Appl. Math. 181: 139-151 (2015) - [j20]Nathaniel J. Karst, Jessica Oehrlein, Denise Sakai Troxell, Junjie Zhu:
L(d, 1)-labelings of the edge-path-replacement by factorization of graphs. J. Comb. Optim. 30(1): 34-41 (2015) - 2014
- [j19]Nathaniel J. Karst, Jessica Oehrlein, Denise Sakai Troxell, Junjie Zhu:
Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two. Discret. Appl. Math. 178: 101-108 (2014) - 2013
- [j18]Sarah Spence Adams, Zachary Brass, Connor Stokes, Denise Sakai Troxell:
Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products. Australas. J Comb. 56: 47-60 (2013) - [j17]Sarah Spence Adams, Noura Howell, Nathaniel J. Karst, Denise Sakai Troxell, Junjie Zhu:
On the L(2, 1)-labelings of amalgamations of graphs. Discret. Appl. Math. 161(7-8): 881-888 (2013) - 2012
- [j16]Sarah Spence Adams, Paul Booth, Harold Jaffe, Denise Sakai Troxell, S. Luke Zinnen:
Exact lambda-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips. Discret. Appl. Math. 160(4-5): 436-447 (2012) - [j15]Sarah Spence Adams, Paul Booth, Denise Sakai Troxell, S. Luke Zinnen:
Modeling the spread of fault in majority-based network systems: Dynamic monopolies in triangular grids. Discret. Appl. Math. 160(10-11): 1624-1633 (2012) - 2011
- [j14]Sarah Spence Adams, Denise Sakai Troxell:
Labeling matched sums with a condition at distance two. Appl. Math. Lett. 24(6): 950-957 (2011) - [j13]Sarah Spence Adams, Denise Sakai Troxell, S. Luke Zinnen:
Dynamic monopolies and feedback vertex sets in hexagonal grids. Comput. Math. Appl. 62(11): 4049-4057 (2011) - [i1]Sarah Spence Adams, Zachary Brass, Connor Stokes, Denise Sakai Troxell:
Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products. CoRR abs/1102.5361 (2011) - 2010
- [j12]Sarah Spence Adams, Alex Trazkovich, Denise Sakai Troxell, Bradford Westgate:
On island sequences of labelings with a condition at distance two. Discret. Appl. Math. 158(1): 1-7 (2010)
2000 – 2009
- 2007
- [j11]Sarah Spence Adams, Jonathan Cass, Matthew Tesch, Denise Sakai Troxell, Cody Wheeland:
The minimum span of L(2, 1)-labelings of certain generalized Petersen graphs. Discret. Appl. Math. 155(10): 1314-1325 (2007) - [j10]Sarah Spence Adams, Matthew Tesch, Denise Sakai Troxell, Bradford Westgate, Cody Wheeland:
On the hole index of L(2, 1)-labelings of r-regular graphs. Discret. Appl. Math. 155(17): 2391-2393 (2007) - 2006
- [j9]Christopher Schwarz, Denise Sakai Troxell:
L(2, 1)-labelings of Cartesian products of two cycles. Discret. Appl. Math. 154(10): 1522-1540 (2006) - [j8]Denise Sakai Troxell:
Introduction to the ITE Special Issue: "Effective Use of Software in the MS/OR Classroom". INFORMS Trans. Educ. 7(1): 1-2 (2006) - [j7]Sarah Spence Adams, Jonathan Cass, Denise Sakai Troxell:
An extension of the channel-assignment problem: L(2, 1)-labelings of generalized Petersen graphs. IEEE Trans. Circuits Syst. I Regul. Pap. 53-I(5): 1101-1107 (2006) - 2005
- [j6]Denise Sakai Troxell:
On critical trees labeled with a condition at distance two. Discret. Math. 295(1-3): 173-189 (2005) - 2003
- [j5]Denise Sakai Troxell:
A Note on the Representation of Unit Interval Graphs: A Link Between Interval Graphs and Semiorders. Ars Comb. 66 (2003)
1990 – 1999
- 1996
- [j4]Denise Sakai Troxell:
No-hole k-tuple (r+1)-distant Colorings. Discret. Appl. Math. 64(1): 67-85 (1996) - 1995
- [j3]Denise Sakai Troxell:
Minimizing the number of holes in 2-distant colorings. Ars Comb. 41 (1995) - 1994
- [j2]Denise Sakai:
Labeling Chordal Graphs: Distance Two Condition. SIAM J. Discret. Math. 7(1): 133-140 (1994) - 1993
- [j1]Denise Sakai, Chi Wang:
No-hole (r+1)-distant colorings. Discret. Math. 119(1-3): 175-189 (1993)
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-25 05:48 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:
