Pages that link to "Item:Q1182058"
From MaRDI portal
The following pages link to Tackling the jump number of interval orders (Q1182058):
Displaying 12 items.
- Scheduling with few changes (Q299829) (← links)
- An improved approximation ratio for the jump number problem on interval orders (Q391978) (← links)
- Chain dominated orders (Q862975) (← links)
- Embedding mappings and splittings with applications (Q968275) (← links)
- The jump number of Z-free ordered sets (Q1183946) (← links)
- On a setup optimization problem for interval orders (Q1195865) (← links)
- Computing the jump number on semi-orders is polynomial (Q1329825) (← links)
- The jump number problem on interval orders: A 3/2 approximation algorithm (Q1898347) (← links)
- The arboreal jump number of an order (Q1943701) (← links)
- A refined analysis on the jump number problem of interval orders (Q2353641) (← links)
- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings (Q3605502) (← links)
- Contiguity orders (Q6567688) (← links)
