The following pages link to Linear discrepancy and bandwidth (Q1611292):
Displaying 14 items.
- The \(t\)-discrepancy of a poset (Q602757) (← links)
- When linear and weak discrepancy are equal (Q626763) (← links)
- Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs (Q631789) (← links)
- Bandwidth on AT-free graphs (Q650939) (← links)
- Irreducible width 2 posets of linear discrepancy \(3\) (Q943376) (← links)
- Average relational distance in linear extensions of posets (Q966037) (← links)
- The total linear discrepancy of an ordered set (Q966038) (← links)
- Degree bounds for linear discrepancy of interval orders and disconnected posets (Q982627) (← links)
- Hardness and approximation of minimum distortion embeddings (Q991793) (← links)
- Bandwidth of bipartite permutation graphs in polynomial time (Q1044045) (← links)
- A characterisation of posets that are nearly antichains (Q1765956) (← links)
- A characterization of partially ordered sets with linear discrepancy equal to \(2\) (Q2464732) (← links)
- Linear discrepancy of the product of two chains (Q2490422) (← links)
- Bandwidth of Bipartite Permutation Graphs in Polynomial Time (Q5458530) (← links)
