The following pages link to Dominance made simple (Q987777):
Displaying 7 items.
- On space efficient two dimensional range minimum data structures (Q692632) (← links)
- On finding fundamental cut sets (Q990139) (← links)
- Blockbusting and domineering (Q1106742) (← links)
- Computing dominances in \(E^ n\) (Q1178238) (← links)
- Algorithms for testing occurrences of length 4 patterns in permutations (Q1698070) (← links)
- On succinct representations of binary trees (Q2363992) (← links)
- Partial dominated schedules and minimizing the total completion time of deteriorating jobs (Q5746677) (← links)