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.
- A characterization of the \(n\)-agent Pareto dominance relation (Q284382) (← links)
- Structural parameterizations for boxicity (Q289935) (← links)
- Ranking chain sum orders (Q290525) (← links)
- An \(O(n^3)\) time algorithm for recognizing threshold dimension 2 graphs (Q293369) (← links)
- Vertex ranking of asteroidal triple-free graphs (Q293448) (← links)
- Succinct posets (Q329288) (← links)
- Minors and dimension (Q345115) (← links)
- \(H\)-product of graphs, \(H\)-threshold graphs and threshold-width of graphs (Q389453) (← links)
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
- Steiner transitive-closure spanners of low-dimensional posets (Q397071) (← links)
- Matchings, coverings, and Castelnuovo-Mumford regularity (Q405389) (← links)
- Boxicity of line graphs (Q409342) (← links)
- Reasoning about visibility (Q420853) (← links)
- The computational complexity of rationalizing Pareto optimal choice behavior (Q483106) (← links)
- The Dilworth number of auto-chordal bipartite graphs (Q497341) (← links)
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360) (← links)
- Graphs with the fewest matchings (Q524194) (← links)
- NP-completeness properties about linear extensions (Q581427) (← links)
- The hardness of approximating the boxicity, cubicity and threshold dimension of a graph (Q602742) (← links)
- The complexity of embedding orders into small products of chains (Q603886) (← links)
- On the order dimension of outerplanar maps (Q651434) (← links)
- Boxicity of circular arc graphs (Q659754) (← links)
- Recognizing strict 2-threshold graphs in O(m) time (Q673666) (← links)
- An \(O(n^ 3)\) recognition algorithm for bithreshold graphs (Q676270) (← links)
- Bipartite bithreshold graphs (Q688258) (← links)
- A constant factor approximation algorithm for boxicity of circular arc graphs (Q741528) (← links)
- Dimension preserving contractions and a finite list of 3-irreducible posets (Q766141) (← links)
- On the stab number of rectangle intersection graphs (Q778517) (← links)
- Counting and enumerating independent sets with applications to combinatorial optimization problems (Q784784) (← links)
- On the greedy dimension of a partial order (Q802583) (← links)
- The relationship between the threshold dimension of split graphs and various dimensional parameters (Q803177) (← links)
- Drawing orders with few slopes (Q807654) (← links)
- Point algebras for temporal reasoning: Algorithms and complexity (Q814509) (← links)
- Minimal fill in O(\(n^{2.69}\)) time (Q819828) (← links)
- Geometric representation of graphs in low dimension using axis parallel boxes (Q848956) (← links)
- Partially ordered knapsack and applications to scheduling (Q881568) (← links)
- Convexity in partial cubes: the hull number (Q898152) (← links)
- Forbidden substructure for interval digraphs/bigraphs (Q898169) (← links)
- Semi-transitive orientations and word-representable graphs (Q908303) (← links)
- New constructions for provably-secure time-bound hierarchical key assignment schemes (Q954992) (← links)
- \(2K_{2}\) vertex-set partition into nonempty parts (Q966027) (← links)
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers (Q968201) (← links)
- Boxicity and cubicity of asteroidal triple free graphs (Q968429) (← links)
- On the cubicity of bipartite graphs (Q987780) (← links)
- The cubicity of hypercube graphs (Q998463) (← links)
- Cubicity, boxicity, and vertex cover (Q1025509) (← links)
- Cubicity of threshold graphs (Q1025516) (← links)
- An upper bound for cubicity in terms of boxicity (Q1025528) (← links)
- Localized and compact data-structure for comparability graphs (Q1025540) (← links)
- Boxicity of Halin graphs (Q1025946) (← links)
