6 citations · 8 across the 4 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019★ 2 cited
Cut Polytopes of Minor-free Graphs
Markus Chimani, Martina Juhnke-Kubitzke, Alexander Nover +1
The cut polytope of a graph is the convex hull of the indicator vectors of all cuts in and is closely related to the MaxCut problem. We give the facet-description of cut po…
cs.DS2019★ 6 cited
Maximum Cut Parameterized by Crossing Number
Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke +3
Given an edge-weighted graph on nodes, the NP-hard Max-Cut problem asks for a node bipartition such that the sum of edge weights joining the different partitions is maximiz…