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 geometric separability of Boolean functions (Q1917289) (← links)
- Cubicity and bandwidth (Q1938886) (← links)
- Rainbow connections of graphs: a survey (Q1938889) (← links)
- Timestamping messages and events in a distributed system using synchronous communication (Q1954214) (← links)
- On the vertex ranking problem for trapezoid, circular-arc and other graphs (Q1961233) (← links)
- Representing graphs as the intersection of cographs and threshold graphs (Q2040010) (← links)
- On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
- Role coloring bipartite graphs (Q2081494) (← links)
- On bipartite graphs having minimum fourth adjacency coefficient (Q2117523) (← links)
- Tight bounds to localize failure nodes on trees, grids and through embeddings under Boolean network tomography (Q2136288) (← links)
- Recognizing simple-triangle graphs by restricted 2-chain subgraph cover (Q2181225) (← links)
- The complexity of the defensive domination problem in special graph classes (Q2279988) (← links)
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters (Q2316935) (← links)
- Fast algorithms for computing the characteristic polynomial of threshold and chain graphs (Q2333249) (← links)
- Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity (Q2340410) (← links)
- Lower bounds for boxicity (Q2341923) (← links)
- Paretian partial orders: the two-agent case (Q2347924) (← links)
- The fixed point property for ordered sets of interval dimension 2 (Q2407685) (← links)
- Chronological rectangle digraphs which are two-terminal series-parallel (Q2414469) (← links)
- Finite dimensional scattered posets (Q2434747) (← links)
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs (Q2445872) (← links)
- Boxicity and maximum degree (Q2477634) (← links)
- On the interval completion of chordal graphs (Q2492201) (← links)
- Cubicity, degeneracy, and crossing number (Q2509731) (← links)
- On multipartite posets (Q2519843) (← links)
- Embedding ordered sets into distributive lattices (Q2520717) (← links)
- Boxicity and treewidth (Q2642011) (← links)
- Dimension invariance of subdivisions (Q2716970) (← links)
- Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs (Q2803835) (← links)
- On Maximal Chain Subgraphs and Covers of Bipartite Graphs (Q2819498) (← links)
- Cubicity of interval graphs and the claw number (Q2851505) (← links)
- Mining posets from linear orders. (Q2874042) (← links)
- Rainbow connection number and connected dominating sets (Q2911064) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- The Complexity of the Partial Order Dimension Problem: Closing the Gap (Q2957691) (← links)
- Secure Authenticated Comparisons (Q3011317) (← links)
- Steiner Transitive-Closure Spanners of Low-Dimensional Posets (Q3012848) (← links)
- Bounds on Threshold Dimension and Disjoint Threshold Coverings (Q3029042) (← links)
- Cubicity of interval graphs and the claw number (Q3061191) (← links)
- Alternation Graphs (Q3104776) (← links)
- Threshold Dimension of Graphs (Q3204506) (← links)
- On the Cubicity of Interval Graphs (Q3503487) (← links)
- The Hardness of Approximating Poset Dimension (Q3503501) (← links)
- AN ALGORITHMIC APPROACH TO PREFERENCE REPRESENTATION (Q3596984) (← links)
- On the Cubicity of AT-Free Graphs and Circular-Arc Graphs (Q3655149) (← links)
- Crisp dimension theory and valued preference relations (Q4471213) (← links)
- Optimal shooting: Characterizations and applications (Q4645180) (← links)
- A Graph Theoretic Approach to Solve Special Knapsack Problems in Polynomial Time (Q4685763) (← links)
- Intersection representation of digraphs in trees with few leaves (Q4719324) (← links)
- Transitive-Closure Spanners: A Survey (Q4933368) (← links)
