Pages that link to "Item:Q1060230"
From MaRDI portal
The following pages link to Interval graphs and interval orders (Q1060230):
Displayed 50 items.
- 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)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- On the classes of interval graphs of limited nesting and count of lengths (Q1739103) (← links)
- Interval semantics for Petri nets with inhibitor arcs (Q1749475) (← links)
- Numerical representation of \(PQI\) interval orders (Q1766750) (← links)
- The lattice of strict completions of a finite poset. (Q1771910) (← links)
- Rational choice with status quo bias (Q1772664) (← links)
- Linear extensions and comparable pairs in partial orders (Q1789051) (← links)
- Koszul binomial edge ideals of pairs of graphs (Q1794075) (← links)
- Handling imprecise evaluations in multiple criteria decision aiding and robust ordinal regression by \(n\)-point intervals (Q1794946) (← links)
- The dimension of cycle-free orders (Q1803661) (← links)
- Sign types associated to posets (Q1806212) (← links)
- Semiorders and the 1/3-2/3 conjecture (Q1823267) (← links)
- Aggregation of semiorders: Intransitive indifference makes a difference (Q1890923) (← links)
- Any complete preference structure without circuit admits an interval representation (Q1908002) (← links)
- Necessary and possible preference structures (Q1949016) (← links)
- Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
- Interval graph limits (Q1950423) (← links)
- Jónsson posets (Q1991606) (← links)
- Graphs of interval count two with a given partition (Q2015148) (← links)
- Declawing a graph: polyhedra and branch-and-cut algorithms (Q2045043) (← links)
- A note on reference-dependent choice with threshold representation (Q2099035) (← links)
- Two problems on interval counting (Q2132398) (← links)
- Uniquely orderable interval graphs (Q2144484) (← links)
- 2-nested matrices: towards understanding the structure of circle graphs (Q2152610) (← links)
- The interplay between transitivity and completeness: generalized \textsf{NaP}-preferences (Q2154163) (← links)
- Continuous representations of interval orders by means of two continuous functions (Q2188940) (← links)
- A bi-preference interplay between transitivity and completeness: reformulating and extending Schmeidler's theorem (Q2197095) (← links)
- Asymptotics and statistics on Fishburn matrices and their generalizations (Q2229176) (← links)
- Unit representation of semiorders. I: Countable sets (Q2244623) (← links)
- Unit representation of semiorders. II: The general case (Q2244624) (← links)
- A probabilistic framework for the design of instance-based supervised ranking algorithms in an ordinal setting (Q2271869) (← links)
- Ordered sets with interval representation and \((m,n)\)-Ferrers relation (Q2271872) (← links)
- Computer science and decision theory (Q2271874) (← links)
- Nontransitive preferences in decision theory (Q2276852) (← links)
- Machine learning models, epistemic set-valued data and generalized loss functions: an encompassing approach (Q2279571) (← links)
- From set relations to belief function relations (Q2283272) (← links)
- Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results (Q2297848) (← links)
- Hereditary semiorders and enumeration of semiorders by dimension (Q2309220) (← links)
- Generalization of Portmanteau theorem for a sequence of interval-valued pseudo-probability measures (Q2328919) (← links)
- Interval orders, semiorders and ordered groups (Q2332813) (← links)
- Generation and enumeration of some classes of interval orders (Q2376909) (← links)
- A general concept of scoring rules: general definitions, statistical inference, and empirical illustrations (Q2385063) (← links)
- Database querying under changing preferences (Q2385451) (← links)
- Congruence relations on a choice space (Q2417402) (← links)
- A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs (Q2423295) (← links)
- Critically prime orders (Q2427215) (← links)