Pages that link to "Item:Q3663349"
From MaRDI portal
The following pages link to The Complexity of the Partial Order Dimension Problem (Q3663349):
Displaying 50 items.
- On the cubicity of certain graphs (Q1041732) (← links)
- On the cubicity of interval graphs (Q1043802) (← links)
- On realizable biorders and the biorder dimension of a relation (Q1057213) (← links)
- Interval graphs and related topics (Q1060229) (← links)
- The complexity of facets (and some facets of complexity) (Q1061485) (← links)
- Decomposing weighted digraphs into sums of chains (Q1084404) (← links)
- On some complexity properties of N-free posets and posets with bounded decomposition diameter (Q1086264) (← links)
- On finding the bidimension of a relation (Q1099113) (← links)
- Multidimensional scaling and threshold graphs (Q1106142) (← links)
- Strict 2-threshold graphs (Q1111574) (← links)
- Trapezoid graphs and their coloring (Q1111577) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- Planar graphs and poset dimension (Q1121926) (← links)
- Asymptotic enumeration of two-dimensional posets (Q1122599) (← links)
- Comparability graphs and intersection graphs (Q1172652) (← links)
- An appraisal of computational complexity for operations researchers (Q1173532) (← links)
- The interval inclusion number of a partially ordered set (Q1176729) (← links)
- Split dimension of graphs (Q1176734) (← links)
- Transitive closure for restricted classes of partial orders (Q1182064) (← links)
- \(N\)-free orders and minimal interval extensions (Q1207724) (← links)
- On the complexity of the k-chain subgraph cover problem (Q1275070) (← links)
- Some complexity results about threshold graphs (Q1327235) (← links)
- A special planar satisfiability problem and a consequence of its NP- completeness (Q1331895) (← links)
- On treewidth and minimum fill-in of asteroidal triple-free graphs (Q1392207) (← links)
- Soft dimension theory. (Q1398925) (← links)
- Searching for the dimension of valued preference relations. (Q1401118) (← links)
- On variations of \(P_{4}\)-sparse graphs (Q1406046) (← links)
- Powers of geometric intersection graphs and dispersion algorithms (Q1414578) (← links)
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs (Q1414581) (← links)
- Induced matchings in asteroidal triple-free graphs (Q1414582) (← links)
- \(P_{5}\)-free augmenting graphs and the maximum stable set problem (Q1414587) (← links)
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs (Q1414592) (← links)
- The order dimension of the poset of regions in a hyperplane arrangement. (Q1421332) (← links)
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization. (Q1428548) (← links)
- Dimension of valued relations (Q1582042) (← links)
- FO model checking on geometric graphs (Q1631773) (← links)
- Co-bipartite neighborhood edge elimination orderings (Q1689989) (← links)
- Sublinear approximation algorithms for boxicity and related problems (Q1693125) (← links)
- On dynamic threshold graphs and related classes (Q1705777) (← links)
- One-sided weak dominance drawing (Q1711831) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
- On the structure of (\(P_{5}\),\,gem)-free graphs (Q1764802) (← links)
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (Q1764808) (← links)
- On the generation of circuits and minimal forbidden sets (Q1769072) (← links)
- Fractional dimension of partial orders (Q1803664) (← links)
- Computing the dimension of N-free ordered sets is NP-complete (Q1824638) (← links)
- Geometrical embeddings of graphs (Q1825202) (← links)
- A recognition algorithm for orders of interval dimension two (Q1894368) (← links)
- Enumeration of difference graphs (Q1894373) (← links)
- On edge transitivity of directed graphs (Q1894773) (← links)
