7 citations · 31 across the 24 of their papers we have counts for
Showing 2019 · cs.CGShow all
2 papers · 2 filters
cs.CG2019
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…
cs.CG2019
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…