7 citations · 31 across the 24 of their papers we have counts for
4 papers · 1 filter
Crossing Numbers of Beyond-Planar Graphs
Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani +1
We study the 1-planar, quasi-planar, and fan-planar crossing number in comparison to the (unrestricted) crossing number of graphs. We prove that there are -vertex 1-planar (quas…
Computing Stable Demers Cartograms
Soeren Nickel, Max Sondag, Wouter Meulemans +4
Cartograms are popular for visualizing numerical data for map regions. Maintaining correct adjacencies is a primary quality criterion for cartograms. When there are multiple data v…
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…
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…