scientific article; zbMATH DE number 512933
From MaRDI portal
Publication:4281648
Recommendations
Cited in
(26)- Recognition of order-preserving maps
- On the computational complexity of the order polynomial
- On the complexity of interval orders and semiorders
- Some results on the complexity of families of sets
- Crowns, cutsets, and valuable partial orders
- On the complexity of partial order properties
- Recognition algorithms for orders of small width and graphs of small Dilworth number
- A characteristic condition for simple partial ordering relations
- On optimal approximations of arbitrary relations by partial orders
- On partial order characterizations of information structures
- A recognition algorithm for orders of interval dimension two
- The fine-grained complexity of multi-dimensional ordering properties
- On the Complexity of Some Ordering Problems
- The complexity of the partial order dimension problem: closing the gap
- Average properties of two-dimensional partial orders
- scientific article; zbMATH DE number 3907780 (Why is no real title available?)
- scientific article; zbMATH DE number 3909755 (Why is no real title available?)
- Sorting and Recognition Problems for Ordered Sets
- scientific article; zbMATH DE number 1985659 (Why is no real title available?)
- scientific article; zbMATH DE number 219236 (Why is no real title available?)
- On the computational complexity of ordered subgraph recognition
- The Complexity of Order Type Isomorphism
- scientific article; zbMATH DE number 5242380 (Why is no real title available?)
- The computational complexity of antimatroid properties
- Cuts of linear orders
- Contiguity orders
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4281648)
