Paul H. Edelman - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 32 from 32

2024

The core of a transferable utility game as the solution to a public good market demand problemPaul H. Edelman, Martin Van der Linden, John A. Weymark. mp, 203(1):687-702, January 2024. [doi]

2021

A new axiomatic approach to the impartial nomination problemPaul H. Edelman, Attila Pór. geb, 130:443-451, 2021. [doi]

2015

Voting power apportionmentsPaul H. Edelman. scw, 44(4):911-925, 2015. [doi]

2013

Simplicial Complexes Obtained from Qualitative Probability OrdersPaul H. Edelman, Tatiana Gvozdeva, Arkadii M. Slinko. siamdm, 27(4):1820-1843, 2013. [doi]

2010

The inverse Banzhaf problemNoga Alon, Paul H. Edelman. scw, 34(3):371-377, 2010. [doi]

2004

Voting power and at-large representationPaul H. Edelman. mss, 47(2):219-232, 2004. [doi]

2003

Geochemical Phase Diagrams and Gale DiagramsJ. H. Stout, Paul H. Edelman, S. W. Peterson, Victor Reiner. siamam, 64(1):231-259, 2003. [doi]

2002

Convex, Acyclic, and Free Sets of an Oriented MatroidPaul H. Edelman, Victor Reiner, Volkmar Welker. dcg, 27(1):99-116, 2002. [doi]

2001

Fair division of indivisible items among people with similar preferencesPaul H. Edelman, Peter C. Fishburn. mss, 41(3):327-347, 2001. [doi]

2000

The Shapley value on convex geometriesJesús Mario Bilbao, Paul H. Edelman. DAM, 103(1-3):33-40, 2000.

On Subdivision Posets of Cyclic PolytopesPaul H. Edelman, Jörg Rambau, Victor Reiner. ejc, 21(1):85-101, 2000. [doi]

Ordering Points by Linear FunctionalsPaul H. Edelman. ejc, 21(1):145-152, 2000. [doi]

Counting the Interior Points of a Point ConfigurationPaul H. Edelman, Victor Reiner. dcg, 23(1):1-13, 2000. [doi]

1998

Visibility Complexes and the Baues Problem for Triangulations in the PlanePaul H. Edelman, Victor Reiner. dcg, 20(1):35-59, 1998. [doi]

1997

Erratum to Free Arrangement and Rhombic TilingsPaul H. Edelman, Victor Reiner. dcg, 17(3):359-359, 1997. [doi]

Catalan Triangulations of the Möbius BandPaul H. Edelman, Victor Reiner. gc, 13(3):231-243, 1997. [doi]

1996

Free Arrangements and Rhombic TilingsPaul H. Edelman, Victor Reiner. dcg, 15(3):307-340, 1996. [doi]

1995

Lexicographically first reduced wordsPaul H. Edelman. DM, 147(1-3):95-106, 1995. [doi]

1994

Chains in the lattice of noncrossing partitionsPaul H. Edelman, Rodica Simion. DM, 126(1-3):107-119, 1994. [doi]

1992

On the Average Number of k-SetsPaul H. Edelman. dcg, 8:209-213, 1992.

Partition statistics on permutationsPaul H. Edelman, Rodica Simion, Dennis White. DM, 99(1-3):63-68, 1992. [doi]

1990

Hyperplane Arrangements with a Lattice of RegionsAnders Björner, Paul H. Edelman, Günter M. Ziegler. dcg, 5:263-288, 1990.

1989

Tableaux and chains in a new partial order of ::::S::::::::::n::::::Paul H. Edelman. JCT, 51(2):181-204, 1989. [doi]

1987

On Inversions and Cycles in PermutationsPaul H. Edelman. ejc, 8(3):269-279, 1987. [doi]

1984

The acyclic sets of an oriented matroidPaul H. Edelman. JCT, 36(1):26-31, 1984. [doi]

1982

The Subposet Lattice and the Order PolynomialPaul H. Edelman, Paul Klingsberg. ejc, 3(4):341-346, 1982. [doi]

Multichains, non-crossing partitions and treesPaul H. Edelman. DM, 40(2-3):171-179, 1982. [doi]

The lattice of convex sets of an oriented matroidPaul H. Edelman. JCT, 33(3):239-244, 1982. [doi]

1980

Chain enumeration and non-crossing partitionsPaul H. Edelman. DM, 31(2):171-180, 1980. [doi]

Zeta Polynomials and the Möbius FunctionPaul H. Edelman. ejc, 1(4):335-340, 1980. [doi]

1979

On a fixed point theorem for partially ordered setsPaul H. Edelman. DM, 25(2):117-119, 1979. [doi]

Group labelings of graphsPaul H. Edelman, Michael Saks. jgt, 3(2):135-140, 1979. [doi]

Sign in or sign up to see more results.

runs on WebDSL