3 citations · 5 across the 7 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.CG2022
Minimum Link Fencing
Sujoy Bhore, Fabian Klute, Maarten Löffler +3
We study a variant of the geometric multicut problem, where we are given a set of colored and pairwise interior-disjoint polygons in the plane. The objective is to co…
cs.CG2022★ 3 cited
Planarizing Graphs and their Drawings by Vertex Splitting
Martin Nöllenburg, Manuel Sorge, Soeren Terziadis +3
The splitting number of a graph is the minimum number of vertex splits required to turn into a planar graph, where a vertex split removes a vertex , introduc…
cs.MA2022
Multidimensional Manhattan Preferences
Jiehua Chen, Martin Nöllenburg, Sofia Simola +2
A preference profile (i.e., a collection of linear preference orders of the voters over a set of alternatives) with alternatives and voters is -Manhattan (resp. -Eucl…