Pages that link to "Item:Q1088407"
From MaRDI portal
The following pages link to On the complexity of interval orders and semiorders (Q1088407):
Displaying 15 items.
- Linear orders and semiorders close to an interval order (Q790852) (← links)
- Inductive characterizations of finite interval orders and semiorders (Q841168) (← links)
- Representing interval orders by weighted bases: some complexity results (Q1042324) (← links)
- Interval orders without odd crowns are defect optimal (Q1079584) (← links)
- On the computational complexity of the order polynomial (Q1086595) (← links)
- On relationships between numerical representations of interval orders and semiorders (Q1099050) (← links)
- The communication complexity of interval orders (Q1201817) (← links)
- Maximal sublattices of finite distributive lattices (Q1272243) (← links)
- Compatibility between interval structures and partial orderings (Q1331978) (← links)
- Tree-visibility orders (Q1584374) (← links)
- On the complexity of partial order properties (Q1590180) (← links)
- A recognition algorithm for orders of interval dimension two (Q1894368) (← links)
- A characterization of interval orders with semiorder dimension two (Q2022521) (← links)
- A genesis of interval orders and semiorders: transitive NaP-preferences (Q2510380) (← links)
- (Q4429357) (← links)