default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul H. Edelman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j32]Paul H. Edelman, Martin Van der Linden, John A. Weymark
:
The core of a transferable utility game as the solution to a public good market demand problem. Math. Program. 203(1): 687-702 (2024)- 2021
- [j31]Paul H. Edelman, Attila Pór:
A new axiomatic approach to the impartial nomination problem. Games Econ. Behav. 130: 443-451 (2021)
2010 – 2019
- 2015
- [j30]Paul H. Edelman:
Voting power apportionments. Soc. Choice Welf. 44(4): 911-925 (2015) - 2013
- [j29]Paul H. Edelman, Tatiana Gvozdeva, Arkadii M. Slinko:
Simplicial Complexes Obtained from Qualitative Probability Orders. SIAM J. Discret. Math. 27(4): 1820-1843 (2013) - 2010
- [j28]Noga Alon, Paul H. Edelman:
The inverse Banzhaf problem. Soc. Choice Welf. 34(3): 371-377 (2010)
2000 – 2009
- 2004
- [j27]Paul H. Edelman:
Voting power and at-large representation. Math. Soc. Sci. 47(2): 219-232 (2004) - 2003
- [j26]J. H. Stout, Paul H. Edelman, S. W. Peterson, Victor Reiner:
Geochemical Phase Diagrams and Gale Diagrams. SIAM J. Appl. Math. 64(1): 231-259 (2003) - 2002
- [j25]Paul H. Edelman, Victor Reiner, Volkmar Welker:
Convex, Acyclic, and Free Sets of an Oriented Matroid. Discret. Comput. Geom. 27(1): 99-116 (2002) - 2001
- [j24]Paul H. Edelman, Peter C. Fishburn:
Fair division of indivisible items among people with similar preferences. Math. Soc. Sci. 41(3): 327-347 (2001) - 2000
- [j23]Jesús Mario Bilbao, Paul H. Edelman:
The Shapley value on convex geometries. Discret. Appl. Math. 103(1-3): 33-40 (2000) - [j22]Paul H. Edelman, Victor Reiner:
Counting the Interior Points of a Point Configuration. Discret. Comput. Geom. 23(1): 1-13 (2000) - [j21]Paul H. Edelman, Jörg Rambau, Victor Reiner:
On Subdivision Posets of Cyclic Polytopes. Eur. J. Comb. 21(1): 85-101 (2000) - [j20]Paul H. Edelman:
Ordering Points by Linear Functionals. Eur. J. Comb. 21(1): 145-152 (2000)
1990 – 1999
- 1998
- [j19]Paul H. Edelman, Victor Reiner:
Visibility Complexes and the Baues Problem for Triangulations in the Plane. Discret. Comput. Geom. 20(1): 35-59 (1998) - 1997
- [j18]Paul H. Edelman, Victor Reiner:
Erratum to Free Arrangement and Rhombic Tilings. Discret. Comput. Geom. 17(3): 359 (1997) - [j17]Paul H. Edelman, Victor Reiner:
Catalan Triangulations of the Möbius Band. Graphs Comb. 13(3): 231-243 (1997) - 1996
- [j16]Paul H. Edelman, Victor Reiner:
Free Arrangements and Rhombic Tilings. Discret. Comput. Geom. 15(3): 307-340 (1996) - 1995
- [j15]Paul H. Edelman:
Lexicographically first reduced words. Discret. Math. 147(1-3): 95-106 (1995) - 1994
- [j14]Paul H. Edelman, Rodica Simion:
Chains in the lattice of noncrossing partitions. Discret. Math. 126(1-3): 107-119 (1994) - 1992
- [j13]Paul H. Edelman:
On the Average Number of k-Sets. Discret. Comput. Geom. 8: 209-213 (1992) - [j12]Paul H. Edelman, Rodica Simion, Dennis White:
Partition statistics on permutations. Discret. Math. 99(1-3): 63-68 (1992) - 1990
- [j11]Anders Björner, Paul H. Edelman, Günter M. Ziegler:
Hyperplane Arrangements with a Lattice of Regions. Discret. Comput. Geom. 5: 263-288 (1990)
1980 – 1989
- 1989
- [j10]Paul H. Edelman:
Tableaux and chains in a new partial order of Sn. J. Comb. Theory A 51(2): 181-204 (1989) - 1987
- [j9]Paul H. Edelman:
On Inversions and Cycles in Permutations. Eur. J. Comb. 8(3): 269-279 (1987) - 1984
- [j8]Paul H. Edelman:
The acyclic sets of an oriented matroid. J. Comb. Theory B 36(1): 26-31 (1984) - 1982
- [j7]Paul H. Edelman:
Multichains, non-crossing partitions and trees. Discret. Math. 40(2-3): 171-179 (1982) - [j6]Paul H. Edelman, Paul Klingsberg:
The Subposet Lattice and the Order Polynomial. Eur. J. Comb. 3(4): 341-346 (1982) - [j5]Paul H. Edelman:
The lattice of convex sets of an oriented matroid. J. Comb. Theory B 33(3): 239-244 (1982) - 1980
- [j4]Paul H. Edelman:
Chain enumeration and non-crossing partitions. Discret. Math. 31(2): 171-180 (1980) - [j3]Paul H. Edelman:
Zeta Polynomials and the Möbius Function. Eur. J. Comb. 1(4): 335-340 (1980)
1970 – 1979
- 1979
- [j2]Paul H. Edelman:
On a fixed point theorem for partially ordered sets. Discret. Math. 25(2): 117-119 (1979) - [j1]Paul H. Edelman, Michael E. Saks:
Group labelings of graphs. J. Graph Theory 3(2): 135-140 (1979)
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-06-10 21: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:
