default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnn N. Trenk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j35]Karen L. Collins
, Ann N. Trenk, Rebecca Whitman:
Split graphs and block representations. Discret. Math. 347(4): 113857 (2024)- 2022
- [j34]Mitchel T. Keller, Ann N. Trenk, Stephen J. Young:
Dimension of Restricted Classes of Interval Orders. Graphs Comb. 38(5): 137 (2022) - [j33]Karen L. Collins, Ann N. Trenk:
The Distinguishing Number and Distinguishing Chromatic Number for Posets. Order 39(3): 361-380 (2022)
2010 – 2019
- 2019
- [j32]Simona Boyadzhiyska, Garth Isaak, Ann N. Trenk:
Interval orders with two interval lengths. Discret. Appl. Math. 267: 52-63 (2019) - [j31]Alan Shuchat, Randy Shull, Ann N. Trenk:
Tolerance Orders of Open and Closed Unit Intervals. Order 36(2): 313-333 (2019) - 2018
- [j30]Karen L. Collins, Ann N. Trenk:
Finding Balance: Split Graphs and Related Classes. Electron. J. Comb. 25(1): 1 (2018) - 2016
- [j29]Christine T. Cheng, Karen L. Collins, Ann N. Trenk:
Split graphs and Nordhaus-Gaddum graphs. Discret. Math. 339(9): 2345-2356 (2016) - [j28]Alan Shuchat, Randy Shull, Ann N. Trenk:
Unit Interval Orders of Open and Closed Intervals. Order 33(1): 85-99 (2016) - 2013
- [j27]Karen L. Collins, Ann N. Trenk:
Nordhaus-Gaddum Theorem for the Distinguishing Chromatic Number. Electron. J. Comb. 20(3): 46 (2013) - 2012
- [i1]Karen L. Collins, Ann N. Trenk:
Nordhaus-Gaddum Theorem for the Distinguishing Chromatic Number. CoRR abs/1203.5765 (2012) - 2011
- [j26]Alan Shuchat, Randy Shull, Ann N. Trenk:
The total weak discrepancy of a partially ordered set. Ars Math. Contemp. 4(1): 95-109 (2011) - [j25]Alan Shuchat, Randy Shull, Ann N. Trenk:
Fractional weak discrepancy and split semiorders. Discret. Appl. Math. 159(7): 647-660 (2011) - 2010
- [j24]David M. Howard, Ann N. Trenk:
The t-discrepancy of a poset. Discret. Appl. Math. 158(16): 1789-1798 (2010) - [j23]David M. Howard, Randy Shull, Noah Streib, Ann N. Trenk:
The total linear discrepancy of an ordered set. Discret. Math. 310(5): 1022-1025 (2010)
2000 – 2009
- 2009
- [j22]Karen L. Collins, Mark Hovey, Ann N. Trenk:
Bounds on the Distinguishing Chromatic Number. Electron. J. Comb. 16(1) (2009) - [j21]Alan Shuchat, Randy Shull, Ann N. Trenk:
Fractional weak discrepancy and interval orders. Discret. Appl. Math. 157(8): 1873-1884 (2009) - [p1]Alan Shuchat, Randy Shull, Ann N. Trenk:
Fractional Weak Discrepancy of Posets and Certain Forbidden Configurations. The Mathematics of Preference, Choice and Order 2009: 291-301 - 2007
- [j20]Alan Shuchat, Randy Shull, Ann N. Trenk:
The fractional weak discrepancy of a partially ordered set. Discret. Appl. Math. 155(17): 2227-2235 (2007) - 2006
- [j19]Karen L. Collins, Ann N. Trenk:
The Distinguishing Chromatic Number. Electron. J. Comb. 13(1) (2006) - [j18]Alan Shuchat, Randy Shull, Ann N. Trenk:
Range of the Fractional Weak Discrepancy Function. Order 23(1): 51-63 (2006) - 2003
- [j17]Garth Isaak, Kathryn L. Nyman, Ann N. Trenk:
A Hierarchy of Classes of Bounded Bitolerance Orders. Ars Comb. 69 (2003) - 2002
- [j16]Martin Charles Golumbic, Robert E. Jamison, Ann N. Trenk:
Archimedean ϕ -tolerance graphs. J. Graph Theory 41(3): 179-194 (2002) - 2001
- [j15]Paul J. Tanenbaum, Ann N. Trenk, Peter C. Fishburn:
Linear Discrepancy and Weak Discrepancy of Partially Ordered Sets. Order 18(3): 201-225 (2001) - [j14]Peter C. Fishburn, Paul J. Tanenbaum, Ann N. Trenk:
Linear Discrepancy and Bandwidth. Order 18(3): 237-245 (2001) - [j13]Kenneth P. Bogart, Joshua D. Laison, Garth Isaak, Ann N. Trenk:
Comparability Invariance Results for Tolerance Orders. Order 18(3): 281-294 (2001) - 2000
- [j12]Kenneth P. Bogart, Ann N. Trenk:
Bounded bitolerance digraphs. Discret. Math. 215: 13-20 (2000)
1990 – 1999
- 1999
- [j11]Edward R. Scheinerman, Ann N. Trenk:
On the Fractional Intersection Number of a Graph. Graphs Comb. 15(3): 341-351 (1999) - [j10]Lenwood S. Heath, Sriram V. Pemmaraju, Ann N. Trenk:
Stack and Queue Layouts of Directed Acyclic Graphs: Part I. SIAM J. Comput. 28(4): 1510-1539 (1999) - 1998
- [j9]Charles M. Fiduccia, Edward R. Scheinerman, Ann N. Trenk, Jennifer S. Zito:
Dot product representations of graphs. Discret. Math. 181(1-3): 113-138 (1998) - [j8]Ann N. Trenk:
On k-weak orders: Recognition and a tolerance result. Discret. Math. 181(1-3): 223-237 (1998) - [j7]John G. Gimbel, Ann N. Trenk:
On the Weakness of an Ordered Set. SIAM J. Discret. Math. 11(4): 655-663 (1998) - 1997
- [j6]Randy Shull, Ann N. Trenk:
Cliques That Are Tolerance Digraphs. Discret. Appl. Math. 80(2-3): 119-134 (1997) - [j5]Randy Shull, Ann N. Trenk:
Unit and proper bitolerance digraphs. J. Graph Theory 24(2): 193-199 (1997) - 1995
- [j4]Ann N. Trenk:
Generalized Perfect Graphs: Characterizations and Inversion. Discret. Appl. Math. 60(1-3): 359-387 (1995) - [j3]Edward R. Scheinerman, Ann N. Trenk, Daniel Ullman:
On point-halfspace graphs. J. Graph Theory 20(1): 19-35 (1995) - 1994
- [j2]Kenneth P. Bogart, Ann N. Trenk:
Bipartite tolerance orders. Discret. Math. 132(1-3): 11-22 (1994) - 1993
- [j1]Edward R. Scheinerman, Ann N. Trenk:
On Generalized Perfect Graphs: Bounded Degree and Bounded Edge Perfection. Discret. Appl. Math. 44(1-3): 233-245 (1993) - 1991
- [c1]Lenwood S. Heath, Sriram V. Pemmaraju, Ann N. Trenk:
Stack and Queue Layouts of Directed Planar Graphs. Planar Graphs 1991: 5-11
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:14 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:
