36 citations · 216 across the 70 of their papers we have counts for
9 papers · 1 filter
Geometric Planar Networks on Bichromatic Points
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore +1
We study three classical graph problems - Hamiltonian path, minimum spanning tree, and minimum perfect matching on geometric graphs induced by bichromatic (red and blue) points. Th…
Exploring Semi-Automatic Map Labeling
Fabian Klute, Guangping Li, Raphael Löffler +2
Label placement in maps is a very challenging task that is critical for the overall map quality. Most previous work focused on designing and implementing fully automatic solutions,…
Mixed Linear Layouts: Complexity, Heuristics, and Experiments
Philipp de Col, Fabian Klute, Martin Nöllenburg
A -page linear graph layout of a graph draws all vertices along a line and each edge in one of disjoint halfplanes called pages, which are bounded by $\el…
Parameterized Algorithms for Book Embedding Problems
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani +1
A k-page book embedding of a graph G draws the vertices of G on a line and the edges on k half-planes (called pages) bounded by this line, such that no two edges on the same page c…
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…
On Strict (Outer-)Confluent Graphs
Henry Förster, Robert Ganian, Fabian Klute +1
A strict confluent (SC) graph drawing is a drawing of a graph with vertices as points in the plane, where vertex adjacencies are represented not by individual curves but rather by…