Paul H. Edelman

32 papers Journal 32
YearRankTypeTitle / Venue / Authors
2024 J jnl
The core of a transferable utility game as the solution to a public good market demand problem.
Math. Program.
Paul H. Edelman, Martin Van der Linden, John A. Weymark
2021 J jnl
A new axiomatic approach to the impartial nomination problem.
Games Econ. Behav.
Paul H. Edelman, Attila Pór
2015 J jnl
Voting power apportionments.
Soc. Choice Welf.
Paul H. Edelman
2013 J jnl
Simplicial Complexes Obtained from Qualitative Probability Orders.
SIAM J. Discret. Math.
Paul H. Edelman, Tatiana Gvozdeva, Arkadii M. Slinko
2010 J jnl
The inverse Banzhaf problem.
Soc. Choice Welf.
Noga Alon, Paul H. Edelman
2004 J jnl
Voting power and at-large representation.
Math. Soc. Sci.
Paul H. Edelman
2003 J jnl
Geochemical Phase Diagrams and Gale Diagrams.
SIAM J. Appl. Math.
J. H. Stout, Paul H. Edelman, S. W. Peterson, Victor Reiner
2002 J jnl
Convex, Acyclic, and Free Sets of an Oriented Matroid.
Discret. Comput. Geom.
Paul H. Edelman, Victor Reiner, Volkmar Welker
2001 J jnl
Fair division of indivisible items among people with similar preferences.
Math. Soc. Sci.
Paul H. Edelman, Peter C. Fishburn
2000 J jnl
Counting the Interior Points of a Point Configuration.
Discret. Comput. Geom.
Paul H. Edelman, Victor Reiner
2000 J jnl
On Subdivision Posets of Cyclic Polytopes.
Eur. J. Comb.
Paul H. Edelman, Jörg Rambau, Victor Reiner
2000 J jnl
Ordering Points by Linear Functionals.
Eur. J. Comb.
Paul H. Edelman
2000 J jnl
The Shapley value on convex geometries.
Discret. Appl. Math.
Jesús Mario Bilbao, Paul H. Edelman
1998 J jnl
Visibility Complexes and the Baues Problem for Triangulations in the Plane.
Discret. Comput. Geom.
Paul H. Edelman, Victor Reiner
1997 J jnl
Catalan Triangulations of the Möbius Band.
Graphs Comb.
Paul H. Edelman, Victor Reiner
1997 J jnl
Erratum to Free Arrangement and Rhombic Tilings.
Discret. Comput. Geom.
Paul H. Edelman, Victor Reiner
1996 J jnl
Free Arrangements and Rhombic Tilings.
Discret. Comput. Geom.
Paul H. Edelman, Victor Reiner
1995 J jnl
Lexicographically first reduced words.
Discret. Math.
Paul H. Edelman
1994 J jnl
Chains in the lattice of noncrossing partitions.
Discret. Math.
Paul H. Edelman, Rodica Simion
1992 J jnl
On the Average Number of k-Sets.
Discret. Comput. Geom.
Paul H. Edelman
1992 J jnl
Partition statistics on permutations.
Discret. Math.
Paul H. Edelman, Rodica Simion, Dennis White
1990 J jnl
Hyperplane Arrangements with a Lattice of Regions.
Discret. Comput. Geom.
Anders Björner, Paul H. Edelman, Günter M. Ziegler
1989 J jnl
Tableaux and chains in a new partial order of
J. Comb. Theory A
Paul H. Edelman
1987 J jnl
On Inversions and Cycles in Permutations.
Eur. J. Comb.
Paul H. Edelman
1984 J jnl
The acyclic sets of an oriented matroid.
J. Comb. Theory B
Paul H. Edelman
1982 J jnl
Multichains, non-crossing partitions and trees.
Discret. Math.
Paul H. Edelman
1982 J jnl
The Subposet Lattice and the Order Polynomial.
Eur. J. Comb.
Paul H. Edelman, Paul Klingsberg
1982 J jnl
The lattice of convex sets of an oriented matroid.
J. Comb. Theory B
Paul H. Edelman
1980 J jnl
Chain enumeration and non-crossing partitions.
Discret. Math.
Paul H. Edelman
1980 J jnl
Zeta Polynomials and the Möbius Function.
Eur. J. Comb.
Paul H. Edelman
1979 J jnl
Group labelings of graphs.
J. Graph Theory
Paul H. Edelman, Michael E. Saks
1979 J jnl
On a fixed point theorem for partially ordered sets.
Discret. Math.
Paul H. Edelman