Pages that link to "Item:Q1060230"

The following pages link to Interval graphs and interval orders (Q1060230):

Displaying 50 items.

• Evaluations of Hecke algebra traces at Kazhdan-Lusztig basis elements (Q281591) (← links)
• \((m, n)\)-rationalizable choices (Q313072) (← links)
• Universal semiorders (Q313082) (← links)
• Preferences in artificial intelligence (Q314443) (← links)
• Fast-mixed searching and related problems on graphs (Q393051) (← links)
• The pseudo-transitivity of preference relations: strict and weak \((m,n)\)-Ferrers properties (Q396205) (← links)
• Catalan pairs and Fishburn triples (Q494124) (← links)
• Jaco-type graphs and black energy dissipation (Q520904) (← links)
• A valued Ferrers relation for interval comparison (Q529258) (← links)
• How to revise a total preorder (Q535324) (← links)
• Biorders with frontier (Q633220) (← links)
• Counting general and self-dual interval orders (Q662031) (← links)
• Minimal obstructions for partial representations of interval graphs (Q668026) (← links)
• Equidistributed statistics on Fishburn matrices and permutations (Q668059) (← links)
• Parallel interval order recognition and construction of interval representations (Q673637) (← links)
• An obvious proof of Fishburn's interval order theorem (Q685567) (← links)
• Counting endpoint sequences for interval orders and interval graphs (Q685648) (← links)
• Bounded discrete representations of interval orders (Q686255) (← links)
• Utility representation of an incomplete preference relation (Q697961) (← links)
• Linear extension majority cycles on partial orders (Q751946) (← links)
• Angle orders (Q762509) (← links)
• New types of aggregation functions for interval-valued fuzzy setting and preservation of pos-\(B\) and nec-\(B\)-transitivity in decision making problems (Q781170) (← links)
• Unified representability of total preorders and interval orders through a single function: the lattice approach (Q841166) (← links)
• Congruences for the Fishburn numbers (Q898818) (← links)
• Circle orders and angle orders (Q908945) (← links)
• Embedding mappings and splittings with applications (Q968275) (← links)
• Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
• Minimizing bumps in linear extensions of ordered sets (Q1077441) (← links)
• Counting interval orders (Q1098864) (← links)
• Continuous semiorder representations (Q1099048) (← links)
• Interval orders and circle orders (Q1114720) (← links)
• Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
• Revealed preference and intransitive indifference (Q1178813) (← links)
• Tackling the jump number of interval orders (Q1182058) (← links)
• Norbert Wiener on the theory of measurement (1914, 1915, 1921) (Q1193374) (← links)
• Planar lattices are lexicographically shellable (Q1198483) (← links)
• \(N\)-free orders and minimal interval extensions (Q1207724) (← links)
• Minimal representation of a semiorder (Q1262181) (← links)
• Preference through indifference: A topological approach (Q1300429) (← links)
• Interval dimension and MacNeille completion (Q1318360) (← links)
• Detecting causal relationships in distributed computations: In search of the holy grail (Q1331790) (← links)
• 3-interval irreducible partially ordered sets (Q1338127) (← links)
• Diversity and dissimilarity in lines and hierarchies (Q1398327) (← links)
• Media theory (Q1613392) (← links)
• Stochastic dominance with imprecise information (Q1621368) (← links)
• Approximations of arbitrary relations by partial orders (Q1644912) (← links)
• Strict \((m, 1)\)-Ferrers properties (Q1645040) (← links)
• Interval-valued rank in finite ordered sets (Q1686200) (← links)
• Necessary and possible indifferences (Q1690609) (← links)
• Extended formulations for order polytopes through network flows (Q1736010) (← links)