Tackling the jump number of interval orders (Q1182058): Difference between revisions

@@ Property / cites work @@
+Q3953608
@@ Property / cites work: Q3953608 / rank @@
+Normal rank
@@ Property / cites work @@
+NP-completeness properties about linear extensions
+Normal rank
@@ Property / cites work @@
+Q4918389
@@ Property / cites work: Q4918389 / rank @@
+Normal rank
@@ Property / cites work @@
+Packing subgraphs in a graph
@@ Property / cites work: Packing subgraphs in a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Interval orders without odd crowns are defect optimal
+Normal rank
@@ Property / cites work @@
+A 3/2-approximation algorithm for the jump number of interval orders
+Normal rank
@@ Property / cites work @@
+Interval graphs and interval orders
@@ Property / cites work: Interval graphs and interval orders / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing Setups for Ordered Sets: A Linear Algebraic Approach
+Normal rank
@@ Property / cites work @@
+Q4918387
@@ Property / cites work: Q4918387 / rank @@
+Normal rank
@@ Property / cites work @@
+The jump number and the lattice of maximal antichains
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf00383398
+Normal rank
@@ Property / OpenAlex ID @@
+W2084751738
@@ Property / OpenAlex ID: W2084751738 / rank @@
+Normal rank