default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarilyn Breen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j15]Marilyn Breen:
Intersections Of Sets Expressible As Unions Of k Starshaped Sets. Ars Comb. 125: 339-345 (2016)- 2014
- [j14]Marilyn Breen:
A Helly-type theorem for intersections of orthogonally starshaped sets in $\mathbb R^d$. Period. Math. Hung. 68(1): 45-53 (2014) - 2013
- [j13]Marilyn Breen:
Dual Helly-Type Theorems For Unions Of Sets Starshaped Via Staircase Paths. Ars Comb. 110: 129-141 (2013) - 2012
- [j12]Marilyn Breen:
Generating the kernel of a staircase starshaped set from certain staircase convex subsets. Period. Math. Hung. 64(1): 29-37 (2012) - 2011
- [j11]Marilyn Breen:
Staircase Visibility And Krasnosel'skii-Type Results For Planar Compact Sets. Ars Comb. 102: 427-434 (2011)
2000 – 2009
- 2009
- [j10]Marilyn Breen:
Analogues of Horn's theorem for finite unions of starshaped sets in ℝ d . Period. Math. Hung. 59(1): 99-107 (2009) - 2007
- [j9]Marilyn Breen:
A Krasnosel'skii-type result for planar sets starshaped via orthogonally convex paths. Period. Math. Hung. 55(2): 169-176 (2007) - 2006
- [j8]Marilyn Breen:
A Helly Theorem For Intersections Of Sets Starshaped Via Staircase n-Paths. Ars Comb. 78 (2006) - 2003
- [j7]Marilyn Breen:
A Decomposition for Simple Polygons. Ars Comb. 68 (2003) - [j6]Marilyn Breen:
A Decomposition Theorem for Simply Connected Orthogonal Polygons. Ars Comb. 68 (2003) - 2001
- [j5]Marilyn Breen:
A Krasnoselskii Theorem for Permissible Paths Whose Edges Are Parallel to Three Given Vectors in the Plane. Ars Comb. 59 (2001) - 2000
- [j4]Marilyn Breen:
Krasnoselskii numbers and non simply connected orthogonal polygons. Ars Comb. 57 (2000)
1990 – 1999
- 1990
- [c1]Marilyn Breen:
Measures of F-Stars in Finitely Starlike Sets. Applied Geometry And Discrete Mathematics 1990: 109-116
1980 – 1989
- 1982
- [j3]Marilyn Breen:
A decomposition theorem for chi1-convex sets. Discret. Math. 41(2): 131-138 (1982) - 1981
- [j2]Marilyn Breen:
k-Dimensional intersections of convex sets and convex kernels. Discret. Math. 36(3): 233-237 (1981)
1970 – 1979
- 1978
- [j1]Marilyn Breen:
A better decomposition theorem for simply connected m-convex sets. Discret. Math. 24(2): 153-159 (1978)
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:11 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:
