On a fixed point theorem for partially ordered sets. - Paul H. Edelman (Discret. Math., 1979)

Group labelings of graphs. - Paul H. Edelman; Michael E. Saks (J. Graph Theory, 1979)

Chain enumeration and non-crossing partitions. - Paul H. Edelman (Discret. Math., 1980)

Zeta Polynomials and the Möbius Function. - Paul H. Edelman (Eur. J. Comb., 1980)

Multichains, non-crossing partitions and trees. - Paul H. Edelman (Discret. Math., 1982)

The Subposet Lattice and the Order Polynomial. - Paul H. Edelman; Paul Klingsberg (Eur. J. Comb., 1982)

The lattice of convex sets of an oriented matroid. - Paul H. Edelman (J. Comb. Theory B, 1982)

The acyclic sets of an oriented matroid. - Paul H. Edelman (J. Comb. Theory B, 1984)

On Inversions and Cycles in Permutations. - Paul H. Edelman (Eur. J. Comb., 1987)

Tableaux and chains in a new partial order of Sn. - Paul H. Edelman (J. Comb. Theory A, 1989)

Hyperplane Arrangements with a Lattice of Regions. - Anders Björner; Paul H. Edelman; Günter M. Ziegler (Discret. Comput. Geom., 1990)

On the Average Number of k-Sets. - Paul H. Edelman (Discret. Comput. Geom., 1992)

Partition statistics on permutations. - Paul H. Edelman; Rodica Simion; Dennis White (Discret. Math., 1992)

Chains in the lattice of noncrossing partitions. - Paul H. Edelman; Rodica Simion (Discret. Math., 1994)

Lexicographically first reduced words. - Paul H. Edelman (Discret. Math., 1995)

Free Arrangements and Rhombic Tilings. - Paul H. Edelman; Victor Reiner (Discret. Comput. Geom., 1996)

Erratum to Free Arrangement and Rhombic Tilings. - Paul H. Edelman; Victor Reiner (Discret. Comput. Geom., 1997)

Catalan Triangulations of the Möbius Band. - Paul H. Edelman; Victor Reiner (Graphs Comb., 1997)

Visibility Complexes and the Baues Problem for Triangulations in the Plane. - Paul H. Edelman; Victor Reiner (Discret. Comput. Geom., 1998)

The Shapley value on convex geometries. - Jesús Mario Bilbao; Paul H. Edelman (Discret. Appl. Math., 2000)

Counting the Interior Points of a Point Configuration. - Paul H. Edelman; Victor Reiner (Discret. Comput. Geom., 2000)

Ordering Points by Linear Functionals. - Paul H. Edelman (Eur. J. Comb., 2000)

On Subdivision Posets of Cyclic Polytopes. - Paul H. Edelman; Jörg Rambau; Victor Reiner (Eur. J. Comb., 2000)

Fair division of indivisible items among people with similar preferences. - Paul H. Edelman; Peter C. Fishburn (Math. Soc. Sci., 2001)

Convex, Acyclic, and Free Sets of an Oriented Matroid. - Paul H. Edelman; Victor Reiner; Volkmar Welker (Discret. Comput. Geom., 2002)

Geochemical Phase Diagrams and Gale Diagrams. - J. H. Stout; Paul H. Edelman; S. W. Peterson; Victor Reiner (SIAM J. Appl. Math., 2003)

Voting power and at-large representation. - Paul H. Edelman (Math. Soc. Sci., 2004)

The inverse Banzhaf problem. - Noga Alon; Paul H. Edelman (Soc. Choice Welf., 2010)

Simplicial Complexes Obtained from Qualitative Probability Orders. - Paul H. Edelman; Tatiana Gvozdeva; Arkadii M. Slinko (SIAM J. Discret. Math., 2013)

Voting power apportionments. - Paul H. Edelman (Soc. Choice Welf., 2015)

A new axiomatic approach to the impartial nomination problem. - Paul H. Edelman; Attila Pór (Games Econ. Behav., 2021)

The core of a transferable utility game as the solution to a public good market demand problem. - Paul H. Edelman; Martin Van der Linden; John A. Weymark (Math. Program., 2024)