research
∙
12/09/2021
Properties of Large 2-Crossing-Critical Graphs
A c-crossing-critical graph is one that has crossing number at least c b...
share
research
∙
12/02/2021
On the Dominant of the Multicut Polytope
Given a graph G=(V,E) and a set S ⊆V2 of terminal pairs, the minimum mul...
research
∙
12/11/2020
On the Bond Polytope
Given a graph G=(V,E), the maximum bond problem searches for a maximum c...
research
∙
03/14/2019
Maximum Cut Parameterized by Crossing Number
Given an edge-weighted graph G on n nodes, the NP-hard Max-Cut problem a...
research
∙
03/05/2019
