default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancis Edward Su
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j17]Kathryn L. Nyman, Francis Edward Su, Shira Zerbib:
Fair division with multiple pieces. Discret. Appl. Math. 283: 115-122 (2020)
2010 – 2019
- 2019
- [j16]Francis Edward Su, Shira Zerbib
:
Piercing numbers in approval voting. Math. Soc. Sci. 101: 65-71 (2019) - [j15]Frédéric Meunier, Francis Edward Su:
Multilabeled Versions of Sperner's and Fan's Lemmas and Applications. SIAM J. Appl. Algebra Geom. 3(3): 391-411 (2019) - 2018
- [j14]Tyler Seacrest, Francis Edward Su:
A Lower Bound Technique for Triangulations of Simplotopes. SIAM J. Discret. Math. 32(1): 1-28 (2018) - [i4]Frédéric Meunier, Francis Edward Su:
Multilabeled versions of Sperner's and Fan's lemmas and applications. CoRR abs/1801.02044 (2018) - 2017
- [j13]Francis Edward Su:
Mathematics for Human Flourishing. Am. Math. Mon. 124(6): 483-493 (2017) - 2014
- [i3]Zeph Landau, Francis Edward Su:
Fair Division and Redistricting. CoRR abs/1402.0862 (2014) - 2013
- [j12]Kathryn L. Nyman, Francis Edward Su:
A Borsuk-Ulam Equivalent that Directly Implies Sperner's Lemma. Am. Math. Mon. 120(4): 346-354 (2013) - [c2]Andrew Niedermaier, Douglas Rizzolo, Francis Edward Su:
A Tree Sperner Lemma. Discrete Geometry and Algebraic Combinatorics 2013 - 2011
- [i2]Rosalie Carlson, Stephen Flood, Kevin O'Neill, Francis Edward Su:
A Tur'an-type problem for circular arc graphs. CoRR abs/1110.4205 (2011) - 2010
- [j11]John Cloutier, Kathryn L. Nyman, Francis Edward Su:
Two-player envy-free multi-cake division. Math. Soc. Sci. 59(1): 26-37 (2010) - [j10]Deborah E. Berg, Serguei Norine, Francis Edward Su, Robin Thomas, Paul Wollan:
Voting in Agreeable Societies. Am. Math. Mon. 117(1): 27-39 (2010) - [j9]Francis Edward Su:
Teaching Research: Encouraging Discoveries. Am. Math. Mon. 117(9): 759-769 (2010)
2000 – 2009
- 2007
- [j8]Gwen Spencer, Francis Edward Su:
The LSB Theorem Implies the KKM Lemma. Am. Math. Mon. 114(2): 156-159 (2007) - 2005
- [j7]Adam Bliss, Francis Edward Su:
Lower Bounds for Simplicial Covers and Triangulations of Cubes. Discret. Comput. Geom. 33(4): 669-686 (2005) - [j6]Timothy Prescott, Francis Edward Su:
A constructive proof of Ky Fan's generalization of Tucker's lemma. J. Comb. Theory A 111(2): 257-265 (2005) - [i1]Claus-Jochen Haake, Akemi Kashiwada, Francis Edward Su:
The Shapley Value of Phylogenetic Trees. CoRR abs/q-bio/0506034 (2005) - 2004
- [j5]Timothy Prescott, Francis Edward Su:
Random walks on the torus with several generators. Random Struct. Algorithms 25(3): 336-345 (2004) - 2003
- [j4]Forest W. Simmons, Francis Edward Su:
Consensus-halving via theorems of Borsuk-Ulam and Tucker. Math. Soc. Sci. 45(1): 15-25 (2003) - 2002
- [j3]Jesús A. De Loera, Elisha Peterson, Francis Edward Su:
A Polytopal Generalization of Sperner's Lemma. J. Comb. Theory A 100(1): 1-26 (2002) - [j2]Claus-Jochen Haake, Matthias G. Raith, Francis Edward Su:
Bidding for envy-freeness: A procedural approach to n-player fair-division problems. Soc. Choice Welf. 19(4): 723-749 (2002) - 2000
- [j1]Francis Edward Su:
Cake-Cutting Algorithms: Be Fair if You Can. by Jack Robertson; William Webb. Am. Math. Mon. 107(2): 185-188 (2000) - [c1]Doug Hensley, Francis Edward Su:
Random walks with badly approximable numbers. Unusual Applications of Number Theory 2000: 95-101
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-10-07 21:19 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:
