The following pages link to Partially Ordered Sets (Q5780132):
Displaying 50 items.
- A characterization of the \(n\)-agent Pareto dominance relation (Q284382) (← links)
- Forcing posets with large dimension to contain large standard examples (Q293603) (← links)
- Analysis of multiple partially ordered responses to belief items with don't know option (Q316775) (← links)
- Minors and dimension (Q345115) (← links)
- Bounds on the \(k\)-dimension of products of special posets (Q382878) (← links)
- Steiner transitive-closure spanners of low-dimensional posets (Q397071) (← links)
- Permutation bigraphs and interval containments (Q401140) (← links)
- The proof of the removable pair conjecture for fractional dimension. (Q405169) (← links)
- Quaternary dichotomous voting rules (Q427518) (← links)
- Continuous multi-utility representations of preorders (Q451057) (← links)
- Multiutility representations for incomplete difference preorders (Q459380) (← links)
- The computational complexity of rationalizing Pareto optimal choice behavior (Q483106) (← links)
- On the number of monotone sequences (Q490988) (← links)
- On graphs associated to sets of rankings (Q491081) (← links)
- Splitting metrics by \(T_0\)-quasi-metrics (Q492235) (← links)
- Answer to some open questions on covering dimension for finite lattices (Q512603) (← links)
- Witness (Delaunay) graphs (Q551502) (← links)
- Implications of Pareto efficiency for two-agent (household) choice (Q553519) (← links)
- Non-Archimedean extensive measurement with incomparability (Q554508) (← links)
- On incomplete preference structures (Q585061) (← links)
- Mixed models, random utilities, and the triangle inequality (Q595587) (← links)
- The hardness of approximating the boxicity, cubicity and threshold dimension of a graph (Q602742) (← links)
- The complexity of embedding orders into small products of chains (Q603886) (← links)
- Time functions as utilities (Q625479) (← links)
- Representing preferences using intervals (Q646529) (← links)
- On the order dimension of outerplanar maps (Q651434) (← links)
- Attack allocation on remote state estimation in multi-systems: structural results and asymptotic solution (Q680517) (← links)
- On the size of maximal chains and the number of pairwise disjoint maximal antichains (Q710588) (← links)
- Efficient provably-secure hierarchical key assignment schemes (Q719310) (← links)
- Grid intersection graphs and order dimension (Q722596) (← links)
- Dimensions of hypergraphs (Q757427) (← links)
- Matching relations and the dimensional structure of social choices (Q760319) (← links)
- Angle orders (Q762509) (← links)
- Dimension preserving contractions and a finite list of 3-irreducible posets (Q766141) (← links)
- On-line chain partitions of orders: a survey (Q766153) (← links)
- Quotients of complete ordered sets (Q793061) (← links)
- On the greedy dimension of a partial order (Q802583) (← links)
- On the number of k-realizations of an ordered set (Q804608) (← links)
- Continuously representable Paretian quasi-orders (Q850469) (← links)
- On a possible continuous analogue of the Szpilrajn theorem and its strengthening by Dushnik and Miller (Q878146) (← links)
- Partially ordered knapsack and applications to scheduling (Q881568) (← links)
- Circle orders and angle orders (Q908945) (← links)
- Sphere orders (Q909680) (← links)
- Some order dimension bounds for communication complexity problems (Q921909) (← links)
- Binary relations: Finite characterizations and computational complexity (Q935039) (← links)
- New constructions for provably-secure time-bound hierarchical key assignment schemes (Q954992) (← links)
- An implicit representation of chordal comparability graphs in linear time (Q972319) (← links)
- Duality for semiantichains and unichain coverings in products of special posets (Q1013994) (← links)
- Conditional ordering extensions (Q1014327) (← links)
- Localized and compact data-structure for comparability graphs (Q1025540) (← links)
