92 citations · 105 across the 17 of their papers we have counts for
3 papers · 1 filter
The Influence of Dimensions on the Complexity of Computing Decision Trees
Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani +5
A decision tree recursively splits a feature space and then assigns class labels based on the resulting partition. Decision trees have been part of the basic machi…
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…
Transitions in Dynamic Point Labeling
Thomas Depian, Guangping Li, Martin Nöllenburg +1
The labeling of point features on a map is a well-studied topic. In a static setting, the goal is to find a non-overlapping label placement for (a subset of) point features. In a d…