Pages that link to "Item:Q1182058"

The following pages link to Tackling the jump number of interval orders (Q1182058):

Displaying 21 items.

• Scheduling with few changes (Q299829) (← links)
• An improved approximation ratio for the jump number problem on interval orders (Q391978) (← links)
• NP-completeness properties about linear extensions (Q581427) (← links)
• Chain dominated orders (Q862975) (← links)
• A 3/2-approximation algorithm for the jump number of interval orders (Q921022) (← links)
• Embedding mappings and splittings with applications (Q968275) (← links)
• A setup heuristic for interval orders (Q1064975) (← links)
• On finding the jump number of a partial order by substitution decomposition (Q1092072) (← 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)
• A weighted version of the jump number problem on two-dimensional orders is NP-complete (Q1404375) (← links)
• An improved algorithm for the jump number problem (Q1603444) (← links)
• Jump number maximization for proper interval graphs and series-parallel graphs (Q1818782) (← 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)
• Jumps of Orderings (Q3484823) (← links)
• Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings (Q3605502) (← links)
• (Q4528061) (← links)
• Contiguity orders (Q6567688) (← links)