Pages that link to "Item:Q4606298"

The following pages link to An ILP-based Proof System for the Crossing Number Problem (Q4606298):

Displaying 20 items.

• On the crossing numbers of Cartesian products of wheels and trees (Q521759) (← links)
• Approximating the 3-period incremental knapsack problem (Q1711662) (← links)
• An improved algorithm for a two-stage production scheduling problem with an outsourcing option (Q2034787) (← links)
• Star-struck by fixed embeddings: modern crossing number heuristics (Q2151428) (← links)
• The longest processing time rule for identical parallel machines revisited (Q2173053) (← links)
• On approximating the incremental knapsack problem (Q2422736) (← links)
• A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem (Q2424829) (← links)
• There are no cubic graphs on 26 vertices with crossing number 10 or 11 (Q2657046) (← links)
• Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\) (Q2678451) (← links)
• Characterizing all graphs with 2-exceptional edges (Q4629555) (← links)
• ON THE CROSSING NUMBER OF THE CARTESIAN PRODUCT OF A SUNLET GRAPH AND A STAR GRAPH (Q4968453) (← links)
• (Q5088941) (← links)
• ON THE CROSSING NUMBER OF THE JOIN OF THE WHEEL ON FIVE VERTICES WITH THE DISCRETE GRAPH (Q5110134) (← links)
• A survey of graphs with known or bounded crossing numbers (Q5139701) (← links)
• Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics (Q5886037) (← links)
• The crossing numbers of join products of four graphs of order five with paths and cycles (Q6137692) (← links)
• (Q6150944) (← links)
• On the crossing numbers of Cartesian products of small graphs with paths, cycles and stars (Q6580155) (← links)
• On 13-crossing-critical graphs with arbitrarily large degrees (Q6604672) (← links)
• The influence of separating cycles in drawings of \(K_5 \setminus e\) in the join product with paths and cycles (Q6634060) (← links)